{ 
the_es:EO. e,e',y:E. (e' before y 
loc(e) 
(e' <loc y) 
y loc e ) }
{ Proof }
Definitions occuring in Statement :
es-le-before: loc(e),
es-le: e loc e' ,
es-locl: (e <loc e'),
es-E: E,
event_ordering: EO,
all: x:A. B[x],
iff: P Q,
and: P Q,
l_before: x before y l
Definitions :
es-le-before: loc(e),
iff: P Q,
and: P Q,
product: x:A 
B[x],
event_ordering: EO,
es-E: E,
isect: 
x:A. B[x],
member: t T,
equal: s = t,
all: x:A. B[x],
function: x:A 
B[x],
uall: [x:A]. B[x],
Unfold: Error :Unfold,
Auto: Error :Auto,
CollapseTHENA: Error :CollapseTHENA,
CollapseTHEN: Error :CollapseTHEN,
tactic: Error :tactic,
limited-type: LimitedType,
universe: Type,
prop: 
,
list: type List,
nil: [],
cons: [car / cdr],
set: {x:A| B[x]} ,
es-before: before(e),
append: as @ bs,
rev_implies: P Q,
l_member: (x l),
implies: P Q,
es-le: e loc e' ,
es-locl: (e <loc e'),
or: P 
Q,
union: left + right,
l_before: x before y l,
increasing: increasing(f;k),
int_seg: {i..j
},
divides: b | a,
assoced: a ~ b,
set_leq: a b,
set_lt: a <p b,
grp_lt: a < b,
void: Void,
false: False,
pair: <a, b>,
l_contains: A 
B,
inject: Inj(A;B;f),
reducible: reducible(a),
prime: prime(a),
squash: 
T,
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),
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: 
,
exists: x:A. B[x],
decidable: Dec(P),
es-causle: e c e',
true: True,
es-pred: pred(e),
sublist: L1 L2,
bool: 
,
Knd: Knd,
IdLnk: IdLnk,
cand: A c B,
so_apply: x[s],
guard: {T},
apply: f a,
strong-subtype: strong-subtype(A;B),
assert: 
b,
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
record-select: r.x,
infix_ap: x f y,
tl: tl(l),
hd: hd(l),
dep-isect: Error :dep-isect,
record+: record+,
le: A B,
ge: i 
j ,
not: 
A,
less_than: a < b,
uimplies: b supposing a,
uiff: uiff(P;Q),
subtype_rel: A r B,
Id: Id,
es-causl: (e < e'),
MaAuto: Error :MaAuto,
RepeatFor: Error :RepeatFor,
Complete: Error :Complete,
D: Error :D,
Try: Error :Try
Lemmas :
es-le_weakening,
singleton_before,
Id_wf,
es-causl_wf,
uiff_inversion,
es-causle-le,
decidable__cand,
decidable__es-locl,
decidable__es-E-equal,
sublist_wf,
int_seg_wf,
increasing_wf,
l_member_wf,
l_before_wf,
iff_functionality_wrt_iff,
es-locl_wf,
es-le_wf,
es-before_wf,
append_wf,
rev_implies_wf,
iff_wf,
l_before_append_iff,
or_functionality_wrt_iff,
l_before-es-before-iff,
and_functionality_wrt_iff,
member-es-before,
member_singleton,
es-E_wf,
event_ordering_wf
\mforall{}the$_{es}$:EO. \mforall{}e,e',y:E. (e' before y \mmember{} \mleq{}loc(e) \mLeftarrow{}{}\mRightarrow{} (e' <loc y) \mwedge{} y \mleq{}loc e )
Date html generated:
2011_08_16-AM-10_38_33
Last ObjectModification:
2010_12_05-PM-11_52_01
Home
Index