Nuprl Lemma : binary_map_case_T_reduce_lemma
∀F,E,right,left,cnt,value,key: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),
top: Top,
so_apply: x[s1;s2;s3;s4;s5],
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
binary_map_case: binary_map_case(m;E;key,value,cnt,left,right.F[key; value; cnt; left; right]),
binary_map_ind: binary_map_ind(v;E;key,value,cnt,left,right,rec1,rec2.T[key;value;cnt;left;right;rec1;rec2]),
bm_T: bm_T(key;value;cnt;left;right),
member: t ∈ T
Latex:
\mforall{}F,E,right,left,cnt,value,key: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_54
Last ObjectModification:
2015_12_28-PM-08_10_49
Theory : binary-map
Home
Index