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