TPTP Problem File: HAL004+1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : HAL004+1 : TPTP v9.0.0. Released v2.6.0.
% Domain : Homological Algebra
% Problem : Lemma for the short Five Lemma, Part 2
% Version : [TPTP] axioms.
% English :
% Refs : [Wei94] Weibel (1994), An Introduction to Homological Algebra
% Source : [TPTP]
% Names :
% Status : Theorem
% Rating : 0.39 v9.0.0, 0.47 v8.2.0, 0.44 v8.1.0, 0.53 v7.4.0, 0.43 v7.3.0, 0.48 v7.2.0, 0.45 v7.1.0, 0.43 v7.0.0, 0.50 v6.4.0, 0.54 v6.3.0, 0.46 v6.2.0, 0.56 v6.1.0, 0.70 v5.5.0, 0.81 v5.4.0, 0.82 v5.3.0, 0.85 v5.2.0, 0.75 v5.1.0, 0.71 v5.0.0, 0.75 v4.1.0, 0.70 v4.0.1, 0.74 v4.0.0, 0.71 v3.7.0, 0.70 v3.5.0, 0.74 v3.4.0, 0.68 v3.3.0, 0.50 v3.2.0, 0.55 v3.1.0, 0.78 v2.7.0, 0.50 v2.6.0
% Syntax : Number of formulae : 31 ( 17 unt; 0 def)
% Number of atoms : 89 ( 19 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 58 ( 0 ~; 0 |; 34 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 0 prp; 1-4 aty)
% Number of functors : 17 ( 17 usr; 14 con; 0-3 aty)
% Number of variables : 72 ( 66 !; 6 ?)
% SPC : FOF_THM_RFO_SEQ
% Comments :
%--------------------------------------------------------------------------
%----Include Standard homological algebra axioms
include('Axioms/HAL001+0.ax').
%--------------------------------------------------------------------------
fof(alpha_morphism,axiom,
morphism(alpha,a,b) ).
fof(beta_morphism,axiom,
morphism(beta,b,c) ).
fof(gamma_morphism,axiom,
morphism(gamma,d,e) ).
fof(delta_morphism,axiom,
morphism(delta,e,r) ).
fof(f_morphism,axiom,
morphism(f,a,d) ).
fof(g_morphism,axiom,
morphism(g,b,e) ).
fof(h_morphism,axiom,
morphism(h,c,r) ).
fof(alpha_injection,axiom,
injection(alpha) ).
fof(gamma_injection,axiom,
injection(gamma) ).
fof(beta_surjection,axiom,
surjection(beta) ).
fof(delta_surjection,axiom,
surjection(delta) ).
fof(alpha_beta_exact,axiom,
exact(alpha,beta) ).
fof(gamma_delta_exact,axiom,
exact(gammma,delta) ).
fof(alpha_g_f_gamma_commute,axiom,
commute(alpha,g,f,gamma) ).
fof(beta_h_g_delta_commute,axiom,
commute(beta,h,g,delta) ).
fof(f_surjection,hypothesis,
surjection(f) ).
fof(h_surjection,hypothesis,
surjection(h) ).
fof(lemma3,conjecture,
! [E] :
( element(E,e)
=> ? [R,B1] :
( element(R,r)
& apply(delta,E) = R
& element(B1,b)
& apply(h,apply(beta,B1)) = R
& apply(delta,apply(g,B1)) = R ) ) ).
%--------------------------------------------------------------------------