Nuprl Lemma : new_23_sig_quorum_state_fun_eq
∀Cmd:ValueAllType. ∀notify,propose:Atom List. ∀f:new_23_sig_headers_type{i:l}(Cmd;notify;propose). ∀es:EO+(Message(f)).
∀e:E. ∀nr:ℤ × ℤ.
(new_23_sig_QuorumStateFun(Cmd;notify;propose;f;nr;es;e)
= if first(e) then <[], []>
if pred(e) ∈b new_23_sig_vote'base(Cmd;notify;propose;f)
then new_23_sig_add_to_quorum(Cmd) nr loc(e) new_23_sig_vote'base(Cmd;notify;propose;f)@pred(e)
new_23_sig_QuorumStateFun(Cmd;notify;propose;f;nr;es;pred(e))
else new_23_sig_QuorumStateFun(Cmd;notify;propose;f;nr;es;pred(e))
fi
∈ (Cmd List × (Id List)))
Proof
Definitions occuring in Statement :
new_23_sig_QuorumStateFun: new_23_sig_QuorumStateFun(Cmd;notify;propose;f;x;es;e),
new_23_sig_add_to_quorum: new_23_sig_add_to_quorum(Cmd),
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),
Message: Message(f),
classfun-res: X@e,
member-eclass: e ∈b X,
event-ordering+: EO+(Info),
es-first: first(e),
es-pred: pred(e),
es-loc: loc(e),
es-E: E,
Id: Id,
nil: [],
list: T List,
vatype: ValueAllType,
ifthenelse: if b then t else f fi ,
all: ∀x:A. B[x],
apply: f a,
pair: <a, b>,
product: x:A × B[x],
int: ℤ,
atom: Atom,
equal: s = t ∈ T
Definitions unfolded in proof :
vatype: ValueAllType,
all: ∀x:A. B[x],
new_23_sig_headers_type: new_23_sig_headers_type{i:l}(Cmd;notify;propose),
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,
implies: P ⇒ Q,
name: Name,
new_23_sig_headers: new_23_sig_headers(notify;propose),
listp: A List+,
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 ,
sq_stable: SqStable(P),
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,
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,
sq_type: SQType(T),
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),
new_23_sig_QuorumStateFun: new_23_sig_QuorumStateFun(Cmd;notify;propose;f;x;es;e),
new_23_sig_QuorumState: new_23_sig_QuorumState(Cmd;notify;propose;f),
memory-class1: memory-class1,
new_23_sig_vote'base: new_23_sig_vote'base(Cmd;notify;propose;f),
encodes-msg-type: hdr encodes T,
classfun-res: X@e,
es-functional-class: X is functional
Latex:
\mforall{}Cmd:ValueAllType. \mforall{}notify,propose:Atom List. \mforall{}f:new\_23\_sig\_headers\_type\{i:l\}(Cmd;notify;propose).
\mforall{}es:EO+(Message(f)). \mforall{}e:E. \mforall{}nr:\mBbbZ{} \mtimes{} \mBbbZ{}.
(new\_23\_sig\_QuorumStateFun(Cmd;notify;propose;f;nr;es;e)
= if first(e) then <[], []>
if pred(e) \mmember{}\msubb{} new\_23\_sig\_vote'base(Cmd;notify;propose;f)
then new\_23\_sig\_add\_to\_quorum(Cmd) nr loc(e)
new\_23\_sig\_vote'base(Cmd;notify;propose;f)@pred(e)
new\_23\_sig\_QuorumStateFun(Cmd;notify;propose;f;nr;es;pred(e))
else new\_23\_sig\_QuorumStateFun(Cmd;notify;propose;f;nr;es;pred(e))
fi )
Date html generated:
2016_05_17-PM-02_28_32
Last ObjectModification:
2016_01_18-AM-09_32_31
Theory : 2!3!consensus!with!signatures
Home
Index