## TPTP Problem File: SET894+1.p

View Solutions - Solve Problem

```%------------------------------------------------------------------------------
% File     : SET894+1 : TPTP v8.0.0. Bugfixed v4.0.0.
% Domain   : Set theory
% Problem  : cart_prod(singleton(A),singleton(B)) = singleton(o_pair(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__t35_zfmisc_1 [Urb06]

% Status   : Theorem
% Rating   : 0.64 v7.5.0, 0.66 v7.4.0, 0.60 v7.3.0, 0.48 v7.0.0, 0.67 v6.4.0, 0.65 v6.3.0, 0.62 v6.2.0, 0.68 v6.1.0, 0.80 v6.0.0, 0.83 v5.5.0, 0.81 v5.4.0, 0.79 v5.3.0, 0.81 v5.2.0, 0.70 v5.1.0, 0.71 v5.0.0, 0.75 v4.1.0, 0.70 v4.0.1, 0.74 v4.0.0
% Syntax   : Number of formulae    :   11 (   6 unt;   0 def)
%            Number of atoms       :   22 (   8 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   14 (   3   ~;   0   |;   3   &)
%                                         (   6 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   0 prp; 1-2 aty)
%            Number of functors    :    4 (   4 usr;   0 con; 1-2 aty)
%            Number of variables   :   28 (  24   !;   4   ?)
% SPC      : FOF_THM_RFO_SEQ

% Comments : Translated by MPTP 0.2 from the original problem in the Mizar
%            library, www.mizar.org
% Bugfixes : v4.0.0 - Removed duplicate formula t2_tarski
%------------------------------------------------------------------------------
fof(antisymmetry_r2_hidden,axiom,
! [A,B] :
( in(A,B)
=> ~ in(B,A) ) ).

fof(commutativity_k2_tarski,axiom,
! [A,B] : unordered_pair(A,B) = unordered_pair(B,A) ).

fof(d1_tarski,axiom,
! [A,B] :
( B = singleton(A)
<=> ! [C] :
( in(C,B)
<=> C = A ) ) ).

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(d5_tarski,axiom,
! [A,B] : ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A)) ).

fof(fc1_zfmisc_1,axiom,
! [A,B] : ~ empty(ordered_pair(A,B)) ).

fof(l55_zfmisc_1,axiom,
! [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(t2_tarski,axiom,
! [A,B] :
( ! [C] :
( in(C,A)
<=> in(C,B) )
=> A = B ) ).

fof(t35_zfmisc_1,conjecture,
! [A,B] : cartesian_product2(singleton(A),singleton(B)) = singleton(ordered_pair(A,B)) ).

%------------------------------------------------------------------------------
```