Nuprl Lemma : bs_treeco_wf
∀[E:Type]. (bs_treeco(E) ∈ Type)
Proof
Definitions occuring in Statement : 
bs_treeco: bs_treeco(E)
, 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
universe: Type
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
bs_treeco: bs_treeco(E)
, 
so_lambda: λ2x.t[x]
, 
so_apply: x[s]
Lemmas referenced : 
unit_wf2, 
eq_atom_wf, 
ifthenelse_wf, 
corec_wf
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation, 
introduction, 
cut, 
sqequalRule, 
lemma_by_obid, 
sqequalHypSubstitution, 
isectElimination, 
thin, 
lambdaEquality, 
productEquality, 
atomEquality, 
instantiate, 
hypothesisEquality, 
tokenEquality, 
hypothesis, 
universeEquality, 
cumulativity, 
voidEquality, 
axiomEquality, 
equalityTransitivity, 
equalitySymmetry
Latex:
\mforall{}[E:Type].  (bs\_treeco(E)  \mmember{}  Type)
Date html generated:
2016_05_15-PM-01_50_04
Last ObjectModification:
2016_04_07-PM-02_24_11
Theory : tree_1
Home
Index