{ 
es:EO. p:E 
(E + Top).
(causal-predecessor(es;p)
(e,e',a,b:E. (a c
e e p e' e' p< b (a < b)))) }
{ Proof }
Definitions occuring in Statement :
es-p-le: e p e',
es-p-locl: e p< e',
causal-predecessor: causal-predecessor(es;p),
es-causle: e c e',
es-causl: (e < e'),
es-E: E,
event_ordering: EO,
top: Top,
all: x:A. B[x],
implies: P Q,
function: x:A B[x],
union: left + right
Definitions :
equal: s = t,
member: t 
T,
function: x:A B[x],
all: x:A. B[x],
event_ordering: EO,
top: Top,
es-E: E,
union: left + right,
dep-isect: Error :dep-isect,
record-select: r.x,
infix_ap: x f y,
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
record+: record+,
causal-predecessor: causal-predecessor(es;p),
apply: f a,
implies: P Q,
assert: 
b,
es-causl: (e < e'),
es-causle: e c e',
es-p-le: e p e',
or: P 
Q,
es-p-locl: e p< e',
p-graph: p-graph(A;f),
true: True,
es-le: e loc e' ,
es-locl: (e <loc e'),
do-apply: do-apply(f;x),
product: x:A 
B[x],
exists: 
x:A. B[x],
subtype_rel: A 
r B,
strong-subtype: strong-subtype(A;B),
nat_plus: 
,
l_member: (x l),
so_apply: x[s],
guard: {T},
prop: 
,
MaAuto: Error :MaAuto,
tactic: Error :tactic
Lemmas :
es-causl_wf,
es-causl_weakening_p-locl,
es-causle_weakening_p-le,
es-causle_transitivity,
es-causl_transitivity1,
es-p-locl_wf,
es-p-le_wf,
es-causle_wf,
causal-predecessor_wf,
es-E_wf,
top_wf,
event_ordering_wf
\mforall{}es:EO. \mforall{}p:E {}\mrightarrow{} (E + Top).
(causal-predecessor(es;p) {}\mRightarrow{} (\mforall{}e,e',a,b:E. (a c\mleq{} e {}\mRightarrow{} e p\mleq{} e' {}\mRightarrow{} e' p< b {}\mRightarrow{} (a < b))))
Date html generated:
2011_08_16-AM-11_16_30
Last ObjectModification:
2010_09_24-PM-08_44_40
Home
Index