Nuprl Lemma : MMTree_Node_wf
∀[T:Type]. ∀[forest:MMTree(T) List List]. (MMTree_Node(forest) ∈ MMTree(T))
Proof
Definitions occuring in Statement :
MMTree_Node: MMTree_Node(forest),
MMTree: MMTree(T),
list: T List,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
MMTree: MMTree(T),
MMTree_Node: MMTree_Node(forest),
subtype_rel: A ⊆r B,
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
bfalse: ff,
btrue: tt,
uimplies: b supposing a,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
uiff: uiff(P;Q),
and: P ∧ Q,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
ext-eq: A ≡ B,
MMTreeco_size: MMTreeco_size(p),
MMTree_size: MMTree_size(p),
nat: ℕ,
le: A ≤ B,
less_than': less_than'(a;b),
not: ¬A,
so_lambda: λ2x.t[x],
int_seg: {i..j-},
lelt: i ≤ j < k,
decidable: Dec(P),
satisfiable_int_formula: satisfiable_int_formula(fmla),
top: Top,
less_than: a < b,
squash: ↓T,
so_apply: x[s]
Lemmas referenced :
MMTreeco_size_wf,
has-value_wf-partial,
int-value-type,
set-value-type,
value-type-has-value,
nat_wf,
int_seg_wf,
MMTree_size_wf,
int_formula_prop_less_lemma,
intformless_wf,
decidable__lt,
int_formula_prop_wf,
int_term_value_var_lemma,
int_term_value_constant_lemma,
int_formula_prop_le_lemma,
int_formula_prop_not_lemma,
int_formula_prop_and_lemma,
itermVar_wf,
itermConstant_wf,
intformle_wf,
intformnot_wf,
intformand_wf,
satisfiable-full-omega-tt,
decidable__le,
length_wf,
int_seg_properties,
select_wf,
length_wf_nat,
sum-nat,
le_wf,
false_wf,
add_nat_wf,
assert_of_eq_atom,
eqtt_to_assert,
neg_assert_of_eq_atom,
assert-bnot,
bool_subtype_base,
subtype_base_sq,
bool_cases_sqequal,
equal_wf,
eqff_to_assert,
bool_wf,
eq_atom_wf,
MMTreeco_wf,
MMTree_wf,
list_wf,
subtype_rel_list,
MMTreeco-ext
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
cut,
dependent_set_memberEquality,
lemma_by_obid,
hypothesis,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
sqequalRule,
dependent_pairEquality,
tokenEquality,
applyEquality,
independent_isectElimination,
lambdaEquality,
setElimination,
rename,
because_Cache,
lambdaFormation,
unionElimination,
equalityElimination,
productElimination,
equalityTransitivity,
equalitySymmetry,
dependent_pairFormation,
promote_hyp,
dependent_functionElimination,
instantiate,
cumulativity,
independent_functionElimination,
voidElimination,
voidEquality,
equalityEquality,
natural_numberEquality,
independent_pairFormation,
int_eqEquality,
intEquality,
isect_memberEquality,
computeAll,
imageElimination,
introduction,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[forest:MMTree(T) List List]. (MMTree\_Node(forest) \mmember{} MMTree(T))
Date html generated:
2016_05_16-AM-08_55_00
Last ObjectModification:
2016_01_17-AM-09_41_31
Theory : C-semantics
Home
Index