Nuprl Lemma : bs_tree_size_wf
∀[E:Type]. ∀[p:bs_tree(E)]. (bs_tree_size(p) ∈ ℕ)
Proof
Definitions occuring in Statement :
bs_tree_size: bs_tree_size(p),
bs_tree: bs_tree(E),
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
bs_tree_size: bs_tree_size(p),
bs_treeco_size: bs_treeco_size(p),
bs_tree: bs_tree(E),
uimplies: b supposing a,
nat: ℕ,
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
bs_tree_wf,
bs_treeco_size_wf,
int-value-type,
le_wf,
set-value-type,
nat_wf,
termination
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
cut,
sqequalRule,
sqequalHypSubstitution,
setElimination,
thin,
rename,
lemma_by_obid,
isectElimination,
hypothesis,
independent_isectElimination,
intEquality,
lambdaEquality,
natural_numberEquality,
hypothesisEquality,
cumulativity,
universeEquality
Latex:
\mforall{}[E:Type]. \mforall{}[p:bs\_tree(E)]. (bs\_tree\_size(p) \mmember{} \mBbbN{})
Date html generated:
2016_05_15-PM-01_50_15
Last ObjectModification:
2016_04_07-PM-02_24_53
Theory : tree_1
Home
Index