{ 
[Info:Type]
eo:EO+(Info). e:E. e':E.
uiff(
first(e');(e' = e) 
((
(loc(e') = loc(e))) 
(first(e')))) }
{ Proof }
Definitions occuring in Statement :
eo-forward: eo.e,
event-ordering+: EO+(Info),
es-first: first(e),
es-loc: loc(e),
es-E: E,
Id: Id,
assert: b,
uiff: uiff(P;Q),
uall: [x:A]. B[x],
all: x:A. B[x],
not: A,
or: P Q,
and: P Q,
universe: Type,
equal: s = t
Definitions :
es-loc: loc(e),
es-first: first(e),
sqequal: s ~ t,
subtype: S 
T,
member: t 
T,
uimplies: b supposing a,
so_lambda: 
x.t[x],
uiff: uiff(P;Q),
or: P Q,
union: left + right,
and: P Q,
product: x:A 
B[x],
not: A,
equal: s = t,
Id: Id,
assert: b,
event_ordering: EO,
event-ordering+: EO+(Info),
universe: Type,
uall: [x:A]. B[x],
isect: 
x:A. B[x],
function: x:A 
B[x],
all: x:A. B[x],
Auto: Error :Auto,
CollapseTHEN: Error :CollapseTHEN,
es-E: E,
eo-forward: eo.e,
subtype_rel: A r B,
AssertBY: Error :AssertBY,
ParallelOp: Error :ParallelOp,
RepeatFor: Error :RepeatFor,
tactic: Error :tactic,
limited-type: LimitedType,
prop: 
,
atom: Atom,
top: Top,
es-base-E: es-base-E(es),
token: "$token",
rev_implies: P 
Q,
implies: P 
Q,
iff: P Q,
eq_id: a = b,
ifthenelse: if b then t else f fi ,
fpf-cap: f(x)?z,
strong-subtype: strong-subtype(A;B),
record-select: r.x,
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
set: {x:A| B[x]} ,
dep-isect: Error :dep-isect,
record+: record+,
le: A 
B,
ge: i 
j ,
less_than: a < b,
deq: EqDecider(T),
es-eq: es-eq(es),
apply: f a,
bool: 
,
eqof: eqof(d),
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,
squash: 
T,
sq_stable: SqStable(P),
so_apply: x[s],
guard: {T},
eq_knd: a = b,
l_member: (x l),
fpf-dom: x dom(f),
void: Void,
false: False,
true: True,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
es-eq-E: e = e',
int: 
,
unit: Unit,
bnot: 
b,
bor: p q,
band: p q,
bimplies: p q,
eq_lnk: a = b,
btrue: tt,
bfalse: ff,
le_int: i z j,
lt_int: i <z j,
sq_type: SQType(T),
IdLnk: IdLnk,
Knd: Knd,
MaName: MaName,
consensus-state3: consensus-state3(T),
consensus-rcv: consensus-rcv(V;A),
divides: b | a,
assoced: a ~ b,
set_leq: a b,
set_lt: a <p b,
grp_lt: a < b,
l_contains: A B,
inject: Inj(A;B;f),
reducible: reducible(a),
prime: prime(a),
l_exists: (
xL. P[x]),
l_all: (xL.P[x]),
fun-connected: y is f*(x),
qle: r s,
qless: r < s,
q-rel: q-rel(r;x),
list: type List,
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-archive-blocked: in state s, ws' blocks ws from archiving v in inning i,
cs-precondition: state s may consider v in inning i,
cs-inning-committed: in state s, inning i has committed v,
cs-inning-committable: in state s, inning i could commit v ,
nat: 
,
infix_ap: x f y,
es-causl: (e < e'),
es-locl: (e <loc e'),
es-le: e loc e' ,
es-causle: e c e',
existse-before: e<e'.P[e],
existse-le: ee'.P[e],
alle-lt: e<e'.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),
exists: x:A. B[x],
es-r-immediate-pred: es-r-immediate-pred(es;R;e';e),
same-thread: same-thread(es;p;e;e'),
decidable: Dec(P),
cand: A c B,
pair: <a, b>
Lemmas :
squash_wf,
event_ordering_wf,
member_wf,
decidable__assert,
decidable__equal_Id,
decidable__not,
decidable__cand,
decidable_wf,
uiff_inversion,
or_functionality_wrt_uiff2,
subtype_base_sq,
bool_subtype_base,
assert_elim,
eqtt_to_assert,
eqff_to_assert,
uiff_transitivity,
assert_of_bnot,
not_functionality_wrt_uiff,
assert-eq-id,
bnot_wf,
eq_id_wf,
es-loc_wf,
es-first_wf,
eo-forward-loc,
es-eq-E_wf,
true_wf,
ifthenelse_wf,
false_wf,
assert_witness,
assert-es-eq-E,
iff_weakening_uiff,
rev_implies_wf,
uiff_functionality_wrt_uiff2,
sq_stable__assert,
subtype_rel_self,
es-base-E_wf,
iff_wf,
bool_wf,
subtype_rel_wf,
deq_wf,
es-eq_wf,
eo-forward-first,
uall_wf,
Id_wf,
not_wf,
assert_wf,
uiff_wf,
es-E_wf,
eo-forward_wf,
event-ordering+_inc,
event-ordering+_wf,
eo-forward-E-subtype
\mforall{}[Info:Type]
\mforall{}eo:EO+(Info). \mforall{}e:E. \mforall{}e':E. uiff(\muparrow{}first(e');(e' = e) \mvee{} ((\mneg{}(loc(e') = loc(e))) \mwedge{} (\muparrow{}first(e'))))
Date html generated:
2011_08_16-AM-11_25_54
Last ObjectModification:
2011_06_20-AM-00_26_30
Home
Index