{ 
[Info:Type]. [es:EO+(Info)]. [X:EClass(Top)]. [f:sys-antecedent(es;X)].
[a:E(X)].
prior(X)(a) 
(X;f) a supposing 
a 
prior(X) }
{ Proof }
Definitions occuring in Statement :
cut-order: a (X;f) b,
es-prior-interface: prior(X),
sys-antecedent: sys-antecedent(es;Sys),
es-E-interface: E(X),
eclass-val: X(e),
in-eclass: e X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
assert: b,
uimplies: b supposing a,
uall: [x:A]. B[x],
top: Top,
universe: Type
Definitions :
limited-type: LimitedType,
l_contains: A 
B,
inject: Inj(A;B;f),
reducible: reducible(a),
prime: prime(a),
squash: 
T,
l_exists: (
xL. P[x]),
l_all: (xL.P[x]),
fun-connected: y is f*(x),
qle: r s,
qless: r < s,
q-rel: q-rel(r;x),
list: type List,
i-finite: i-finite(I),
i-closed: i-closed(I),
p-outcome: Outcome,
f-subset: xs ys,
fset-closed: (s closed under fs),
l_disjoint: l_disjoint(T;l1;l2),
cs-not-completed: in state s, a has not completed inning i,
cs-archived: by state s, a archived v in inning i,
cs-passed: by state s, a passed inning i without archiving a value,
cs-archive-blocked: in state s, ws' blocks ws from archiving v in inning i,
cs-precondition: state s may consider v in inning i,
cs-inning-committed: in state s, inning i has committed v,
cs-inning-committable: in state s, inning i could commit v ,
nat: 
,
es-le: e loc 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),
unit: Unit,
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'),
es-causle: e c e',
infix_ap: x f y,
intensional-universe: IType,
sq_type: SQType(T),
record: record(x.T[x]),
cand: A c
B,
pair: <a, b>,
bool: 
,
collect-event: collect-event(es;X;n;v.num[v];L.P[L];e),
decidable: Dec(P),
es-locl: (e <loc e'),
es-causl: (e < e'),
rev_implies: P 
Q,
iff: P 
Q,
atom: Atom,
es-base-E: es-base-E(es),
token: "$token",
record-select: r.x,
cond-class: [X?Y],
apply: f a,
so_apply: x[s],
or: P 
Q,
guard: {T},
eq_knd: a = b,
l_member: (x l),
fpf-dom: x dom(f),
union: left + right,
so_lambda: 
x.t[x],
subtype: S T,
lambda: x.A[x],
fpf: a:A fp-> B[a],
top: Top,
in-eclass: e X,
es-E: E,
event_ordering: EO,
strong-subtype: strong-subtype(A;B),
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
set: {x:A| B[x]} ,
dep-isect: Error :dep-isect,
record+: record+,
le: A B,
ge: i 
j ,
not: 
A,
less_than: a < b,
product: x:A 
B[x],
and: P Q,
uiff: uiff(P;Q),
subtype_rel: A r B,
deq-member: deq-member(eq;x;L),
es-prior-interface: prior(X),
eclass-val: X(e),
es-cut: Cut(X;f),
fset: FSet{T},
cut-of: cut(X;f;s),
implies: P Q,
function: x:A 
B[x],
all: x:A. B[x],
prop: 
,
universe: Type,
cut-order: a (X;f) b,
fset-member: a s,
ifthenelse: if b then t else f fi ,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
true: True,
equal: s = t,
false: False,
void: Void,
event-ordering+: EO+(Info),
so_lambda: x y.t[x; y],
eclass: EClass(A[eo; e]),
sys-antecedent: sys-antecedent(es;Sys),
uall: [x:A]. B[x],
es-E-interface: E(X),
uimplies: b supposing a,
isect: 
x:A. B[x],
member: t T,
assert: b,
MaAuto: Error :MaAuto,
CollapseTHEN: Error :CollapseTHEN,
tactic: Error :tactic
Lemmas :
cut-order_wf,
cut-order_witness,
assert_wf,
es-E-interface_wf,
sys-antecedent_wf,
eclass_wf,
event-ordering+_wf,
true_wf,
deq-member_wf,
ifthenelse_wf,
false_wf,
fset-member_wf,
eclass-val_wf,
es-prior-interface_wf,
cut-of_wf,
eclass-val_wf2,
es-E_wf,
member_wf,
in-eclass_wf,
es-prior-interface_wf0,
top_wf,
es-prior-interface_wf1,
subtype_rel_wf,
event-ordering+_inc,
uall_wf,
uiff_inversion,
es-interface-subtype_rel2,
es-base-E_wf,
subtype_rel_self,
cut-order-iff1,
es-causl_wf,
decidable__equal_es-E-interface,
intensional-universe_wf,
es-E-interface-subtype_rel,
decidable__cand,
decidable__es-causl,
decidable__cut-order,
cut-order_weakening
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[f:sys-antecedent(es;X)]. \mforall{}[a:E(X)].
prior(X)(a) \mleq{}(X;f) a supposing \muparrow{}a \mmember{}\msubb{} prior(X)
Date html generated:
2011_08_16-PM-05_54_43
Last ObjectModification:
2011_06_20-AM-01_38_19
Home
Index