Nuprl Lemma : pv11_p1_ldr_fun_state_propose_pred
∀Cmd:ValueAllType. ∀f:pv11_p1_headers_type{i:l}(Cmd). ∀es:EO+(Message(f)). ∀e1,e2:E. ∀ldrs_uid:Id ⟶ ℤ.
∀bnum:pv11_p1_Ballot_Num(). ∀active:𝔹. ∀proposals:(ℤ × Cmd) List. ∀s:ℤ. ∀c:Cmd.
((e1 <loc e2)
⇒ (<bnum, active, proposals>
= pv11_p1_LeaderStateFun(Cmd;ldrs_uid;f;es;e1)
∈ (pv11_p1_Ballot_Num() × 𝔹 × ((ℤ × Cmd) List)))
⇒ (header(e1) = [propose] ∈ Name)
⇒ has-es-info-type(es;e1;f;ℤ × Cmd)
⇒ (<s, c> = msgval(e1) ∈ (ℤ × Cmd))
⇒ (¬↑(pv11_p1_in_domain(Cmd) s proposals))
⇒ (∃e:{e:E| ¬↑first(e)}
((e1 = pred(e) ∈ E)
∧ e ≤loc e2
∧ (<bnum, active, pv11_p1_add_if_new() pv11_p1_same_proposal(Cmd) <s, c> proposals>
= pv11_p1_LeaderStateFun(Cmd;ldrs_uid;f;es;e)
∈ (pv11_p1_Ballot_Num() × 𝔹 × ((ℤ × Cmd) List))))))
Proof
Definitions occuring in Statement :
pv11_p1_LeaderStateFun: pv11_p1_LeaderStateFun(Cmd;ldrs_uid;mf;es;e),
pv11_p1_add_if_new: pv11_p1_add_if_new(),
pv11_p1_same_proposal: pv11_p1_same_proposal(Cmd),
pv11_p1_in_domain: pv11_p1_in_domain(Cmd),
pv11_p1_headers_type: pv11_p1_headers_type{i:l}(Cmd),
pv11_p1_Ballot_Num: pv11_p1_Ballot_Num(),
es-info-body: msgval(e),
has-es-info-type: has-es-info-type(es;e;f;T),
es-header: header(e),
Message: Message(f),
event-ordering+: EO+(Info),
es-le: e ≤loc e' ,
es-locl: (e <loc e'),
es-first: first(e),
es-pred: pred(e),
es-E: E,
Id: Id,
name: Name,
cons: [a / b],
nil: [],
list: T List,
vatype: ValueAllType,
assert: ↑b,
bool: 𝔹,
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
not: ¬A,
implies: P ⇒ Q,
and: P ∧ Q,
set: {x:A| B[x]} ,
apply: f a,
function: x:A ⟶ B[x],
pair: <a, b>,
product: x:A × B[x],
int: ℤ,
token: "$token",
equal: s = t ∈ 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),
exists: ∃x:A. B[x],
cand: A c∧ B,
has-es-info-type: has-es-info-type(es;e;f;T)
Latex:
\mforall{}Cmd:ValueAllType. \mforall{}f:pv11\_p1\_headers\_type\{i:l\}(Cmd). \mforall{}es:EO+(Message(f)). \mforall{}e1,e2:E.
\mforall{}ldrs$_{uid}$:Id {}\mrightarrow{} \mBbbZ{}. \mforall{}bnum:pv11\_p1\_Ballot\_Num(). \mforall{}active:\mBbbB{}. \mforall{}proposals:(\mBbbZ{} \mtimes{} Cm\000Cd) List. \mforall{}s:\mBbbZ{}. \mforall{}c:Cmd.
((e1 <loc e2)
{}\mRightarrow{} (<bnum, active, proposals> = pv11\_p1\_LeaderStateFun(Cmd;ldrs$_{uid}$;f;es;e\000C1))
{}\mRightarrow{} (header(e1) = [propose])
{}\mRightarrow{} has-es-info-type(es;e1;f;\mBbbZ{} \mtimes{} Cmd)
{}\mRightarrow{} (<s, c> = msgval(e1))
{}\mRightarrow{} (\mneg{}\muparrow{}(pv11\_p1\_in\_domain(Cmd) s proposals))
{}\mRightarrow{} (\mexists{}e:\{e:E| \mneg{}\muparrow{}first(e)\}
((e1 = pred(e))
\mwedge{} e \mleq{}loc e2
\mwedge{} (<bnum, active, pv11\_p1\_add\_if\_new() pv11\_p1\_same\_proposal(Cmd) <s, c> proposals> = pv11\_p1\000C\_LeaderStateFun(Cmd;ldrs$_{uid}$;f;es;e)))))
Date html generated:
2016_05_17-PM-03_44_43
Last ObjectModification:
2016_01_18-AM-11_16_16
Theory : paxos!synod
Home
Index