Nuprl Lemma : bm_find_wf
∀[T,Key:Type]. ∀[compare:bm_compare(Key)]. ∀[x:Key]. ∀[m:binary-map(T;Key)]. (bm_find(compare;m;x) ∈ T?)
Proof
Definitions occuring in Statement :
bm_find: bm_find(compare;m;x),
bm_compare: bm_compare(K),
binary-map: binary-map(T;Key),
uall: ∀[x:A]. B[x],
unit: Unit,
member: t ∈ T,
union: left + right,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
binary-map: binary-map(T;Key),
all: ∀x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
guard: {T},
subtype_rel: A ⊆r B,
int_seg: {i..j-},
lelt: i ≤ j < k,
decidable: Dec(P),
or: P ∨ Q,
le: A ≤ B,
less_than': less_than'(a;b),
ext-eq: A ≡ B,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
sq_type: SQType(T),
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
bm_E: bm_E(),
binary_map_size: binary_map_size(p),
assert: ↑b,
bm_find: bm_find(compare;m;x),
binary_map_ind: binary_map_ind(v;E;key,value,cnt,left,right,rec1,rec2.T[key;value;cnt;left;right;rec1;rec2]),
bfalse: ff,
bnot: ¬bb,
bm_T: bm_T(key;value;cnt;left;right),
spreadn: let a,b,c,d,e = u in v[a; b; c; d; e],
cand: A c∧ B,
less_than: a < b,
squash: ↓T,
bm_compare: bm_compare(K),
callbyvalueall: callbyvalueall,
has-value: (a)↓,
has-valueall: has-valueall(a)
Latex:
\mforall{}[T,Key:Type]. \mforall{}[compare:bm\_compare(Key)]. \mforall{}[x:Key]. \mforall{}[m:binary-map(T;Key)].
(bm\_find(compare;m;x) \mmember{} T?)
Date html generated:
2016_05_17-PM-01_41_45
Last ObjectModification:
2016_01_17-AM-11_20_32
Theory : binary-map
Home
Index