Nuprl Lemma : lookup-list-map-remove-prop
∀[Key,Value:Type]. ∀[deqKey:EqDecider(Key)]. ∀[key2:Key]. ∀[m:lookup-list-map-type(Key;Value)]. ∀[key1:Key].
(lookup-list-map-find(deqKey;key1;lookup-list-map-remove(deqKey;key2;m))
= if deqKey key1 key2 then inr ⋅ else lookup-list-map-find(deqKey;key1;m) fi
∈ (Value?))
Proof
Definitions occuring in Statement :
lookup-list-map-remove: lookup-list-map-remove(deqKey;key;m),
lookup-list-map-find: lookup-list-map-find(deqKey;key;m),
lookup-list-map-type: lookup-list-map-type(Key;Value),
deq: EqDecider(T),
ifthenelse: if b then t else f fi ,
it: ⋅,
uall: ∀[x:A]. B[x],
unit: Unit,
apply: f a,
inr: inr x ,
union: left + right,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
lookup-list-map-type: lookup-list-map-type(Key;Value),
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
deq: EqDecider(T),
so_apply: x[s],
implies: P ⇒ Q,
all: ∀x:A. B[x],
exposed-bfalse: exposed-bfalse,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
eqof: eqof(d),
ifthenelse: if b then t else f fi ,
lookup-list-map-find: lookup-list-map-find(deqKey;key;m),
apply-alist: apply-alist(eq;L;x),
list_ind: list_ind,
lookup-list-map-remove: lookup-list-map-remove(deqKey;key;m),
remove-alist: remove-alist(eq;L;x),
nil: [],
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
not: ¬A,
subtype_rel: A ⊆r B,
so_lambda: so_lambda(x,y,z.t[x; y; z]),
top: Top,
so_apply: x[s1;s2;s3],
pi1: fst(t),
pi2: snd(t)
Latex:
\mforall{}[Key,Value:Type]. \mforall{}[deqKey:EqDecider(Key)]. \mforall{}[key2:Key]. \mforall{}[m:lookup-list-map-type(Key;Value)].
\mforall{}[key1:Key].
(lookup-list-map-find(deqKey;key1;lookup-list-map-remove(deqKey;key2;m))
= if deqKey key1 key2 then inr \mcdot{} else lookup-list-map-find(deqKey;key1;m) fi )
Date html generated:
2016_05_17-PM-01_51_40
Last ObjectModification:
2015_12_28-PM-08_51_08
Theory : datatype-signatures
Home
Index