Nuprl Lemma : new_23_sig_validity

∀[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))].
  (eo-msg-interface-constraint(es;new_23_sig_main();new_23_sig_headers_internal();f)
  ⇒ for every p1 in new_23_sig_decided'base(Cmd;notify;propose;f) there is an
     earlier event  with info=m such that
     (msg-header(m) = propose ∈ Name) ∧ (p1 = msg-body(m) ∈ (ℤ × Cmd)))


Proof




Definitions occuring in Statement :  new_23_sig_headers_internal: new_23_sig_headers_internal(),  new_23_sig_main: new_23_sig_main(),  new_23_sig_decided'base: new_23_sig_decided'base(Cmd;notify;propose;f),  new_23_sig_headers_type: new_23_sig_headers_type{i:l}(Cmd;notify;propose),  set-sig: set-sig{i:l}(Item),  eo-msg-interface-constraint: eo-msg-interface-constraint(es;X;hdrs;f),  msg-body: msg-body(msg),  msg-header: msg-header(m),  Message: Message(f),  causal-class-relation: causal-class-relation,  event-ordering+: EO+(Info),  Id: Id,  name: Name,  list: T List,  deq: EqDecider(T),  int_upper: {i...},  nat: ℕ,  vatype: ValueAllType,  uall: ∀[x:A]. B[x],  implies: P ⇒ Q,  and: P ∧ Q,  product: x:A × B[x],  natural_number: $n,  int: ℤ,  atom: Atom,  equal: s = t ∈ T,  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,  prop: ℙ,  and: P ∧ Q,  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),  causal-class-relation: causal-class-relation,  new_23_sig_propose'base: new_23_sig_propose'base(Cmd;notify;propose;f),  encodes-msg-type: hdr encodes T,  es-header: header(e),  es-info-body: msgval(e),  msg-type: msg-type(msg;f),  strongwellfounded: SWellFounded(R[x; y]),  int_seg: {i..j-},  lelt: i ≤ j < k,  decidable: Dec(P),  eo-msg-interface-constraint: eo-msg-interface-constraint(es;X;hdrs;f),  new_23_sig_decided'base: new_23_sig_decided'base(Cmd;notify;propose;f),  new_23_sig_headers_internal: new_23_sig_headers_internal(),  make-msg-interface: make-msg-interface(i;l;m),  new_23_sig_vote'base: new_23_sig_vote'base(Cmd;notify;propose;f),  new_23_sig_retry'base: new_23_sig_retry'base(Cmd;notify;propose;f),  pi1: fst(t),  pi2: snd(t),  has-es-info-type: has-es-info-type(es;e;f;T),  rev_uimplies: rev_uimplies(P;Q),  so_lambda: λ2x y.t[x; y],  so_apply: x[s1;s2],  l_member: (x ∈ l)

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))].
    (eo-msg-interface-constraint(es;new\_23\_sig\_main();new\_23\_sig\_headers\_internal();f)
    {}\mRightarrow{}  for  every  p1  in  new\_23\_sig\_decided'base(Cmd;notify;propose;f)  there  is  an
          earlier  event    with  info=m  such  that
          (msg-header(m)  =  propose)  \mwedge{}  (p1  =  msg-body(m)))



Date html generated: 2016_05_17-PM-02_30_25
Last ObjectModification: 2016_05_13-AM-04_26_18

Theory : 2!3!consensus!with!signatures


Home Index