TPTP Problem File: SET942+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SET942+1 : TPTP v9.0.0. Released v3.2.0.
% Domain : Set theory
% Problem : subset(A,B) => subset(union(A),union(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__t95_zfmisc_1 [Urb06]
% Status : Theorem
% Rating : 0.21 v9.0.0, 0.25 v8.2.0, 0.28 v8.1.0, 0.25 v7.4.0, 0.13 v7.3.0, 0.17 v7.2.0, 0.14 v7.1.0, 0.17 v6.4.0, 0.19 v6.3.0, 0.21 v6.2.0, 0.28 v6.1.0, 0.43 v6.0.0, 0.35 v5.5.0, 0.26 v5.4.0, 0.32 v5.3.0, 0.37 v5.2.0, 0.25 v5.1.0, 0.24 v5.0.0, 0.33 v4.1.0, 0.26 v4.0.0, 0.25 v3.7.0, 0.20 v3.5.0, 0.21 v3.4.0, 0.32 v3.3.0, 0.36 v3.2.0
% Syntax : Number of formulae : 7 ( 3 unt; 0 def)
% Number of atoms : 14 ( 1 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 9 ( 2 ~; 0 |; 1 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 0 prp; 1-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 15 ( 12 !; 3 ?)
% 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(d3_tarski,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ) ).
fof(d4_tarski,axiom,
! [A,B] :
( B = union(A)
<=> ! [C] :
( in(C,B)
<=> ? [D] :
( in(C,D)
& in(D,A) ) ) ) ).
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(t95_zfmisc_1,conjecture,
! [A,B] :
( subset(A,B)
=> subset(union(A),union(B)) ) ).
%------------------------------------------------------------------------------