Nuprl Lemma : bm_delete'_wf
∀[T,Key:Type]. ∀[m1,m2:binary-map(T;Key)].  (bm_delete'(m1;m2) ∈ binary-map(T;Key))
Proof
Definitions occuring in Statement : 
bm_delete': bm_delete'(m1;m2)
, 
binary-map: binary-map(T;Key)
, 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
universe: Type
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
bm_delete': bm_delete'(m1;m2)
, 
binary-map: binary-map(T;Key)
, 
ext-eq: A ≡ B
, 
and: P ∧ Q
, 
subtype_rel: A ⊆r B
, 
all: ∀x:A. B[x]
, 
implies: P 
⇒ Q
, 
bool: 𝔹
, 
unit: Unit
, 
it: ⋅
, 
btrue: tt
, 
uiff: uiff(P;Q)
, 
uimplies: b supposing a
, 
sq_type: SQType(T)
, 
guard: {T}
, 
eq_atom: x =a y
, 
ifthenelse: if b then t else f fi 
, 
bm_E: bm_E()
, 
assert: ↑b
, 
top: Top
, 
so_lambda: so_lambda(x,y,z,w,v.t[x; y; z; w; v])
, 
so_apply: x[s1;s2;s3;s4;s5]
, 
bfalse: ff
, 
exists: ∃x:A. B[x]
, 
prop: ℙ
, 
or: P ∨ Q
, 
bnot: ¬bb
, 
false: False
, 
bm_T: bm_T(key;value;cnt;left;right)
, 
bm_T?: bm_T?(v)
, 
pi1: fst(t)
, 
true: True
Latex:
\mforall{}[T,Key:Type].  \mforall{}[m1,m2:binary-map(T;Key)].    (bm\_delete'(m1;m2)  \mmember{}  binary-map(T;Key))
Date html generated:
2016_05_17-PM-01_40_23
Last ObjectModification:
2015_12_28-PM-08_10_54
Theory : binary-map
Home
Index