{ 
[Info:Type]. [es:EO+(Info)]. [X:EClass(Top)]. [f:E(X) 
E(X)].
[e:E(X)]. (last(prior-f-fixedpoints(e)) = f**(e))
supposing x:E(X). f x c
x }
{ Proof }
Definitions occuring in Statement :
es-prior-fixedpoints: prior-f-fixedpoints(e),
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,
last: last(L)
Definitions :
prop: 
,
member: t 
T,
bfalse: ff,
btrue: tt,
ifthenelse: if b then t else f fi ,
ycomb: Y,
es-prior-fixedpoints: prior-f-fixedpoints(e),
lt_int: i <z j,
bnot: 
b,
le_int: i z j,
length: ||as||,
select: l[i],
null: null(as),
not: A,
assert: 
b,
subtype: S 
T,
so_lambda: 
x y.t[x; y],
implies: P 
Q,
last: last(L),
all: x:A. B[x],
top: Top,
and: P 
Q,
iff: P 
Q,
guard: {T},
sq_type: SQType(T),
or: P 
Q,
so_apply: x[s1;s2],
es-E-interface: E(X),
false: False,
cand: A c B
Lemmas :
not_functionality_wrt_iff,
assert_of_bnot,
es-E_wf,
not_wf,
bnot_wf,
assert_wf,
iff_transitivity,
eqff_to_assert,
assert-es-eq-E-2,
eqtt_to_assert,
bool_sq,
es-E-interface-subtype_rel,
es-fix_wf2,
es-eq-E_wf,
bool_cases,
false_wf,
eclass-val_wf2,
es-prior-fixedpoints_wf,
last_append,
top_wf,
event-ordering+_wf,
event-ordering+_inc,
es-E-interface_wf,
es-interface-subtype_rel2,
es-prior-interface_wf,
in-eclass_wf,
es-fix_property
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[f:E(X) {}\mrightarrow{} E(X)].
\mforall{}[e:E(X)]. (last(prior-f-fixedpoints(e)) = f**(e)) supposing \mforall{}x:E(X). f x c\mleq{} x
Date html generated:
2011_08_16-PM-05_44_04
Last ObjectModification:
2011_06_20-AM-01_32_00
Home
Index