Nuprl Lemma : pv11_p1_lt_bnum_upd
∀ldrs_uid:Id ⟶ ℤ. ∀b:pv11_p1_Ballot_Num(). ∀l:Id. ((↑(pv11_p1_is_bnum() b)) ⇒ (↑(b < (pv11_p1_upd_bnum() b l))))
Proof
Definitions occuring in Statement :
pv11_p1_lt_bnum: pv11_p1_lt_bnum(ldrs_uid),
pv11_p1_upd_bnum: pv11_p1_upd_bnum(),
pv11_p1_is_bnum: pv11_p1_is_bnum(),
pv11_p1_Ballot_Num: pv11_p1_Ballot_Num(),
Id: Id,
assert: ↑b,
all: ∀x:A. B[x],
implies: P ⇒ Q,
apply: f a,
function: x:A ⟶ B[x],
int: ℤ
Definitions unfolded in proof :
all: ∀x:A. B[x],
implies: P ⇒ Q,
pv11_p1_lt_bnum: pv11_p1_lt_bnum(ldrs_uid),
pv11_p1_Ballot_Num: pv11_p1_Ballot_Num(),
pv11_p1_is_bnum: pv11_p1_is_bnum(),
isl: isl(x),
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
pv11_p1_upd_bnum: pv11_p1_upd_bnum(),
pv11_p1_mk_bnum: pv11_p1_mk_bnum(),
pv11_p1_lt_bnum': pv11_p1_lt_bnum'(ldrs_uid),
member: t ∈ T,
uall: ∀[x:A]. B[x],
uiff: uiff(P;Q),
and: P ∧ Q,
rev_uimplies: rev_uimplies(P;Q),
uimplies: b supposing a,
or: P ∨ Q,
decidable: Dec(P),
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
not: ¬A,
top: Top,
prop: ℙ,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
bfalse: ff
Latex:
\mforall{}ldrs$_{uid}$:Id {}\mrightarrow{} \mBbbZ{}. \mforall{}b:pv11\_p1\_Ballot\_Num(). \mforall{}l:Id.
((\muparrow{}(pv11\_p1\_is\_bnum() b)) {}\mRightarrow{} (\muparrow{}(b < (pv11\_p1\_upd\_bnum() b l))))
Date html generated:
2016_05_17-PM-03_13_14
Last ObjectModification:
2016_01_18-AM-11_18_58
Theory : paxos!synod
Home
Index