{ 
es:EO. i:Id.
[R:{e:E| loc(e) = i} 
]
e:E
((e:E. Dec(R[e]) supposing loc(e) = i)
(
e':E. (e' 
loc e c
R[e']))
(e':E
(e' loc e
c (R[e']
(e'':E. ((e' <loc e'') e'' loc e (
R[e'']))))))
supposing loc(e) = i) }
{ Proof }
Definitions occuring in Statement :
es-le: e loc e' ,
es-locl: (e <loc e'),
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
decidable: Dec(P),
uimplies: b supposing a,
uall: [x:A]. B[x],
cand: A c B,
prop: ,
so_apply: x[s],
all: x:A. B[x],
exists: x:A. B[x],
not: A,
implies: P Q,
and: 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,
uimplies: b supposing a,
so_apply: x[s],
exists: x:A. B[x],
cand: A c B,
and: P Q,
member: t 
T,
so_lambda: 
x.t[x],
es-le: e loc e' ,
or: P 
Q,
guard: {T},
es-locl: (e <loc e'),
wellfounded: WellFnd{i}(A;x,y.R[x; y]),
decidable: Dec(P),
not: A,
iff: P 
Q,
false: False,
rev_implies: P Q
Lemmas :
es-E_wf,
es-loc_wf,
Id_wf,
event_ordering_wf,
decidable_wf,
es-le_wf,
es-locl_wf,
not_wf,
es-le-loc,
es-locl-wellfnd,
es-le-not-locl,
decidable__assert,
es-first_wf,
es-le-iff,
es-pred_wf,
es-pred-locl,
es-loc-pred,
es-le-pred,
es-locl_transitivity1,
es-le_weakening,
member_wf
\mforall{}es:EO. \mforall{}i:Id.
\mforall{}[R:\{e:E| loc(e) = i\} {}\mrightarrow{} \mBbbP{}]
\mforall{}e:E
((\mforall{}e:E. Dec(R[e]) supposing loc(e) = i)
{}\mRightarrow{} (\mexists{}e':E. (e' \mleq{}loc e c\mwedge{} R[e']))
{}\mRightarrow{} (\mexists{}e':E
(e' \mleq{}loc e c\mwedge{} (R[e'] \mwedge{} (\mforall{}e'':E. ((e' <loc e'') {}\mRightarrow{} e'' \mleq{}loc e {}\mRightarrow{} (\mneg{}R[e'']))))))
supposing loc(e) = i)
Date html generated:
2011_08_16-AM-10_51_15
Last ObjectModification:
2011_06_18-AM-09_26_18
Home
Index