{ 
[Info:Type]. [es:EO+(Info)]. [X:EClass(Top)]. [f:E(X) 
E(X)].
[e:E(X)]. no_repeats(E(X);prior-f-fixedpoints(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-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,
no_repeats: no_repeats(T;l)
Definitions :
limited-type: LimitedType,
natural_number: $n,
list: type List,
length: ||as||,
select: l[i],
bool: 
,
so_lambda: 
x.t[x],
firstn: firstn(n;as),
cons: [car / cdr],
nil: [],
int_seg: {i..j
},
int: 
,
l_member: (x 
l),
es-prior-fixedpoints: prior-f-fixedpoints(e),
remove-repeats: remove-repeats(eq;L),
strong-subtype: strong-subtype(A;B),
le: A B,
ge: i 
j ,
product: x:A 
B[x],
and: P 
Q,
uiff: uiff(P;Q),
less_than: a < b,
nat: 
,
void: Void,
false: False,
not: 
A,
implies: P 
Q,
no_repeats: no_repeats(T;l),
infix_ap: x f y,
es-causl: (e < e'),
or: P 
Q,
set: {x:A| B[x]} ,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
assert: 
b,
prop: 
,
es-causle: e c e',
uimplies: b supposing a,
union: left + right,
es-E-interface: E(X),
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,
es-locl: (e <loc e'),
es-le: e loc e' ,
existse-before: 
e<e'.P[e],
existse-le: ee'.P[e],
alle-lt: e<e'.P[e],
alle-le: ee'.P[e],
alle-between1: e[e1,e2).P[e],
existse-between1: e[e1,e2).P[e],
alle-between2: e[e1,e2].P[e],
existse-between2: e[e1,e2].P[e],
existse-between3: e(e1,e2].P[e],
es-fset-loc: i locs(s),
es-r-immediate-pred: es-r-immediate-pred(es;R;e';e),
same-thread: same-thread(es;p;e;e'),
collect-event: collect-event(es;X;n;v.num[v];L.P[L];e),
decidable: Dec(P),
minus: -n,
subtract: n - m,
rationals: 
,
add: n + m,
guard: {T},
exists: x:A. B[x],
strongwellfounded: SWellFounded(R[x; y]),
fpf: a:A fp-> B[a],
real: 
,
grp_car: |g|,
append: as @ bs,
sq_type: SQType(T),
eq_bool: p =b q,
eq_int: (i =
j),
null: null(as),
set_blt: a <
b,
grp_blt: a < b,
dcdr-to-bool: [d],
bl-all: (xL.P[x])_b,
bl-exists: (xL.P[x])_b,
b-exists: (i<n.P[i])_b,
eq_type: eq_type(T;T'),
qeq: qeq(r;s),
q_less: q_less(r;s),
q_le: q_le(r;s),
deq-member: deq-member(eq;x;L),
deq-disjoint: deq-disjoint(eq;as;bs),
deq-all-disjoint: deq-all-disjoint(eq;ass;bs),
eq_str: Error :eq_str,
eq_id: a = b,
eq_lnk: a = b,
es-prior-interface: prior(X),
in-eclass: e X,
tl: tl(l),
hd: hd(l),
pair: <a, b>,
lt_int: i <z j,
le_int: i z j,
bfalse: ff,
btrue: tt,
iff: P 
Q,
bimplies: p q,
band: p q,
bor: p q,
es-eq-E: e = e',
bnot: b,
unit: Unit,
record: record(x.T[x]),
cand: A c B,
l_disjoint: l_disjoint(T;l1;l2),
eclass-val: X(e),
es-p-le: e p e',
es-p-locl: e p< e',
causal-predecessor: causal-predecessor(es;p),
es-pred: pred(e),
es-loc: loc(e),
Id: Id,
es-init: es-init(es;e),
true: True,
es-fix: f**(e),
sqequal: s ~ t
Lemmas :
es-fix-equal,
es-fix-causle,
es-prior-fixedpoints-fix,
list-equal-set2,
es-fix_wf2,
es-locl_transitivity2,
es-locl_irreflexivity,
es-le_wf,
es-causle-le,
eclass-val_wf,
es-locl_wf,
Id_wf,
es-prior-interface-locl,
es-causle_transitivity,
es-causle_weakening_locl,
es-le_weakening,
es-prior-fixedpoints-causle,
es-prior-interface-causl,
eclass-val_wf2,
no_repeats-append,
l_disjoint_wf,
l_member_wf,
l_disjoint_singleton,
bool_wf,
es-eq-E_wf,
assert-es-eq-E-2,
not_functionality_wrt_uiff,
assert_of_bnot,
uiff_transitivity,
eqff_to_assert,
iff_weakening_uiff,
eqtt_to_assert,
ifthenelse_wf,
bnot_wf,
es-prior-interface_wf,
in-eclass_wf,
es-prior-interface_wf0,
es-prior-interface_wf1,
es-interface-subtype_rel2,
append_wf,
no_repeats-single,
ge_wf,
subtype_rel_wf,
false_wf,
es-causl-swellfnd,
guard_wf,
nat_ind_tp,
le_wf,
es-causl_wf,
decidable__es-E-equal,
nat_wf,
not_wf,
es-E-interface_wf,
no_repeats_wf,
es-E-interface-subtype_rel,
member_wf,
es-E_wf,
event-ordering+_inc,
subtype_rel_self,
es-causle_wf,
event-ordering+_wf,
top_wf,
eclass_wf,
es-prior-fixedpoints_wf,
no_repeats-settype,
assert_wf,
select_wf,
length_wf_nat,
nat_properties,
length_wf1
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[f:E(X) {}\mrightarrow{} E(X)].
\mforall{}[e:E(X)]. no\_repeats(E(X);prior-f-fixedpoints(e)) supposing \mforall{}x:E(X). f x c\mleq{} x
Date html generated:
2011_08_16-PM-05_45_02
Last ObjectModification:
2011_06_20-AM-01_32_33
Home
Index