TPTP Problem File: SEU318+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SEU318+1 : TPTP v8.2.0. Released v3.3.0.
% Domain : Set theory
% Problem : MPTP bushy problem t52_pre_topc
% Version : [Urb07] axioms : Especial.
% English :
% Refs : [Ban01] Bancerek et al. (2001), On the Characterizations of Co
% : [Urb07] Urban (2006), Email to G. Sutcliffe
% Source : [Urb07]
% Names : bushy-t52_pre_topc [Urb07]
% Status : Theorem
% Rating : 0.72 v8.2.0, 0.69 v8.1.0, 0.67 v7.5.0, 0.75 v7.4.0, 0.57 v7.3.0, 0.66 v7.2.0, 0.62 v7.1.0, 0.57 v7.0.0, 0.60 v6.4.0, 0.62 v6.3.0, 0.58 v6.2.0, 0.72 v6.1.0, 0.77 v6.0.0, 0.78 v5.4.0, 0.79 v5.3.0, 0.81 v5.2.0, 0.70 v5.1.0, 0.76 v5.0.0, 0.79 v4.1.0, 0.78 v4.0.1, 0.87 v4.0.0, 0.88 v3.7.0, 0.85 v3.5.0, 0.89 v3.4.0, 0.84 v3.3.0
% Syntax : Number of formulae : 51 ( 11 unt; 0 def)
% Number of atoms : 167 ( 7 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 125 ( 9 ~; 1 |; 54 &)
% ( 5 <=>; 56 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 20 ( 18 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 85 ( 77 !; 8 ?)
% SPC : FOF_THM_RFO_SEQ
% Comments : Translated by MPTP 0.2 from the original problem in the Mizar
% library, www.mizar.org
%------------------------------------------------------------------------------
fof(antisymmetry_r2_hidden,axiom,
! [A,B] :
( in(A,B)
=> ~ in(B,A) ) ).
fof(cc10_membered,axiom,
! [A] :
( v1_membered(A)
=> ! [B] :
( element(B,A)
=> v1_xcmplx_0(B) ) ) ).
fof(cc11_membered,axiom,
! [A] :
( v2_membered(A)
=> ! [B] :
( element(B,A)
=> ( v1_xcmplx_0(B)
& v1_xreal_0(B) ) ) ) ).
fof(cc12_membered,axiom,
! [A] :
( v3_membered(A)
=> ! [B] :
( element(B,A)
=> ( v1_xcmplx_0(B)
& v1_xreal_0(B)
& v1_rat_1(B) ) ) ) ).
fof(cc13_membered,axiom,
! [A] :
( v4_membered(A)
=> ! [B] :
( element(B,A)
=> ( v1_xcmplx_0(B)
& v1_xreal_0(B)
& v1_int_1(B)
& v1_rat_1(B) ) ) ) ).
fof(cc14_membered,axiom,
! [A] :
( v5_membered(A)
=> ! [B] :
( element(B,A)
=> ( v1_xcmplx_0(B)
& natural(B)
& v1_xreal_0(B)
& v1_int_1(B)
& v1_rat_1(B) ) ) ) ).
fof(cc15_membered,axiom,
! [A] :
( empty(A)
=> ( v1_membered(A)
& v2_membered(A)
& v3_membered(A)
& v4_membered(A)
& v5_membered(A) ) ) ).
fof(cc16_membered,axiom,
! [A] :
( v1_membered(A)
=> ! [B] :
( element(B,powerset(A))
=> v1_membered(B) ) ) ).
fof(cc17_membered,axiom,
! [A] :
( v2_membered(A)
=> ! [B] :
( element(B,powerset(A))
=> ( v1_membered(B)
& v2_membered(B) ) ) ) ).
fof(cc18_membered,axiom,
! [A] :
( v3_membered(A)
=> ! [B] :
( element(B,powerset(A))
=> ( v1_membered(B)
& v2_membered(B)
& v3_membered(B) ) ) ) ).
fof(cc19_membered,axiom,
! [A] :
( v4_membered(A)
=> ! [B] :
( element(B,powerset(A))
=> ( v1_membered(B)
& v2_membered(B)
& v3_membered(B)
& v4_membered(B) ) ) ) ).
fof(cc1_membered,axiom,
! [A] :
( v5_membered(A)
=> v4_membered(A) ) ).
fof(cc20_membered,axiom,
! [A] :
( v5_membered(A)
=> ! [B] :
( element(B,powerset(A))
=> ( v1_membered(B)
& v2_membered(B)
& v3_membered(B)
& v4_membered(B)
& v5_membered(B) ) ) ) ).
fof(cc2_membered,axiom,
! [A] :
( v4_membered(A)
=> v3_membered(A) ) ).
fof(cc3_membered,axiom,
! [A] :
( v3_membered(A)
=> v2_membered(A) ) ).
fof(cc4_membered,axiom,
! [A] :
( v2_membered(A)
=> v1_membered(A) ) ).
fof(d10_xboole_0,axiom,
! [A,B] :
( A = B
<=> ( subset(A,B)
& subset(B,A) ) ) ).
fof(d3_tarski,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ) ).
fof(dt_k1_setfam_1,axiom,
$true ).
fof(dt_k1_xboole_0,axiom,
$true ).
fof(dt_k1_zfmisc_1,axiom,
$true ).
fof(dt_k6_pre_topc,axiom,
! [A,B] :
( ( top_str(A)
& element(B,powerset(the_carrier(A))) )
=> element(topstr_closure(A,B),powerset(the_carrier(A))) ) ).
fof(dt_k6_setfam_1,axiom,
! [A,B] :
( element(B,powerset(powerset(A)))
=> element(meet_of_subsets(A,B),powerset(A)) ) ).
fof(dt_l1_pre_topc,axiom,
! [A] :
( top_str(A)
=> one_sorted_str(A) ) ).
fof(dt_l1_struct_0,axiom,
$true ).
fof(dt_m1_subset_1,axiom,
$true ).
fof(dt_u1_struct_0,axiom,
$true ).
fof(existence_l1_pre_topc,axiom,
? [A] : top_str(A) ).
fof(existence_l1_struct_0,axiom,
? [A] : one_sorted_str(A) ).
fof(existence_m1_subset_1,axiom,
! [A] :
? [B] : element(B,A) ).
fof(fc1_subset_1,axiom,
! [A] : ~ empty(powerset(A)) ).
fof(fc6_membered,axiom,
( empty(empty_set)
& v1_membered(empty_set)
& v2_membered(empty_set)
& v3_membered(empty_set)
& v4_membered(empty_set)
& v5_membered(empty_set) ) ).
fof(rc1_membered,axiom,
? [A] :
( ~ empty(A)
& v1_membered(A)
& v2_membered(A)
& v3_membered(A)
& v4_membered(A)
& v5_membered(A) ) ).
fof(rc1_subset_1,axiom,
! [A] :
( ~ empty(A)
=> ? [B] :
( element(B,powerset(A))
& ~ empty(B) ) ) ).
fof(rc2_subset_1,axiom,
! [A] :
? [B] :
( element(B,powerset(A))
& empty(B) ) ).
fof(rc6_pre_topc,axiom,
! [A] :
( ( topological_space(A)
& top_str(A) )
=> ? [B] :
( element(B,powerset(the_carrier(A)))
& closed_subset(B,A) ) ) ).
fof(redefinition_k6_setfam_1,axiom,
! [A,B] :
( element(B,powerset(powerset(A)))
=> meet_of_subsets(A,B) = set_meet(B) ) ).
fof(reflexivity_r1_tarski,axiom,
! [A,B] : subset(A,A) ).
fof(t1_subset,axiom,
! [A,B] :
( in(A,B)
=> element(A,B) ) ).
fof(t2_subset,axiom,
! [A,B] :
( element(A,B)
=> ( empty(B)
| in(A,B) ) ) ).
fof(t3_subset,axiom,
! [A,B] :
( element(A,powerset(B))
<=> subset(A,B) ) ).
fof(t44_pre_topc,axiom,
! [A] :
( ( topological_space(A)
& top_str(A) )
=> ! [B] :
( element(B,powerset(powerset(the_carrier(A))))
=> ( ! [C] :
( element(C,powerset(the_carrier(A)))
=> ( in(C,B)
=> closed_subset(C,A) ) )
=> closed_subset(meet_of_subsets(the_carrier(A),B),A) ) ) ) ).
fof(t45_pre_topc,axiom,
! [A] :
( top_str(A)
=> ! [B] :
( element(B,powerset(the_carrier(A)))
=> ! [C] :
( in(C,the_carrier(A))
=> ( in(C,topstr_closure(A,B))
<=> ! [D] :
( element(D,powerset(the_carrier(A)))
=> ( ( closed_subset(D,A)
& subset(B,D) )
=> in(C,D) ) ) ) ) ) ) ).
fof(t46_pre_topc,axiom,
! [A] :
( ( topological_space(A)
& top_str(A) )
=> ! [B] :
( element(B,powerset(the_carrier(A)))
=> ? [C] :
( element(C,powerset(powerset(the_carrier(A))))
& ! [D] :
( element(D,powerset(the_carrier(A)))
=> ( in(D,C)
<=> ( closed_subset(D,A)
& subset(B,D) ) ) )
& topstr_closure(A,B) = meet_of_subsets(the_carrier(A),C) ) ) ) ).
fof(t48_pre_topc,axiom,
! [A] :
( top_str(A)
=> ! [B] :
( element(B,powerset(the_carrier(A)))
=> subset(B,topstr_closure(A,B)) ) ) ).
fof(t4_subset,axiom,
! [A,B,C] :
( ( in(A,B)
& element(B,powerset(C)) )
=> element(A,C) ) ).
fof(t52_pre_topc,conjecture,
! [A] :
( top_str(A)
=> ! [B] :
( element(B,powerset(the_carrier(A)))
=> ( ( closed_subset(B,A)
=> topstr_closure(A,B) = B )
& ( ( topological_space(A)
& topstr_closure(A,B) = B )
=> closed_subset(B,A) ) ) ) ) ).
fof(t5_subset,axiom,
! [A,B,C] :
~ ( in(A,B)
& element(B,powerset(C))
& empty(C) ) ).
fof(t6_boole,axiom,
! [A] :
( empty(A)
=> A = empty_set ) ).
fof(t7_boole,axiom,
! [A,B] :
~ ( in(A,B)
& empty(B) ) ).
fof(t8_boole,axiom,
! [A,B] :
~ ( empty(A)
& A != B
& empty(B) ) ).
%------------------------------------------------------------------------------