Nuprl Lemma : bm_insert_wf
∀[T,Key:Type]. ∀[compare:bm_compare(Key)]. ∀[m:binary-map(T;Key)]. ∀[x:Key]. ∀[v:T].
(bm_insert(compare;m;x;v) ∈ binary-map(T;Key))
Proof
Definitions occuring in Statement :
bm_insert: bm_insert(compare;m;x;v),
bm_compare: bm_compare(K),
binary-map: binary-map(T;Key),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Lemmas :
nat_properties,
less_than_transitivity1,
less_than_irreflexivity,
ge_wf,
less_than_wf,
assert_wf,
bm_cnt_prop_wf,
le_wf,
binary_map_size_wf,
binary_map_wf,
int_seg_wf,
decidable__le,
subtract_wf,
false_wf,
not-ge-2,
less-iff-le,
condition-implies-le,
minus-one-mul,
zero-add,
minus-add,
minus-minus,
add-associates,
add-swap,
add-commutes,
add_functionality_wrt_le,
add-zero,
le-add-cancel,
decidable__equal_int,
subtype_rel-int_seg,
le_weakening,
int_seg_properties,
binary_map-ext,
eq_atom_wf,
bool_wf,
eqtt_to_assert,
assert_of_eq_atom,
subtype_base_sq,
atom_subtype_base,
unit_wf2,
unit_subtype_base,
it_wf,
bm_cnt_prop_E_reduce_lemma,
true_wf,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
bool_subtype_base,
assert-bnot,
neg_assert_of_eq_atom,
not-le-2,
subtract-is-less,
lelt_wf,
valueall-type-has-valueall,
int-valueall-type,
evalall-reduce,
bm_cnt_prop_T,
lt_int_wf,
assert_of_lt_int,
bm_T'_wf,
bm_T-wf2,
bm_T_wf,
decidable__lt,
not-equal-2,
le-add-cancel-alt,
sq_stable__le,
add-mul-special,
zero-mul,
nat_wf,
binary-map_wf,
bm_compare_wf
\mforall{}[T,Key:Type]. \mforall{}[compare:bm\_compare(Key)]. \mforall{}[m:binary-map(T;Key)]. \mforall{}[x:Key]. \mforall{}[v:T].
(bm\_insert(compare;m;x;v) \mmember{} binary-map(T;Key))
Date html generated:
2015_07_17-AM-08_19_40
Last ObjectModification:
2015_01_27-PM-00_37_37
Home
Index