{ 
[es:EO]. [p:E 
(E + Top)].
[e,e':E]. same-thread(es;p;e;e') supposing e = e'
supposing causal-predecessor(es;p) }
{ Proof }
Definitions occuring in Statement :
same-thread: same-thread(es;p;e;e'),
causal-predecessor: causal-predecessor(es;p),
es-E: E,
event_ordering: EO,
uimplies: b supposing a,
uall: [x:A]. B[x],
top: Top,
function: x:A B[x],
union: left + right,
equal: s = t
Definitions :
uall: [x:A]. B[x],
uimplies: b supposing a,
same-thread: same-thread(es;p;e;e'),
member: t 
T,
prop: 
,
squash: 
T,
true: True,
so_lambda: 
x y.t[x; y],
so_apply: x[s1;s2],
all: x:A. B[x],
implies: P 
Q
Lemmas :
es-E_wf,
causal-predecessor_wf,
top_wf,
event_ordering_wf,
final-iterate_wf,
squash_wf,
strongwellfounded_wf,
p-graph_wf2,
causal-pred-wellfounded
\mforall{}[es:EO]. \mforall{}[p:E {}\mrightarrow{} (E + Top)].
\mforall{}[e,e':E]. same-thread(es;p;e;e') supposing e = e' supposing causal-predecessor(es;p)
Date html generated:
2011_08_16-AM-11_16_48
Last ObjectModification:
2011_06_20-AM-00_22_26
Home
Index