{ 
[Info:Type]. [eo:EO+(Info)]. [e:E].
({e':E| (loc(e') = loc(e)) 
e 
loc e' } 
r E) }
{ Proof }
Definitions occuring in Statement :
eo-forward: eo.e,
event-ordering+: EO+(Info),
es-le: e loc e' ,
es-loc: loc(e),
es-E: E,
Id: Id,
subtype_rel: A r B,
uall: [x:A]. B[x],
implies: P Q,
set: {x:A| B[x]} ,
universe: Type,
equal: s = t
Definitions :
prop: 
,
es-loc: loc(e),
apply: f a,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
ifthenelse: if b then t else f fi ,
band: p 
q,
es-base-E: es-base-E(es),
es-dom: es-dom(es),
sqequal: s ~ t,
fpf: a:A fp-> B[a],
union: left + right,
or: P 
Q,
lambda: 
x.A[x],
record-update: r[x := v],
eo-restrict: eo-restrict(eo;P),
subtype: S T,
fpf-cap: f(x)?z,
strong-subtype: strong-subtype(A;B),
record-select: r.x,
assert: 
b,
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,
product: x:A 
B[x],
and: P Q,
uiff: uiff(P;Q),
all: x:A. B[x],
Id: Id,
equal: s = t,
es-le: e loc e' ,
function: x:A 
B[x],
set: {x:A| B[x]} ,
eo-forward: eo.e,
implies: P Q,
universe: Type,
subtype_rel: A r B,
member: t 
T,
uall: [x:A]. B[x],
isect: 
x:A. B[x],
es-E: E,
event_ordering: EO,
event-ordering+: EO+(Info),
eq_id: a = b,
bnot: b,
es-ble: e loc e',
bor: p q,
atom: Atom,
top: Top,
token: "$token",
guard: {T},
btrue: tt,
sq_type: SQType(T),
bool: 
,
true: True,
false: False,
int: 
,
nequal: a 
b T ,
qless: r < s,
rationals: 
,
atom: Atom$n,
es-causle: e c e',
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),
exists: x:A. B[x],
es-r-immediate-pred: es-r-immediate-pred(es;R;e';e),
same-thread: same-thread(es;p;e;e'),
decidable: Dec(P),
es-causl: (e < e'),
void: Void,
limited-type: LimitedType,
cand: A c B,
es-locl: (e <loc e'),
rev_implies: P 
Q,
iff: P Q,
eq_bool: p =b q,
lt_int: i <z j,
le_int: i z j,
bimplies: p q,
es-bless: e <loc e',
es-eq-E: e = e',
eq_lnk: a = b,
eq_str: Error :eq_str,
deq-all-disjoint: deq-all-disjoint(eq;ass;bs),
deq-disjoint: deq-disjoint(eq;as;bs),
deq-member: deq-member(eq;x;L),
q_le: q_le(r;s),
q_less: q_less(r;s),
qeq: qeq(r;s),
eq_type: eq_type(T;T'),
b-exists: (i<n.P[i])_b,
bl-exists: (xL.P[x])_b,
bl-all: (xL.P[x])_b,
dcdr-to-bool: [d],
grp_blt: a < b,
set_blt: a < b,
infix_ap: x f y,
null: null(as),
eq_int: (i =
j),
Auto: Error :Auto,
CollapseTHEN: Error :CollapseTHEN,
bfalse: ff,
unit: Unit
Lemmas :
eqtt_to_assert,
eqff_to_assert,
es-locl_wf,
eq_id_wf,
bnot_wf,
es-ble_wf,
bor_wf,
band_wf,
assert-eq-id,
not_functionality_wrt_uiff,
assert_of_bnot,
uiff_transitivity,
not_wf,
iff_weakening_uiff,
assert-es-ble,
or_functionality_wrt_iff,
assert_of_bor,
iff_transitivity,
rev_implies_wf,
iff_wf,
and_functionality_wrt_iff,
assert_of_band,
decidable__es-le,
atom2_subtype_base,
false_wf,
ifthenelse_wf,
true_wf,
subtype_base_sq,
bool_subtype_base,
bool_wf,
assert_elim,
es-dom_wf,
subtype_rel_self,
eo-forward-E,
member_wf,
assert_wf,
es-base-E_wf,
subtype_rel_wf,
Id_wf,
es-loc_wf,
es-le_wf,
es-E_wf,
eo-forward_wf,
event-ordering+_wf,
event-ordering+_inc
\mforall{}[Info:Type]. \mforall{}[eo:EO+(Info)]. \mforall{}[e:E]. (\{e':E| (loc(e') = loc(e)) {}\mRightarrow{} e \mleq{}loc e' \} \msubseteq{}r E)
Date html generated:
2011_08_16-AM-11_22_27
Last ObjectModification:
2010_12_21-PM-05_12_34
Home
Index