Nuprl Lemma : pv11_p1-p1a
∀[Cmd:{T:Type| valueall-type(T)} ]. ∀[accpts,ldrs:bag(Id)]. ∀[ldrs_uid:Id ⟶ ℤ]. ∀[reps:bag(Id)].
∀[mf:pv11_p1_headers_type{i:l}(Cmd)]. ∀[es:EO+(Message(mf))]. ∀[e:E]. ∀[d:ℤ]. ∀[i:Id]. ∀[auth:𝔹]. ∀[i1:Id].
∀[p:pv11_p1_Ballot_Num()].
(<d, i, mk-msg(auth;``pv11_p1 p1a``;<i1, p>)> ∈ pv11_p1_main(Cmd;accpts;ldrs;ldrs_uid;reps;mf)(e)
⇐⇒ loc(e) ↓∈ ldrs
∧ i ↓∈ accpts
∧ (d = 0 ∈ ℤ)
∧ auth = pv11_p1_init_active()
∧ (i1 = loc(e) ∈ Id)
∧ (↓((p = (pv11_p1_init_ballot_num() loc(e)) ∈ pv11_p1_Ballot_Num()) ∧ (↑first(e)))
∨ ((header(e) = ``pv11_p1 preempted`` ∈ Name)
∧ has-es-info-type(es;e;mf;pv11_p1_Ballot_Num())
∧ (↑(pv11_p1_is_bnum() msgval(e)))
∧ (↑(fst(pv11_p1_LeaderStateFun(Cmd;ldrs_uid;mf;es;e)) < msgval(e)))
∧ (p = (pv11_p1_upd_bnum() msgval(e) loc(e)) ∈ pv11_p1_Ballot_Num()))))
Proof
Definitions occuring in Statement :
pv11_p1_main: pv11_p1_main(Cmd;accpts;ldrs;ldrs_uid;reps;mf),
pv11_p1_LeaderStateFun: pv11_p1_LeaderStateFun(Cmd;ldrs_uid;mf;es;e),
pv11_p1_init_active: pv11_p1_init_active(),
pv11_p1_init_ballot_num: pv11_p1_init_ballot_num(),
pv11_p1_headers_type: pv11_p1_headers_type{i:l}(Cmd),
pv11_p1_lt_bnum: pv11_p1_lt_bnum(ldrs_uid),
pv11_p1_upd_bnum: pv11_p1_upd_bnum(),
pv11_p1_is_bnum: pv11_p1_is_bnum(),
pv11_p1_Ballot_Num: pv11_p1_Ballot_Num(),
msg-interface: Interface,
mk-msg: mk-msg(auth;hdr;val),
es-info-body: msgval(e),
has-es-info-type: has-es-info-type(es;e;f;T),
es-header: header(e),
Message: Message(f),
classrel: v ∈ X(e),
event-ordering+: EO+(Info),
es-first: first(e),
es-loc: loc(e),
es-E: E,
Id: Id,
name: Name,
cons: [a / b],
nil: [],
valueall-type: valueall-type(T),
assert: ↑b,
bool: 𝔹,
uall: ∀[x:A]. B[x],
pi1: fst(t),
iff: P ⇐⇒ Q,
squash: ↓T,
or: P ∨ Q,
and: P ∧ Q,
set: {x:A| B[x]} ,
apply: f a,
function: x:A ⟶ B[x],
pair: <a, b>,
natural_number: $n,
int: ℤ,
token: "$token",
universe: Type,
equal: s = t ∈ T,
bag-member: x ↓∈ bs,
bag: bag(T)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
pv11_p1_headers_type: pv11_p1_headers_type{i:l}(Cmd),
subtype_rel: A ⊆r B,
listp: A List+,
name: Name,
vatype: ValueAllType,
prop: ℙ,
and: P ∧ Q,
implies: P ⇒ Q,
sq_stable: SqStable(P),
l_all: (∀x∈L.P[x]),
all: ∀x:A. B[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),
bag-member: x ↓∈ bs,
make-msg-interface: make-msg-interface(i;l;m),
classrel: v ∈ X(e),
cand: A c∧ B,
has-es-info-type: has-es-info-type(es;e;f;T),
top: Top,
or: P ∨ Q,
pi1: fst(t),
pi2: snd(t),
nat: ℕ,
exists: ∃x:A. B[x],
pv11_p1_headers_no_rep: pv11_p1_headers_no_rep(),
no_repeats: no_repeats(T;l),
ge: i ≥ j ,
satisfiable_int_formula: satisfiable_int_formula(fmla),
pv11_p1_init_active: pv11_p1_init_active()
Latex:
\mforall{}[Cmd:\{T:Type| valueall-type(T)\} ]. \mforall{}[accpts,ldrs:bag(Id)]. \mforall{}[ldrs$_{uid}$:Id {}\mrightarrow{}\000C \mBbbZ{}]. \mforall{}[reps:bag(Id)].
\mforall{}[mf:pv11\_p1\_headers\_type\{i:l\}(Cmd)]. \mforall{}[es:EO+(Message(mf))]. \mforall{}[e:E]. \mforall{}[d:\mBbbZ{}]. \mforall{}[i:Id]. \mforall{}[auth:\mBbbB{}].
\mforall{}[i1:Id]. \mforall{}[p:pv11\_p1\_Ballot\_Num()].
(<d, i, mk-msg(auth;``pv11\_p1 p1a``;<i1, p>)> \mmember{} pv11\_p1\_main(Cmd;accpts;ldrs;ldrs$_{ui\000Cd}$;reps;mf)(e)
\mLeftarrow{}{}\mRightarrow{} loc(e) \mdownarrow{}\mmember{} ldrs
\mwedge{} i \mdownarrow{}\mmember{} accpts
\mwedge{} (d = 0)
\mwedge{} auth = pv11\_p1\_init\_active()
\mwedge{} (i1 = loc(e))
\mwedge{} (\mdownarrow{}((p = (pv11\_p1\_init\_ballot\_num() loc(e))) \mwedge{} (\muparrow{}first(e)))
\mvee{} ((header(e) = ``pv11\_p1 preempted``)
\mwedge{} has-es-info-type(es;e;mf;pv11\_p1\_Ballot\_Num())
\mwedge{} (\muparrow{}(pv11\_p1\_is\_bnum() msgval(e)))
\mwedge{} (\muparrow{}(fst(pv11\_p1\_LeaderStateFun(Cmd;ldrs$_{uid}$;mf;es;e)) < msgval\000C(e)))
\mwedge{} (p = (pv11\_p1\_upd\_bnum() msgval(e) loc(e))))))
Date html generated:
2016_05_17-PM-03_09_06
Last ObjectModification:
2016_01_18-PM-08_25_01
Theory : paxos!synod
Home
Index