Nuprl Lemma : ler_Propose_from_Choose

es:EO'. nodes:bag(Id). uid:Id  . client:Id. e:E. epoch,i:.
  ((ler_leader_ring_message-constraint{i:l}(client;nodes;uid) es)
   <epoch, i ler_Propose()(e)
   (e':{e':E| (e' < e)} . epoch  ler_Choose()(e')))


Proof not projected




Definitions occuring in Statement :  ler_leader_ring_message-constraint: ler_leader_ring_message-constraint{i:l}(client;nodes;uid) ler_Propose: ler_Propose() ler_Choose: ler_Choose() Message: Message classrel: v  X(e) event-ordering+: EO+(Info) es-causl: (e < e') es-E: E Id: Id all: x:A. B[x] exists: x:A. B[x] squash: T implies: P  Q set: {x:A| B[x]}  apply: f a function: x:A  B[x] pair: <a, b> product: x:A  B[x] int: bag: bag(T)
Definitions :  cand: A c B or: P  Q so_lambda: x.t[x] and: P  Q name: Name es-header: es-header(es;e) ler_leader_ring_headers_no_inputs: ler_leader_ring_headers_no_inputs() true: True prop: false: False not: A le: A  B ge: i  j  nat: member: t  T ler_Choose: ler_Choose() exists: x:A. B[x] squash: T ler_Propose: ler_Propose() implies: P  Q all: x:A. B[x] rev_implies: P  Q iff: P  Q so_apply: x[s] uiff: uiff(P;Q) uimplies: b supposing a message-constraint: message-constraint{i:l}(es;X;hdrs) uall: [x:A]. B[x] strongwellfounded: SWellFounded(R[x; y]) ler_leader_ring_message-constraint: ler_leader_ring_message-constraint{i:l}(client;nodes;uid) msg-header: msg-header(m) subtype: S  T
Lemmas :  event-ordering+_wf bag_wf ler_leader_ring_message-constraint_wf ler_Propose_wf ler_Choose_wf es-causle_weakening es-causl_transitivity2 ler_Nbr_wf prior-classrel-p-local-pred ler_Propose_ilf es-loc_wf ler_leader_ring_main_wf Id_wf classrel_wf es-E_wf squash_wf ler_leader_ring_headers_no_inputs_wf msg-header_wf l_member_wf name_wf cons_member valueall-type_wf int-valueall-type product-valueall-type base-noloc-classrel-make-Msg es-causl_wf le_wf nat_wf ge_wf nat_properties Message_wf event-ordering+_inc es-causl-swellfnd

\mforall{}es:EO'.  \mforall{}nodes:bag(Id).  \mforall{}uid:Id  {}\mrightarrow{}  \mBbbZ{}.  \mforall{}client:Id.  \mforall{}e:E.  \mforall{}epoch,i:\mBbbZ{}.
    ((ler\_leader\_ring\_message-constraint\{i:l\}(client;nodes;uid)  es)
    {}\mRightarrow{}  <epoch,  i>  \mmember{}  ler\_Propose()(e)
    {}\mRightarrow{}  (\mdownarrow{}\mexists{}e':\{e':E|  (e'  <  e)\}  .  epoch  \mmember{}  ler\_Choose()(e')))


Date html generated: 2012_02_20-PM-06_04_08
Last ObjectModification: 2012_02_02-PM-02_39_03

Home Index