{ 
es:EO. e:E.
case es-pred?(es;e)
of inl(p) =>
(loc(p) = loc(e))
(p < e)
(e':E. (e' < e) 
((e' = p) 
(e' < p)) supposing loc(e') = loc(e))
| inr(z) =>
e':E. 
(e' < e) supposing loc(e') = loc(e) }
{ Proof }
Definitions occuring in Statement :
es-pred?: es-pred?(es;e),
es-causl: (e < e'),
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
uimplies: b supposing a,
all: x:A. B[x],
not: A,
implies: P Q,
or: P Q,
and: P Q,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
equal: s = t
Definitions :
all: x:A. B[x],
es-pred?: es-pred?(es;e),
and: P Q,
implies: P Q,
iff: P 
Q,
member: t 
T,
prop: 
,
rev_implies: P Q,
so_lambda: 
x.t[x],
list_accum: list_accum(x,a.f[x; a];y;l),
ycomb: Y,
uimplies: b supposing a,
not: A,
false: False,
cand: A c B,
or: P Q,
guard: {T},
ifthenelse: if b then t else f fi ,
btrue: tt,
bfalse: ff,
uall: [x:A]. B[x],
so_apply: x[s],
decidable: Dec(P),
bool: 
,
unit: Unit,
it: 
Lemmas :
filter_wf,
es-pred-list_wf,
es-E_wf,
event_ordering_wf,
iff_wf,
l_member_wf,
eq_id_wf,
es-loc_wf,
Id_wf,
es-causl_wf,
assert_wf,
decidable__es-causl,
all_functionality_wrt_iff,
iff_functionality_wrt_iff,
iff_transitivity,
member_filter,
and_functionality_wrt_iff,
member-es-pred-list,
iff_weakening_uiff,
and_functionality_wrt_uiff3,
assert-eq-id,
false_wf,
nil_member,
cons_member,
es-bcausl_wf,
bool_wf,
eqtt_to_assert,
assert-es-bcausl,
not_wf,
uiff_transitivity,
bnot_wf,
eqff_to_assert,
assert_of_bnot,
not_functionality_wrt_iff,
es-causl_transitivity,
es-causl-total
\mforall{}es:EO. \mforall{}e:E.
case es-pred?(es;e)
of inl(p) =>
(loc(p) = loc(e))
\mwedge{} (p < e)
\mwedge{} (\mforall{}e':E. (e' < e) {}\mRightarrow{} ((e' = p) \mvee{} (e' < p)) supposing loc(e') = loc(e))
| inr(z) =>
\mforall{}e':E. \mneg{}(e' < e) supposing loc(e') = loc(e)
Date html generated:
2011_08_16-AM-10_25_08
Last ObjectModification:
2011_06_18-AM-09_09_29
Home
Index