Nuprl Lemma : pv11_p1_ldr_active2
∀Cmd:ValueAllType. ∀f:pv11_p1_headers_type{i:l}(Cmd). ∀es:EO+(Message(f)). ∀e:E. ∀ldrs_uid:Id ⟶ ℤ.
∀v:pv11_p1_Ballot_Num() × 𝔹 × ((ℤ × Cmd) List).
(v ∈ pv11_p1_LeaderState(Cmd;ldrs_uid;f)(e)
⇒ let bnum,active,proposals1 = v in
(↑active)
⇒ (↓∃e':E
∃pvals:(pv11_p1_Ballot_Num() × ℤ × Cmd) List
∃proposals:(ℤ × Cmd) List
∃b:𝔹
((e' <loc e)
∧ <bnum, pvals> ∈ pv11_p1_adopted'base(Cmd;f)(e')
∧ <bnum, b, proposals> ∈ pv11_p1_LeaderState(Cmd;ldrs_uid;f)(e'))))
Proof
Definitions occuring in Statement :
pv11_p1_LeaderState: pv11_p1_LeaderState(Cmd;ldrs_uid;mf),
pv11_p1_adopted'base: pv11_p1_adopted'base(Cmd;mf),
pv11_p1_headers_type: pv11_p1_headers_type{i:l}(Cmd),
pv11_p1_Ballot_Num: pv11_p1_Ballot_Num(),
Message: Message(f),
classrel: v ∈ X(e),
event-ordering+: EO+(Info),
es-locl: (e <loc e'),
es-E: E,
Id: Id,
list: T List,
vatype: ValueAllType,
assert: ↑b,
bool: 𝔹,
spreadn: spread3,
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
squash: ↓T,
implies: P ⇒ Q,
and: P ∧ Q,
function: x:A ⟶ B[x],
pair: <a, b>,
product: x:A × B[x],
int: ℤ
Definitions unfolded in proof :
vatype: ValueAllType,
all: ∀x:A. B[x],
implies: P ⇒ Q,
pv11_p1_headers_type: pv11_p1_headers_type{i:l}(Cmd),
l_all: (∀x∈L.P[x]),
and: P ∧ Q,
member: t ∈ T,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
subtype_rel: A ⊆r B,
prop: ℙ,
so_apply: x[s],
iff: P ⇐⇒ Q,
listp: A List+,
name: Name,
int_seg: {i..j-},
lelt: i ≤ j < k,
le: A ≤ B,
less_than': less_than'(a;b),
false: False,
not: ¬A,
less_than: a < b,
squash: ↓T,
length: ||as||,
list_ind: list_ind,
pv11_p1_headers: pv11_p1_headers(),
cons: [a / b],
nil: [],
it: ⋅,
true: True,
select: L[n],
subtract: n - m,
uimplies: b supposing a,
guard: {T},
rev_implies: P ⇐ Q,
pv11_p1_headers_fun: pv11_p1_headers_fun(Cmd),
name_eq: name_eq(x;y),
name-deq: NameDeq,
list-deq: list-deq(eq),
band: p ∧b q,
ifthenelse: if b then t else f fi ,
atom-deq: AtomDeq,
eq_atom: x =a y,
bfalse: ff,
btrue: tt,
null: null(as),
pv11_p1_LeaderState: pv11_p1_LeaderState(Cmd;ldrs_uid;mf),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
Memory3: Memory3,
spreadn: spread3,
exists: ∃x:A. B[x],
pv11_p1_propose'base: pv11_p1_propose'base(Cmd;mf),
encodes-msg-type: hdr encodes T,
pv11_p1_adopted'base: pv11_p1_adopted'base(Cmd;mf),
pv11_p1_preempted'base: pv11_p1_preempted'base(Cmd;mf),
uiff: uiff(P;Q),
bnot: ¬bb,
assert: ↑b,
sq_stable: SqStable(P),
pv11_p1_Ballot_Num: pv11_p1_Ballot_Num(),
pv11_p1_init_leader: pv11_p1_init_leader(Cmd),
pv11_p1_init_active: pv11_p1_init_active(),
pi1: fst(t),
pi2: snd(t),
top: Top,
pv11_p1_on_propose: pv11_p1_on_propose(Cmd),
let: let,
pv11_p1_when_adopted: pv11_p1_when_adopted(Cmd;ldrs_uid),
bool: 𝔹,
unit: Unit,
or: P ∨ Q,
sq_type: SQType(T),
pv11_p1_when_preempted: pv11_p1_when_preempted(Cmd;ldrs_uid),
outl: outl(x),
isl: isl(x),
outr: outr(x),
cand: A c∧ B,
Id: Id
Latex:
\mforall{}Cmd:ValueAllType. \mforall{}f:pv11\_p1\_headers\_type\{i:l\}(Cmd). \mforall{}es:EO+(Message(f)). \mforall{}e:E. \mforall{}ldrs$_\mbackslash{}ff7\000Cbuid}$:Id {}\mrightarrow{} \mBbbZ{}.
\mforall{}v:pv11\_p1\_Ballot\_Num() \mtimes{} \mBbbB{} \mtimes{} ((\mBbbZ{} \mtimes{} Cmd) List).
(v \mmember{} pv11\_p1\_LeaderState(Cmd;ldrs$_{uid}$;f)(e)
{}\mRightarrow{} let bnum,active,proposals1 = v in
(\muparrow{}active)
{}\mRightarrow{} (\mdownarrow{}\mexists{}e':E
\mexists{}pvals:(pv11\_p1\_Ballot\_Num() \mtimes{} \mBbbZ{} \mtimes{} Cmd) List
\mexists{}proposals:(\mBbbZ{} \mtimes{} Cmd) List
\mexists{}b:\mBbbB{}
((e' <loc e)
\mwedge{} <bnum, pvals> \mmember{} pv11\_p1\_adopted'base(Cmd;f)(e')
\mwedge{} <bnum, b, proposals> \mmember{} pv11\_p1\_LeaderState(Cmd;ldrs$_{uid}$;f)(e\000C'))))
Date html generated:
2016_05_17-PM-03_18_58
Last ObjectModification:
2016_01_18-AM-11_18_30
Theory : paxos!synod
Home
Index