Nuprl Lemma : pv11_p1_leq_bnum_dummy_eq
∀ldrs_uid:Id ⟶ ℤ. ∀b:pv11_p1_Ballot_Num(). (pv11_p1_leq_bnum(ldrs_uid) pv11_p1_dummy_ballot() b ~ tt)
Proof
Definitions occuring in Statement :
pv11_p1_leq_bnum: pv11_p1_leq_bnum(ldrs_uid),
pv11_p1_dummy_ballot: pv11_p1_dummy_ballot(),
pv11_p1_Ballot_Num: pv11_p1_Ballot_Num(),
Id: Id,
btrue: tt,
all: ∀x:A. B[x],
apply: f a,
function: x:A ⟶ B[x],
int: ℤ,
sqequal: s ~ t
Definitions unfolded in proof :
pv11_p1_dummy_ballot: pv11_p1_dummy_ballot(),
pv11_p1_Ballot_Num: pv11_p1_Ballot_Num(),
all: ∀x:A. B[x],
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
subtype_rel: A ⊆r B,
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
true: True,
prop: ℙ,
rev_implies: P ⇐ Q,
pv11_p1_leq_bnum: pv11_p1_leq_bnum(ldrs_uid),
sq_type: SQType(T),
guard: {T}
Latex:
\mforall{}ldrs$_{uid}$:Id {}\mrightarrow{} \mBbbZ{}. \mforall{}b:pv11\_p1\_Ballot\_Num().
(pv11\_p1\_leq\_bnum(ldrs$_{uid}$) pv11\_p1\_dummy\_ballot() b \msim{} tt)
Date html generated:
2016_05_17-PM-03_15_35
Last ObjectModification:
2015_12_29-PM-11_21_19
Theory : paxos!synod
Home
Index