Nuprl Lemma : coterm-ext
∀[opr:Type]. coterm(opr) ≡ coterm-fun(opr;coterm(opr))
Proof
Definitions occuring in Statement :
coterm: coterm(opr),
coterm-fun: coterm-fun(opr;T),
ext-eq: A ≡ B,
uall: ∀[x:A]. B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
member: t ∈ T,
so_apply: x[s],
uimplies: b supposing a,
coterm: coterm(opr)
Lemmas referenced :
corec-ext,
coterm-fun_wf,
coterm-fun-continous,
istype-universe
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation_alt,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
sqequalRule,
lambdaEquality_alt,
hypothesisEquality,
hypothesis,
inhabitedIsType,
independent_isectElimination,
instantiate,
universeEquality
Latex:
\mforall{}[opr:Type]. coterm(opr) \mequiv{} coterm-fun(opr;coterm(opr))
Date html generated:
2020_05_19-PM-09_53_27
Last ObjectModification:
2020_03_09-PM-04_08_07
Theory : terms
Home
Index