Nuprl Lemma : Paxos-spec6-NoProposal-invariant
[Info:Type]
es:EO+(Info). failset:Id List.
[T:Type]
f:
. acceptors:Id List. Reserve,NoProposal,NewBallot:EClass(). VoteState:EClass(AcceptorState).
Proposal:EClass( 
T). AcceptOrReject:EClass( T 
). leader: 
Id. Decide,Input:EClass(T).
Vote:EClass(Id ). Collect:EClass( 
T).
(Paxos-spec6-body{i:l}(Info;es;T;f;acceptors;
Reserve;VoteState;Proposal;
AcceptOrReject;leader;Decide;
Vote;Input;Collect;NoProposal;
NewBallot;failset)
(np:E(NoProposal)
((loc(np) = (leader NoProposal(np)))
(
p:E(Proposal). ((p < np) (NoProposal(np) 
(fst(Proposal(p)))))))))
Proof not projected
Definitions occuring in Statement :
Paxos-spec6-body: Paxos-spec6-body,
paxos-acceptor-state: AcceptorState,
es-E-interface: E(X),
eclass-val: X(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-causl: (e < e'),
es-loc: loc(e),
Id: Id,
bool: ,
nat_plus: ,
nat: ,
uall: [x:A]. B[x],
pi1: fst(t),
le: A B,
all: x:A. B[x],
exists: x:A. B[x],
implies: P Q,
and: P Q,
apply: f a,
function: x:A B[x],
product: x:A B[x],
list: type List,
int: ,
universe: Type,
equal: s = t
Definitions :
squash: 
T,
bag_only_single: bag_only_single{bag_only_single_compseq_tag_def:o}(x),
bag_size_single: bag_size_single{bag_size_single_compseq_tag_def:o}(x),
permutation: permutation(T;L1;L2),
quotient: x,y:A//B[x; y],
axiom: Ax,
bag-only: only(bs),
bag_size_empty: bag_size_empty{bag_size_empty_compseq_tag_def:o},
lt_int: i <z j,
bfalse: ff,
limited-type: LimitedType,
null: null(as),
set_blt: a <
b,
grp_blt: a < b,
dcdr-to-bool: [d],
bl-all: (x
L.P[x])_b,
bl-exists: (xL.P[x])_b,
b-exists: (i<n.P[i])_b,
eq_type: eq_type(T;T'),
qeq: qeq(r;s),
q_less: q_less(r;s),
q_le: q_le(r;s),
deq-member: deq-member(eq;x;L),
deq-disjoint: deq-disjoint(eq;as;bs),
deq-all-disjoint: deq-all-disjoint(eq;ass;bs),
eq_id: a = b,
eq_lnk: a = b,
es-eq-E: e = e',
es-bless: e <loc e',
es-ble: e loc e',
bimplies: p q,
band: p q,
bor: p 
q,
bag-size: bag-size(bs),
eq_int: (i =
j),
bnot: 
b,
unit: Unit,
eclass-compose1: f o X,
grp_car: |g|,
atom: Atom,
es-base-E: es-base-E(es),
token: "$token",
cand: A c B,
alle-lt: e<e'.P[e],
es-le: e loc e' ,
fpf: a:A fp-> B[a],
guard: {T},
btrue: tt,
sq_type: SQType(T),
true: True,
rev_implies: P 
Q,
iff: P Q,
union: left + right,
or: P Q,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
es-class-causal-mrel-fail: es-class-causal-mrel-fail,
es-class-def: es-class-def,
es-class-causal-rel-fail: es-class-causal-rel-fail,
strong-subtype: strong-subtype(A;B),
ge: i 
j ,
uimplies: b supposing a,
uiff: uiff(P;Q),
subtype_rel: A 
r B,
void: Void,
false: False,
real: 
,
rationals: 
,
prop: 
,
dep-isect: Error :dep-isect,
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
record+: record+,
bag: bag(T),
record-select: r.x,
infix_ap: x f y,
pair: <a, b>,
subtype: S T,
es-E: E,
es-locl: (e <loc e'),
es-causle: e c e',
l_all: (xL.P[x]),
no_repeats: no_repeats(T;l),
add: n + m,
length: ||as||,
l_member: (x l),
apply: f a,
es-loc: loc(e),
bool: ,
paxos-acceptor-state: AcceptorState,
member: t T,
nat_plus: ,
list: type List,
so_lambda: 
x y.t[x; y],
Paxos-spec6-body: Paxos-spec6-body,
set: {x:A| B[x]} ,
Id: Id,
top: Top,
event-ordering+: EO+(Info),
event_ordering: EO,
isect: 
x:A. B[x],
uall: [x:A]. B[x],
so_lambda: x.t[x],
function: x:A B[x],
product: x:A B[x],
MaAuto: Error :MaAuto,
CollapseTHEN: Error :CollapseTHEN,
RepeatFor: Error :RepeatFor,
empty-bag: {},
single-bag: {x},
le_int: i z j,
ifthenelse: if b then t else f fi ,
spreadn: spread3,
lambda: x.A[x],
es-filter-image: f[X],
nat: ,
eclass: EClass(A[eo; e]),
equal: s = t,
CollapseTHENA: Error :CollapseTHENA,
eclass-val: X(e),
pi1: fst(t),
pi2: snd(t),
less_than: a < b,
not: A,
and: P Q,
in-eclass: e X,
assert: 
b,
AssertBY: Error :AssertBY,
Auto: Error :Auto,
D: Error :D,
paxos-state-ballot: Ballot(s),
int: ,
es-causl: (e < e'),
es-E-interface: E(X),
exists: x:A. B[x],
natural_number: $n,
le: A B,
implies: P Q,
all: x:A. B[x],
universe: Type,
THENM: Error :THENM,
so_apply: x[s],
id-deq: IdDeq,
paxos-state-info: Info(s),
es-tagged-true-class: Tagged_tt(X),
MaxVote: MaxVote(es;T;Vote;e;s),
paxos-state-name: Name(s),
paxos-state-value: Value(s),
minus: -n,
list-max: list-max(x.f[x];L),
spread: spread def,
mapfilter: mapfilter(f;P;L),
let: let,
paxos-state-reservation: Reservation(s),
es-prior-val: (X)',
es-interface-predecessors: (X)(e),
eq_bool: p =b q,
filter: filter(P;l),
es-first-at: e is first@ i s.t. e.P[e],
multiply: n * m,
it: 
,
proper-iseg: L1 < L2,
iseg: l1 l2,
l_exists: (xL. P[x]),
gt: i > j,
map: map(f;as),
eq_knd: a = b,
fpf-dom: x dom(f),
intensional-universe: IType,
nil: [],
list_ind: list_ind def,
int_eq: if a=b then c else d,
atom_eq: atomeqn def,
sqequal: s ~ t,
append: as @ bs,
locl: locl(a),
Knd: Knd,
atom: Atom$n,
IdLnk: IdLnk,
divides: b | a,
assoced: a ~ b,
set_leq: a b,
set_lt: a <p b,
grp_lt: a < b,
l_contains: A B,
reducible: reducible(a),
prime: prime(a),
fun-connected: y is f*(x),
qle: r s,
qless: r < s,
q-rel: q-rel(r;x),
sq_exists: x:{A| B[x]},
i-finite: i-finite(I),
i-closed: i-closed(I),
p-outcome: Outcome,
fset-member: a s,
f-subset: xs ys,
fset-closed: (s closed under fs),
l_disjoint: l_disjoint(T;l1;l2),
cs-not-completed: in state s, a has not completed inning i,
cs-archived: by state s, a archived v in inning i,
cs-passed: by state s, a passed inning i without archiving a value,
cs-inning-committed: in state s, inning i has committed v,
cs-inning-committable: in state s, inning i could commit v ,
cs-archive-blocked: in state s, ws' blocks ws from archiving v in inning i,
cs-precondition: state s may consider v in inning i,
existse-before: e<e'.P[e],
existse-le: ee'.P[e],
alle-le: ee'.P[e],
alle-between1: e[e1,e2).P[e],
existse-between1: e[e1,e2).P[e],
alle-between2: e[e1,e2].P[e],
existse-between2: e[e1,e2].P[e],
existse-between3: e(e1,e2].P[e],
es-fset-loc: i locs(s),
es-r-immediate-pred: es-r-immediate-pred(es;R;e';e),
same-thread: same-thread(es;p;e;e'),
collect-event: collect-event(es;X;n;v.num[v];L.P[L];e),
cut-order: a (X;f) b,
path-goes-thru: x-f*-y thru i,
lg-edge: lg-edge(g;a;b),
ses-action: Action(e),
ses-legal-sequence: Legal(pas) given prvt,
decidable: Dec(P),
uni_sat: a = !x:T. Q[x],
inv_funs: InvFuns(A;B;f;g),
inject: Inj(A;B;f),
eqfun_p: IsEqFun(T;eq),
refl: Refl(T;x,y.E[x; y]),
urefl: UniformlyRefl(T;x,y.E[x; y]),
sym: Sym(T;x,y.E[x; y]),
usym: UniformlySym(T;x,y.E[x; y]),
trans: Trans(T;x,y.E[x; y]),
utrans: UniformlyTrans(T;x,y.E[x; y]),
anti_sym: AntiSym(T;x,y.R[x; y]),
uanti_sym: UniformlyAntiSym(T;x,y.R[x; y]),
connex: Connex(T;x,y.R[x; y]),
uconnex: uconnex(T; x,y.R[x; y]),
coprime: CoPrime(a,b),
ident: Ident(T;op;id),
assoc: Assoc(T;op),
comm: Comm(T;op),
inverse: Inverse(T;op;id;inv),
bilinear: BiLinear(T;pl;tm),
bilinear_p: IsBilinear(A;B;C;+a;+b;+c;f),
action_p: IsAction(A;x;e;S;f),
dist_1op_2op_lr: Dist1op2opLR(A;1op;2op),
fun_thru_1op: fun_thru_1op(A;B;opa;opb;f),
fun_thru_2op: FunThru2op(A;B;opa;opb;f),
cancel: Cancel(T;S;op),
monot: monot(T;x,y.R[x; y];f),
monoid_p: IsMonoid(T;op;id),
group_p: IsGroup(T;op;id;inv),
monoid_hom_p: IsMonHom{M1,M2}(f),
grp_leq: a b,
integ_dom_p: IsIntegDom(r),
prime_ideal_p: IsPrimeIdeal(R;P),
value-type: value-type(T),
valueall-type: valueall-type(T),
is_list_splitting: is_list_splitting(T;L;LL;L2;f),
is_accum_splitting: is_accum_splitting(T;A;L;LL;L2;f;g;x),
req: x = y,
rnonneg: rnonneg(r),
rleq: x y,
i-member: r I,
partitions: partitions(I;p),
modulus-of-ccontinuity: modulus-of-ccontinuity(omega;I;f),
fpf-sub: f g,
sq_stable: SqStable(P),
cons: [car / cdr],
es-p-le: e p e',
es-p-locl: e p< e',
causal-predecessor: causal-predecessor(es;p),
record: record(x.T[x]),
es-before: before(e),
es-le-before: loc(e),
hd: hd(l),
last: last(L),
remove-repeats: remove-repeats(eq;L),
select: l[i],
runEvents: runEvents(r)
Lemmas :
es-causl_transitivity2,
es-causle_wf,
decidable__es-causle,
es-causle_weakening_locl,
l_member-settype,
es-le_wf,
decidable__equal_es-E-interface,
decidable__l_member,
member-interface-predecessors,
sq_stable__and,
decidable__es-causl,
member-mapfilter,
property-from-l_member,
sq_stable_wf,
sq_stable__equal,
sq_stable_from_decidable,
list-set-type2,
l_all_wf,
list-max-property2,
length-map,
filter_type,
list-subtype,
l_member_wf,
uiff_wf,
assert-eq-id,
nat_properties,
btrue_wf,
bfalse_wf,
unit_wf,
intensional-universe_wf,
es-interface-val_wf2,
pos-length,
equal-nil-sq-nil,
mapfilter_wf,
list-max_wf,
pos_length2,
es-loc_wf,
paxos-state-reservation_wf,
es-interface-predecessors_wf,
filter_wf,
length_wf1,
es-locl_wf,
assert_witness,
length_wf_nat,
es-prior-val_wf,
product_subtype_base,
Id_wf,
es-E-interface_wf,
es-causl_wf,
le_wf,
event-ordering+_wf,
uall_wf,
nat_plus_wf,
eclass_wf,
nat_wf,
Paxos-spec6-body_wf,
Paxos-spec6-Collect-invariant,
es-E_wf,
event-ordering+_inc,
paxos-acceptor-state_wf,
bool_wf,
nat_plus_properties,
nat_plus_inc,
eclass-val_wf,
paxos-state-ballot_wf,
member_wf,
assert_wf,
false_wf,
ifthenelse_wf,
in-eclass_wf,
true_wf,
subtype_base_sq,
bool_subtype_base,
assert_elim,
es-interface-top,
subtype_rel_wf,
Paxos-spec6-VoteState-invariant,
not_wf,
pi1_wf_top,
top_wf,
es-base-E_wf,
subtype_rel_self,
pi2_wf,
bag_wf,
uiff_transitivity,
eqtt_to_assert,
assert_of_eq_int,
bag-size_wf,
eqff_to_assert,
assert_of_bnot,
not_functionality_wrt_uiff,
bnot_wf,
eq_int_wf,
bag-only_wf,
pi1_wf,
permutation_wf,
assert_of_le_int,
assert_functionality_wrt_uiff,
bnot_of_le_int,
assert_of_lt_int,
lt_int_wf,
le_int_wf,
set_subtype_base,
int_subtype_base
\mforall{}[Info:Type]
\mforall{}es:EO+(Info). \mforall{}failset:Id List.
\mforall{}[T:Type]
\mforall{}f:\mBbbN{}\msupplus{}. \mforall{}acceptors:Id List. \mforall{}Reserve,NoProposal,NewBallot:EClass(\mBbbN{}).
\mforall{}VoteState:EClass(AcceptorState). \mforall{}Proposal:EClass(\mBbbN{} \mtimes{} T). \mforall{}AcceptOrReject:EClass(\mBbbN{} \mtimes{} T \mtimes{} \mBbbB{}).
\mforall{}leader:\mBbbN{} {}\mrightarrow{} Id. \mforall{}Decide,Input:EClass(T). \mforall{}Vote:EClass(Id \mtimes{} \mBbbN{} \mtimes{} \mBbbB{}).
\mforall{}Collect:EClass(\mBbbN{} \mtimes{} \mBbbZ{} \mtimes{} T).
(Paxos-spec6-body\{i:l\}(Info;es;T;f;acceptors;
Reserve;VoteState;Proposal;
AcceptOrReject;leader;Decide;
Vote;Input;Collect;NoProposal;
NewBallot;failset)
{}\mRightarrow{} (\mforall{}np:E(NoProposal)
((loc(np) = (leader NoProposal(np)))
\mwedge{} (\mexists{}p:E(Proposal). ((p < np) \mwedge{} (NoProposal(np) \mleq{} (fst(Proposal(p)))))))))
Date html generated:
2011_10_20-PM-04_38_22
Last ObjectModification:
2011_06_18-PM-02_03_07
Home
Index