{ 
[Info,T:Type]. [X:EClass(T)]. [es:EO+(Info)]. [v:T]. [e:E].
uiff(v 
Prior(X)(e);
e'<e.v X(e')
e''<e.w:T. (w X(e'') 
e'' 
loc e' )) }
{ Proof }
Definitions occuring in Statement :
primed-class: Prior(X),
classrel: v X(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
alle-lt: e<e'.P[e],
existse-before: e<e'.P[e],
es-le: e loc e' ,
es-E: E,
uiff: uiff(P;Q),
uall: [x:A]. B[x],
all: x:A. B[x],
squash: T,
implies: P Q,
and: P Q,
universe: Type
Definitions :
tactic: Error :tactic,
Try: Error :Try,
CollapseTHEN: Error :CollapseTHEN,
Auto: Error :Auto,
uall: [x:A]. B[x],
isect: 
x:A. B[x],
dep-isect: Error :dep-isect,
record+: record+,
event-ordering+: EO+(Info),
set: {x:A| B[x]} ,
squash: T,
uimplies: b supposing a,
product: x:A 
B[x],
and: P Q,
uiff: uiff(P;Q),
quotient: x,y:A//B[x; y],
bag: bag(T),
function: x:A 
B[x],
eclass: EClass(A[eo; e]),
so_lambda: 
x y.t[x; y],
universe: Type,
es-E: E,
event_ordering: EO,
classrel: v X(e),
primed-class: Prior(X),
prop: 
,
bag-member: bag-member(T;x;bs),
existse-before: e<e'.P[e],
so_lambda: x.t[x],
alle-lt: e<e'.P[e],
all: x:A. B[x],
implies: P Q,
es-le: e loc e' ,
true: True,
member: t T,
subtype_rel: A 
r B,
less_than: a < b,
not: 
A,
ge: i 
j ,
le: A B,
strong-subtype: strong-subtype(A;B),
assert: 
b,
ifthenelse: if b then t else f fi ,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
eq_atom: eq_atom$n(x;y),
eq_atom: x =a y,
record-select: r.x,
equal: s = t,
exists: x:A. B[x],
lambda: x.A[x],
Id: Id,
subtype: S T,
es-loc: loc(e),
sq_stable: SqStable(P),
CollapseTHENA: Error :CollapseTHENA,
MaAuto: Error :MaAuto,
D: Error :D,
es-locl: (e <loc e'),
sq_exists: x:{A| B[x]},
union: left + right,
or: P 
Q,
es-local-pred: last(P),
apply: f a,
lt_int: i <z j,
natural_number: $n,
bag-size: bag-size(bs),
nat: 
,
int: 
,
grp_car: |g|,
real: 
,
bool: 
,
fpf: a:A fp-> B[a],
es-causl: (e < e'),
infix_ap: x f y,
token: "$token",
es-base-E: es-base-E(es),
top: Top,
atom: Atom,
cand: A c B,
inl: inl x ,
false: False,
empty-bag: {},
void: Void,
inr: inr x ,
it: 
,
Complete: Error :Complete,
decidable: Dec(P),
same-thread: same-thread(es;p;e;e'),
es-r-immediate-pred: es-r-immediate-pred(es;R;e';e),
es-fset-loc: i locs(s),
existse-between3: e(e1,e2].P[e],
existse-between2: e[e1,e2].P[e],
alle-between2: e[e1,e2].P[e],
existse-between1: e[e1,e2).P[e],
alle-between1: e[e1,e2).P[e],
alle-le: ee'.P[e],
existse-le: ee'.P[e],
es-causle: e c e',
es-pred: pred(e),
eclass-val: X(e),
iff: P 
Q,
rev_implies: P Q,
pair: <a, b>,
le_int: i z j,
eq_int: (i =
j),
null: null(as),
set_blt: a <
b,
grp_blt: a < b,
dcdr-to-bool: [d],
bl-all: (xL.P[x])_b,
bl-exists: (xL.P[x])_b,
b-exists: (i<n.P[i])_b,
bag-null: bag-null(bs),
eq_type: eq_type(T;T'),
qeq: qeq(r;s),
q_less: q_less(r;s),
q_le: q_le(r;s),
deq-member: deq-member(eq;x;L),
deq-disjoint: deq-disjoint(eq;as;bs),
deq-all-disjoint: deq-all-disjoint(eq;ass;bs),
name_eq: name_eq(x;y),
eq_id: a = b,
eq_lnk: a = b,
es-eq-E: e = e',
es-bless: e <loc e',
es-ble: e loc e',
bnot: b,
bimplies: p q,
band: p q,
bor: p q,
rev_uimplies: rev_uimplies(P;Q),
length: ||as||,
modulus-of-ccontinuity: modulus-of-ccontinuity(omega;I;f),
fpf-sub: f g,
partitions: partitions(I;p),
i-member: r I,
rleq: x y,
rnonneg: rnonneg(r),
req: x = y,
RepeatFor: Error :RepeatFor,
guard: {T},
es-init: es-init(es;e)
Lemmas :
true_wf,
ifthenelse_wf,
false_wf,
es-causle_weakening_locl,
es-causle_antisymmetry,
es-causle-le,
sq_stable__bag-member,
bag-member-iff-size,
assert_of_lt_int,
es-le-not-locl,
decidable__es-locl,
decidable__es-le,
es-causl_wf,
bag-member-empty,
empty-bag_wf,
bag-member_wf,
subtype_rel_self,
es-base-E_wf,
bool_wf,
es-local-pred_wf,
bag-size_wf,
nat_wf,
member_wf,
bag_wf,
lt_int_wf,
es-locl_wf,
not_wf,
assert_wf,
classrel_wf,
primed-class_wf,
sq_stable__classrel,
squash_wf,
existse-before_wf,
alle-lt_wf,
es-le_wf,
event-ordering+_wf,
event-ordering+_inc,
es-E_wf,
eclass_wf,
es-loc_wf,
Id_wf
\mforall{}[Info,T:Type]. \mforall{}[X:EClass(T)]. \mforall{}[es:EO+(Info)]. \mforall{}[v:T]. \mforall{}[e:E].
uiff(v \mmember{} Prior(X)(e);\mdownarrow{}\mexists{}e'<e.v \mmember{} X(e') \mwedge{} \mforall{}e''<e.\mforall{}w:T. (w \mmember{} X(e'') {}\mRightarrow{} e'' \mleq{}loc e' ))
Date html generated:
2011_08_16-PM-05_04_31
Last ObjectModification:
2011_06_17-AM-10_54_02
Home
Index