{ 
[Info:Type]. [es:EO+(Info)]. [X:EClass(Top)]. [f:E(X) 
E(X)].
[e,a:E(X)]. f**(a) = f**(e) supposing a is f*(e)
supposing x:E(X). f x c
x }
{ Proof }
Definitions occuring in Statement :
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-fix: f**(e),
es-causle: e c e',
uimplies: b supposing a,
uall: [x:A]. B[x],
top: Top,
all: x:A. B[x],
apply: f a,
function: x:A B[x],
universe: Type,
equal: s = t,
fun-connected: y is f*(x)
Definitions :
all: x:A. B[x],
member: t 
T,
prop: 
,
so_lambda: 
x y.t[x; y],
es-fix: f**(e),
es-E-interface: E(X),
uall: [x:A]. B[x],
so_apply: x[s1;s2],
uimplies: b supposing a,
implies: P 
Q,
subtype: S 
T
Lemmas :
fun-connected_wf,
es-E-interface_wf,
es-causle_wf,
event-ordering+_inc,
es-E-interface-subtype_rel,
eclass_wf,
top_wf,
es-E_wf,
event-ordering+_wf,
fix-connected,
es-eq_wf-interface,
es-causle-interface-retraction
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[f:E(X) {}\mrightarrow{} E(X)].
\mforall{}[e,a:E(X)]. f**(a) = f**(e) supposing a is f*(e) supposing \mforall{}x:E(X). f x c\mleq{} x
Date html generated:
2011_08_16-PM-04_04_03
Last ObjectModification:
2011_06_20-AM-00_39_21
Home
Index