Nuprl Lemma : bm_E_wf
∀[T,Key:Type]. (bm_E() ∈ binary_map(T;Key))
Proof
Definitions occuring in Statement :
bm_E: bm_E(),
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,
binary_map: binary_map(T;Key),
bm_E: bm_E(),
subtype_rel: A ⊆r B,
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
btrue: tt,
ext-eq: A ≡ B,
and: P ∧ Q,
binary_mapco_size: binary_mapco_size(p),
has-value: (a)↓,
nat: ℕ,
le: A ≤ B,
less_than': less_than'(a;b),
false: False,
not: ¬A,
implies: P ⇒ Q,
prop: ℙ,
all: ∀x:A. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a
Latex:
\mforall{}[T,Key:Type]. (bm\_E() \mmember{} binary\_map(T;Key))
Date html generated:
2016_05_17-PM-01_37_09
Last ObjectModification:
2015_12_28-PM-08_11_03
Theory : binary-map
Home
Index