TPTP Problem File: SEU296+3.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SEU296+3 : TPTP v8.2.0. Released v3.2.0.
% Domain : Set theory
% Problem : Finite sets, theorem 17
% Version : [Urb06] axioms : Especial.
% English :
% Refs : [Dar90] Darmochwal (1990), Finite Sets
% : [Urb06] Urban (2006), Email to G. Sutcliffe
% Source : [Urb06]
% Names : finset_1__t17_finset_1 [Urb06]
% Status : Theorem
% Rating : 0.78 v8.2.0, 0.81 v7.4.0, 0.73 v7.3.0, 0.76 v7.1.0, 0.70 v7.0.0, 0.73 v6.4.0, 0.69 v6.3.0, 0.71 v6.2.0, 0.84 v6.1.0, 0.93 v6.0.0, 0.87 v5.5.0, 0.96 v5.4.0, 0.93 v5.3.0, 0.96 v5.2.0, 0.85 v5.1.0, 0.86 v5.0.0, 0.92 v4.1.0, 0.91 v4.0.0, 0.92 v3.7.0, 0.90 v3.5.0, 0.89 v3.3.0, 0.86 v3.2.0
% Syntax : Number of formulae : 79 ( 11 unt; 0 def)
% Number of atoms : 256 ( 9 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 199 ( 22 ~; 1 |; 129 &)
% ( 2 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 20 ( 19 usr; 0 prp; 1-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 108 ( 81 !; 27 ?)
% 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(cc1_arytm_3,axiom,
! [A] :
( ordinal(A)
=> ! [B] :
( element(B,A)
=> ( epsilon_transitive(B)
& epsilon_connected(B)
& ordinal(B) ) ) ) ).
fof(cc1_finset_1,axiom,
! [A] :
( empty(A)
=> finite(A) ) ).
fof(cc1_funct_1,axiom,
! [A] :
( empty(A)
=> function(A) ) ).
fof(cc1_ordinal1,axiom,
! [A] :
( ordinal(A)
=> ( epsilon_transitive(A)
& epsilon_connected(A) ) ) ).
fof(cc1_relat_1,axiom,
! [A] :
( empty(A)
=> relation(A) ) ).
fof(cc2_arytm_3,axiom,
! [A] :
( ( empty(A)
& ordinal(A) )
=> ( epsilon_transitive(A)
& epsilon_connected(A)
& ordinal(A)
& natural(A) ) ) ).
fof(cc2_finset_1,axiom,
! [A] :
( finite(A)
=> ! [B] :
( element(B,powerset(A))
=> finite(B) ) ) ).
fof(cc2_funct_1,axiom,
! [A] :
( ( relation(A)
& empty(A)
& function(A) )
=> ( relation(A)
& function(A)
& one_to_one(A) ) ) ).
fof(cc2_ordinal1,axiom,
! [A] :
( ( epsilon_transitive(A)
& epsilon_connected(A) )
=> ordinal(A) ) ).
fof(cc3_arytm_3,axiom,
! [A] :
( element(A,omega)
=> ( epsilon_transitive(A)
& epsilon_connected(A)
& ordinal(A)
& natural(A) ) ) ).
fof(cc3_ordinal1,axiom,
! [A] :
( empty(A)
=> ( epsilon_transitive(A)
& epsilon_connected(A)
& ordinal(A) ) ) ).
fof(cc4_arytm_3,axiom,
! [A] :
( element(A,positive_rationals)
=> ( ordinal(A)
=> ( epsilon_transitive(A)
& epsilon_connected(A)
& ordinal(A)
& natural(A) ) ) ) ).
fof(commutativity_k3_xboole_0,axiom,
! [A,B] : set_intersection2(A,B) = set_intersection2(B,A) ).
fof(d1_finset_1,axiom,
! [A] :
( finite(A)
<=> ? [B] :
( relation(B)
& function(B)
& relation_rng(B) = A
& in(relation_dom(B),omega) ) ) ).
fof(dt_k5_relat_1,axiom,
! [A,B] :
( ( relation(A)
& relation(B) )
=> relation(relation_composition(A,B)) ) ).
fof(existence_m1_subset_1,axiom,
! [A] :
? [B] : element(B,A) ).
fof(fc10_finset_1,axiom,
! [A,B] :
( finite(B)
=> finite(set_intersection2(A,B)) ) ).
fof(fc10_relat_1,axiom,
! [A,B] :
( ( empty(A)
& relation(B) )
=> ( empty(relation_composition(B,A))
& relation(relation_composition(B,A)) ) ) ).
fof(fc11_finset_1,axiom,
! [A,B] :
( finite(A)
=> finite(set_intersection2(A,B)) ) ).
fof(fc12_relat_1,axiom,
( empty(empty_set)
& relation(empty_set)
& relation_empty_yielding(empty_set) ) ).
fof(fc1_funct_1,axiom,
! [A,B] :
( ( relation(A)
& function(A)
& relation(B)
& function(B) )
=> ( relation(relation_composition(A,B))
& function(relation_composition(A,B)) ) ) ).
fof(fc1_ordinal2,axiom,
( epsilon_transitive(omega)
& epsilon_connected(omega)
& ordinal(omega)
& ~ empty(omega) ) ).
fof(fc1_relat_1,axiom,
! [A,B] :
( ( relation(A)
& relation(B) )
=> relation(set_intersection2(A,B)) ) ).
fof(fc1_subset_1,axiom,
! [A] : ~ empty(powerset(A)) ).
fof(fc1_xboole_0,axiom,
empty(empty_set) ).
fof(fc2_ordinal1,axiom,
( relation(empty_set)
& relation_empty_yielding(empty_set)
& function(empty_set)
& one_to_one(empty_set)
& empty(empty_set)
& epsilon_transitive(empty_set)
& epsilon_connected(empty_set)
& ordinal(empty_set) ) ).
fof(fc4_relat_1,axiom,
( empty(empty_set)
& relation(empty_set) ) ).
fof(fc5_ordinal1,axiom,
! [A] :
( ( relation(A)
& function(A)
& transfinite_sequence(A) )
=> ( epsilon_transitive(relation_dom(A))
& epsilon_connected(relation_dom(A))
& ordinal(relation_dom(A)) ) ) ).
fof(fc5_relat_1,axiom,
! [A] :
( ( ~ empty(A)
& relation(A) )
=> ~ empty(relation_dom(A)) ) ).
fof(fc6_funct_1,axiom,
! [A] :
( ( relation(A)
& relation_non_empty(A)
& function(A) )
=> with_non_empty_elements(relation_rng(A)) ) ).
fof(fc6_relat_1,axiom,
! [A] :
( ( ~ empty(A)
& relation(A) )
=> ~ empty(relation_rng(A)) ) ).
fof(fc7_relat_1,axiom,
! [A] :
( empty(A)
=> ( empty(relation_dom(A))
& relation(relation_dom(A)) ) ) ).
fof(fc8_arytm_3,axiom,
~ empty(positive_rationals) ).
fof(fc8_funcop_1,axiom,
! [A,B] :
( ( relation(A)
& function(A)
& function_yielding(A)
& relation(B)
& function(B) )
=> ( relation(relation_composition(B,A))
& function(relation_composition(B,A))
& function_yielding(relation_composition(B,A)) ) ) ).
fof(fc8_relat_1,axiom,
! [A] :
( empty(A)
=> ( empty(relation_rng(A))
& relation(relation_rng(A)) ) ) ).
fof(fc9_relat_1,axiom,
! [A,B] :
( ( empty(A)
& relation(B) )
=> ( empty(relation_composition(A,B))
& relation(relation_composition(A,B)) ) ) ).
fof(idempotence_k3_xboole_0,axiom,
! [A,B] : set_intersection2(A,A) = A ).
fof(rc1_arytm_3,axiom,
? [A] :
( ~ empty(A)
& epsilon_transitive(A)
& epsilon_connected(A)
& ordinal(A)
& natural(A) ) ).
fof(rc1_finset_1,axiom,
? [A] :
( ~ empty(A)
& finite(A) ) ).
fof(rc1_funcop_1,axiom,
? [A] :
( relation(A)
& function(A)
& function_yielding(A) ) ).
fof(rc1_funct_1,axiom,
? [A] :
( relation(A)
& function(A) ) ).
fof(rc1_ordinal1,axiom,
? [A] :
( epsilon_transitive(A)
& epsilon_connected(A)
& ordinal(A) ) ).
fof(rc1_ordinal2,axiom,
? [A] :
( epsilon_transitive(A)
& epsilon_connected(A)
& ordinal(A)
& being_limit_ordinal(A) ) ).
fof(rc1_relat_1,axiom,
? [A] :
( empty(A)
& relation(A) ) ).
fof(rc1_subset_1,axiom,
! [A] :
( ~ empty(A)
=> ? [B] :
( element(B,powerset(A))
& ~ empty(B) ) ) ).
fof(rc1_xboole_0,axiom,
? [A] : empty(A) ).
fof(rc2_arytm_3,axiom,
? [A] :
( element(A,positive_rationals)
& ~ empty(A)
& epsilon_transitive(A)
& epsilon_connected(A)
& ordinal(A) ) ).
fof(rc2_finset_1,axiom,
! [A] :
? [B] :
( element(B,powerset(A))
& empty(B)
& relation(B)
& function(B)
& one_to_one(B)
& epsilon_transitive(B)
& epsilon_connected(B)
& ordinal(B)
& natural(B)
& finite(B) ) ).
fof(rc2_funct_1,axiom,
? [A] :
( relation(A)
& empty(A)
& function(A) ) ).
fof(rc2_ordinal1,axiom,
? [A] :
( relation(A)
& function(A)
& one_to_one(A)
& empty(A)
& epsilon_transitive(A)
& epsilon_connected(A)
& ordinal(A) ) ).
fof(rc2_ordinal2,axiom,
? [A] :
( relation(A)
& function(A)
& transfinite_sequence(A)
& ordinal_yielding(A) ) ).
fof(rc2_relat_1,axiom,
? [A] :
( ~ empty(A)
& relation(A) ) ).
fof(rc2_subset_1,axiom,
! [A] :
? [B] :
( element(B,powerset(A))
& empty(B) ) ).
fof(rc2_xboole_0,axiom,
? [A] : ~ empty(A) ).
fof(rc3_arytm_3,axiom,
? [A] :
( element(A,positive_rationals)
& empty(A)
& epsilon_transitive(A)
& epsilon_connected(A)
& ordinal(A)
& natural(A) ) ).
fof(rc3_finset_1,axiom,
! [A] :
( ~ empty(A)
=> ? [B] :
( element(B,powerset(A))
& ~ empty(B)
& finite(B) ) ) ).
fof(rc3_funct_1,axiom,
? [A] :
( relation(A)
& function(A)
& one_to_one(A) ) ).
fof(rc3_ordinal1,axiom,
? [A] :
( ~ empty(A)
& epsilon_transitive(A)
& epsilon_connected(A)
& ordinal(A) ) ).
fof(rc3_relat_1,axiom,
? [A] :
( relation(A)
& relation_empty_yielding(A) ) ).
fof(rc4_funct_1,axiom,
? [A] :
( relation(A)
& relation_empty_yielding(A)
& function(A) ) ).
fof(rc4_ordinal1,axiom,
? [A] :
( relation(A)
& function(A)
& transfinite_sequence(A) ) ).
fof(rc5_funct_1,axiom,
? [A] :
( relation(A)
& relation_non_empty(A)
& function(A) ) ).
fof(reflexivity_r1_tarski,axiom,
! [A,B] : subset(A,A) ).
fof(t145_relat_1,axiom,
! [A,B] :
( relation(B)
=> relation_image(B,A) = relation_image(B,set_intersection2(relation_dom(B),A)) ) ).
fof(t15_finset_1,axiom,
! [A,B] :
( finite(A)
=> finite(set_intersection2(A,B)) ) ).
fof(t160_relat_1,axiom,
! [A] :
( relation(A)
=> ! [B] :
( relation(B)
=> relation_rng(relation_composition(A,B)) = relation_image(B,relation_rng(A)) ) ) ).
fof(t17_finset_1,conjecture,
! [A,B] :
( ( relation(B)
& function(B) )
=> ( finite(A)
=> finite(relation_image(B,A)) ) ) ).
fof(t17_xboole_1,axiom,
! [A,B] : subset(set_intersection2(A,B),A) ).
fof(t1_subset,axiom,
! [A,B] :
( in(A,B)
=> element(A,B) ) ).
fof(t2_boole,axiom,
! [A] : set_intersection2(A,empty_set) = empty_set ).
fof(t2_subset,axiom,
! [A,B] :
( element(A,B)
=> ( empty(B)
| in(A,B) ) ) ).
fof(t3_subset,axiom,
! [A,B] :
( element(A,powerset(B))
<=> subset(A,B) ) ).
fof(t46_relat_1,axiom,
! [A] :
( relation(A)
=> ! [B] :
( relation(B)
=> ( subset(relation_rng(A),relation_dom(B))
=> relation_dom(relation_composition(A,B)) = relation_dom(A) ) ) ) ).
fof(t4_subset,axiom,
! [A,B,C] :
( ( in(A,B)
& element(B,powerset(C)) )
=> element(A,C) ) ).
fof(t5_subset,axiom,
! [A,B,C] :
~ ( in(A,B)
& element(B,powerset(C))
& empty(C) ) ).
fof(t6_boole,axiom,
! [A] :
( empty(A)
=> A = empty_set ) ).
fof(t7_boole,axiom,
! [A,B] :
~ ( in(A,B)
& empty(B) ) ).
fof(t8_boole,axiom,
! [A,B] :
~ ( empty(A)
& A != B
& empty(B) ) ).
%------------------------------------------------------------------------------