{ 
[Info:Type]. [es:EO+(Info)]. [X:EClass(Top)]. [f:sys-antecedent(es;X)].
[a,b,c:E(X)].
(a 
(X;f) c) supposing (b (X;f) c and a (X;f) b) }
{ Proof }
Definitions occuring in Statement :
cut-order: a (X;f) b,
sys-antecedent: sys-antecedent(es;Sys),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
uimplies: b supposing a,
uall: [x:A]. B[x],
top: Top,
universe: Type
Definitions :
union: left + right,
subtype: S 
T,
top: Top,
event_ordering: EO,
es-E: E,
lambda: 
x.A[x],
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-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,
uimplies: b supposing a,
cut-order: a (X;f) b,
fset-member: a 
s,
assert: 
b,
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),
es-E-interface: E(X),
member: t T,
isect: 
x:A. B[x],
uall: [x:A]. B[x],
Auto: Error :Auto,
CollapseTHEN: Error :CollapseTHEN,
tactic: Error :tactic
Lemmas :
cut-of_wf,
cut-order_wf,
true_wf,
deq-member_wf,
ifthenelse_wf,
false_wf,
assert_wf,
fset-member_wf,
es-E-interface_wf,
event-ordering+_wf,
event-ordering+_inc,
es-E_wf,
top_wf,
eclass_wf,
sys-antecedent_wf,
cut-order_witness,
cut-order_transitivity
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[f:sys-antecedent(es;X)]. \mforall{}[a,b,c:E(X)].
(a \mleq{}(X;f) c) supposing (b \mleq{}(X;f) c and a \mleq{}(X;f) b)
Date html generated:
2011_08_16-PM-05_55_44
Last ObjectModification:
2011_06_20-AM-01_39_00
Home
Index