Nuprl Lemma : pv11_p1_ord_scout
∀Cmd:ValueAllType. ∀accpts:bag(Id). ∀mf:pv11_p1_headers_type{i:l}(Cmd). ∀es:EO+(Message(mf)). ∀e1,e2:E.
∀b:pv11_p1_Ballot_Num(). ∀zo,z:bag(Id) × ((pv11_p1_Ballot_Num() × ℤ × Cmd) List).
((e1 <loc e2)
⇒ zo ∈ pv11_p1_ScoutState(Cmd;accpts;mf) b(e1)
⇒ z ∈ pv11_p1_ScoutState(Cmd;accpts;mf) b(e2)
⇒ let waitfor1,pvalues1 = zo
in let waitfor2,pvalues2 = z
in sub-bag(Id;waitfor2;waitfor1) ∧ pvalues1 ⊆ pvalues2)
Proof
Definitions occuring in Statement :
pv11_p1_ScoutState: pv11_p1_ScoutState(Cmd;accpts;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,
sublist: L1 ⊆ L2,
list: T List,
vatype: ValueAllType,
all: ∀x:A. B[x],
implies: P ⇒ Q,
and: P ∧ Q,
apply: f a,
spread: spread def,
product: x:A × B[x],
int: ℤ,
sub-bag: sub-bag(T;as;bs),
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),
refl: Refl(T;x,y.E[x; y]),
trans: Trans(T;x,y.E[x; y]),
pv11_p1_on_p1b: pv11_p1_on_p1b(Cmd),
spreadn: spread4,
let: let,
bool: 𝔹,
unit: Unit,
uiff: uiff(P;Q),
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
pv11_p1_append_news: pv11_p1_append_news(Cmd),
pv11_p1_add_if_new: pv11_p1_add_if_new(),
assert: ↑b,
bnot: ¬bb,
pv11_p1_p1b'base: pv11_p1_p1b'base(Cmd;mf),
encodes-msg-type: hdr encodes T
Latex:
\mforall{}Cmd:ValueAllType. \mforall{}accpts:bag(Id). \mforall{}mf:pv11\_p1\_headers\_type\{i:l\}(Cmd). \mforall{}es:EO+(Message(mf)).
\mforall{}e1,e2:E. \mforall{}b:pv11\_p1\_Ballot\_Num(). \mforall{}zo,z:bag(Id) \mtimes{} ((pv11\_p1\_Ballot\_Num() \mtimes{} \mBbbZ{} \mtimes{} Cmd) List).
((e1 <loc e2)
{}\mRightarrow{} zo \mmember{} pv11\_p1\_ScoutState(Cmd;accpts;mf) b(e1)
{}\mRightarrow{} z \mmember{} pv11\_p1\_ScoutState(Cmd;accpts;mf) b(e2)
{}\mRightarrow{} let waitfor1,pvalues1 = zo
in let waitfor2,pvalues2 = z
in sub-bag(Id;waitfor2;waitfor1) \mwedge{} pvalues1 \msubseteq{} pvalues2)
Date html generated:
2016_05_17-PM-02_55_25
Last ObjectModification:
2016_01_18-AM-11_23_33
Theory : paxos!synod
Home
Index