{ 
es:EO. e:E. 
L:E List. e':E. ((e' 
L) 
e' c
e) }
{ Proof }
Definitions occuring in Statement :
es-causle: e c e',
es-E: E,
event_ordering: EO,
all: x:A. B[x],
exists: x:A. B[x],
iff: P Q,
list: type List,
l_member: (x l)
Definitions :
event_ordering: EO,
product: x:A 
B[x],
and: P 
Q,
iff: P Q,
es-E: E,
function: x:A 
B[x],
all: x:A. B[x],
l_member: (x l),
es-causl: (e < e'),
implies: P Q,
rev_implies: P Q,
es-causle: e c e',
member: t T,
equal: s = t,
prop: 
,
list: type List,
exists: x:A. B[x],
subtype_rel: A 
r B,
strong-subtype: strong-subtype(A;B),
apply: f a,
record-select: r.x,
dep-isect: Error :dep-isect,
infix_ap: x f y,
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
record+: record+,
ParallelOp: Error :ParallelOp,
Auto: Error :Auto,
es-pred-list: es-pred-list(es;e),
cons: [car / cdr],
CollapseTHENA: Error :CollapseTHENA,
CollapseTHEN: Error :CollapseTHEN,
tactic: Error :tactic,
universe: Type,
union: left + right,
or: P 
Q,
limited-type: LimitedType,
false: False,
not: 
A,
void: Void,
bool: 
,
es-le: e loc e' ,
es-locl: (e <loc e'),
pair: <a, b>,
guard: {T},
decidable: Dec(P),
existse-before: e<e'.P[e],
existse-le: ee'.P[e],
alle-lt: e<e'.P[e],
alle-le: ee'.P[e],
alle-between1: e[e1,e2).P[e],
existse-between1: e[e1,e2).P[e],
alle-between2: e[e1,e2].P[e],
existse-between2: e[e1,e2].P[e],
existse-between3: e(e1,e2].P[e],
es-fset-loc: i locs(s),
Knd: Knd,
IdLnk: IdLnk,
Id: Id,
so_apply: x[s],
assert: 
b,
fpf: a:A fp-> B[a],
less_than: a < b,
int: 
,
MaAuto: Error :MaAuto
Lemmas :
decidable__es-causl,
decidable__es-E-equal,
iff_functionality_wrt_iff,
iff_transitivity,
cons_member,
or_functionality_wrt_iff,
rev_implies_wf,
es-causl_wf,
event_ordering_wf,
member-es-pred-list,
es-pred-list_wf,
es-causle_wf,
l_member_wf,
iff_wf,
es-E_wf
\mforall{}es:EO. \mforall{}e:E. \mexists{}L:E List. \mforall{}e':E. ((e' \mmember{} L) \mLeftarrow{}{}\mRightarrow{} e' c\mleq{} e)
Date html generated:
2011_08_16-AM-11_11_14
Last ObjectModification:
2010_09_24-PM-08_48_40
Home
Index