Nuprl Lemma : l_tree-induction
∀[L,T:Type]. ∀[P:l_tree(L;T) ⟶ ℙ].
((∀val:L. P[l_tree_leaf(val)])
⇒ (∀val:T. ∀left_subtree,right_subtree:l_tree(L;T).
(P[left_subtree] ⇒ P[right_subtree] ⇒ P[l_tree_node(val;left_subtree;right_subtree)]))
⇒ {∀v:l_tree(L;T). P[v]})
Proof
Definitions occuring in Statement :
l_tree_node: l_tree_node(val;left_subtree;right_subtree),
l_tree_leaf: l_tree_leaf(val),
l_tree: l_tree(L;T),
uall: ∀[x:A]. B[x],
prop: ℙ,
guard: {T},
so_apply: x[s],
all: ∀x:A. B[x],
implies: P ⇒ Q,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
guard: {T},
so_lambda: λ2x.t[x],
member: t ∈ T,
uimplies: b supposing a,
subtype_rel: A ⊆r B,
nat: ℕ,
prop: ℙ,
so_apply: x[s],
all: ∀x:A. B[x],
le: A ≤ B,
and: P ∧ Q,
not: ¬A,
false: False,
ext-eq: A ≡ B,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
sq_type: SQType(T),
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
l_tree_leaf: l_tree_leaf(val),
l_tree_size: l_tree_size(p),
bfalse: ff,
exists: ∃x:A. B[x],
or: P ∨ Q,
bnot: ¬bb,
assert: ↑b,
l_tree_node: l_tree_node(val;left_subtree;right_subtree),
spreadn: spread3,
cand: A c∧ B,
ge: i ≥ j ,
decidable: Dec(P),
satisfiable_int_formula: satisfiable_int_formula(fmla),
top: Top,
int_seg: {i..j-},
lelt: i ≤ j < k,
less_than: a < b,
squash: ↓T
Lemmas referenced :
l_tree_leaf_wf,
l_tree_node_wf,
int_seg_wf,
uall_wf,
lelt_wf,
int_term_value_subtract_lemma,
itermSubtract_wf,
decidable__le,
subtract_wf,
int_formula_prop_wf,
int_term_value_add_lemma,
int_formula_prop_le_lemma,
int_term_value_var_lemma,
int_term_value_constant_lemma,
int_formula_prop_less_lemma,
int_formula_prop_not_lemma,
int_formula_prop_and_lemma,
itermAdd_wf,
intformle_wf,
itermVar_wf,
itermConstant_wf,
intformless_wf,
intformnot_wf,
intformand_wf,
satisfiable-full-omega-tt,
decidable__lt,
nat_properties,
neg_assert_of_eq_atom,
assert-bnot,
bool_subtype_base,
bool_cases_sqequal,
equal_wf,
eqff_to_assert,
atom_subtype_base,
subtype_base_sq,
assert_of_eq_atom,
eqtt_to_assert,
bool_wf,
eq_atom_wf,
l_tree-ext,
less_than'_wf,
nat_wf,
l_tree_size_wf,
le_wf,
isect_wf,
l_tree_wf,
all_wf,
uniform-comp-nat-induction
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
lambdaFormation,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
sqequalRule,
lambdaEquality,
hypothesisEquality,
hypothesis,
applyEquality,
because_Cache,
setElimination,
rename,
independent_functionElimination,
introduction,
productElimination,
independent_pairEquality,
dependent_functionElimination,
voidElimination,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
promote_hyp,
hypothesis_subsumption,
tokenEquality,
unionElimination,
equalityElimination,
independent_isectElimination,
instantiate,
cumulativity,
atomEquality,
dependent_pairFormation,
independent_pairFormation,
setEquality,
intEquality,
natural_numberEquality,
int_eqEquality,
isect_memberEquality,
voidEquality,
computeAll,
dependent_set_memberEquality,
imageElimination,
equalityEquality,
functionEquality,
universeEquality
Latex:
\mforall{}[L,T:Type]. \mforall{}[P:l\_tree(L;T) {}\mrightarrow{} \mBbbP{}].
((\mforall{}val:L. P[l\_tree\_leaf(val)])
{}\mRightarrow{} (\mforall{}val:T. \mforall{}left$_{subtree}$,right$_{subtree}$:l\_tree(L;T\000C).
(P[left$_{subtree}$] {}\mRightarrow{} P[right$_{subtree}$] {}\mRightarrow{} P[l\_\000Ctree\_node(val;left$_{subtree}$;right$_{subtree}$)]))
{}\mRightarrow{} \{\mforall{}v:l\_tree(L;T). P[v]\})
Date html generated:
2016_05_16-AM-08_43_35
Last ObjectModification:
2016_01_17-AM-00_05_31
Theory : labeled!trees
Home
Index