Nuprl Lemma : new_23_sig_replica_state_from_proposal_fun
∀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}(ℤ). ∀n:ℤ.
((↑(set-sig-member(slots) n new_23_sig_ReplicaStateFun(Cmd;notify;propose;slots;f;es;e)))
⇒ (∃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_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-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,
new_23_sig_replica_state_from_proposal,
new_23_sig_ReplicaStateFun_wf,
new_23_sig_ReplicaState-classrel,
assert_wf,
set-sig-member_wf,
set-sig_wf,
es-E_wf,
event-ordering+_subtype,
Message_wf,
subtype_rel_dep_function,
vatype_wf,
event-ordering+_wf,
new_23_sig_headers_type_wf,
list_wf
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{}n:\mBbbZ{}.
((\muparrow{}(set-sig-member(slots) n new\_23\_sig\_ReplicaStateFun(Cmd;notify;propose;slots;f;es;e)))
{}\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_21
Last ObjectModification:
2015_02_04-PM-01_48_01
Home
Index