TPTP Problem File: SET880+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SET880+1 : TPTP v9.0.0. Released v3.2.0.
% Domain : Set theory
% Problem : difference(singleton(A),singleton(B)) = empty_set => A = B
% Version : [Urb06] axioms : Especial.
% English :
% Refs : [Byl90] Bylinski (1990), Some Basic Properties of Sets
% : [Urb06] Urban (2006), Email to G. Sutcliffe
% Source : [Urb06]
% Names : zfmisc_1__t21_zfmisc_1 [Urb06]
% Status : Theorem
% Rating : 0.00 v9.0.0, 0.06 v7.4.0, 0.07 v7.1.0, 0.09 v7.0.0, 0.07 v6.4.0, 0.12 v6.3.0, 0.08 v6.2.0, 0.12 v6.1.0, 0.10 v6.0.0, 0.13 v5.5.0, 0.07 v5.3.0, 0.11 v5.2.0, 0.00 v5.0.0, 0.12 v4.1.0, 0.13 v4.0.0, 0.12 v3.7.0, 0.10 v3.5.0, 0.11 v3.3.0, 0.14 v3.2.0
% Syntax : Number of formulae : 7 ( 3 unt; 0 def)
% Number of atoms : 12 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 7 ( 2 ~; 0 |; 0 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 0 prp; 1-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 11 ( 9 !; 2 ?)
% 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(d1_tarski,axiom,
! [A,B] :
( B = singleton(A)
<=> ! [C] :
( in(C,B)
<=> C = A ) ) ).
fof(fc1_xboole_0,axiom,
empty(empty_set) ).
fof(l36_zfmisc_1,axiom,
! [A,B] :
( set_difference(singleton(A),B) = empty_set
<=> in(A,B) ) ).
fof(rc1_xboole_0,axiom,
? [A] : empty(A) ).
fof(rc2_xboole_0,axiom,
? [A] : ~ empty(A) ).
fof(t21_zfmisc_1,conjecture,
! [A,B] :
( set_difference(singleton(A),singleton(B)) = empty_set
=> A = B ) ).
%------------------------------------------------------------------------------