let X, Y be set ; :: thesis: for f being real-valued Function st f | X is bounded_above & f | Y is bounded_above holds
f | (X \/ Y) is bounded_above

let f be real-valued Function; :: thesis: ( f | X is bounded_above & f | Y is bounded_above implies f | (X \/ Y) is bounded_above )
assume that
A1: f | X is bounded_above and
A2: f | Y is bounded_above ; :: thesis: f | (X \/ Y) is bounded_above
consider r1 being Real such that
A3: for c being object st c in X /\ (dom f) holds
f . c <= r1 by ;
consider r2 being Real such that
A4: for c being object st c in Y /\ (dom f) holds
f . c <= r2 by ;
now :: thesis: ex r being set st
for c being object st c in (X \/ Y) /\ (dom f) holds
f . c <= r
take r = |.r1.| + |.r2.|; :: thesis: for c being object st c in (X \/ Y) /\ (dom f) holds
f . c <= r

let c be object ; :: thesis: ( c in (X \/ Y) /\ (dom f) implies f . c <= r )
assume A5: c in (X \/ Y) /\ (dom f) ; :: thesis: f . c <= r
then A6: c in dom f by XBOOLE_0:def 4;
A7: c in X \/ Y by ;
now :: thesis: f . c <= r
per cases ( c in X or c in Y ) by ;
suppose c in X ; :: thesis: f . c <= r
then c in X /\ (dom f) by ;
then A8: f . c <= r1 by A3;
A9: 0 <= |.r2.| by COMPLEX1:46;
r1 <= |.r1.| by ABSVALUE:4;
then f . c <= |.r1.| by ;
then (f . c) + 0 <= r by ;
hence f . c <= r ; :: thesis: verum
end;
suppose c in Y ; :: thesis: f . c <= r
then c in Y /\ (dom f) by ;
then A10: f . c <= r2 by A4;
A11: 0 <= |.r1.| by COMPLEX1:46;
r2 <= |.r2.| by ABSVALUE:4;
then f . c <= |.r2.| by ;
then 0 + (f . c) <= r by ;
hence f . c <= r ; :: thesis: verum
end;
end;
end;
hence f . c <= r ; :: thesis: verum
end;
hence f | (X \/ Y) is bounded_above by Th70; :: thesis: verum