Nuprl Lemma : TC-base
∀[Dom:Type]. ∀[R:Dom ⟶ Dom ⟶ ℙ]. ∀x,y:Dom. ((R x y) ⇒ TC(λa,b.R a b)(x,y))
Proof
Definitions occuring in Statement :
TC: TC(λx,y.F[x; y])(a,b),
uall: ∀[x:A]. B[x],
prop: ℙ,
all: ∀x:A. B[x],
implies: P ⇒ Q,
apply: f a,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
TC: TC(λx,y.F[x; y])(a,b),
member: t ∈ T,
so_lambda: λ2x y.t[x; y],
infix_ap: x f y,
prop: ℙ,
guard: {T},
rel_implies: R1 => R2
Lemmas referenced :
transitive-closure-contains
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
lambdaFormation,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
because_Cache,
sqequalRule,
lambdaEquality,
applyEquality,
hypothesisEquality,
functionEquality,
cumulativity,
universeEquality,
hypothesis,
dependent_functionElimination,
independent_functionElimination
Latex:
\mforall{}[Dom:Type]. \mforall{}[R:Dom {}\mrightarrow{} Dom {}\mrightarrow{} \mBbbP{}]. \mforall{}x,y:Dom. ((R x y) {}\mRightarrow{} TC(\mlambda{}a,b.R a b)(x,y))
Date html generated:
2016_05_16-AM-09_07_50
Last ObjectModification:
2015_12_28-PM-07_03_04
Theory : first-order!and!ancestral!logic
Home
Index