let n be Nat; :: thesis: for A being Subset of (TOP-REAL n) st A is bounded holds
BDD A is bounded

let A be Subset of (TOP-REAL n); :: thesis: ( A is bounded implies BDD A is bounded )
assume A is bounded ; :: thesis: BDD A is bounded
then consider r being Real such that
A1: for q being Point of (TOP-REAL n) st q in A holds
|.q.| < r by Th21;
per cases ( n >= 1 or n < 1 ) ;
suppose A2: n >= 1 ; :: thesis: BDD A is bounded
set a = r;
reconsider P = (REAL n) \ { q where q is Point of (TOP-REAL n) : |.q.| < r } as Subset of (TOP-REAL n) by EUCLID:22;
A3: P c= A `
proof
let z be object ; :: according to TARSKI:def 3 :: thesis: ( not z in P or z in A ` )
assume A4: z in P ; :: thesis: z in A `
then reconsider q0 = z as Point of (TOP-REAL n) ;
not z in { q where q is Point of (TOP-REAL n) : |.q.| < r } by A4, XBOOLE_0:def 5;
then |.q0.| >= r ;
then not q0 in A by A1;
hence z in A ` by XBOOLE_0:def 5; :: thesis: verum
end;
then A5: Down (P,(A `)) = P by XBOOLE_1:28;
now :: thesis: BDD A is bounded
per cases ( n >= 2 or n < 2 ) ;
suppose n >= 2 ; :: thesis: BDD A is bounded
then A6: P is connected by Th40;
now :: thesis: BDD A is bounded
assume not BDD A is bounded ; :: thesis: contradiction
then consider q being Point of (TOP-REAL n) such that
A7: q in BDD A and
A8: not |.q.| < r by Th21;
consider y being set such that
A9: q in y and
A10: y in { B3 where B3 is Subset of (TOP-REAL n) : B3 is_inside_component_of A } by A7, TARSKI:def 4;
consider B3 being Subset of (TOP-REAL n) such that
A11: y = B3 and
A12: B3 is_inside_component_of A by A10;
q in the carrier of (TOP-REAL n) ;
then A13: q in REAL n by EUCLID:22;
B3 is_a_component_of A ` by A12;
then consider B4 being Subset of ((TOP-REAL n) | (A `)) such that
A14: B4 = B3 and
A15: B4 is a_component by CONNSP_1:def 6;
for q2 being Point of (TOP-REAL n) st q2 = q holds
|.q2.| >= r by A8;
then not q in { q2 where q2 is Point of (TOP-REAL n) : |.q2.| < r } ;
then q in P by A13, XBOOLE_0:def 5;
then P /\ B4 <> {} ((TOP-REAL n) | (A `)) by A9, A11, A14, XBOOLE_0:def 4;
then P meets B4 ;
then A16: P c= B4 by A5, A6, A15, CONNSP_1:36, CONNSP_1:46;
B3 is bounded by A12;
hence contradiction by A2, A14, A16, Th41, RLTOPSP1:42; :: thesis: verum
end;
hence BDD A is bounded ; :: thesis: verum
end;
suppose A17: n < 2 ; :: thesis: BDD A is bounded
{ q where q is Point of (TOP-REAL n) : for r2 being Real st q = |[r2]| holds
r2 >= r } c= the carrier of (TOP-REAL n)
proof
let z be object ; :: according to TARSKI:def 3 :: thesis: ( not z in { q where q is Point of (TOP-REAL n) : for r2 being Real st q = |[r2]| holds
r2 >= r
}
or z in the carrier of (TOP-REAL n) )

assume z in { q where q is Point of (TOP-REAL n) : for r2 being Real st q = |[r2]| holds
r2 >= r
}
; :: thesis: z in the carrier of (TOP-REAL n)
then ex q being Point of (TOP-REAL n) st
( q = z & ( for r2 being Real st q = |[r2]| holds
r2 >= r ) ) ;
hence z in the carrier of (TOP-REAL n) ; :: thesis: verum
end;
then reconsider P2 = { q where q is Point of (TOP-REAL n) : for r2 being Real st q = |[r2]| holds
r2 >= r
}
as Subset of (TOP-REAL n) ;
{ q where q is Point of (TOP-REAL n) : for r2 being Real st q = |[r2]| holds
r2 <= - r } c= the carrier of (TOP-REAL n)
proof
let z be object ; :: according to TARSKI:def 3 :: thesis: ( not z in { q where q is Point of (TOP-REAL n) : for r2 being Real st q = |[r2]| holds
r2 <= - r
}
or z in the carrier of (TOP-REAL n) )

assume z in { q where q is Point of (TOP-REAL n) : for r2 being Real st q = |[r2]| holds
r2 <= - r
}
; :: thesis: z in the carrier of (TOP-REAL n)
then ex q being Point of (TOP-REAL n) st
( q = z & ( for r2 being Real st q = |[r2]| holds
r2 <= - r ) ) ;
hence z in the carrier of (TOP-REAL n) ; :: thesis: verum
end;
then reconsider P1 = { q where q is Point of (TOP-REAL n) : for r2 being Real st q = |[r2]| holds
r2 <= - r
}
as Subset of (TOP-REAL n) ;
n < 1 + 1 by A17;
then n <= 1 by NAT_1:13;
then A18: n = 1 by A2, XXREAL_0:1;
A19: P c= P1 \/ P2
proof
let z be object ; :: according to TARSKI:def 3 :: thesis: ( not z in P or z in P1 \/ P2 )
assume A20: z in P ; :: thesis: z in P1 \/ P2
then reconsider q0 = z as Point of (TOP-REAL n) ;
consider r3 being Real such that
A21: q0 = <*r3*> by A18, JORDAN2B:20;
not z in { q where q is Point of (TOP-REAL n) : |.q.| < r } by A20, XBOOLE_0:def 5;
then |.q0.| >= r ;
then A22: |.r3.| >= r by A21, Th4;
per cases ( - r >= r3 or r3 >= r ) by A22, SEQ_2:1;
suppose - r >= r3 ; :: thesis: z in P1 \/ P2
then for r2 being Real st q0 = |[r2]| holds
r2 <= - r by A21, JORDAN2B:23;
then q0 in P1 ;
hence z in P1 \/ P2 by XBOOLE_0:def 3; :: thesis: verum
end;
end;
end;
P1 \/ P2 c= P
proof
let z be object ; :: according to TARSKI:def 3 :: thesis: ( not z in P1 \/ P2 or z in P )
assume A23: z in P1 \/ P2 ; :: thesis: z in P
per cases ( z in P1 or z in P2 ) by A23, XBOOLE_0:def 3;
suppose A24: z in P1 ; :: thesis: z in P
then A25: ex q being Point of (TOP-REAL n) st
( q = z & ( for r2 being Real st q = |[r2]| holds
r2 <= - r ) ) ;
for q2 being Point of (TOP-REAL n) st q2 = z holds
|.q2.| >= r
proof
let q2 be Point of (TOP-REAL n); :: thesis: ( q2 = z implies |.q2.| >= r )
consider r3 being Real such that
A26: q2 = <*r3*> by A18, JORDAN2B:20;
assume A27: q2 = z ; :: thesis: |.q2.| >= r
then A28: r3 <= - r by A25, A26;
now :: thesis: ( ( r < 0 & |.r3.| >= r ) or ( r >= 0 & |.r3.| >= r ) )end;
hence |.q2.| >= r by A26, Th4; :: thesis: verum
end;
then A29: not z in { q2 where q2 is Point of (TOP-REAL n) : |.q2.| < r } ;
z in the carrier of (TOP-REAL n) by A24;
then z in REAL n by EUCLID:22;
hence z in P by A29, XBOOLE_0:def 5; :: thesis: verum
end;
suppose A30: z in P2 ; :: thesis: z in P
then A31: ex q being Point of (TOP-REAL n) st
( q = z & ( for r2 being Real st q = |[r2]| holds
r2 >= r ) ) ;
for q2 being Point of (TOP-REAL n) st q2 = z holds
|.q2.| >= r
proof
let q2 be Point of (TOP-REAL n); :: thesis: ( q2 = z implies |.q2.| >= r )
consider r3 being Real such that
A32: q2 = <*r3*> by A18, JORDAN2B:20;
assume q2 = z ; :: thesis: |.q2.| >= r
then A33: r3 >= r by A31, A32;
hence |.q2.| >= r by A32, Th4; :: thesis: verum
end;
then A34: not z in { q2 where q2 is Point of (TOP-REAL n) : |.q2.| < r } ;
z in the carrier of (TOP-REAL n) by A30;
then z in REAL n by EUCLID:22;
hence z in P by A34, XBOOLE_0:def 5; :: thesis: verum
end;
end;
end;
then A35: P = P1 \/ P2 by A19;
then P2 c= P by XBOOLE_1:7;
then A36: Down (P2,(A `)) = P2 by A3, XBOOLE_1:1, XBOOLE_1:28;
for w1, w2 being Point of (TOP-REAL n) st w1 in P2 & w2 in P2 holds
LSeg (w1,w2) c= P2
proof
let w1, w2 be Point of (TOP-REAL n); :: thesis: ( w1 in P2 & w2 in P2 implies LSeg (w1,w2) c= P2 )
assume that
A37: w1 in P2 and
A38: w2 in P2 ; :: thesis: LSeg (w1,w2) c= P2
A39: ex q2 being Point of (TOP-REAL n) st
( q2 = w2 & ( for r2 being Real st q2 = |[r2]| holds
r2 >= r ) ) by A38;
consider r3 being Real such that
A40: w1 = <*r3*> by A18, JORDAN2B:20;
consider r4 being Real such that
A41: w2 = <*r4*> by A18, JORDAN2B:20;
A42: ex q1 being Point of (TOP-REAL n) st
( q1 = w1 & ( for r2 being Real st q1 = |[r2]| holds
r2 >= r ) ) by A37;
thus LSeg (w1,w2) c= P2 :: thesis: verum
proof
let z be object ; :: according to TARSKI:def 3 :: thesis: ( not z in LSeg (w1,w2) or z in P2 )
assume z in LSeg (w1,w2) ; :: thesis: z in P2
then consider r2 being Real such that
A43: z = ((1 - r2) * w1) + (r2 * w2) and
A44: 0 <= r2 and
A45: r2 <= 1 ;
reconsider q4 = z as Point of (TOP-REAL n) by A43;
( (1 - r2) * w1 = |[((1 - r2) * r3)]| & r2 * w2 = |[(r2 * r4)]| ) by A18, A40, A41, JORDAN2B:21;
then A46: z = |[(((1 - r2) * r3) + (r2 * r4))]| by A18, A43, JORDAN2B:22;
for r5 being Real st q4 = |[r5]| holds
r5 >= r
proof
let r5 be Real; :: thesis: ( q4 = |[r5]| implies r5 >= r )
assume q4 = |[r5]| ; :: thesis: r5 >= r
then A47: r5 = ((1 - r2) * r3) + (r2 * r4) by A46, JORDAN2B:23;
1 - r2 >= 0 by A45, XREAL_1:48;
then A48: (1 - r2) * r3 >= (1 - r2) * r by A42, A40, XREAL_1:64;
( r2 * r4 >= r2 * r & ((1 - r2) * r) + (r2 * r) = r ) by A39, A41, A44, XREAL_1:64;
hence r5 >= r by A47, A48, XREAL_1:7; :: thesis: verum
end;
hence z in P2 ; :: thesis: verum
end;
end;
then P2 is convex by JORDAN1:def 1;
then A49: Down (P2,(A `)) is connected by A36, CONNSP_1:46;
P1 c= P by A35, XBOOLE_1:7;
then A50: Down (P1,(A `)) = P1 by A3, XBOOLE_1:1, XBOOLE_1:28;
A51: now :: thesis: not P2 is bounded end;
A57: now :: thesis: not P1 is bounded end;
for w1, w2 being Point of (TOP-REAL n) st w1 in P1 & w2 in P1 holds
LSeg (w1,w2) c= P1
proof
let w1, w2 be Point of (TOP-REAL n); :: thesis: ( w1 in P1 & w2 in P1 implies LSeg (w1,w2) c= P1 )
assume that
A64: w1 in P1 and
A65: w2 in P1 ; :: thesis: LSeg (w1,w2) c= P1
consider r4 being Real such that
A66: w2 = <*r4*> by A18, JORDAN2B:20;
ex q2 being Point of (TOP-REAL n) st
( q2 = w2 & ( for r2 being Real st q2 = |[r2]| holds
r2 <= - r ) ) by A65;
then A67: r4 <= - r by A66;
consider r3 being Real such that
A68: w1 = <*r3*> by A18, JORDAN2B:20;
ex q1 being Point of (TOP-REAL n) st
( q1 = w1 & ( for r2 being Real st q1 = |[r2]| holds
r2 <= - r ) ) by A64;
then A69: r3 <= - r by A68;
thus LSeg (w1,w2) c= P1 :: thesis: verum
proof
let z be object ; :: according to TARSKI:def 3 :: thesis: ( not z in LSeg (w1,w2) or z in P1 )
assume z in LSeg (w1,w2) ; :: thesis: z in P1
then consider r2 being Real such that
A70: z = ((1 - r2) * w1) + (r2 * w2) and
A71: 0 <= r2 and
A72: r2 <= 1 ;
reconsider q4 = z as Point of (TOP-REAL n) by A70;
A73: r2 * w2 = |[(r2 * r4)]| by A18, A66, JORDAN2B:21;
(1 - r2) * w1 = (1 - r2) * |[r3]| by A68
.= |[((1 - r2) * r3)]| by JORDAN2B:21 ;
then A74: z = |[(((1 - r2) * r3) + (r2 * r4))]| by A18, A70, A73, JORDAN2B:22;
for r5 being Real st q4 = |[r5]| holds
r5 <= - r
proof
let r5 be Real; :: thesis: ( q4 = |[r5]| implies r5 <= - r )
assume q4 = |[r5]| ; :: thesis: r5 <= - r
then A75: r5 = ((1 - r2) * r3) + (r2 * r4) by A74, JORDAN2B:23;
1 - r2 >= 0 by A72, XREAL_1:48;
then A76: (1 - r2) * r3 <= (1 - r2) * (- r) by A69, XREAL_1:64;
( r2 * r4 <= r2 * (- r) & ((1 - r2) * (- r)) + (r2 * (- r)) = - r ) by A67, A71, XREAL_1:64;
hence r5 <= - r by A75, A76, XREAL_1:7; :: thesis: verum
end;
hence z in P1 ; :: thesis: verum
end;
end;
then P1 is convex by JORDAN1:def 1;
then A77: Down (P1,(A `)) is connected by A50, CONNSP_1:46;
now :: thesis: BDD A is bounded
assume not BDD A is bounded ; :: thesis: contradiction
then consider q being Point of (TOP-REAL n) such that
A78: q in BDD A and
A79: not |.q.| < r by Th21;
consider y being set such that
A80: q in y and
A81: y in { B3 where B3 is Subset of (TOP-REAL n) : B3 is_inside_component_of A } by A78, TARSKI:def 4;
consider B3 being Subset of (TOP-REAL n) such that
A82: y = B3 and
A83: B3 is_inside_component_of A by A81;
q in the carrier of (TOP-REAL n) ;
then A84: q in REAL n by EUCLID:22;
for q2 being Point of (TOP-REAL n) st q2 = q holds
|.q2.| >= r by A79;
then not q in { q2 where q2 is Point of (TOP-REAL n) : |.q2.| < r } ;
then A85: q in P by A84, XBOOLE_0:def 5;
B3 is_a_component_of A ` by A83;
then consider B4 being Subset of ((TOP-REAL n) | (A `)) such that
A86: B4 = B3 and
A87: B4 is a_component by CONNSP_1:def 6;
end;
hence BDD A is bounded ; :: thesis: verum
end;
end;
end;
hence BDD A is bounded ; :: thesis: verum
end;
suppose n < 1 ; :: thesis: BDD A is bounded
end;
end;