defpred S₁[ Element of NAT ] means ( [$1,(width (GoB g))] in Indices (GoB g) & ex i being Element of NAT st
( i in dom g & g /. i = (GoB g) * $1,(width (GoB g)) ) );
set Y = { j where j is Element of NAT : S₁[j] } ;
1 <= width (GoB g) by GOBOARD7:35;
then consider i, j being Element of NAT such that
A96: ( i in dom g & [j,(width (GoB g))] in Indices (GoB g) & g /. i = (GoB g) * j,(width (GoB g)) ) by Th10;
A97: j in { j where j is Element of NAT : S₁[j] } by A96;
A98: { j where j is Element of NAT : S₁[j] } c= dom (GoB g)

proof

let y be set ; :: according to TARSKI:def 3 :: thesis: ( not y in { j where j is Element of NAT : S₁[j] } or y in dom (GoB g) )
assume y in { j where j is Element of NAT : S₁[j] } ; :: thesis: y in dom (GoB g)
then ex j being Element of NAT st
( y = j & [j,(width (GoB g))] in Indices (GoB g) & ex i being Element of NAT st
( i in dom g & g /. i = (GoB g) * j,(width (GoB g)) ) ) ;
then [y,(width (GoB g))] in [:(dom (GoB g)),(Seg (width (GoB g))):] by MATRIX_1:def 5;
hence y in dom (GoB g) by ZFMISC_1:106; :: thesis: verum

end;

{ j where j is Element of NAT : S₁[j] } is Subset of NAT from DOMAIN_1:sch 7();
then reconsider Y = { j where j is Element of NAT : S₁[j] } as non empty finite Subset of NAT by A97, A98;
reconsider i1 = max Y as Element of NAT by ORDINAL1:def 13;
i1 in Y by XXREAL_2:def 8;
then consider j being Element of NAT such that
A99: ( j = i1 & [j,(width (GoB g))] in Indices (GoB g) & ex i being Element of NAT st
( i in dom g & g /. i = (GoB g) * j,(width (GoB g)) ) ) ;
consider i being Element of NAT such that
A100: ( i in dom g & g /. i = (GoB g) * j,(width (GoB g)) ) by A99;
( 1 <= i1 & i1 <= len (GoB g) & 1 <= 1 & 1 <= width (GoB g) ) by A99, MATRIX_1:39;
then A101: ((GoB g) * i1,(width (GoB g))) `2 = ((GoB g) * 1,(width (GoB g))) `2 by GOBOARD5:2;
then A102: ((GoB g) * i1,(width (GoB g))) `2 = N-bound (L~ g) by Th42;
{ (q `1 ) where q is Point of (TOP-REAL 2) : ( q `2 = N-bound (L~ g) & q in L~ g ) } c= REAL

proof

let X be set ; :: according to TARSKI:def 3 :: thesis: ( not X in { (q `1 ) where q is Point of (TOP-REAL 2) : ( q `2 = N-bound (L~ g) & q in L~ g ) } or X in REAL )
assume X in { (q `1 ) where q is Point of (TOP-REAL 2) : ( q `2 = N-bound (L~ g) & q in L~ g ) } ; :: thesis: X in REAL
then ex q being Point of (TOP-REAL 2) st
( X = q `1 & q `2 = N-bound (L~ g) & q in L~ g ) ;
hence X in REAL ; :: thesis: verum

end;

then reconsider B = { (q `1 ) where q is Point of (TOP-REAL 2) : ( q `2 = N-bound (L~ g) & q in L~ g ) } as Subset of REAL ;
set s1 = ((GoB g) * (len (GoB g)),(width (GoB g))) `1 ;
for r being real number st r in B holds
((GoB g) * (len (GoB g)),(width (GoB g))) `1 >= r

proof

let r be real number ; :: thesis: ( r in B implies ((GoB g) * (len (GoB g)),(width (GoB g))) `1 >= r )
assume r in B ; :: thesis: ((GoB g) * (len (GoB g)),(width (GoB g))) `1 >= r
then consider q being Point of (TOP-REAL 2) such that
A103: ( r = q `1 & q `2 = N-bound (L~ g) & q in L~ g ) ;
( 1 <= len (GoB g) & 1 <= width (GoB g) ) by GOBOARD7:34, GOBOARD7:35;
hence ((GoB g) * (len (GoB g)),(width (GoB g))) `1 >= r by A103, Th34; :: thesis: verum

end;

then A104: B is bounded_above by SEQ_4:def 1;
A105: ( 1 <= i & i <= len g ) by A100, FINSEQ_3:27;

now

per cases ( i < len g or i = len g ) by A105, XXREAL_0:1;

case i < len g ; :: thesis: (GoB g) * i1,(width (GoB g)) in L~ g

then i + 1 <= len g by NAT_1:13;
then g /. i in LSeg g,i by A105, TOPREAL1:27;
hence (GoB g) * i1,(width (GoB g)) in L~ g by A99, A100, SPPOL_2:17; :: thesis: verum

end;

case i = len g ; :: thesis: (GoB g) * i1,(width (GoB g)) in L~ g

then g /. i in LSeg g,(i -' 1) by Lm9, Th3;
hence (GoB g) * i1,(width (GoB g)) in L~ g by A99, A100, SPPOL_2:17; :: thesis: verum

end;

end;

end;

then ( ((GoB g) * i1,(width (GoB g))) `2 = N-bound (L~ g) & (GoB g) * i1,(width (GoB g)) in L~ g ) by A101, Th42;
then A106: ((GoB g) * i1,(width (GoB g))) `1 in { (q `1 ) where q is Point of (TOP-REAL 2) : ( q `2 = N-bound (L~ g) & q in L~ g ) } ;
then A107: upper_bound B >= ((GoB g) * i1,(width (GoB g))) `1 by A104, SEQ_4:def 4;
for r being real number st r in B holds
r <= ((GoB g) * i1,(width (GoB g))) `1

proof

let r be real number ; :: thesis: ( r in B implies r <= ((GoB g) * i1,(width (GoB g))) `1 )
assume r in B ; :: thesis: r <= ((GoB g) * i1,(width (GoB g))) `1
then consider q being Point of (TOP-REAL 2) such that
A108: ( r = q `1 & q `2 = N-bound (L~ g) & q in L~ g ) ;
thus r <= ((GoB g) * i1,(width (GoB g))) `1 by A108, Lm8; :: thesis: verum

end;

then upper_bound B <= ((GoB g) * i1,(width (GoB g))) `1 by A106, SEQ_4:62;
then ((GoB g) * i1,(width (GoB g))) `1 = upper_bound B by A107, XXREAL_0:1
.= sup (proj1 | (N-most (L~ g))) by Th17 ;
hence ex b₁ being Element of NAT st
( [b₁,(width (GoB g))] in Indices (GoB g) & (GoB g) * b₁,(width (GoB g)) = N-max (L~ g) ) by A99, A102, EUCLID:57; :: thesis: verum