let C be Ordinal; :: thesis: for A being Ordinal st A <> {} & A is limit_ordinal holds
ex fi being Ordinal-Sequence st
( dom fi = A & ( for B being Ordinal st B in A holds
fi . B = exp C,B ) & ex D being Ordinal st D is_limes_of fi )
defpred S1[ Ordinal] means ( $1 <> {} & $1 is limit_ordinal & ( for fi being Ordinal-Sequence st dom fi = $1 & ( for B being Ordinal st B in $1 holds
fi . B = exp C,B ) holds
for D being Ordinal holds not D is_limes_of fi ) );
let A be Ordinal; :: thesis: ( A <> {} & A is limit_ordinal implies ex fi being Ordinal-Sequence st
( dom fi = A & ( for B being Ordinal st B in A holds
fi . B = exp C,B ) & ex D being Ordinal st D is_limes_of fi ) )
assume A1:
( A <> {} & A is limit_ordinal & ( for fi being Ordinal-Sequence st dom fi = A & ( for B being Ordinal st B in A holds
fi . B = exp C,B ) holds
for D being Ordinal holds not D is_limes_of fi ) )
; :: thesis: contradiction
A2:
ex A being Ordinal st S1[A]
by A1;
consider A being Ordinal such that
A3:
S1[A]
and
A4:
for A1 being Ordinal st S1[A1] holds
A c= A1
from ORDINAL1:sch 1(A2);
deffunc H1( Ordinal) -> set = exp C,$1;
consider fi being Ordinal-Sequence such that
A5:
( dom fi = A & ( for B being Ordinal st B in A holds
fi . B = H1(B) ) )
from ORDINAL2:sch 3();
then
{} in C
by ORDINAL3:10;
then
1 c= C
by Lm3, ORDINAL1:33;
then A7:
1 c< C
by A6, XBOOLE_0:def 8;
then A8:
1 in C
by ORDINAL1:21;
A9:
for B2, B1 being Ordinal st B1 in B2 & B2 in A holds
exp C,B1 in exp C,B2
proof
defpred S2[
Ordinal]
means for
B1 being
Ordinal st
B1 in $1 & $1
in A holds
exp C,
B1 in exp C,$1;
A10:
S2[
{} ]
;
A11:
for
B being
Ordinal st
S2[
B] holds
S2[
succ B]
proof
let B be
Ordinal;
:: thesis: ( S2[B] implies S2[ succ B] )
assume A12:
for
B1 being
Ordinal st
B1 in B &
B in A holds
exp C,
B1 in exp C,
B
;
:: thesis: S2[ succ B]
let B1 be
Ordinal;
:: thesis: ( B1 in succ B & succ B in A implies exp C,B1 in exp C,(succ B) )
assume A13:
(
B1 in succ B &
succ B in A )
;
:: thesis: exp C,B1 in exp C,(succ B)
A14:
exp C,
B <> {}
A16:
(
exp C,
(succ B) = C *^ (exp C,B) & 1
*^ (exp C,B) = exp C,
B &
B in succ B )
by ORDINAL1:10, ORDINAL2:56, ORDINAL2:61;
then A17:
(
exp C,
B in exp C,
(succ B) &
B in A &
B1 c= B )
by A8, A13, A14, ORDINAL1:19, ORDINAL1:34, ORDINAL2:57;
hence
exp C,
B1 in exp C,
(succ B)
by A7, A14, A16, ORDINAL1:21, ORDINAL2:57;
:: thesis: verum
end;
A18:
for
B being
Ordinal st
B <> {} &
B is
limit_ordinal & ( for
D being
Ordinal st
D in B holds
S2[
D] ) holds
S2[
B]
proof
let B be
Ordinal;
:: thesis: ( B <> {} & B is limit_ordinal & ( for D being Ordinal st D in B holds
S2[D] ) implies S2[B] )
assume that A19:
(
B <> {} &
B is
limit_ordinal )
and A20:
for
D being
Ordinal st
D in B holds
S2[
D]
;
:: thesis: S2[B]
let B1 be
Ordinal;
:: thesis: ( B1 in B & B in A implies exp C,B1 in exp C,B )
assume A21:
(
B1 in B &
B in A )
;
:: thesis: exp C,B1 in exp C,B
then consider psi being
Ordinal-Sequence such that A22:
(
dom psi = B & ( for
D being
Ordinal st
D in B holds
psi . D = exp C,
D ) & ex
D being
Ordinal st
D is_limes_of psi )
by A4, A19, ORDINAL1:7;
A23:
exp C,
B = lim psi
by A19, A22, ORDINAL2:62;
psi is
increasing
then A25:
lim psi = sup psi
by A19, A22, Th8;
psi . B1 = exp C,
B1
by A21, A22;
then
(
exp C,
B1 in rng psi &
sup psi = sup (rng psi) )
by A21, A22, FUNCT_1:def 5;
hence
exp C,
B1 in exp C,
B
by A23, A25, ORDINAL2:27;
:: thesis: verum
end;
thus
for
B being
Ordinal holds
S2[
B]
from ORDINAL2:sch 1(A10, A11, A18); :: thesis: verum
end;
fi is increasing
then
sup fi is_limes_of fi
by A3, A5, Th8;
hence
contradiction
by A3, A5; :: thesis: verum