Nuprl Lemma : ancestral-logic-example2-ext
∀x,y:Dom.  (TC(λa,b.TC(λi,j.P i j)(a,b))(x,y) 
⇒ TC(λa,b.P a b)(x,y))
Proof
Definitions occuring in Statement : 
TC: TC(λx,y.F[x; y])(a,b)
, 
language1: language1{i:l}(D,A,B,C,P,Q,R,H.fml[D;A;B;C;P;Q;R;H])
, 
all: ∀x:A. B[x]
, 
implies: P 
⇒ Q
, 
apply: f a
Definitions unfolded in proof : 
member: t ∈ T
, 
ancestral-logic-example2, 
TC-trans, 
TC-min-uniform, 
transitive-closure-transitive, 
transitive-closure-minimal-uniform, 
spreadn: spread3
Lemmas referenced : 
ancestral-logic-example2, 
TC-trans, 
TC-min-uniform, 
transitive-closure-transitive, 
transitive-closure-minimal-uniform
Rules used in proof : 
introduction, 
cut, 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
instantiate, 
extract_by_obid, 
hypothesis, 
sqequalHypSubstitution, 
sqequalRule, 
equalityTransitivity, 
equalitySymmetry
Latex:
\mforall{}x,y:Dom.    (TC(\mlambda{}a,b.TC(\mlambda{}i,j.P  i  j)(a,b))(x,y)  {}\mRightarrow{}  TC(\mlambda{}a,b.P  a  b)(x,y))
Date html generated:
2016_05_16-AM-09_08_34
Last ObjectModification:
2015_12_28-PM-07_02_58
Theory : first-order!and!ancestral!logic
Home
Index