Nuprl Lemma : co-W_wf
∀[A:Type]. ∀[B:A ⟶ Type]. (co-W(A;a.B[a]) ∈ Type)
Proof
Definitions occuring in Statement :
co-W: co-W(A;a.B[a]),
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
co-W: co-W(A;a.B[a]),
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
corec_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
lambdaEquality,
productEquality,
hypothesisEquality,
functionEquality,
applyEquality,
universeEquality,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
cumulativity,
isect_memberEquality,
because_Cache
Latex:
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. (co-W(A;a.B[a]) \mmember{} Type)
Date html generated:
2016_05_15-PM-10_06_28
Last ObjectModification:
2015_12_27-PM-05_50_22
Theory : bar!induction
Home
Index