Nuprl Lemma : bm_compare_int_wf
bm_compare_int() ∈ bm_compare(ℤ)
Proof
Definitions occuring in Statement :
bm_compare_int: bm_compare_int(),
bm_compare: bm_compare(K),
member: t ∈ T,
int: ℤ
Definitions unfolded in proof :
bm_compare_int: bm_compare_int(),
bm_compare: bm_compare(K),
member: t ∈ T,
uall: ∀[x:A]. B[x],
and: P ∧ Q,
cand: A c∧ B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
prop: ℙ,
trans: Trans(T;x,y.E[x; y]),
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
uimplies: b supposing a,
ifthenelse: if b then t else f fi ,
le: A ≤ B,
less_than': less_than'(a;b),
true: True,
not: ¬A,
false: False,
bfalse: ff,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
decidable: Dec(P),
satisfiable_int_formula: satisfiable_int_formula(fmla),
top: Top,
anti_sym: AntiSym(T;x,y.R[x; y]),
nequal: a ≠ b ∈ T ,
connex: Connex(T;x,y.R[x; y]),
refl: Refl(T;x,y.E[x; y]),
sym: Sym(T;x,y.E[x; y])
Latex:
bm\_compare\_int() \mmember{} bm\_compare(\mBbbZ{})
Date html generated:
2016_05_17-PM-01_41_13
Last ObjectModification:
2016_01_17-AM-11_20_47
Theory : binary-map
Home
Index