TPTP Problem File: SEU166+2.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SEU166+2 : TPTP v9.0.0. Released v3.3.0.
% Domain : Set theory
% Problem : MPTP chainy problem t118_zfmisc_1
% 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 : chainy-t118_zfmisc_1 [Urb07]
% Status : Theorem
% Rating : 0.73 v9.0.0, 0.78 v8.2.0, 0.81 v7.5.0, 0.84 v7.4.0, 0.80 v7.3.0, 0.79 v7.1.0, 0.78 v7.0.0, 0.83 v6.4.0, 0.88 v6.3.0, 0.83 v6.2.0, 0.92 v6.1.0, 1.00 v5.5.0, 0.96 v5.2.0, 0.95 v5.0.0, 0.96 v3.7.0, 0.90 v3.5.0, 0.95 v3.3.0
% Syntax : Number of formulae : 96 ( 37 unt; 0 def)
% Number of atoms : 194 ( 61 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 129 ( 31 ~; 5 |; 31 &)
% ( 33 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-2 aty)
% Number of variables : 197 ( 190 !; 7 ?)
% 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(antisymmetry_r2_xboole_0,axiom,
! [A,B] :
( proper_subset(A,B)
=> ~ proper_subset(B,A) ) ).
fof(commutativity_k2_tarski,axiom,
! [A,B] : unordered_pair(A,B) = unordered_pair(B,A) ).
fof(commutativity_k2_xboole_0,axiom,
! [A,B] : set_union2(A,B) = set_union2(B,A) ).
fof(commutativity_k3_xboole_0,axiom,
! [A,B] : set_intersection2(A,B) = set_intersection2(B,A) ).
fof(d10_xboole_0,axiom,
! [A,B] :
( A = B
<=> ( subset(A,B)
& subset(B,A) ) ) ).
fof(d1_tarski,axiom,
! [A,B] :
( B = singleton(A)
<=> ! [C] :
( in(C,B)
<=> C = A ) ) ).
fof(d1_xboole_0,axiom,
! [A] :
( A = empty_set
<=> ! [B] : ~ in(B,A) ) ).
fof(d1_zfmisc_1,axiom,
! [A,B] :
( B = powerset(A)
<=> ! [C] :
( in(C,B)
<=> subset(C,A) ) ) ).
fof(d2_tarski,axiom,
! [A,B,C] :
( C = unordered_pair(A,B)
<=> ! [D] :
( in(D,C)
<=> ( D = A
| D = B ) ) ) ).
fof(d2_xboole_0,axiom,
! [A,B,C] :
( C = set_union2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
| in(D,B) ) ) ) ).
fof(d2_zfmisc_1,axiom,
! [A,B,C] :
( C = cartesian_product2(A,B)
<=> ! [D] :
( in(D,C)
<=> ? [E,F] :
( in(E,A)
& in(F,B)
& D = ordered_pair(E,F) ) ) ) ).
fof(d3_tarski,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ) ).
fof(d3_xboole_0,axiom,
! [A,B,C] :
( C = set_intersection2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ) ).
fof(d4_tarski,axiom,
! [A,B] :
( B = union(A)
<=> ! [C] :
( in(C,B)
<=> ? [D] :
( in(C,D)
& in(D,A) ) ) ) ).
fof(d4_xboole_0,axiom,
! [A,B,C] :
( C = set_difference(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
& ~ in(D,B) ) ) ) ).
fof(d5_tarski,axiom,
! [A,B] : ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A)) ).
fof(d7_xboole_0,axiom,
! [A,B] :
( disjoint(A,B)
<=> set_intersection2(A,B) = empty_set ) ).
fof(d8_xboole_0,axiom,
! [A,B] :
( proper_subset(A,B)
<=> ( subset(A,B)
& A != B ) ) ).
fof(dt_k1_tarski,axiom,
$true ).
fof(dt_k1_xboole_0,axiom,
$true ).
fof(dt_k1_zfmisc_1,axiom,
$true ).
fof(dt_k2_tarski,axiom,
$true ).
fof(dt_k2_xboole_0,axiom,
$true ).
fof(dt_k2_zfmisc_1,axiom,
$true ).
fof(dt_k3_tarski,axiom,
$true ).
fof(dt_k3_xboole_0,axiom,
$true ).
fof(dt_k4_tarski,axiom,
$true ).
fof(dt_k4_xboole_0,axiom,
$true ).
fof(fc1_xboole_0,axiom,
empty(empty_set) ).
fof(fc1_zfmisc_1,axiom,
! [A,B] : ~ empty(ordered_pair(A,B)) ).
fof(fc2_xboole_0,axiom,
! [A,B] :
( ~ empty(A)
=> ~ empty(set_union2(A,B)) ) ).
fof(fc3_xboole_0,axiom,
! [A,B] :
( ~ empty(A)
=> ~ empty(set_union2(B,A)) ) ).
fof(idempotence_k2_xboole_0,axiom,
! [A,B] : set_union2(A,A) = A ).
fof(idempotence_k3_xboole_0,axiom,
! [A,B] : set_intersection2(A,A) = A ).
fof(irreflexivity_r2_xboole_0,axiom,
! [A,B] : ~ proper_subset(A,A) ).
fof(l1_zfmisc_1,lemma,
! [A] : singleton(A) != empty_set ).
fof(l23_zfmisc_1,lemma,
! [A,B] :
( in(A,B)
=> set_union2(singleton(A),B) = B ) ).
fof(l25_zfmisc_1,lemma,
! [A,B] :
~ ( disjoint(singleton(A),B)
& in(A,B) ) ).
fof(l28_zfmisc_1,lemma,
! [A,B] :
( ~ in(A,B)
=> disjoint(singleton(A),B) ) ).
fof(l2_zfmisc_1,lemma,
! [A,B] :
( subset(singleton(A),B)
<=> in(A,B) ) ).
fof(l32_xboole_1,lemma,
! [A,B] :
( set_difference(A,B) = empty_set
<=> subset(A,B) ) ).
fof(l3_zfmisc_1,lemma,
! [A,B,C] :
( subset(A,B)
=> ( in(C,A)
| subset(A,set_difference(B,singleton(C))) ) ) ).
fof(l4_zfmisc_1,lemma,
! [A,B] :
( subset(A,singleton(B))
<=> ( A = empty_set
| A = singleton(B) ) ) ).
fof(l50_zfmisc_1,lemma,
! [A,B] :
( in(A,B)
=> subset(A,union(B)) ) ).
fof(l55_zfmisc_1,lemma,
! [A,B,C,D] :
( in(ordered_pair(A,B),cartesian_product2(C,D))
<=> ( in(A,C)
& in(B,D) ) ) ).
fof(rc1_xboole_0,axiom,
? [A] : empty(A) ).
fof(rc2_xboole_0,axiom,
? [A] : ~ empty(A) ).
fof(reflexivity_r1_tarski,axiom,
! [A,B] : subset(A,A) ).
fof(symmetry_r1_xboole_0,axiom,
! [A,B] :
( disjoint(A,B)
=> disjoint(B,A) ) ).
fof(t106_zfmisc_1,lemma,
! [A,B,C,D] :
( in(ordered_pair(A,B),cartesian_product2(C,D))
<=> ( in(A,C)
& in(B,D) ) ) ).
fof(t10_zfmisc_1,lemma,
! [A,B,C,D] :
~ ( unordered_pair(A,B) = unordered_pair(C,D)
& A != C
& A != D ) ).
fof(t118_zfmisc_1,conjecture,
! [A,B,C] :
( subset(A,B)
=> ( subset(cartesian_product2(A,C),cartesian_product2(B,C))
& subset(cartesian_product2(C,A),cartesian_product2(C,B)) ) ) ).
fof(t12_xboole_1,lemma,
! [A,B] :
( subset(A,B)
=> set_union2(A,B) = B ) ).
fof(t17_xboole_1,lemma,
! [A,B] : subset(set_intersection2(A,B),A) ).
fof(t19_xboole_1,lemma,
! [A,B,C] :
( ( subset(A,B)
& subset(A,C) )
=> subset(A,set_intersection2(B,C)) ) ).
fof(t1_boole,axiom,
! [A] : set_union2(A,empty_set) = A ).
fof(t1_xboole_1,lemma,
! [A,B,C] :
( ( subset(A,B)
& subset(B,C) )
=> subset(A,C) ) ).
fof(t1_zfmisc_1,lemma,
powerset(empty_set) = singleton(empty_set) ).
fof(t26_xboole_1,lemma,
! [A,B,C] :
( subset(A,B)
=> subset(set_intersection2(A,C),set_intersection2(B,C)) ) ).
fof(t28_xboole_1,lemma,
! [A,B] :
( subset(A,B)
=> set_intersection2(A,B) = A ) ).
fof(t2_boole,axiom,
! [A] : set_intersection2(A,empty_set) = empty_set ).
fof(t2_tarski,axiom,
! [A,B] :
( ! [C] :
( in(C,A)
<=> in(C,B) )
=> A = B ) ).
fof(t2_xboole_1,lemma,
! [A] : subset(empty_set,A) ).
fof(t33_xboole_1,lemma,
! [A,B,C] :
( subset(A,B)
=> subset(set_difference(A,C),set_difference(B,C)) ) ).
fof(t33_zfmisc_1,lemma,
! [A,B,C,D] :
( ordered_pair(A,B) = ordered_pair(C,D)
=> ( A = C
& B = D ) ) ).
fof(t36_xboole_1,lemma,
! [A,B] : subset(set_difference(A,B),A) ).
fof(t37_xboole_1,lemma,
! [A,B] :
( set_difference(A,B) = empty_set
<=> subset(A,B) ) ).
fof(t37_zfmisc_1,lemma,
! [A,B] :
( subset(singleton(A),B)
<=> in(A,B) ) ).
fof(t38_zfmisc_1,lemma,
! [A,B,C] :
( subset(unordered_pair(A,B),C)
<=> ( in(A,C)
& in(B,C) ) ) ).
fof(t39_xboole_1,lemma,
! [A,B] : set_union2(A,set_difference(B,A)) = set_union2(A,B) ).
fof(t39_zfmisc_1,lemma,
! [A,B] :
( subset(A,singleton(B))
<=> ( A = empty_set
| A = singleton(B) ) ) ).
fof(t3_boole,axiom,
! [A] : set_difference(A,empty_set) = A ).
fof(t3_xboole_0,lemma,
! [A,B] :
( ~ ( ~ disjoint(A,B)
& ! [C] :
~ ( in(C,A)
& in(C,B) ) )
& ~ ( ? [C] :
( in(C,A)
& in(C,B) )
& disjoint(A,B) ) ) ).
fof(t3_xboole_1,lemma,
! [A] :
( subset(A,empty_set)
=> A = empty_set ) ).
fof(t40_xboole_1,lemma,
! [A,B] : set_difference(set_union2(A,B),B) = set_difference(A,B) ).
fof(t45_xboole_1,lemma,
! [A,B] :
( subset(A,B)
=> B = set_union2(A,set_difference(B,A)) ) ).
fof(t46_zfmisc_1,lemma,
! [A,B] :
( in(A,B)
=> set_union2(singleton(A),B) = B ) ).
fof(t48_xboole_1,lemma,
! [A,B] : set_difference(A,set_difference(A,B)) = set_intersection2(A,B) ).
fof(t4_boole,axiom,
! [A] : set_difference(empty_set,A) = empty_set ).
fof(t4_xboole_0,lemma,
! [A,B] :
( ~ ( ~ disjoint(A,B)
& ! [C] : ~ in(C,set_intersection2(A,B)) )
& ~ ( ? [C] : in(C,set_intersection2(A,B))
& disjoint(A,B) ) ) ).
fof(t60_xboole_1,lemma,
! [A,B] :
~ ( subset(A,B)
& proper_subset(B,A) ) ).
fof(t63_xboole_1,lemma,
! [A,B,C] :
( ( subset(A,B)
& disjoint(B,C) )
=> disjoint(A,C) ) ).
fof(t65_zfmisc_1,lemma,
! [A,B] :
( set_difference(A,singleton(B)) = A
<=> ~ in(B,A) ) ).
fof(t69_enumset1,lemma,
! [A] : unordered_pair(A,A) = singleton(A) ).
fof(t6_boole,axiom,
! [A] :
( empty(A)
=> A = empty_set ) ).
fof(t6_zfmisc_1,lemma,
! [A,B] :
( subset(singleton(A),singleton(B))
=> A = B ) ).
fof(t7_boole,axiom,
! [A,B] :
~ ( in(A,B)
& empty(B) ) ).
fof(t7_xboole_1,lemma,
! [A,B] : subset(A,set_union2(A,B)) ).
fof(t83_xboole_1,lemma,
! [A,B] :
( disjoint(A,B)
<=> set_difference(A,B) = A ) ).
fof(t8_boole,axiom,
! [A,B] :
~ ( empty(A)
& A != B
& empty(B) ) ).
fof(t8_xboole_1,lemma,
! [A,B,C] :
( ( subset(A,B)
& subset(C,B) )
=> subset(set_union2(A,C),B) ) ).
fof(t8_zfmisc_1,lemma,
! [A,B,C] :
( singleton(A) = unordered_pair(B,C)
=> A = B ) ).
fof(t92_zfmisc_1,lemma,
! [A,B] :
( in(A,B)
=> subset(A,union(B)) ) ).
fof(t99_zfmisc_1,lemma,
! [A] : union(powerset(A)) = A ).
fof(t9_zfmisc_1,lemma,
! [A,B,C] :
( singleton(A) = unordered_pair(B,C)
=> B = C ) ).
%------------------------------------------------------------------------------