Nuprl Lemma : pv11_p1_eq_bnums-assert
∀[x,y:pv11_p1_Ballot_Num()]. uiff(↑(pv11_p1_eq_bnums() x y);x = y ∈ pv11_p1_Ballot_Num())
Proof
Definitions occuring in Statement :
pv11_p1_eq_bnums: pv11_p1_eq_bnums(),
pv11_p1_Ballot_Num: pv11_p1_Ballot_Num(),
assert: ↑b,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
apply: f a,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
pv11_p1_eq_bnums: pv11_p1_eq_bnums(),
pv11_p1_Ballot_Num: pv11_p1_Ballot_Num(),
subtype_rel: A ⊆r B,
guard: {T},
implies: P ⇒ Q,
prop: ℙ,
rev_uimplies: rev_uimplies(P;Q)
Latex:
\mforall{}[x,y:pv11\_p1\_Ballot\_Num()]. uiff(\muparrow{}(pv11\_p1\_eq\_bnums() x y);x = y)
Date html generated:
2016_05_17-PM-02_47_32
Last ObjectModification:
2015_12_29-PM-11_29_52
Theory : paxos!synod
Home
Index