Nuprl Lemma : new_23_sig_proposal_classrel

∀[Cmd:ValueAllType]
  ∀propose:Atom List
    ∀[notify:Atom List]. ∀[f:new_23_sig_headers_type{i:l}(Cmd;notify;propose)].
      ∀es:EO+(Message(f)). ∀e:E.
        ∀[nc:ℤ × Cmd]
          uiff(nc ∈ new_23_sig_Proposal(Cmd;notify;propose;f)(e);nc ∈ new_23_sig_propose'base(Cmd;notify;propose;f)(e)
          ∨ nc ∈ (new_23_sig_vote2prop(Cmd) o new_23_sig_vote'base(Cmd;notify;propose;f))(e))


Proof




Definitions occuring in Statement :  new_23_sig_Proposal: new_23_sig_Proposal(Cmd;notify;propose;f),  new_23_sig_vote2prop: new_23_sig_vote2prop(Cmd),  new_23_sig_propose'base: new_23_sig_propose'base(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),  Message: Message(f),  eclass0: (f o X),  classrel: v ∈ X(e),  event-ordering+: EO+(Info),  es-E: E,  list: T List,  vatype: ValueAllType,  uiff: uiff(P;Q),  uall: ∀[x:A]. B[x],  all: ∀x:A. B[x],  or: P ∨ Q,  product: x:A × B[x],  int: ℤ,  atom: Atom
Definitions unfolded in proof :  vatype: ValueAllType,  uall: ∀[x:A]. B[x],  all: ∀x:A. B[x],  uiff: uiff(P;Q),  and: P ∧ Q,  uimplies: b supposing a,  member: t ∈ T,  classrel: v ∈ X(e),  bag-member: x ↓∈ bs,  squash: ↓T,  new_23_sig_headers_type: new_23_sig_headers_type{i:l}(Cmd;notify;propose),  name: Name,  subtype_rel: A ⊆r B,  prop: ℙ,  listp: A List+,  implies: P ⇒ Q,  sq_stable: SqStable(P),  l_all: (∀x∈L.P[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,  new_23_sig_headers_fun: new_23_sig_headers_fun(Cmd;notify;propose),  bool: 𝔹,  unit: Unit,  it: ⋅,  btrue: tt,  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),  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_Proposal: new_23_sig_Proposal(Cmd;notify;propose;f),  decidable: Dec(P),  rev_uimplies: rev_uimplies(P;Q),  sq_or: a ↓∨ b,  new_23_sig_vote'base: new_23_sig_vote'base(Cmd;notify;propose;f),  encodes-msg-type: hdr encodes T,  list: T List,  new_23_sig_propose'base: new_23_sig_propose'base(Cmd;notify;propose;f)

Latex:
\mforall{}[Cmd:ValueAllType]
    \mforall{}propose:Atom  List
        \mforall{}[notify:Atom  List].  \mforall{}[f:new\_23\_sig\_headers\_type\{i:l\}(Cmd;notify;propose)].
            \mforall{}es:EO+(Message(f)).  \mforall{}e:E.
                \mforall{}[nc:\mBbbZ{}  \mtimes{}  Cmd]
                    uiff(nc  \mmember{}  new\_23\_sig\_Proposal(Cmd;notify;propose;f)(
                                        e);nc  \mmember{}  new\_23\_sig\_propose'base(Cmd;notify;propose;f)(e)
                    \mvee{}  nc  \mmember{}  (new\_23\_sig\_vote2prop(Cmd)  o  new\_23\_sig\_vote'base(Cmd;notify;propose;f))(e))



Date html generated: 2016_05_17-PM-02_27_52
Last ObjectModification: 2016_01_18-AM-09_32_27

Theory : 2!3!consensus!with!signatures


Home Index