Nuprl Lemma : pv11_p1_scout_from_acc
∀Cmd:ValueAllType. ∀f:pv11_p1_headers_type{i:l}(Cmd). ∀es:EO+(Message(f)). ∀e:E. ∀accpts:bag(Id).
∀s:bag(Id) × ((pv11_p1_Ballot_Num() × ℤ × Cmd) List). ∀bnum:pv11_p1_Ballot_Num().
(s ∈ pv11_p1_ScoutState(Cmd;accpts;f) bnum(e)
⇒ let waitfor,pvalues = s
in ∀p:pv11_p1_Ballot_Num() × ℤ × Cmd
((p ∈ pvalues)
⇒ (∃e':E
∃l:Id
∃r:(pv11_p1_Ballot_Num() × ℤ × Cmd) List
(e' ≤loc e ∧ <l, bnum, bnum, r> ∈ pv11_p1_p1b'base(Cmd;f)(e') ∧ (p ∈ r)))))
Proof
Definitions occuring in Statement :
pv11_p1_ScoutState: pv11_p1_ScoutState(Cmd;accpts;mf),
pv11_p1_p1b'base: pv11_p1_p1b'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-le: e ≤loc e' ,
es-E: E,
Id: Id,
l_member: (x ∈ l),
list: T List,
vatype: ValueAllType,
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
implies: P ⇒ Q,
and: P ∧ Q,
apply: f a,
spread: spread def,
pair: <a, b>,
product: x:A × B[x],
int: ℤ,
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),
pv11_p1_ScoutState: pv11_p1_ScoutState(Cmd;accpts;mf),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
State1: State1(init;tr;X),
exists: ∃x:A. B[x],
pv11_p1_p1b'base: pv11_p1_p1b'base(Cmd;mf),
encodes-msg-type: hdr encodes T,
uiff: uiff(P;Q),
pv11_p1_init_scout: pv11_p1_init_scout(Cmd;accpts),
pv11_p1_init_pvalues: pv11_p1_init_pvalues(Cmd),
pv11_p1_on_p1b: pv11_p1_on_p1b(Cmd),
spreadn: spread4,
bool: 𝔹,
unit: Unit,
let: let,
or: P ∨ Q,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
pv11_p1_append_news: pv11_p1_append_news(Cmd),
pv11_p1_add_if_new: pv11_p1_add_if_new(),
l_subset: l_subset(T;as;bs),
cand: A c∧ B,
pv11_p1_Ballot_Num: pv11_p1_Ballot_Num(),
Id: Id
Latex:
\mforall{}Cmd:ValueAllType. \mforall{}f:pv11\_p1\_headers\_type\{i:l\}(Cmd). \mforall{}es:EO+(Message(f)). \mforall{}e:E. \mforall{}accpts:bag(Id).
\mforall{}s:bag(Id) \mtimes{} ((pv11\_p1\_Ballot\_Num() \mtimes{} \mBbbZ{} \mtimes{} Cmd) List). \mforall{}bnum:pv11\_p1\_Ballot\_Num().
(s \mmember{} pv11\_p1\_ScoutState(Cmd;accpts;f) bnum(e)
{}\mRightarrow{} let waitfor,pvalues = s
in \mforall{}p:pv11\_p1\_Ballot\_Num() \mtimes{} \mBbbZ{} \mtimes{} Cmd
((p \mmember{} pvalues)
{}\mRightarrow{} (\mexists{}e':E
\mexists{}l:Id
\mexists{}r:(pv11\_p1\_Ballot\_Num() \mtimes{} \mBbbZ{} \mtimes{} Cmd) List
(e' \mleq{}loc e \mwedge{} <l, bnum, bnum, r> \mmember{} pv11\_p1\_p1b'base(Cmd;f)(e') \mwedge{} (p \mmember{} r)))))
Date html generated:
2016_05_17-PM-03_19_40
Last ObjectModification:
2016_01_18-AM-11_17_46
Theory : paxos!synod
Home
Index