{ 
[Info:Type]. [es:EO+(Info)]. [X:EClass(Top)]. [f:sys-antecedent(es;X)].
[c:Cut(X;f)]. [a,e:E(X)].
(e 
c) supposing ((e <loc a) and a c) }
{ Proof }
Definitions occuring in Statement :
es-cut: Cut(X;f),
sys-antecedent: sys-antecedent(es;Sys),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-locl: (e <loc e'),
es-eq: es-eq(es),
uimplies: b supposing a,
uall: [x:A]. B[x],
top: Top,
universe: Type,
fset-member: a s
Definitions :
deq: EqDecider(T),
pair: <a, b>,
Id: Id,
fset-filter: {x s | P[x]},
fset-singleton: {x},
fset-intersection: a 
b,
fset-union: x 
y,
fset-remove: fset-remove(eq;y;s),
fset-add: fset-add(eq;x;s),
strong-subtype: strong-subtype(A;B),
infix_ap: x f y,
es-causl: (e < e'),
tl: tl(l),
hd: hd(l),
l_all: (xL.P[x]),
fset-closed: (s closed under fs),
le: A 
B,
ge: i 
j ,
not: 
A,
less_than: a < b,
product: x:A 
B[x],
and: P 
Q,
uiff: uiff(P;Q),
deq-member: deq-member(eq;x;L),
implies: P 
Q,
void: Void,
false: False,
true: True,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
es-eq: es-eq(es),
es-locl: (e <loc e'),
prop: 
,
fset: FSet{T},
fset-member: a s,
uimplies: b supposing a,
assert: 
b,
es-E-interface: E(X),
set: {x:A| B[x]} ,
es-cut: Cut(X;f),
union: left + right,
sys-antecedent: sys-antecedent(es;Sys),
subtype: S 
T,
subtype_rel: A r B,
atom: Atom,
apply: f a,
token: "$token",
ifthenelse: if b then t else f fi ,
record-select: r.x,
top: Top,
event_ordering: EO,
es-E: E,
lambda: 
x.A[x],
dep-isect: Error :dep-isect,
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
record+: record+,
all: x:A. B[x],
function: x:A 
B[x],
isect: x:A. B[x],
uall: [x:A]. B[x],
eclass: EClass(A[eo; e]),
so_lambda: 
x y.t[x; y],
universe: Type,
member: t T,
event-ordering+: EO+(Info),
equal: s = t,
tactic: Error :tactic,
Thin_andRename: Error :Thin_andRename,
RepeatFor: Error :RepeatFor,
CollapseTHENA: Error :CollapseTHENA,
CollapseTHEN: Error :CollapseTHEN,
MaAuto: Error :MaAuto,
strongwellfounded: SWellFounded(R[x; y]),
exists: 
x:A. B[x],
rationals: 
,
add: n + m,
minus: -n,
grp_car: |g|,
real: 
,
subtract: n - m,
natural_number: $n,
int: 
,
nat: 
,
guard: {T},
so_apply: x[s],
l_member: (x l),
or: P 
Q,
in-eclass: e 
X,
es-prior-interface: prior(X),
iff: P 
Q,
rev_implies: P Q,
sq_type: SQType(T),
cand: A c B,
eclass-val: X(e),
es-causle: e c e',
es-le: e loc e' ,
collect-event: collect-event(es;X;n;v.num[v];L.P[L];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],
alle-lt: e<e'.P[e],
existse-le: ee'.P[e],
existse-before: e<e'.P[e],
decidable: Dec(P),
fpf: a:A fp-> B[a],
es-loc: loc(e),
bool: 
,
btrue: tt,
bfalse: ff
Lemmas :
not_assert_elim,
btrue_neq_bfalse,
Id_wf,
es-locl-total2,
es-loc_wf,
es-prior-interface-val,
es-cut-closed-prior,
es-E-interface-subtype_rel,
eclass-val_wf,
decidable__es-locl,
es-prior-interface-causl,
es-causl_weakening,
es-prior-interface_wf,
eclass-val_wf2,
in-eclass_wf,
assert_elim,
bool_sq,
es-is-prior-interface,
member_wf,
nat_wf,
es-causl_wf,
guard_wf,
le_wf,
nat_ind_tp,
es-causl-swellfnd,
nat_properties,
ge_wf,
eclass_wf,
top_wf,
event-ordering+_wf,
sys-antecedent_wf,
es-cut_wf,
fset-member_wf-cut,
es-locl_wf,
es-E_wf,
subtype_rel_self,
event-ordering+_inc,
fset-member_witness,
fset-member_wf,
assert_wf,
false_wf,
ifthenelse_wf,
deq-member_wf,
true_wf,
es-E-interface_wf,
es-eq_wf-interface
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[f:sys-antecedent(es;X)]. \mforall{}[c:Cut(X;f)].
\mforall{}[a,e:E(X)].
(e \mmember{} c) supposing ((e <loc a) and a \mmember{} c)
Date html generated:
2011_08_16-PM-05_46_47
Last ObjectModification:
2011_06_20-AM-01_33_52
Home
Index