Nuprl Lemma : binary_map_case_E
∀[E,F: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(),
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{}[E,F: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_38_00
Last ObjectModification:
2015_12_28-PM-08_10_41
Theory : binary-map
Home
Index