Nuprl Lemma : bm_cnt_prop_pos
∀[T,Key:Type]. ∀[m:binary_map(T;Key)]. 0 ≤ bm_numItems(m) supposing ↑bm_cnt_prop(m)
Proof
Definitions occuring in Statement :
bm_numItems: bm_numItems(m),
bm_cnt_prop: bm_cnt_prop(m),
binary_map: binary_map(T;Key),
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
le: A ≤ B,
natural_number: $n,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
squash: ↓T,
prop: ℙ,
true: True,
subtype_rel: A ⊆r B,
guard: {T},
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q,
le: A ≤ B,
not: ¬A,
false: False
Latex:
\mforall{}[T,Key:Type]. \mforall{}[m:binary\_map(T;Key)]. 0 \mleq{} bm\_numItems(m) supposing \muparrow{}bm\_cnt\_prop(m)
Date html generated:
2016_05_17-PM-01_39_21
Last ObjectModification:
2016_01_17-AM-11_20_21
Theory : binary-map
Home
Index