Nuprl Lemma : new_23_sig_quorum_inv_vote2_fun

∀Cmd:ValueAllType. ∀notify,propose:Atom List. ∀f:new_23_sig_headers_type{i:l}(Cmd;notify;propose). ∀es:EO+(Message(f)).
∀e:E. ∀ni:ℤ × ℤ.
  (no_repeats(Id;snd(new_23_sig_QuorumStateFun(Cmd;notify;propose;f;ni;es;e)))
  ∧ (||snd(new_23_sig_QuorumStateFun(Cmd;notify;propose;f;ni;es;e))||
    = ||fst(new_23_sig_QuorumStateFun(Cmd;notify;propose;f;ni;es;e))||
    ∈ ℤ)
  ∧ (∀i:ℕ||snd(new_23_sig_QuorumStateFun(Cmd;notify;propose;f;ni;es;e))||
       (↓∃e':E
          ((e' <loc e)
          ∧ <<ni, fst(new_23_sig_QuorumStateFun(Cmd;notify;propose;f;ni;es;e))[i]>
            , snd(new_23_sig_QuorumStateFun(Cmd;notify;propose;f;ni;es;e))[i]
            > ∈ new_23_sig_vote'base(Cmd;notify;propose;f)(e')
          ∧ (∀e''∈[es-init(es;e);e').∀c:Cmd
                                       (¬<<ni, c>, snd(new_23_sig_QuorumStateFun(Cmd;notify;propose;f;ni;es;e))[i]> ∈
                                          new_23_sig_vote'base(Cmd;notify;propose;f)(e'')))))))


Proof




Definitions occuring in Statement :  new_23_sig_QuorumStateFun: new_23_sig_QuorumStateFun(Cmd;notify;propose;f;x;es;e),  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),  classrel: v ∈ X(e),  event-ordering+: EO+(Info),  es-init: es-init(es;e),  es-closed-open-interval: [e;e'),  es-locl: (e <loc e'),  es-E: E,  Id: Id,  l_all: (∀x∈L.P[x]),  no_repeats: no_repeats(T;l),  select: L[n],  length: ||as||,  list: T List,  int_seg: {i..j-},  vatype: ValueAllType,  pi1: fst(t),  pi2: snd(t),  all: ∀x:A. B[x],  exists: ∃x:A. B[x],  not: ¬A,  squash: ↓T,  and: P ∧ Q,  pair: <a, b>,  product: x:A × B[x],  natural_number: $n,  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)

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{}ni:\mBbbZ{}  \mtimes{}  \mBbbZ{}.
    (no\_repeats(Id;snd(new\_23\_sig\_QuorumStateFun(Cmd;notify;propose;f;ni;es;e)))
    \mwedge{}  (||snd(new\_23\_sig\_QuorumStateFun(Cmd;notify;propose;f;ni;es;e))||
        =  ||fst(new\_23\_sig\_QuorumStateFun(Cmd;notify;propose;f;ni;es;e))||)
    \mwedge{}  (\mforall{}i:\mBbbN{}||snd(new\_23\_sig\_QuorumStateFun(Cmd;notify;propose;f;ni;es;e))||
              (\mdownarrow{}\mexists{}e':E
                    ((e'  <loc  e)
                    \mwedge{}  <<ni,  fst(new\_23\_sig\_QuorumStateFun(Cmd;notify;propose;f;ni;es;e))[i]>
                        ,  snd(new\_23\_sig\_QuorumStateFun(Cmd;notify;propose;f;ni;es;e))[i]
                        >  \mmember{}  new\_23\_sig\_vote'base(Cmd;notify;propose;f)(e')
                    \mwedge{}  (\mforall{}e''\mmember{}[es-init(es;e);e').
                                  \mforall{}c:Cmd
                                      (\mneg{}<<ni,  c>,  snd(new\_23\_sig\_QuorumStateFun(Cmd;notify;propose;f;ni;es;e))[i]>  \mmember{}
                                            new\_23\_sig\_vote'base(Cmd;notify;propose;f)(e'')))))))



Date html generated: 2016_05_17-PM-02_15_33
Last ObjectModification: 2016_01_18-AM-09_32_24

Theory : 2!3!consensus!with!signatures


Home Index