Nuprl Lemma : bs_tree_wf
∀[E:Type]. (bs_tree(E) ∈ Type)
Proof
Definitions occuring in Statement :
bs_tree: bs_tree(E),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
bs_tree: bs_tree(E),
uimplies: b supposing a,
nat: ℕ,
so_lambda: λ2x.t[x],
so_apply: x[s],
prop: ℙ
Lemmas referenced :
bs_treeco_size_wf,
int-value-type,
le_wf,
set-value-type,
nat_wf,
has-value_wf-partial,
bs_treeco_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
setEquality,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
cumulativity,
hypothesisEquality,
hypothesis,
independent_isectElimination,
intEquality,
lambdaEquality,
natural_numberEquality,
because_Cache,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
universeEquality
Latex:
\mforall{}[E:Type]. (bs\_tree(E) \mmember{} Type)
Date html generated:
2016_05_15-PM-01_50_12
Last ObjectModification:
2016_04_07-PM-02_24_50
Theory : tree_1
Home
Index