Nuprl Lemma : new_23_sig_progress2-step2
∀[Cmd:ValueAllType]. ∀[eq:EqDecider(Cmd)]. ∀[reps,clients:bag(Id)]. ∀[coeff:{2...}]. ∀[flrs:ℕ].
∀[propose,notify:Atom List]. ∀[slots:set-sig{i:l}(ℤ)]. ∀[f:new_23_sig_headers_type{i:l}(Cmd;notify;propose)].
∀[es:EO+(Message(f))]. ∀[e:E]. ∀[n,r:ℤ]. ∀[c:Cmd]. ∀[faulty:bag(Id)]. ∀[e':E]. ∀[c':Cmd].
(msgs-interface-delivered-with-omissions(f;es;new_23_sig_main();faulty;flrs;reps)
⇒ bag-no-repeats(Id;reps)
⇒ (#(reps) = ((coeff * flrs) + flrs + 1) ∈ ℤ)
⇒ loc(e) ↓∈ reps
⇒ (¬loc(e) ↓∈ faulty)
⇒ (e' ≤loc e
∧ <n, c'> ∈ new_23_sig_Proposal(Cmd;notify;propose;f)(e')
∧ (¬↑(set-sig-member(slots) n new_23_sig_ReplicaStateFun(Cmd;notify;propose;slots;f;es;e')))
∧ (no new_23_sig_Notify(Cmd;clients;notify;propose;f) n between e' and e))
⇒ <<n, r>, c> ∈ new_23_sig_RoundInfo(Cmd;notify;propose;f)(e)
⇒ new_23_sig_NewRoundsStateFun(Cmd;notify;propose;f;n;es.e';e) < r
⇒ b_all(Id;reps;i.↓∃e1:E
((e < e1)
∧ (loc(e1) = i ∈ Id)
∧ <<<n, r>, c>, loc(e)> ∈ new_23_sig_vote'base(Cmd;notify;propose;f)(e1))))
Proof
Definitions occuring in Statement :
new_23_sig_main: new_23_sig_main(),
new_23_sig_ReplicaStateFun: new_23_sig_ReplicaStateFun(Cmd;notify;propose;slots;f;es;e),
new_23_sig_Proposal: new_23_sig_Proposal(Cmd;notify;propose;f),
new_23_sig_Notify: new_23_sig_Notify(Cmd;clients;notify;propose;f),
new_23_sig_NewRoundsStateFun: new_23_sig_NewRoundsStateFun(Cmd;notify;propose;f;x;es;e),
new_23_sig_RoundInfo: new_23_sig_RoundInfo(Cmd;notify;propose;f),
new_23_sig_vote'base: new_23_sig_vote'base(Cmd;notify;propose;f),
new_23_sig_headers_type: new_23_sig_headers_type{i:l}(Cmd;notify;propose),
set-sig-member: set-sig-member(s),
set-sig: set-sig{i:l}(Item),
msgs-interface-delivered-with-omissions: msgs-interface-delivered-with-omissions(f;es;X;faulty;failures;ids),
msg-interface: Interface,
Message: Message(f),
no-classrel-in-interval: (no X between start and e),
classrel: v ∈ X(e),
eo-forward: eo.e,
event-ordering+: EO+(Info),
es-le: e ≤loc e' ,
es-causl: (e < e'),
es-loc: loc(e),
es-E: E,
Id: Id,
list: T List,
deq: EqDecider(T),
int_upper: {i...},
nat: ℕ,
vatype: ValueAllType,
assert: ↑b,
less_than: a < b,
uall: ∀[x:A]. B[x],
exists: ∃x:A. B[x],
not: ¬A,
squash: ↓T,
implies: P ⇒ Q,
and: P ∧ Q,
apply: f a,
pair: <a, b>,
product: x:A × B[x],
multiply: n * m,
add: n + m,
natural_number: $n,
int: ℤ,
atom: Atom,
equal: s = t ∈ T,
b_all: b_all(T;b;x.P[x]),
bag-member: x ↓∈ bs,
bag-no-repeats: bag-no-repeats(T;bs),
bag-size: #(bs),
bag: bag(T)
Definitions unfolded in proof :
vatype: ValueAllType,
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
member: t ∈ T,
new_23_sig_headers_type: new_23_sig_headers_type{i:l}(Cmd;notify;propose),
name: Name,
subtype_rel: A ⊆r B,
and: P ∧ Q,
prop: ℙ,
listp: A List+,
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,
new_23_sig_headers: new_23_sig_headers(notify;propose),
rev_implies: P ⇐ Q,
guard: {T},
or: P ∨ Q,
uimplies: b supposing a,
new_23_sig_headers_fun: new_23_sig_headers_fun(Cmd;notify;propose),
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
cand: A c∧ B,
new_23_sig_headers_no_rep: new_23_sig_headers_no_rep(notify;propose),
squash: ↓T,
no_repeats: no_repeats(T;l),
nat: ℕ,
le: A ≤ B,
less_than': less_than'(a;b),
false: False,
not: ¬A,
length: ||as||,
list_ind: list_ind,
cons: [a / b],
nil: [],
less_than: a < b,
true: True,
sq_type: SQType(T),
int_upper: {i...},
ge: i ≥ j ,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
top: Top,
select: L[n],
subtract: n - m,
bfalse: ff,
bnot: ¬bb,
assert: ↑b,
name_eq: name_eq(x;y),
name-deq: NameDeq,
list-deq: list-deq(eq),
band: p ∧b q,
atom-deq: AtomDeq,
eq_atom: x =a y,
null: null(as),
b_all: b_all(T;b;x.P[x]),
msgs-interface-delivered-with-omissions: msgs-interface-delivered-with-omissions(f;es;X;faulty;failures;ids),
mk-msg-interface: mk-msg-interface(l;m),
new_23_sig_vote'base: new_23_sig_vote'base(Cmd;notify;propose;f),
msg-authentic: msg-authentic(m),
pi1: fst(t),
make-Msg: make-Msg(hdr;val),
mk-msg: mk-msg(auth;hdr;val)
Latex:
\mforall{}[Cmd:ValueAllType]. \mforall{}[eq:EqDecider(Cmd)]. \mforall{}[reps,clients:bag(Id)]. \mforall{}[coeff:\{2...\}]. \mforall{}[flrs:\mBbbN{}].
\mforall{}[propose,notify:Atom List]. \mforall{}[slots:set-sig\{i:l\}(\mBbbZ{})].
\mforall{}[f:new\_23\_sig\_headers\_type\{i:l\}(Cmd;notify;propose)]. \mforall{}[es:EO+(Message(f))]. \mforall{}[e:E]. \mforall{}[n,r:\mBbbZ{}].
\mforall{}[c:Cmd]. \mforall{}[faulty:bag(Id)]. \mforall{}[e':E]. \mforall{}[c':Cmd].
(msgs-interface-delivered-with-omissions(f;es;new\_23\_sig\_main();faulty;flrs;reps)
{}\mRightarrow{} bag-no-repeats(Id;reps)
{}\mRightarrow{} (\#(reps) = ((coeff * flrs) + flrs + 1))
{}\mRightarrow{} loc(e) \mdownarrow{}\mmember{} reps
{}\mRightarrow{} (\mneg{}loc(e) \mdownarrow{}\mmember{} faulty)
{}\mRightarrow{} (e' \mleq{}loc e
\mwedge{} <n, c'> \mmember{} new\_23\_sig\_Proposal(Cmd;notify;propose;f)(e')
\mwedge{} (\mneg{}\muparrow{}(set-sig-member(slots) n new\_23\_sig\_ReplicaStateFun(Cmd;notify;propose;slots;f;es;e')))
\mwedge{} (no new\_23\_sig\_Notify(Cmd;clients;notify;propose;f) n between e' and e))
{}\mRightarrow{} <<n, r>, c> \mmember{} new\_23\_sig\_RoundInfo(Cmd;notify;propose;f)(e)
{}\mRightarrow{} new\_23\_sig\_NewRoundsStateFun(Cmd;notify;propose;f;n;es.e';e) < r
{}\mRightarrow{} b\_all(Id;reps;i.\mdownarrow{}\mexists{}e1:E
((e < e1)
\mwedge{} (loc(e1) = i)
\mwedge{} <<<n, r>, c>, loc(e)> \mmember{} new\_23\_sig\_vote'base(Cmd;notify;propose;f)(e1))))
Date html generated:
2016_05_17-PM-02_43_39
Last ObjectModification:
2016_01_18-AM-09_30_01
Theory : 2!3!consensus!with!signatures
Home
Index