{ 
[Info:Type]. [es:EO+(Info)]. [X,Y:EClass(Top)].
[e:E]. (
(X)(e) = (Y)(e)) supposing e:E. (
e 
X 
e Y) }
{ Proof }
Definitions occuring in Statement :
es-interface-predecessors: (X)(e),
es-E-interface: E(X),
in-eclass: e X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-loc: loc(e),
es-E: E,
Id: Id,
assert: b,
uimplies: b supposing a,
uall: [x:A]. B[x],
top: Top,
all: x:A. B[x],
iff: P Q,
set: {x:A| B[x]} ,
list: type List,
universe: Type,
equal: s = t
Definitions :
uall: [x:A]. B[x],
uimplies: b supposing a,
all: x:A. B[x],
iff: P Q,
member: t T,
prop: 
,
so_lambda: 
x.t[x],
and: P 
Q,
implies: P Q,
rev_implies: P Q,
so_lambda: x y.t[x; y],
es-E-interface: E(X),
so_apply: x[s],
so_apply: x[s1;s2],
subtype: S 
T
Lemmas :
es-interface-predecessors-equal,
list-equal-set2,
es-E-interface_wf,
Id_wf,
es-loc_wf,
sq_stable__equal,
es-interface-predecessors_wf,
es-E_wf,
event-ordering+_inc,
iff_wf,
assert_wf,
in-eclass_wf,
eclass_wf,
top_wf,
event-ordering+_wf
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X,Y:EClass(Top)].
\mforall{}[e:E]. (\mleq{}(X)(e) = \mleq{}(Y)(e)) supposing \mforall{}e:E. (\muparrow{}e \mmember{}\msubb{} X \mLeftarrow{}{}\mRightarrow{} \muparrow{}e \mmember{}\msubb{} Y)
Date html generated:
2011_08_16-PM-05_17_13
Last ObjectModification:
2011_06_20-AM-01_19_11
Home
Index