TPTP Problem File: SEU060+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SEU060+1 : TPTP v8.2.0. Released v3.2.0.
% Domain : Set theory
% Problem : Functions and their basic properties, theorem 139
% Version : [Urb06] axioms : Especial.
% English :
% Refs : [Byl90] Bylinski (1990), Functions and Their Basic Properties
% : [Urb06] Urban (2006), Email to G. Sutcliffe
% Source : [Urb06]
% Names : funct_1__t139_funct_1 [Urb06]
% Status : Theorem
% Rating : 0.86 v8.2.0, 0.89 v8.1.0, 0.86 v7.5.0, 0.88 v7.4.0, 0.87 v7.3.0, 0.90 v7.2.0, 0.86 v7.1.0, 0.91 v7.0.0, 0.83 v6.4.0, 0.85 v6.3.0, 0.88 v6.2.0, 0.92 v6.1.0, 1.00 v5.5.0, 0.96 v5.2.0, 0.95 v5.0.0, 0.96 v3.7.0, 0.90 v3.5.0, 0.95 v3.3.0, 0.93 v3.2.0
% Syntax : Number of formulae : 47 ( 14 unt; 0 def)
% Number of atoms : 108 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 74 ( 13 ~; 1 |; 32 &)
% ( 9 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 0 prp; 1-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-2 aty)
% Number of variables : 85 ( 73 !; 12 ?)
% 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_funct_1,axiom,
! [A] :
( empty(A)
=> function(A) ) ).
fof(cc1_relat_1,axiom,
! [A] :
( empty(A)
=> relation(A) ) ).
fof(cc2_funct_1,axiom,
! [A] :
( ( relation(A)
& empty(A)
& function(A) )
=> ( relation(A)
& function(A)
& one_to_one(A) ) ) ).
fof(commutativity_k2_tarski,axiom,
! [A,B] : unordered_pair(A,B) = unordered_pair(B,A) ).
fof(commutativity_k3_xboole_0,axiom,
! [A,B] : set_intersection2(A,B) = set_intersection2(B,A) ).
fof(d10_xboole_0,axiom,
! [A,B] :
( A = B
<=> ( subset(A,B)
& subset(B,A) ) ) ).
fof(d11_relat_1,axiom,
! [A] :
( relation(A)
=> ! [B,C] :
( relation(C)
=> ( C = relation_dom_restriction(A,B)
<=> ! [D,E] :
( in(ordered_pair(D,E),C)
<=> ( in(D,B)
& in(ordered_pair(D,E),A) ) ) ) ) ) ).
fof(d14_relat_1,axiom,
! [A] :
( relation(A)
=> ! [B,C] :
( C = relation_inverse_image(A,B)
<=> ! [D] :
( in(D,C)
<=> ? [E] :
( in(ordered_pair(D,E),A)
& in(E,B) ) ) ) ) ).
fof(d3_tarski,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ) ).
fof(d3_xboole_0,axiom,
! [A,B,C] :
( C = set_intersection2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ) ).
fof(d5_tarski,axiom,
! [A,B] : ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A)) ).
fof(dt_k7_relat_1,axiom,
! [A,B] :
( relation(A)
=> relation(relation_dom_restriction(A,B)) ) ).
fof(existence_m1_subset_1,axiom,
! [A] :
? [B] : element(B,A) ).
fof(fc12_relat_1,axiom,
( empty(empty_set)
& relation(empty_set)
& relation_empty_yielding(empty_set) ) ).
fof(fc13_relat_1,axiom,
! [A,B] :
( ( relation(A)
& relation_empty_yielding(A) )
=> ( relation(relation_dom_restriction(A,B))
& relation_empty_yielding(relation_dom_restriction(A,B)) ) ) ).
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(fc1_zfmisc_1,axiom,
! [A,B] : ~ empty(ordered_pair(A,B)) ).
fof(fc2_subset_1,axiom,
! [A] : ~ empty(singleton(A)) ).
fof(fc3_subset_1,axiom,
! [A,B] : ~ empty(unordered_pair(A,B)) ).
fof(fc4_funct_1,axiom,
! [A,B] :
( ( relation(A)
& function(A) )
=> ( relation(relation_dom_restriction(A,B))
& function(relation_dom_restriction(A,B)) ) ) ).
fof(fc4_relat_1,axiom,
( empty(empty_set)
& relation(empty_set) ) ).
fof(idempotence_k3_xboole_0,axiom,
! [A,B] : set_intersection2(A,A) = A ).
fof(rc1_funct_1,axiom,
? [A] :
( relation(A)
& function(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_funct_1,axiom,
? [A] :
( relation(A)
& empty(A)
& function(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_funct_1,axiom,
? [A] :
( relation(A)
& function(A)
& one_to_one(A) ) ).
fof(rc3_relat_1,axiom,
? [A] :
( relation(A)
& relation_empty_yielding(A) ) ).
fof(reflexivity_r1_tarski,axiom,
! [A,B] : subset(A,A) ).
fof(t139_funct_1,conjecture,
! [A,B,C] :
( relation(C)
=> relation_inverse_image(relation_dom_restriction(C,A),B) = set_intersection2(A,relation_inverse_image(C,B)) ) ).
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(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(t88_relat_1,axiom,
! [A,B] :
( relation(B)
=> subset(relation_dom_restriction(B,A),B) ) ).
fof(t8_boole,axiom,
! [A,B] :
~ ( empty(A)
& A != B
& empty(B) ) ).
%------------------------------------------------------------------------------