TPTP Problem File: SEU417+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SEU417+1 : TPTP v8.2.0. Released v3.4.0.
% Domain : Set Theory
% Problem : First and Second Order Cutting of Binary Relations T07
% Version : [Urb08] axioms : Especial.
% English :
% Refs : [Ret05] Retel (2005), Properties of First and Second Order Cut
% : [Urb07] Urban (2007), MPTP 0.2: Design, Implementation, and In
% : [Urb08] Urban (2006), Email to G. Sutcliffe
% Source : [Urb08]
% Names : t7_relset_2 [Urb08]
% Status : Theorem
% Rating : 0.39 v8.2.0, 0.36 v8.1.0, 0.39 v7.5.0, 0.41 v7.4.0, 0.20 v7.3.0, 0.38 v7.1.0, 0.39 v7.0.0, 0.40 v6.4.0, 0.46 v6.3.0, 0.42 v6.2.0, 0.48 v6.1.0, 0.60 v6.0.0, 0.65 v5.5.0, 0.70 v5.4.0, 0.71 v5.3.0, 0.74 v5.2.0, 0.60 v5.1.0, 0.62 v5.0.0, 0.67 v4.1.0, 0.65 v4.0.0, 0.67 v3.7.0, 0.65 v3.5.0, 0.68 v3.4.0
% Syntax : Number of formulae : 50 ( 15 unt; 0 def)
% Number of atoms : 111 ( 19 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 70 ( 9 ~; 1 |; 28 &)
% ( 1 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-3 aty)
% Number of variables : 97 ( 91 !; 6 ?)
% SPC : FOF_THM_RFO_SEQ
% Comments : Normal version: includes the axioms (which may be theorems from
% other articles) and background that are possibly necessary.
% : Translated by MPTP from the Mizar Mathematical Library 4.48.930.
% : The problem encoding is based on set theory.
%------------------------------------------------------------------------------
fof(t7_relset_2,conjecture,
! [A,B] :
( m1_subset_1(B,k1_zfmisc_1(k1_zfmisc_1(A)))
=> ! [C] :
( m1_subset_1(C,k1_zfmisc_1(k1_zfmisc_1(A)))
=> r1_tarski(k5_subset_1(A,k8_setfam_1(A,B),k8_setfam_1(A,C)),k8_setfam_1(A,k1_relset_2(A,B,C))) ) ) ).
fof(antisymmetry_r2_hidden,axiom,
! [A,B] :
( r2_hidden(A,B)
=> ~ r2_hidden(B,A) ) ).
fof(cc1_relat_1,axiom,
! [A] :
( v1_xboole_0(A)
=> v1_relat_1(A) ) ).
fof(commutativity_k1_relset_2,axiom,
! [A,B,C] :
( ( m1_subset_1(B,k1_zfmisc_1(k1_zfmisc_1(A)))
& m1_subset_1(C,k1_zfmisc_1(k1_zfmisc_1(A))) )
=> k1_relset_2(A,B,C) = k1_relset_2(A,C,B) ) ).
fof(commutativity_k2_xboole_0,axiom,
! [A,B] : k2_xboole_0(A,B) = k2_xboole_0(B,A) ).
fof(commutativity_k3_xboole_0,axiom,
! [A,B] : k3_xboole_0(A,B) = k3_xboole_0(B,A) ).
fof(commutativity_k4_subset_1,axiom,
! [A,B,C] :
( ( m1_subset_1(B,k1_zfmisc_1(A))
& m1_subset_1(C,k1_zfmisc_1(A)) )
=> k4_subset_1(A,B,C) = k4_subset_1(A,C,B) ) ).
fof(commutativity_k5_subset_1,axiom,
! [A,B,C] :
( ( m1_subset_1(B,k1_zfmisc_1(A))
& m1_subset_1(C,k1_zfmisc_1(A)) )
=> k5_subset_1(A,B,C) = k5_subset_1(A,C,B) ) ).
fof(dt_k1_relset_2,axiom,
! [A,B,C] :
( ( m1_subset_1(B,k1_zfmisc_1(k1_zfmisc_1(A)))
& m1_subset_1(C,k1_zfmisc_1(k1_zfmisc_1(A))) )
=> m1_subset_1(k1_relset_2(A,B,C),k1_zfmisc_1(k1_zfmisc_1(A))) ) ).
fof(dt_k1_xboole_0,axiom,
$true ).
fof(dt_k1_zfmisc_1,axiom,
$true ).
fof(dt_k2_xboole_0,axiom,
$true ).
fof(dt_k3_xboole_0,axiom,
$true ).
fof(dt_k4_subset_1,axiom,
! [A,B,C] :
( ( m1_subset_1(B,k1_zfmisc_1(A))
& m1_subset_1(C,k1_zfmisc_1(A)) )
=> m1_subset_1(k4_subset_1(A,B,C),k1_zfmisc_1(A)) ) ).
fof(dt_k5_subset_1,axiom,
! [A,B,C] :
( ( m1_subset_1(B,k1_zfmisc_1(A))
& m1_subset_1(C,k1_zfmisc_1(A)) )
=> m1_subset_1(k5_subset_1(A,B,C),k1_zfmisc_1(A)) ) ).
fof(dt_k8_setfam_1,axiom,
! [A,B] :
( m1_subset_1(B,k1_zfmisc_1(k1_zfmisc_1(A)))
=> m1_subset_1(k8_setfam_1(A,B),k1_zfmisc_1(A)) ) ).
fof(dt_m1_subset_1,axiom,
$true ).
fof(existence_m1_subset_1,axiom,
! [A] :
? [B] : m1_subset_1(B,A) ).
fof(fc12_relat_1,axiom,
( v1_xboole_0(k1_xboole_0)
& v1_relat_1(k1_xboole_0)
& v3_relat_1(k1_xboole_0) ) ).
fof(fc1_relat_1,axiom,
! [A,B] :
( ( v1_relat_1(A)
& v1_relat_1(B) )
=> v1_relat_1(k3_xboole_0(A,B)) ) ).
fof(fc1_subset_1,axiom,
! [A] : ~ v1_xboole_0(k1_zfmisc_1(A)) ).
fof(fc2_relat_1,axiom,
! [A,B] :
( ( v1_relat_1(A)
& v1_relat_1(B) )
=> v1_relat_1(k2_xboole_0(A,B)) ) ).
fof(fc4_relat_1,axiom,
( v1_xboole_0(k1_xboole_0)
& v1_relat_1(k1_xboole_0) ) ).
fof(idempotence_k1_relset_2,axiom,
! [A,B,C] :
( ( m1_subset_1(B,k1_zfmisc_1(k1_zfmisc_1(A)))
& m1_subset_1(C,k1_zfmisc_1(k1_zfmisc_1(A))) )
=> k1_relset_2(A,B,B) = B ) ).
fof(idempotence_k2_xboole_0,axiom,
! [A,B] : k2_xboole_0(A,A) = A ).
fof(idempotence_k3_xboole_0,axiom,
! [A,B] : k3_xboole_0(A,A) = A ).
fof(idempotence_k4_subset_1,axiom,
! [A,B,C] :
( ( m1_subset_1(B,k1_zfmisc_1(A))
& m1_subset_1(C,k1_zfmisc_1(A)) )
=> k4_subset_1(A,B,B) = B ) ).
fof(idempotence_k5_subset_1,axiom,
! [A,B,C] :
( ( m1_subset_1(B,k1_zfmisc_1(A))
& m1_subset_1(C,k1_zfmisc_1(A)) )
=> k5_subset_1(A,B,B) = B ) ).
fof(rc1_relat_1,axiom,
? [A] :
( v1_xboole_0(A)
& v1_relat_1(A) ) ).
fof(rc1_subset_1,axiom,
! [A] :
( ~ v1_xboole_0(A)
=> ? [B] :
( m1_subset_1(B,k1_zfmisc_1(A))
& ~ v1_xboole_0(B) ) ) ).
fof(rc2_relat_1,axiom,
? [A] :
( ~ v1_xboole_0(A)
& v1_relat_1(A) ) ).
fof(rc2_subset_1,axiom,
! [A] :
? [B] :
( m1_subset_1(B,k1_zfmisc_1(A))
& v1_xboole_0(B) ) ).
fof(rc3_relat_1,axiom,
? [A] :
( v1_relat_1(A)
& v3_relat_1(A) ) ).
fof(redefinition_k1_relset_2,axiom,
! [A,B,C] :
( ( m1_subset_1(B,k1_zfmisc_1(k1_zfmisc_1(A)))
& m1_subset_1(C,k1_zfmisc_1(k1_zfmisc_1(A))) )
=> k1_relset_2(A,B,C) = k3_xboole_0(B,C) ) ).
fof(redefinition_k4_subset_1,axiom,
! [A,B,C] :
( ( m1_subset_1(B,k1_zfmisc_1(A))
& m1_subset_1(C,k1_zfmisc_1(A)) )
=> k4_subset_1(A,B,C) = k2_xboole_0(B,C) ) ).
fof(redefinition_k5_subset_1,axiom,
! [A,B,C] :
( ( m1_subset_1(B,k1_zfmisc_1(A))
& m1_subset_1(C,k1_zfmisc_1(A)) )
=> k5_subset_1(A,B,C) = k3_xboole_0(B,C) ) ).
fof(reflexivity_r1_tarski,axiom,
! [A,B] : r1_tarski(A,A) ).
fof(t1_boole,axiom,
! [A] : k2_xboole_0(A,k1_xboole_0) = A ).
fof(t1_subset,axiom,
! [A,B] :
( r2_hidden(A,B)
=> m1_subset_1(A,B) ) ).
fof(t29_xboole_1,axiom,
! [A,B,C] : r1_tarski(k3_xboole_0(A,B),k2_xboole_0(A,C)) ).
fof(t2_boole,axiom,
! [A] : k3_xboole_0(A,k1_xboole_0) = k1_xboole_0 ).
fof(t2_subset,axiom,
! [A,B] :
( m1_subset_1(A,B)
=> ( v1_xboole_0(B)
| r2_hidden(A,B) ) ) ).
fof(t3_subset,axiom,
! [A,B] :
( m1_subset_1(A,k1_zfmisc_1(B))
<=> r1_tarski(A,B) ) ).
fof(t4_subset,axiom,
! [A,B,C] :
( ( r2_hidden(A,B)
& m1_subset_1(B,k1_zfmisc_1(C)) )
=> m1_subset_1(A,C) ) ).
fof(t59_setfam_1,axiom,
! [A,B] :
( m1_subset_1(B,k1_zfmisc_1(k1_zfmisc_1(A)))
=> ! [C] :
( m1_subset_1(C,k1_zfmisc_1(k1_zfmisc_1(A)))
=> ( r1_tarski(B,C)
=> r1_tarski(k8_setfam_1(A,C),k8_setfam_1(A,B)) ) ) ) ).
fof(t5_subset,axiom,
! [A,B,C] :
~ ( r2_hidden(A,B)
& m1_subset_1(B,k1_zfmisc_1(C))
& v1_xboole_0(C) ) ).
fof(t6_boole,axiom,
! [A] :
( v1_xboole_0(A)
=> A = k1_xboole_0 ) ).
fof(t7_boole,axiom,
! [A,B] :
~ ( r2_hidden(A,B)
& v1_xboole_0(B) ) ).
fof(t8_boole,axiom,
! [A,B] :
~ ( v1_xboole_0(A)
& A != B
& v1_xboole_0(B) ) ).
fof(t8_mssubfam,axiom,
! [A,B] :
( m1_subset_1(B,k1_zfmisc_1(k1_zfmisc_1(A)))
=> ! [C] :
( m1_subset_1(C,k1_zfmisc_1(k1_zfmisc_1(A)))
=> ! [D] :
( m1_subset_1(D,k1_zfmisc_1(k1_zfmisc_1(A)))
=> ( B = k4_subset_1(k1_zfmisc_1(A),C,D)
=> k8_setfam_1(A,B) = k5_subset_1(A,k8_setfam_1(A,C),k8_setfam_1(A,D)) ) ) ) ) ).
%------------------------------------------------------------------------------