Nuprl Lemma : binary-tree_size_wf
∀[p:binary-tree()]. (binary-tree_size(p) ∈ ℕ)
Proof
Definitions occuring in Statement : 
binary-tree_size: binary-tree_size(p)
, 
binary-tree: binary-tree()
, 
nat: ℕ
, 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
binary-tree_size: binary-tree_size(p)
, 
binary-treeco_size: binary-treeco_size(p)
, 
binary-tree: binary-tree()
, 
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, 
binary-treeco_size_wf, 
binary-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
Latex:
\mforall{}[p:binary-tree()].  (binary-tree\_size(p)  \mmember{}  \mBbbN{})
Date html generated:
2016_05_16-AM-09_05_46
Last ObjectModification:
2015_12_28-PM-06_49_37
Theory : C-semantics
Home
Index