Nuprl Lemma : binary-treeco_wf
binary-treeco() ∈ Type
Proof
Definitions occuring in Statement :
binary-treeco: binary-treeco(),
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
binary-treeco: binary-treeco(),
member: t ∈ T,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
corec_wf,
ifthenelse_wf,
eq_atom_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
lambdaEquality,
productEquality,
atomEquality,
instantiate,
hypothesisEquality,
tokenEquality,
hypothesis,
universeEquality,
intEquality,
voidEquality
Latex:
binary-treeco() \mmember{} Type
Date html generated:
2016_05_16-AM-09_05_11
Last ObjectModification:
2015_12_28-PM-06_49_04
Theory : C-semantics
Home
Index