Nuprl Lemma : lookup-list-map-remove_wf
∀[Key,Value:Type]. ∀[deqKey:EqDecider(Key)]. ∀[key:Key]. ∀[m:lookup-list-map-type(Key;Value)].
  (lookup-list-map-remove(deqKey;key;m) ∈ lookup-list-map-type(Key;Value))
Proof
Definitions occuring in Statement : 
lookup-list-map-remove: lookup-list-map-remove(deqKey;key;m)
, 
lookup-list-map-type: lookup-list-map-type(Key;Value)
, 
deq: EqDecider(T)
, 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
universe: Type
Lemmas : 
nat_properties, 
less_than_transitivity1, 
less_than_irreflexivity, 
ge_wf, 
less_than_wf, 
equal-wf-T-base, 
colength_wf_list, 
list_wf, 
list-cases, 
product_subtype_list, 
spread_cons_lemma, 
sq_stable__le, 
le_antisymmetry_iff, 
add_functionality_wrt_le, 
add-associates, 
add-zero, 
zero-add, 
le-add-cancel, 
nat_wf, 
decidable__le, 
false_wf, 
not-le-2, 
condition-implies-le, 
minus-add, 
minus-one-mul, 
add-commutes, 
le_wf, 
subtract_wf, 
not-ge-2, 
less-iff-le, 
minus-minus, 
add-swap, 
subtype_base_sq, 
set_subtype_base, 
int_subtype_base, 
bool_wf, 
eqtt_to_assert, 
safe-assert-deq, 
eqff_to_assert, 
equal_wf, 
bool_cases_sqequal, 
bool_subtype_base, 
assert-bnot, 
cons_wf_listp, 
listp_wf, 
lookup-list-map-type_wf, 
deq_wf, 
list_ind_nil_lemma, 
nil_wf, 
subtype_rel_list
\mforall{}[Key,Value:Type].  \mforall{}[deqKey:EqDecider(Key)].  \mforall{}[key:Key].  \mforall{}[m:lookup-list-map-type(Key;Value)].
    (lookup-list-map-remove(deqKey;key;m)  \mmember{}  lookup-list-map-type(Key;Value))
Date html generated:
2015_07_17-AM-08_24_10
Last ObjectModification:
2015_04_02-PM-05_45_07
Home
Index