Nuprl Lemma : pv11_p1_scout_state_from_p1bs
∀Cmd:ValueAllType. ∀f:pv11_p1_headers_type{i:l}(Cmd). ∀es:EO+(Message(f)). ∀start,e:E. ∀accpts,ldrs:bag(Id).
∀ldrs_uid:Id ⟶ ℤ. ∀reps:bag(Id). ∀bnum:pv11_p1_Ballot_Num(). ∀waitfor:bag(Id).
∀pvalues:(pv11_p1_Ballot_Num() × ℤ × Cmd) List.
(start ≤loc e
⇒ Inj(Id;ℤ;ldrs_uid)
⇒ pv11_p1_message-constraint{paxos-v11-part1.esh:o}(Cmd; accpts; ldrs; ldrs_uid; reps; f; es)
⇒ (<waitfor, pvalues>
= pv11_p1_ScoutStateFun(Cmd;accpts;f;bnum;es.start;e)
∈ (bag(Id) × ((pv11_p1_Ballot_Num() × ℤ × Cmd) List)))
⇒ (↓∃L:E List
((waitfor = [i∈accpts|¬bi ∈b map(λe.loc(e);L)] ∈ bag(Id))
∧ (∀pv:pv11_p1_Ballot_Num() × ℤ × Cmd
((pv ∈ pvalues) ⇐⇒ (pv ∈ concat(map(λe.(snd(pv11_p1_AcceptorStateFun(Cmd;ldrs_uid;f;es;e)));L)))))
∧ (∀e':E
((e' ∈ L)
⇒ ((e' < e)
∧ loc(e') ↓∈ accpts
∧ (bnum = (fst(pv11_p1_AcceptorStateFun(Cmd;ldrs_uid;f;es;e'))) ∈ pv11_p1_Ballot_Num())))))))
Proof
Definitions occuring in Statement :
pv11_p1_message-constraint: pv11_p1_message-constraint{paxos-v11-part1.esh:o}(Cmd; accpts; ldrs; ldrs_uid; reps; mf; es),
pv11_p1_ScoutStateFun: pv11_p1_ScoutStateFun(Cmd;accpts;mf;x;es;e),
pv11_p1_AcceptorStateFun: pv11_p1_AcceptorStateFun(Cmd;ldrs_uid;mf;es;e),
pv11_p1_headers_type: pv11_p1_headers_type{i:l}(Cmd),
pv11_p1_Ballot_Num: pv11_p1_Ballot_Num(),
Message: Message(f),
eo-forward: eo.e,
event-ordering+: EO+(Info),
es-le: e ≤loc e' ,
es-causl: (e < e'),
es-loc: loc(e),
es-E: E,
id-deq: IdDeq,
Id: Id,
l_member: (x ∈ l),
deq-member: x ∈b L,
concat: concat(ll),
map: map(f;as),
list: T List,
inject: Inj(A;B;f),
vatype: ValueAllType,
bnot: ¬bb,
pi1: fst(t),
pi2: snd(t),
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
iff: P ⇐⇒ Q,
squash: ↓T,
implies: P ⇒ Q,
and: P ∧ Q,
lambda: λx.A[x],
function: x:A ⟶ B[x],
pair: <a, b>,
product: x:A × B[x],
int: ℤ,
equal: s = t ∈ T,
bag-member: x ↓∈ bs,
bag-filter: [x∈b|p[x]],
bag: bag(T)
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),
strongwellfounded: SWellFounded(R[x; y]),
exists: ∃x:A. B[x],
nat: ℕ,
ge: i ≥ j ,
satisfiable_int_formula: satisfiable_int_formula(fmla),
top: Top,
decidable: Dec(P),
or: P ∨ Q,
sq_type: SQType(T),
uiff: uiff(P;Q),
pv11_p1_init_scout: pv11_p1_init_scout(Cmd;accpts),
pv11_p1_p1b'base: pv11_p1_p1b'base(Cmd;mf),
pv11_p1_init_pvalues: pv11_p1_init_pvalues(Cmd),
has-es-info-type: has-es-info-type(es;e;f;T),
es-info-type: es-info-type(es;e;f),
msg-type: msg-type(msg;f),
es-header: header(e),
pv11_p1_on_p1b: pv11_p1_on_p1b(Cmd),
let: let,
spreadn: spread4,
pi1: fst(t),
pi2: snd(t),
bool: 𝔹,
unit: Unit,
bnot: ¬bb,
assert: ↑b,
concat: concat(ll),
cand: A c∧ B,
pv11_p1_message-constraint: pv11_p1_message-constraint{paxos-v11-part1.esh:o}(Cmd; accpts; ldrs; ldrs_uid; reps; mf; es),
eo-msg-interface-constraint: eo-msg-interface-constraint(es;X;hdrs;f),
pv11_p1_headers_no_inputs: pv11_p1_headers_no_inputs(),
es-info-body: msgval(e),
es-info-auth: es-info-auth(es;e),
make-msg-interface: make-msg-interface(i;l;m),
bag-remove: bs - x,
rev_uimplies: rev_uimplies(P;Q),
deq: EqDecider(T),
label: ...$L... t,
es-le: e ≤loc e' ,
encodes-msg-type: hdr encodes T,
eq_id: a = b
Latex:
\mforall{}Cmd:ValueAllType. \mforall{}f:pv11\_p1\_headers\_type\{i:l\}(Cmd). \mforall{}es:EO+(Message(f)). \mforall{}start,e:E.
\mforall{}accpts,ldrs:bag(Id). \mforall{}ldrs$_{uid}$:Id {}\mrightarrow{} \mBbbZ{}. \mforall{}reps:bag(Id). \mforall{}bnum:pv11\_p1\_Ballot\000C\_Num(). \mforall{}waitfor:bag(Id).
\mforall{}pvalues:(pv11\_p1\_Ballot\_Num() \mtimes{} \mBbbZ{} \mtimes{} Cmd) List.
(start \mleq{}loc e
{}\mRightarrow{} Inj(Id;\mBbbZ{};ldrs$_{uid}$)
{}\mRightarrow{} pv11\_p1\_message-constraint\{paxos-v11-part1.esh:o\}(Cmd; accpts; ldrs; ldrs$_{uid\mbackslash{}ff7\000Cd$; reps; f; es)
{}\mRightarrow{} (<waitfor, pvalues> = pv11\_p1\_ScoutStateFun(Cmd;accpts;f;bnum;es.start;e))
{}\mRightarrow{} (\mdownarrow{}\mexists{}L:E List
((waitfor = [i\mmember{}accpts|\mneg{}\msubb{}i \mmember{}\msubb{} map(\mlambda{}e.loc(e);L)])
\mwedge{} (\mforall{}pv:pv11\_p1\_Ballot\_Num() \mtimes{} \mBbbZ{} \mtimes{} Cmd
((pv \mmember{} pvalues)
\mLeftarrow{}{}\mRightarrow{} (pv \mmember{} concat(map(\mlambda{}e.(snd(pv11\_p1\_AcceptorStateFun(Cmd;ldrs$_{uid}\mbackslash{}f\000Cf24;f;es;e)));L)))))
\mwedge{} (\mforall{}e':E
((e' \mmember{} L)
{}\mRightarrow{} ((e' < e)
\mwedge{} loc(e') \mdownarrow{}\mmember{} accpts
\mwedge{} (bnum = (fst(pv11\_p1\_AcceptorStateFun(Cmd;ldrs$_{uid}$;f;es;e'\000C))))))))))
Date html generated:
2016_05_17-PM-04_06_11
Last ObjectModification:
2016_01_18-AM-11_24_44
Theory : paxos!synod
Home
Index