Nuprl Lemma : pv11_p1_inc_acc
∀Cmd:ValueAllType. ∀ldrs_uid:Id ─→ ℤ. ∀mf:pv11_p1_headers_type{i:l}(Cmd). ∀es:EO+(Message(mf)). ∀e1,e2:E.
∀zh,z:pv11_p1_Ballot_Num() × ((pv11_p1_Ballot_Num() × ℤ × Cmd) List).
((e1 <loc e2)
⇒ zh ∈ pv11_p1_AcceptorState(Cmd;ldrs_uid;mf)(e1)
⇒ z ∈ pv11_p1_AcceptorState(Cmd;ldrs_uid;mf)(e2)
⇒ let ballot_num1,accepted1 = zh
in let ballot_num2,accepted2 = z
in (↑(pv11_p1_leq_bnum(ldrs_uid) ballot_num1 ballot_num2)) ∧ accepted1 ≤ accepted2)
Proof
Definitions occuring in Statement :
pv11_p1_AcceptorState: pv11_p1_AcceptorState(Cmd;ldrs_uid;mf),
pv11_p1_headers_type: pv11_p1_headers_type{i:l}(Cmd),
pv11_p1_leq_bnum: pv11_p1_leq_bnum(ldrs_uid),
pv11_p1_Ballot_Num: pv11_p1_Ballot_Num(),
Message: Message(f),
classrel: v ∈ X(e),
event-ordering+: EO+(Info),
es-locl: (e <loc e'),
es-E: E,
Id: Id,
iseg: l1 ≤ l2,
list: T List,
vatype: ValueAllType,
assert: ↑b,
all: ∀x:A. B[x],
implies: P ⇒ Q,
and: P ∧ Q,
apply: f a,
function: x:A ─→ B[x],
spread: spread def,
product: x:A × B[x],
int: ℤ
Lemmas :
int_seg_wf,
length_wf,
name_wf,
pv11_p1_headers_wf,
l_all_iff,
l_member_wf,
equal_wf,
pv11_p1_headers_fun_wf,
cons_wf_listp,
nil_wf,
listp_wf,
cons_member,
cons_wf,
equal-wf-base,
iff_weakening_equal,
classrel_wf,
squash_wf,
true_wf,
es-E_wf,
event-ordering+_subtype,
event-ordering+_wf,
eclass_wf,
State2-state-class2,
pv11_p1_init_acceptor_wf,
pv11_p1_on_p1a_wf,
pv11_p1_p1a'base_wf,
pv11_p1_on_p2a_wf,
pv11_p1_p2a'base_wf,
State-loc-comb-trans-refl,
assert_wf,
pv11_p1_leq_bnum_wf,
iseg_wf,
disjoint-union-tr_wf,
single-bag_wf,
disjoint-union-comb_wf,
assert_of_bor,
lt_int_wf,
eq_int_wf,
bool_wf,
eqtt_to_assert,
assert_of_eq_int,
le_int_wf,
le_weakening,
less_than_wf,
assert_of_lt_int,
iff_transitivity,
int_subtype_base,
le_wf,
iff_weakening_uiff,
assert_of_band,
assert_of_le_int,
or_wf,
iseg_weakening2,
iseg_transitivity,
decidable__lt,
false_wf,
less-iff-le,
add_functionality_wrt_le,
add-associates,
add-swap,
add-commutes,
le-add-cancel,
le_antisymmetry_iff,
le_transitivity,
disj_un_tr_ap_inl_lemma,
subtype_rel_sum,
unit_wf2,
eqff_to_assert,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
bor_wf,
not_over_or,
not_over_and,
decidable__int_equal,
disj_un_tr_ap_inr_lemma,
bl-exists_wf,
pv11_p1_same_pvalue_wf,
equal-wf-T-base,
l_exists_wf,
assert-bl-exists,
l_exists_iff,
bnot_wf,
not_wf,
assert_of_bnot,
exists_wf,
iseg_append,
uiff_transitivity,
disjoint-union-comb-single-val,
base-headers-msg-val-single-val,
subtype_rel_weakening,
ext-eq_weakening,
base-disjoint-classrel,
name_eq_wf,
assert-name_eq,
sq_stable__encodes-msg-type,
l_all_fwd,
list_wf,
valueall-type_wf,
single-valued-bag-single,
es-le_weakening,
pv11_p1_AcceptorState_wf,
es-locl_wf,
pv11_p1_Ballot_Num_wf,
Message_wf,
subtype_rel_dep_function,
vatype_wf,
pv11_p1_headers_type_wf,
Id_wf,
set_wf
Latex:
\mforall{}Cmd:ValueAllType. \mforall{}ldrs$_{uid}$:Id {}\mrightarrow{} \mBbbZ{}. \mforall{}mf:pv11\_p1\_headers\_type\{i:l\}(Cmd). \mforall{}e\000Cs:EO+(Message(mf)).
\mforall{}e1,e2:E. \mforall{}zh,z:pv11\_p1\_Ballot\_Num() \mtimes{} ((pv11\_p1\_Ballot\_Num() \mtimes{} \mBbbZ{} \mtimes{} Cmd) List).
((e1 <loc e2)
{}\mRightarrow{} zh \mmember{} pv11\_p1\_AcceptorState(Cmd;ldrs$_{uid}$;mf)(e1)
{}\mRightarrow{} z \mmember{} pv11\_p1\_AcceptorState(Cmd;ldrs$_{uid}$;mf)(e2)
{}\mRightarrow{} let ballot$_{num1}$,accepted1 = zh
in let ballot$_{num2}$,accepted2 = z
in (\muparrow{}(pv11\_p1\_leq\_bnum(ldrs$_{uid}$) ballot$_{num1}$\000C ballot$_{num2}$)) \mwedge{} accepted1 \mleq{} accepted2)
Date html generated:
2015_07_23-PM-04_13_03
Last ObjectModification:
2015_02_04-AM-07_29_33
Home
Index