Nuprl Lemma : btr_Node_wf
∀[left,right:binary-tree()]. (btr_Node(left;right) ∈ binary-tree())
Proof
Definitions occuring in Statement :
btr_Node: btr_Node(left;right),
binary-tree: binary-tree(),
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
binary-tree: binary-tree(),
btr_Node: btr_Node(left;right),
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
bfalse: ff,
btrue: tt,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
subtype_rel: A ⊆r B,
ext-eq: A ≡ B,
binary-treeco_size: binary-treeco_size(p),
binary-tree_size: binary-tree_size(p),
nat: ℕ,
le: A ≤ B,
less_than': less_than'(a;b),
not: ¬A,
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
binary-treeco-ext,
binary-treeco_wf,
eq_atom_wf,
bool_wf,
eqtt_to_assert,
assert_of_eq_atom,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
neg_assert_of_eq_atom,
add_nat_wf,
false_wf,
le_wf,
binary-tree_size_wf,
nat_wf,
value-type-has-value,
set-value-type,
int-value-type,
has-value_wf-partial,
binary-treeco_size_wf,
binary-tree_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
cut,
dependent_set_memberEquality,
lemma_by_obid,
hypothesis,
sqequalRule,
dependent_pairEquality,
tokenEquality,
sqequalHypSubstitution,
setElimination,
thin,
rename,
hypothesisEquality,
isectElimination,
lambdaFormation,
unionElimination,
equalityElimination,
productElimination,
independent_isectElimination,
because_Cache,
intEquality,
equalityTransitivity,
equalitySymmetry,
dependent_pairFormation,
promote_hyp,
dependent_functionElimination,
instantiate,
cumulativity,
independent_functionElimination,
voidElimination,
productEquality,
voidEquality,
equalityEquality,
applyEquality,
natural_numberEquality,
independent_pairFormation,
lambdaEquality
Latex:
\mforall{}[left,right:binary-tree()]. (btr\_Node(left;right) \mmember{} binary-tree())
Date html generated:
2016_05_16-AM-09_06_10
Last ObjectModification:
2015_12_28-PM-06_48_33
Theory : C-semantics
Home
Index