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