Nuprl Lemma : l_tree_size_wf
∀[L,T:Type]. ∀[p:l_tree(L;T)]. (l_tree_size(p) ∈ ℕ)
Proof
Definitions occuring in Statement :
l_tree_size: l_tree_size(p),
l_tree: l_tree(L;T),
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
l_tree_size: l_tree_size(p),
l_treeco_size: l_treeco_size(p),
l_tree: l_tree(L;T),
uimplies: b supposing a,
nat: ℕ,
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
termination,
nat_wf,
set-value-type,
le_wf,
int-value-type,
l_treeco_size_wf,
l_tree_wf
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,
universeEquality
Latex:
\mforall{}[L,T:Type]. \mforall{}[p:l\_tree(L;T)]. (l\_tree\_size(p) \mmember{} \mBbbN{})
Date html generated:
2016_05_16-AM-08_43_05
Last ObjectModification:
2015_12_28-PM-06_42_04
Theory : labeled!trees
Home
Index