let a, b be ordinal number ; ( a is limit_ordinal & 0 in b implies exp a,b is limit_ordinal )
assume A0:
( a is limit_ordinal & 0 in b )
; exp a,b is limit_ordinal
per cases
( a = 0 or 0 in a )
by ORDINAL3:10;
suppose 0A:
0 in a
;
exp a,b is limit_ordinal defpred S1[
Ordinal]
means (
0 in $1 implies
exp a,$1 is
limit_ordinal );
A1:
S1[
{} ]
;
A2:
for
c being
ordinal number st
S1[
c] holds
S1[
succ c]
A3:
for
c being
ordinal number st
c <> {} &
c is
limit_ordinal & ( for
b being
ordinal number st
b in c holds
S1[
b] ) holds
S1[
c]
proof
let c be
ordinal number ;
( c <> {} & c is limit_ordinal & ( for b being ordinal number st b in c holds
S1[b] ) implies S1[c] )
assume that Z0:
(
c <> {} &
c is
limit_ordinal )
and Z1:
for
b being
ordinal number st
b in c holds
S1[
b]
;
S1[c]
deffunc H1(
Ordinal)
-> set =
exp a,$1;
consider f being
Ordinal-Sequence such that B1:
(
dom f = c & ( for
b being
ordinal number st
b in c holds
f . b = H1(
b) ) )
from ORDINAL2:sch 3();
B2:
exp a,
c = lim f
by Z0, B1, ORDINAL2:62;
f is
non-decreasing
by 0A, B1, Th003;
then
Union f is_limes_of f
by Z0, B1, ThND;
then B3:
exp a,
c = Union f
by B2, ORDINAL2:def 14;
for
d being
ordinal number st
d in exp a,
c holds
succ d in exp a,
c
proof
let d be
ordinal number ;
( d in exp a,c implies succ d in exp a,c )
assume
d in exp a,
c
;
succ d in exp a,c
then consider b being
set such that B4:
(
b in dom f &
d in f . b )
by B3, CARD_5:10;
reconsider b =
b as
Ordinal by B4;
B5:
succ b in dom f
by Z0, B1, B4, ORDINAL1:41;
then B6:
(
f . b = H1(
b) &
f . (succ b) = H1(
succ b) &
S1[
succ b] )
by Z1, B1, B4;
H1(
b)
c= H1(
succ b)
by 0A, ORDINAL4:27, ORDINAL3:1;
then
succ d in f . (succ b)
by B6, ORDINAL1:41, B4, ORDINAL3:10;
hence
succ d in exp a,
c
by B3, B5, CARD_5:10;
verum
end;
hence
S1[
c]
by ORDINAL1:41;
verum
end;
for
c being
ordinal number holds
S1[
c]
from ORDINAL2:sch 1(A1, A2, A3);
hence
exp a,
b is
limit_ordinal
by A0;
verum end; end;