Nuprl Lemma : binary_map_case_E_reduce_lemma
∀F,E:Top. (binary_map_case(bm_E();E;key,value,cnt,left,right.F[key;value;cnt;left;right]) ~ E)
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_E: bm_E(),
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_E: bm_E(),
member: t ∈ T
Latex:
\mforall{}F,E:Top. (binary\_map\_case(bm\_E();E;key,value,cnt,left,right.F[key;value;cnt;left;right]) \msim{} E)
Date html generated:
2016_05_17-PM-01_37_58
Last ObjectModification:
2015_12_28-PM-08_10_45
Theory : binary-map
Home
Index