Nuprl Lemma : rsc4_increasing_max
es:EO'. e1,e2:E. Cmd:ValueAllType. zl,z:
( List).
((e1 <loc e2)
zl 
rsc4_ReplicaState(Cmd)(e1)
z rsc4_ReplicaState(Cmd)(e2)
let max1,missing1 = zl
in let max2,missing2 = z
in (
max1 
z max2)
(x:. ((int-list-member(x;missing2)) ((int-list-member(x;missing1)) 
(max1 <z x)))))
Proof
Definitions occuring in Statement :
rsc4_ReplicaState: rsc4_ReplicaState(Cmd),
Message: Message,
classrel: v X(e),
event-ordering+: EO+(Info),
es-locl: (e <loc e'),
es-E: E,
le_int: i z j,
lt_int: i <z j,
assert: b,
all: x:A. B[x],
implies: P Q,
or: P Q,
and: P Q,
spread: spread def,
product: x:A B[x],
list: type List,
int: ,
int-list-member: int-list-member(i;xs),
vatype: ValueAllType
Definitions :
eq_atom: x =a y,
atom-deq: AtomDeq,
list-deq: list-deq(eq),
name-deq: NameDeq,
name_eq: name_eq(x;y),
name: Name,
rsc4_vote'base: rsc4_vote'base(Cmd),
rsc4_vote2prop: rsc4_vote2prop(Cmd),
rsc4_propose'base: rsc4_propose'base(Cmd),
squash: 
T,
band: p 
q,
bfalse: ff,
subtype: S 
T,
rsc4_onnewpropose: rsc4_onnewpropose(Cmd),
true: True,
ifthenelse: if b then t else f fi ,
guard: {T},
btrue: tt,
false: False,
not: 
A,
uiff: uiff(P;Q),
le: A B,
cand: A c B,
so_lambda: 
x.t[x],
member: t T,
trans: Trans(T;x,y.E[x; y]),
refl: Refl(T;x,y.E[x; y]),
prop: 
,
rsc4_Proposal: rsc4_Proposal(Cmd),
rsc4_init: rsc4_init(),
rsc4_update_replica: rsc4_update_replica(Cmd),
or: P Q,
assert: b,
and: P Q,
implies: P Q,
vatype: ValueAllType,
all: x:A. B[x],
unit: Unit,
decidable: Dec(P),
iff: P 
Q,
sq_type: SQType(T),
uimplies: b supposing a,
rev_uimplies: rev_uimplies(P;Q),
so_apply: x[s],
bool: 
,
so_apply: x[s1;s2],
uall: [x:A]. B[x],
rsc4_ReplicaState: rsc4_ReplicaState(Cmd),
it: 
Lemmas :
assert_elim,
event-ordering+_wf,
valueall-type_wf,
rsc4_ReplicaState_wf,
es-le_weakening,
es-E_wf,
classrel_wf,
single-valued-bag-single,
single-valued-classrel-base,
simple-loc-comb-1-concat-single-val,
name_wf,
assert-name_eq,
base-disjoint-classrel,
simple-loc-comb-1-concat-disjoint-classrel,
disjoint-classrel-symm,
rsc4_vote'base_wf,
rsc4_vote2prop_wf,
concat-lifting-loc-1_wf,
simple-loc-comb-1_wf,
rsc4_propose'base_wf,
parallel-class-single-val,
es-le_wf,
Message_wf,
event-ordering+_inc,
es-locl_wf,
assert_of_bnot,
assert_of_band,
true_wf,
squash_wf,
bnot_thru_bor,
not_wf,
band_wf,
member-list-diff,
list-diff_wf,
bnot_of_lt_int,
assert_functionality_wrt_uiff,
eqff_to_assert,
bnot_wf,
from-upto-member,
member_append,
from-upto_wf,
append_wf,
uiff_transitivity,
assert-deq-member,
assert_of_bor,
eqtt_to_assert,
equal_wf,
iff_transitivity,
int-deq_wf,
deq-member_wf,
bor_wf,
decidable__or,
sq_stable_from_decidable,
sq_stable__all,
sq_stable__assert,
sq_stable__and,
not_functionality_wrt_iff,
decidable__assert,
assert_of_lt_int,
or_functionality_wrt_iff,
assert-int-list-member,
implies_functionality_wrt_iff,
all_functionality_wrt_iff,
iff_weakening_uiff,
less_than_wf,
l_member_wf,
le_wf,
and_functionality_wrt_iff,
bool_subtype_base,
bool_wf,
subtype_base_sq,
assert_of_le_int,
rsc4_Proposal_wf,
bag_wf,
Id_wf,
rsc4_init_wf,
rsc4_update_replica_wf,
lt_int_wf,
or_wf,
int-list-member_wf,
all_wf,
le_int_wf,
assert_wf,
and_wf,
Memory-class-trans-refl
\mforall{}es:EO'. \mforall{}e1,e2:E. \mforall{}Cmd:ValueAllType. \mforall{}zl,z:\mBbbZ{} \mtimes{} (\mBbbZ{} List).
((e1 <loc e2)
{}\mRightarrow{} zl \mmember{} rsc4\_ReplicaState(Cmd)(e1)
{}\mRightarrow{} z \mmember{} rsc4\_ReplicaState(Cmd)(e2)
{}\mRightarrow{} let max1,missing1 = zl
in let max2,missing2 = z
in (\muparrow{}max1 \mleq{}z max2)
\mwedge{} (\mforall{}x:\mBbbZ{}
((\muparrow{}int-list-member(x;missing2))
{}\mRightarrow{} ((\muparrow{}int-list-member(x;missing1)) \mvee{} (\muparrow{}max1 <z x)))))
Date html generated:
2012_02_20-PM-04_58_30
Last ObjectModification:
2012_02_02-PM-02_16_34
Home
Index