Nuprl Lemma : binary_map_case_T
∀[key,value,cnt,left,right,E,F:Top].
(binary_map_case(bm_T(key;value;cnt;left;right);E;key,value,cnt,left,right.F[key;value;cnt;left;right])
~ F[key;value;cnt;left;right])
Proof
Definitions occuring in Statement :
binary_map_case: binary_map_case(m;E;key,value,cnt,left,right.F[key; value; cnt; left; right]),
bm_T: bm_T(key;value;cnt;left;right),
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s1;s2;s3;s4;s5],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
so_lambda: so_lambda(x,y,z,w,v.t[x; y; z; w; v]),
member: t ∈ T,
top: Top,
so_apply: x[s1;s2;s3;s4;s5],
uall: ∀[x:A]. B[x]
Latex:
\mforall{}[key,value,cnt,left,right,E,F:Top].
(binary\_map\_case(bm\_T(key;value;cnt;left;right);E;key,value,cnt,left,right.
F[key;value;cnt;left;right]) \msim{} F[key;value;cnt;left;right])
Date html generated:
2016_05_17-PM-01_37_56
Last ObjectModification:
2015_12_28-PM-08_10_52
Theory : binary-map
Home
Index