Nuprl Lemma : btr_Leaf_wf
∀[val:ℤ]. (btr_Leaf(val) ∈ binary-tree())
Proof
Definitions occuring in Statement :
btr_Leaf: btr_Leaf(val),
binary-tree: binary-tree(),
uall: ∀[x:A]. B[x],
member: t ∈ T,
int: ℤ
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
binary-tree: binary-tree(),
btr_Leaf: btr_Leaf(val),
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
btrue: tt,
subtype_rel: A ⊆r B,
ext-eq: A ≡ B,
and: P ∧ Q,
binary-treeco_size: binary-treeco_size(p),
has-value: (a)↓,
nat: ℕ,
le: A ≤ B,
less_than': less_than'(a;b),
false: False,
not: ¬A,
implies: P ⇒ Q,
prop: ℙ,
all: ∀x:A. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a
Lemmas referenced :
binary-treeco-ext,
ifthenelse_wf,
eq_atom_wf,
binary-treeco_wf,
false_wf,
le_wf,
nat_wf,
has-value_wf_base,
set_subtype_base,
int_subtype_base,
is-exception_wf,
has-value_wf-partial,
set-value-type,
int-value-type,
binary-treeco_size_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
cut,
dependent_set_memberEquality,
lemma_by_obid,
hypothesis,
sqequalRule,
dependent_pairEquality,
tokenEquality,
hypothesisEquality,
thin,
instantiate,
sqequalHypSubstitution,
isectElimination,
universeEquality,
intEquality,
productEquality,
voidEquality,
applyEquality,
productElimination,
natural_numberEquality,
independent_pairFormation,
lambdaFormation,
divergentSqle,
sqleReflexivity,
lambdaEquality,
independent_isectElimination,
because_Cache,
equalityEquality,
equalityTransitivity,
equalitySymmetry,
dependent_functionElimination,
independent_functionElimination
Latex:
\mforall{}[val:\mBbbZ{}]. (btr\_Leaf(val) \mmember{} binary-tree())
Date html generated:
2016_05_16-AM-09_06_00
Last ObjectModification:
2015_12_28-PM-06_48_24
Theory : C-semantics
Home
Index