Nuprl Lemma : pv11_p1_decision_from_p2a
∀[Cmd:ValueAllType]. ∀[f:pv11_p1_headers_type{i:l}(Cmd)]. ∀[es:EO+(Message(f))]. ∀[accpts,ldrs:bag(Id)].
∀[ldrs_uid:Id ⟶ ℤ]. ∀[reps:bag(Id)]. ∀[e:E]. ∀[k:ℤ]. ∀[v:Cmd].
∀a:Id
(pv11_p1_decision{i:l}(Cmd;f;accpts;ldrs;ldrs_uid;reps;es;e;k;v)
⇒ has-es-info-type(es;e;f;Id × pv11_p1_Ballot_Num() × ℤ × pv11_p1_Ballot_Num())
⇒ a ↓∈ accpts
⇒ (↓∃e':E
(e' ≤loc e
∧ (k = (fst(snd(snd(msgval(e))))) ∈ ℤ)
∧ ((fst(snd(msgval(e)))) = (snd(snd(snd(msgval(e))))) ∈ pv11_p1_Ballot_Num())
∧ pv11_p1_p2a'send(Cmd;f) a <loc(e), fst(snd(msgval(e))), k, v> ∈ pv11_p1_main(Cmd;accpts;ldrs;ldrs_uid;reps;f\000C)(e'))))
Proof
Definitions occuring in Statement :
pv11_p1_decision: pv11_p1_decision{i:l}(Cmd;f;accpts;ldrs;ldrs_uid;reps;es;e;k;v),
pv11_p1_p2a'send: pv11_p1_p2a'send(Cmd;f),
pv11_p1_main: pv11_p1_main(Cmd;accpts;ldrs;ldrs_uid;reps;mf),
pv11_p1_headers_type: pv11_p1_headers_type{i:l}(Cmd),
pv11_p1_Ballot_Num: pv11_p1_Ballot_Num(),
msg-interface: Interface,
es-info-body: msgval(e),
has-es-info-type: has-es-info-type(es;e;f;T),
Message: Message(f),
classrel: v ∈ X(e),
event-ordering+: EO+(Info),
es-le: e ≤loc e' ,
es-loc: loc(e),
es-E: E,
Id: Id,
vatype: ValueAllType,
uall: ∀[x:A]. B[x],
pi1: fst(t),
pi2: snd(t),
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
squash: ↓T,
implies: P ⇒ Q,
and: P ∧ Q,
apply: f a,
function: x:A ⟶ B[x],
pair: <a, b>,
product: x:A × B[x],
int: ℤ,
equal: s = t ∈ T,
bag-member: x ↓∈ bs,
bag: bag(T)
Definitions unfolded in proof :
vatype: ValueAllType,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
member: t ∈ T,
pv11_p1_headers_type: pv11_p1_headers_type{i:l}(Cmd),
subtype_rel: A ⊆r B,
listp: A List+,
name: Name,
prop: ℙ,
and: P ∧ Q,
sq_stable: SqStable(P),
l_all: (∀x∈L.P[x]),
so_lambda: λ2x.t[x],
so_apply: x[s],
iff: P ⇐⇒ Q,
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_decision: pv11_p1_decision{i:l}(Cmd;f;accpts;ldrs;ldrs_uid;reps;es;e;k;v),
exists: ∃x:A. B[x],
make-msg-interface: make-msg-interface(i;l;m),
top: Top,
cand: A c∧ B,
has-es-info-type: has-es-info-type(es;e;f;T),
pv11_p1_p2a'send: pv11_p1_p2a'send(Cmd;f),
mk-msg-interface: mk-msg-interface(l;m),
pi1: fst(t),
pi2: snd(t),
sq_type: SQType(T)
Latex:
\mforall{}[Cmd:ValueAllType]. \mforall{}[f:pv11\_p1\_headers\_type\{i:l\}(Cmd)]. \mforall{}[es:EO+(Message(f))].
\mforall{}[accpts,ldrs:bag(Id)]. \mforall{}[ldrs$_{uid}$:Id {}\mrightarrow{} \mBbbZ{}]. \mforall{}[reps:bag(Id)]. \mforall{}[e:E]. \mforall{}[k:\mBbbZ{}]\000C. \mforall{}[v:Cmd].
\mforall{}a:Id
(pv11\_p1\_decision\{i:l\}(Cmd;f;accpts;ldrs;ldrs$_{uid}$;reps;es;e;k;v)
{}\mRightarrow{} has-es-info-type(es;e;f;Id \mtimes{} pv11\_p1\_Ballot\_Num() \mtimes{} \mBbbZ{} \mtimes{} pv11\_p1\_Ballot\_Num())
{}\mRightarrow{} a \mdownarrow{}\mmember{} accpts
{}\mRightarrow{} (\mdownarrow{}\mexists{}e':E
(e' \mleq{}loc e
\mwedge{} (k = (fst(snd(snd(msgval(e))))))
\mwedge{} ((fst(snd(msgval(e)))) = (snd(snd(snd(msgval(e))))))
\mwedge{} pv11\_p1\_p2a'send(Cmd;f) a <loc(e), fst(snd(msgval(e))), k, v> \mmember{} pv11\_p1\_main(Cmd;accpts;\000Cldrs;ldrs$_{uid}$;reps;f)(
e'))))
Date html generated:
2016_05_17-PM-04_16_50
Last ObjectModification:
2016_01_18-AM-11_15_27
Theory : paxos!synod
Home
Index