{ es:EO. e':E.
    [P:{e:E| loc(e) = loc(e')}   ]
      (e@loc(e').Dec(P[e])  (e<e'.P[e]  e<e'.P[e])) }

{ Proof }



Definitions occuring in Statement :  alle-lt: e<e'.P[e] existse-before: e<e'.P[e] alle-at: e@i.P[e] es-loc: loc(e) es-E: E event_ordering: EO Id: Id decidable: Dec(P) uall: [x:A]. B[x] prop: so_apply: x[s] all: x:A. B[x] iff: P  Q not: A implies: P  Q set: {x:A| B[x]}  function: x:A  B[x] equal: s = t
Definitions :  all: x:A. B[x] uall: [x:A]. B[x] prop: implies: P  Q so_apply: x[s] iff: P  Q not: A and: P  Q rev_implies: P  Q member: t  T false: False so_lambda: x.t[x] alle-at: e@i.P[e] alle-lt: e<e'.P[e] existse-before: e<e'.P[e] exists: x:A. B[x] cand: A c B decidable: Dec(P) or: P  Q es-locl: (e <loc e')
Lemmas :  alle-lt_wf es-E_wf Id_wf es-loc_wf not_wf existse-before_wf alle-at_wf decidable_wf event_ordering_wf decidable__existse-before decidable__not es-locl_wf

\mforall{}es:EO.  \mforall{}e':E.
    \mforall{}[P:\{e:E|  loc(e)  =  loc(e')\}    {}\mrightarrow{}  \mBbbP{}].  (\mforall{}e@loc(e').Dec(P[e])  {}\mRightarrow{}  (\mneg{}\mforall{}e<e'.P[e]  \mLeftarrow{}{}\mRightarrow{}  \mexists{}e<e'.\mneg{}P[e]))


Date html generated: 2011_08_16-AM-10_45_58
Last ObjectModification: 2011_06_18-AM-09_21_26

Home Index