Nuprl Lemma : new_23_sig_replica_state_from_proposal
∀Cmd:ValueAllType. ∀notify,propose:Atom List. ∀f:new_23_sig_headers_type{i:l}(Cmd;notify;propose). ∀es:EO+(Message(f)).
∀e:E. ∀slots:set-sig{i:l}(ℤ). ∀s:set-sig-set(slots).
  (s ∈ new_23_sig_ReplicaState(Cmd;notify;propose;slots;f)(e)
  
⇒ (∀n:ℤ
        ((↑(set-sig-member(slots) n s))
        
⇒ (∃e':E
             ∃c:Cmd
              ((e' <loc e)
              ∧ <n, c> ∈ new_23_sig_Proposal(Cmd;notify;propose;f)(e')
              ∧ (¬↑(set-sig-member(slots) n new_23_sig_ReplicaStateFun(Cmd;notify;propose;slots;f;es;e'))))))))
Proof
Definitions occuring in Statement : 
new_23_sig_ReplicaStateFun: new_23_sig_ReplicaStateFun(Cmd;notify;propose;slots;f;es;e)
, 
new_23_sig_ReplicaState: new_23_sig_ReplicaState(Cmd;notify;propose;slots;f)
, 
new_23_sig_Proposal: new_23_sig_Proposal(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-locl: (e <loc e')
, 
es-E: E
, 
list: T List
, 
vatype: ValueAllType
, 
assert: ↑b
, 
all: ∀x:A. B[x]
, 
exists: ∃x:A. B[x]
, 
not: ¬A
, 
implies: P 
⇒ Q
, 
and: P ∧ Q
, 
apply: f a
, 
pair: <a, b>
, 
product: x:A × B[x]
, 
int: ℤ
, 
atom: Atom
, 
set-sig-member: set-sig-member(s)
, 
set-sig-set: set-sig-set(s)
, 
set-sig: set-sig{i:l}(Item)
Lemmas : 
int_seg_wf, 
length_wf, 
name_wf, 
new_23_sig_headers_wf, 
l_all_iff, 
l_member_wf, 
equal_wf, 
new_23_sig_headers_fun_wf, 
cons_member, 
cons_wf, 
cons_wf_listp, 
listp_wf, 
nil_wf, 
equal-wf-base, 
list_subtype_base, 
atom_subtype_base, 
iff_weakening_equal, 
name_eq_wf, 
bool_wf, 
eqtt_to_assert, 
assert-name_eq, 
sq_stable__no_repeats, 
squash_wf, 
true_wf, 
eqff_to_assert, 
bool_cases_sqequal, 
subtype_base_sq, 
bool_subtype_base, 
assert-bnot, 
Id_wf, 
classrel_wf, 
es-E_wf, 
event-ordering+_subtype, 
event-ordering+_wf, 
eclass_wf, 
set-sig-set_wf, 
Memory1-memory-class1, 
set-sig-empty_wf, 
new_23_sig_update_replica_wf, 
new_23_sig_Proposal_wf, 
Memory-loc-class-invariant-sv1, 
all_wf, 
assert_wf, 
set-sig-member_wf, 
exists_wf, 
es-locl_wf, 
not_wf, 
new_23_sig_ReplicaStateFun_wf, 
single-bag_wf, 
parallel-class-single-val, 
new_23_sig_propose'base_wf, 
eclass0_wf, 
new_23_sig_vote'base_wf, 
new_23_sig_vote2prop_wf, 
disjoint-classrel-symm, 
eclass0-disjoint-classrel, 
base-disjoint-classrel, 
length_of_cons_lemma, 
length_of_nil_lemma, 
false_wf, 
le_wf, 
less_than_wf, 
nat_wf, 
sq_stable__encodes-msg-type, 
l_all_fwd, 
list_wf, 
valueall-type_wf, 
subtype_rel_weakening, 
ext-eq_weakening, 
top_wf, 
eclass0-single-val, 
single-valued-bag-single, 
base-headers-msg-val-single-val, 
bag-member-single, 
bag-member_wf, 
set-sig-add-prop, 
es-loc_wf, 
Memory-loc-class_wf, 
new_23_sig_ReplicaState_wf, 
set-sig_wf, 
Message_wf, 
subtype_rel_dep_function, 
vatype_wf, 
new_23_sig_headers_type_wf, 
set_wf, 
set-sig-empty-prop2, 
decidable__assert, 
int_subtype_base, 
new_23_sig_ReplicaState-classrel, 
assert_functionality_wrt_uiff
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{}slots:set-sig\{i:l\}(\mBbbZ{}).  \mforall{}s:set-sig-set(slots).
    (s  \mmember{}  new\_23\_sig\_ReplicaState(Cmd;notify;propose;slots;f)(e)
    {}\mRightarrow{}  (\mforall{}n:\mBbbZ{}
                ((\muparrow{}(set-sig-member(slots)  n  s))
                {}\mRightarrow{}  (\mexists{}e':E
                          \mexists{}c:Cmd
                            ((e'  <loc  e)
                            \mwedge{}  <n,  c>  \mmember{}  new\_23\_sig\_Proposal(Cmd;notify;propose;f)(e')
                            \mwedge{}  (\mneg{}\muparrow{}(set-sig-member(slots)  n 
                                        new\_23\_sig\_ReplicaStateFun(Cmd;notify;propose;slots;f;es;e'))))))))
Date html generated:
2015_07_23-PM-03_57_19
Last ObjectModification:
2015_02_04-PM-01_50_23
Home
Index