{ 
es:EO. rel_finite(E;
k,j.(k < j)) }
{ Proof }
Definitions occuring in Statement :
es-causl: (e < e'),
es-E: E,
event_ordering: EO,
all: x:A. B[x],
lambda: x.A[x],
rel_finite: rel_finite(T;R)
Definitions :
rev_implies: P 
Q,
iff: P 
Q,
nat: 
,
cand: A c
B,
prop: 
,
assert: 
b,
set: {x:A| B[x]} ,
equal: s = t,
member: t 
T,
strong-subtype: strong-subtype(A;B),
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
record-select: r.x,
dep-isect: Error :dep-isect,
record+: record+,
le: A 
B,
ge: i 
j ,
not: 
A,
less_than: a < b,
uimplies: b supposing a,
and: P Q,
uiff: uiff(P;Q),
subtype_rel: A 
r B,
isect: 
x:A. B[x],
uall: [x:A]. B[x],
event_ordering: EO,
rel_finite: rel_finite(T;R),
es-causl: (e < e'),
list: type List,
exists: 
x:A. B[x],
product: x:A 
B[x],
all: x:A. B[x],
implies: P Q,
function: x:A 
B[x],
l_member: (x l),
es-E: E,
infix_ap: x f y,
apply: f a,
lambda: x.A[x],
Auto: Error :Auto,
CollapseTHEN: Error :CollapseTHEN,
es-pred-list: es-pred-list(es;e),
D: Error :D
Lemmas :
es-E_wf,
es-causl_wf,
nat_wf,
l_member_wf,
es-pred-list_wf,
rel_finite_wf,
event_ordering_wf,
member-es-pred-list
\mforall{}es:EO. rel\_finite(E;\mlambda{}k,j.(k < j))
Date html generated:
2011_08_16-AM-10_35_19
Last ObjectModification:
2010_11_22-PM-10_43_57
Home
Index