{ 
[Info:Type]
es:EO+(Info). X:EClass(Top). e:E.
(prior(X)(e) <loc e)
(
prior(X)(e) 
X)
(e'':E. ((e'' <loc e) 
(prior(X)(e) <loc e'') (
e'' X)))
supposing e prior(X) }
{ Proof }
Definitions occuring in Statement :
es-prior-interface: prior(X),
eclass-val: X(e),
in-eclass: e X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-locl: (e <loc e'),
es-E: E,
assert: b,
uimplies: b supposing a,
uall: [x:A]. B[x],
top: Top,
all: x:A. B[x],
not: A,
implies: P Q,
and: P Q,
universe: Type
Definitions :
outl: outl(x),
inr: inr x ,
bag_size_empty: bag_size_empty{bag_size_empty_compseq_tag_def:o},
null: null(as),
inl: inl x ,
Id: Id,
rev_implies: P 
Q,
exists: 
x:A. B[x],
iff: P Q,
bag_only_single: bag_only_single{bag_only_single_compseq_tag_def:o}(x),
bag_size_single: bag_size_single{bag_size_single_compseq_tag_def:o}(x),
cand: A c B,
fpf: a:A fp-> B[a],
strong-subtype: strong-subtype(A;B),
le: A 
B,
ge: i 
j ,
less_than: a < b,
uiff: uiff(P;Q),
bool: 
,
natural_number: $n,
real: 
,
grp_car: |g|,
int: 
,
nat: 
,
bag-size: bag-size(bs),
eq_int: (i =
j),
not: A,
sq_exists: x:{A| B[x]},
union: left + right,
or: P 
Q,
do-apply: do-apply(f;x),
can-apply: can-apply(f;x),
es-local-pred: last(P),
local-pred-class: local-pred-class(P),
eclass-val: X(e),
subtype: S 
T,
atom: Atom,
es-base-E: es-base-E(es),
token: "$token",
subtype_rel: A r B,
quotient: x,y:A//B[x; y],
es-E-interface: E(X),
dep-isect: Error :dep-isect,
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
record+: record+,
bag: bag(T),
set: {x:A| B[x]} ,
record-select: r.x,
top: Top,
es-prior-interface: prior(X),
universe: Type,
eclass: EClass(A[eo; e]),
so_lambda: 
x y.t[x; y],
all: x:A. B[x],
es-E: E,
event-ordering+: EO+(Info),
event_ordering: EO,
uimplies: b supposing a,
prop: 
,
es-locl: (e <loc e'),
product: x:A 
B[x],
es-causl: (e < e'),
infix_ap: x f y,
apply: f a,
assert: b,
ifthenelse: if b then t else f fi ,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
true: True,
false: False,
void: Void,
uall: [x:A]. B[x],
isect: 
x:A. B[x],
implies: P Q,
function: x:A 
B[x],
member: t T,
equal: s = t,
and: P Q,
MaAuto: Error :MaAuto,
CollapseTHEN: Error :CollapseTHEN,
D: Error :D,
CollapseTHENA: Error :CollapseTHENA,
RepUR: Error :RepUR,
Auto: Error :Auto,
in-eclass: e X,
lambda: x.A[x]
Lemmas :
event-ordering+_wf,
event-ordering+_inc,
subtype_rel_self,
es-base-E_wf,
es-E_wf,
es-E-interface_wf,
es-prior-interface_wf,
es-interface-subtype_rel2,
member_wf,
eclass_wf,
es-prior-interface_wf1,
top_wf,
es-prior-interface_wf0,
in-eclass_wf,
assert_wf,
subtype_rel_wf,
assert_witness,
es-local-pred-property,
es-locl_wf,
es-local-pred_wf,
not_wf,
eq_int_wf,
bag-size_wf,
nat_wf,
bag_wf,
bool_wf,
true_wf,
iff_wf,
false_wf,
es-causl_wf,
Id_wf,
ifthenelse_wf
\mforall{}[Info:Type]
\mforall{}es:EO+(Info). \mforall{}X:EClass(Top). \mforall{}e:E.
(prior(X)(e) <loc e)
\mwedge{} (\muparrow{}prior(X)(e) \mmember{}\msubb{} X)
\mwedge{} (\mforall{}e'':E. ((e'' <loc e) {}\mRightarrow{} (prior(X)(e) <loc e'') {}\mRightarrow{} (\mneg{}\muparrow{}e'' \mmember{}\msubb{} X)))
supposing \muparrow{}e \mmember{}\msubb{} prior(X)
Date html generated:
2011_08_16-PM-04_46_49
Last ObjectModification:
2011_06_20-AM-01_04_47
Home
Index