{ 
[Info:Type]
es:EO+(Info). X:EClass(Top). e:E.
(
e 
prior(X) 
e':E. ((e' <loc e) 
(e' X))) }
{ Proof }
Definitions occuring in Statement :
es-prior-interface: prior(X),
in-eclass: e X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-locl: (e <loc e'),
es-E: E,
assert: b,
uall: [x:A]. B[x],
top: Top,
all: x:A. B[x],
exists: x:A. B[x],
iff: P Q,
and: P Q,
universe: Type
Definitions :
infix_ap: x f y,
es-causl: (e < e'),
atom: Atom,
apply: f a,
es-base-E: es-base-E(es),
token: "$token",
lambda: 
x.A[x],
subtype: S 
T,
guard: {T},
fpf: a:A fp-> B[a],
quotient: x,y:A//B[x; y],
bag: bag(T),
es-E-interface: E(X),
strong-subtype: strong-subtype(A;B),
record-select: r.x,
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
dep-isect: Error :dep-isect,
record+: record+,
le: A 
B,
ge: i 
j ,
not: 
A,
less_than: a < b,
uimplies: b supposing a,
uiff: uiff(P;Q),
subtype_rel: A r B,
void: Void,
false: False,
true: True,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
ifthenelse: if b then t else f fi ,
prop: 
,
rev_implies: P Q,
es-prior-interface: prior(X),
in-eclass: e X,
top: Top,
equal: s = t,
member: t T,
set: {x:A| B[x]} ,
implies: P Q,
so_lambda: 
x.t[x],
iff: P Q,
exists: x:A. B[x],
and: P Q,
product: x:A 
B[x],
es-locl: (e <loc e'),
assert: b,
es-E: E,
event_ordering: EO,
eclass: EClass(A[eo; e]),
so_lambda: x y.t[x; y],
event-ordering+: EO+(Info),
universe: Type,
uall: [x:A]. B[x],
isect: 
x:A. B[x],
all: x:A. B[x],
function: x:A 
B[x],
MaAuto: Error :MaAuto,
Try: Error :Try,
CollapseTHEN: Error :CollapseTHEN,
Auto: Error :Auto,
ParallelOp: Error :ParallelOp,
tactic: Error :tactic
Lemmas :
es-prior-interface_wf0,
eclass_wf,
es-prior-interface_wf1,
top_wf,
es-prior-interface_wf,
in-eclass_wf,
true_wf,
ifthenelse_wf,
false_wf,
assert_wf,
subtype_rel_wf,
member_wf,
es-E_wf,
es-locl_wf,
assert_witness,
event-ordering+_wf,
iff_wf,
uall_wf,
is-prior-interface,
event-ordering+_inc,
es-interface-subtype_rel2,
es-E-interface_wf,
es-base-E_wf,
subtype_rel_self
\mforall{}[Info:Type]
\mforall{}es:EO+(Info). \mforall{}X:EClass(Top). \mforall{}e:E. (\muparrow{}e \mmember{}\msubb{} prior(X) \mLeftarrow{}{}\mRightarrow{} \mexists{}e':E. ((e' <loc e) \mwedge{} (\muparrow{}e' \mmember{}\msubb{} X)))
Date html generated:
2011_08_16-PM-04_46_13
Last ObjectModification:
2011_06_20-AM-01_04_16
Home
Index