let C1, C2, C3 be non empty set ; :: thesis: for f, g being RMembership_Func of C1,C2
for h being RMembership_Func of C2,C3
for x, z being set st x in C1 & z in C3 holds
sup (rng (min (min f,g),h,x,z)) <= min (sup (rng (min f,h,x,z))),(sup (rng (min g,h,x,z)))
let f, g be RMembership_Func of C1,C2; :: thesis: for h being RMembership_Func of C2,C3
for x, z being set st x in C1 & z in C3 holds
sup (rng (min (min f,g),h,x,z)) <= min (sup (rng (min f,h,x,z))),(sup (rng (min g,h,x,z)))
let h be RMembership_Func of C2,C3; :: thesis: for x, z being set st x in C1 & z in C3 holds
sup (rng (min (min f,g),h,x,z)) <= min (sup (rng (min f,h,x,z))),(sup (rng (min g,h,x,z)))
let x, z be set ; :: thesis: ( x in C1 & z in C3 implies sup (rng (min (min f,g),h,x,z)) <= min (sup (rng (min f,h,x,z))),(sup (rng (min g,h,x,z))) )
assume A1:
( x in C1 & z in C3 )
; :: thesis: sup (rng (min (min f,g),h,x,z)) <= min (sup (rng (min f,h,x,z))),(sup (rng (min g,h,x,z)))
set F = min (min f,g),h,x,z;
set G = min f,h,x,z;
set H = min g,h,x,z;
rng (min (min f,g),h,x,z) is bounded
by Th1;
then A2:
rng (min (min f,g),h,x,z) is bounded_above
by XXREAL_2:def 11;
rng (min f,h,x,z) is bounded
by Th1;
then A3:
rng (min f,h,x,z) is bounded_above
by XXREAL_2:def 11;
rng (min g,h,x,z) is bounded
by Th1;
then A4:
rng (min g,h,x,z) is bounded_above
by XXREAL_2:def 11;
A5:
for y being set st y in dom (min f,h,x,z) holds
(min f,h,x,z) . y <= sup (rng (min f,h,x,z))
proof
let y be
set ;
:: thesis: ( y in dom (min f,h,x,z) implies (min f,h,x,z) . y <= sup (rng (min f,h,x,z)) )
assume
y in dom (min f,h,x,z)
;
:: thesis: (min f,h,x,z) . y <= sup (rng (min f,h,x,z))
then
(min f,h,x,z) . y in rng (min f,h,x,z)
by FUNCT_1:def 5;
hence
(min f,h,x,z) . y <= sup (rng (min f,h,x,z))
by A3, SEQ_4:def 4;
:: thesis: verum
end;
A6:
for y being set st y in dom (min g,h,x,z) holds
(min g,h,x,z) . y <= sup (rng (min g,h,x,z))
proof
let y be
set ;
:: thesis: ( y in dom (min g,h,x,z) implies (min g,h,x,z) . y <= sup (rng (min g,h,x,z)) )
assume
y in dom (min g,h,x,z)
;
:: thesis: (min g,h,x,z) . y <= sup (rng (min g,h,x,z))
then
(min g,h,x,z) . y in rng (min g,h,x,z)
by FUNCT_1:def 5;
hence
(min g,h,x,z) . y <= sup (rng (min g,h,x,z))
by A4, SEQ_4:def 4;
:: thesis: verum
end;
A7:
sup (rng (min (min f,g),h,x,z)) <= sup (rng (min f,h,x,z))
proof
A8:
for
s being
real number st
0 < s holds
ex
y being
set st
(
y in dom (min (min f,g),h,x,z) &
(sup (rng (min (min f,g),h,x,z))) - s <= (min f,h,x,z) . y )
proof
let s be
real number ;
:: thesis: ( 0 < s implies ex y being set st
( y in dom (min (min f,g),h,x,z) & (sup (rng (min (min f,g),h,x,z))) - s <= (min f,h,x,z) . y ) )
assume
0 < s
;
:: thesis: ex y being set st
( y in dom (min (min f,g),h,x,z) & (sup (rng (min (min f,g),h,x,z))) - s <= (min f,h,x,z) . y )
then consider r being
real number such that A9:
(
r in rng (min (min f,g),h,x,z) &
(sup (rng (min (min f,g),h,x,z))) - s < r )
by A2, SEQ_4:def 4;
consider y being
set such that A10:
(
y in dom (min (min f,g),h,x,z) &
r = (min (min f,g),h,x,z) . y )
by A9, FUNCT_1:def 5;
A11:
[x,y] in [:C1,C2:]
by A1, A10, ZFMISC_1:106;
(min (min f,g),h,x,z) . y =
min ((min f,g) . [x,y]),
(h . [y,z])
by A1, A10, Def2
.=
min (min (f . [x,y]),(g . [x,y])),
(h . [y,z])
by A11, FUZZY_1:def 4
.=
min (min (h . [y,z]),(f . [x,y])),
(g . [x,y])
by XXREAL_0:33
.=
min ((min f,h,x,z) . y),
(g . [x,y])
by A1, A10, Def2
;
then
r <= (min f,h,x,z) . y
by A10, XXREAL_0:17;
hence
ex
y being
set st
(
y in dom (min (min f,g),h,x,z) &
(sup (rng (min (min f,g),h,x,z))) - s <= (min f,h,x,z) . y )
by A9, A10, XXREAL_0:2;
:: thesis: verum
end;
for
s being
real number st
0 < s holds
(sup (rng (min (min f,g),h,x,z))) - s <= sup (rng (min f,h,x,z))
proof
let s be
real number ;
:: thesis: ( 0 < s implies (sup (rng (min (min f,g),h,x,z))) - s <= sup (rng (min f,h,x,z)) )
assume
0 < s
;
:: thesis: (sup (rng (min (min f,g),h,x,z))) - s <= sup (rng (min f,h,x,z))
then consider y being
set such that A12:
(
y in dom (min (min f,g),h,x,z) &
(sup (rng (min (min f,g),h,x,z))) - s <= (min f,h,x,z) . y )
by A8;
y in C2
by A12;
then
y in dom (min f,h,x,z)
by FUNCT_2:def 1;
then
(min f,h,x,z) . y <= sup (rng (min f,h,x,z))
by A5;
hence
(sup (rng (min (min f,g),h,x,z))) - s <= sup (rng (min f,h,x,z))
by A12, XXREAL_0:2;
:: thesis: verum
end;
hence
sup (rng (min (min f,g),h,x,z)) <= sup (rng (min f,h,x,z))
by XREAL_1:59;
:: thesis: verum
end;
sup (rng (min (min f,g),h,x,z)) <= sup (rng (min g,h,x,z))
proof
A13:
for
s being
real number st
0 < s holds
ex
y being
set st
(
y in dom (min (min f,g),h,x,z) &
(sup (rng (min (min f,g),h,x,z))) - s <= (min g,h,x,z) . y )
proof
let s be
real number ;
:: thesis: ( 0 < s implies ex y being set st
( y in dom (min (min f,g),h,x,z) & (sup (rng (min (min f,g),h,x,z))) - s <= (min g,h,x,z) . y ) )
assume
0 < s
;
:: thesis: ex y being set st
( y in dom (min (min f,g),h,x,z) & (sup (rng (min (min f,g),h,x,z))) - s <= (min g,h,x,z) . y )
then consider r being
real number such that A14:
(
r in rng (min (min f,g),h,x,z) &
(sup (rng (min (min f,g),h,x,z))) - s < r )
by A2, SEQ_4:def 4;
consider y being
set such that A15:
(
y in dom (min (min f,g),h,x,z) &
r = (min (min f,g),h,x,z) . y )
by A14, FUNCT_1:def 5;
A16:
[x,y] in [:C1,C2:]
by A1, A15, ZFMISC_1:106;
(min (min f,g),h,x,z) . y =
min ((min f,g) . [x,y]),
(h . [y,z])
by A1, A15, Def2
.=
min (min (f . [x,y]),(g . [x,y])),
(h . [y,z])
by A16, FUZZY_1:def 4
.=
min (f . [x,y]),
(min (h . [y,z]),(g . [x,y]))
by XXREAL_0:33
.=
min ((min g,h,x,z) . y),
(f . [x,y])
by A1, A15, Def2
;
then
r <= (min g,h,x,z) . y
by A15, XXREAL_0:17;
hence
ex
y being
set st
(
y in dom (min (min f,g),h,x,z) &
(sup (rng (min (min f,g),h,x,z))) - s <= (min g,h,x,z) . y )
by A14, A15, XXREAL_0:2;
:: thesis: verum
end;
for
s being
real number st
0 < s holds
(sup (rng (min (min f,g),h,x,z))) - s <= sup (rng (min g,h,x,z))
proof
let s be
real number ;
:: thesis: ( 0 < s implies (sup (rng (min (min f,g),h,x,z))) - s <= sup (rng (min g,h,x,z)) )
assume
0 < s
;
:: thesis: (sup (rng (min (min f,g),h,x,z))) - s <= sup (rng (min g,h,x,z))
then consider y being
set such that A17:
(
y in dom (min (min f,g),h,x,z) &
(sup (rng (min (min f,g),h,x,z))) - s <= (min g,h,x,z) . y )
by A13;
y in C2
by A17;
then
y in dom (min g,h,x,z)
by FUNCT_2:def 1;
then
(min g,h,x,z) . y <= sup (rng (min g,h,x,z))
by A6;
hence
(sup (rng (min (min f,g),h,x,z))) - s <= sup (rng (min g,h,x,z))
by A17, XXREAL_0:2;
:: thesis: verum
end;
hence
sup (rng (min (min f,g),h,x,z)) <= sup (rng (min g,h,x,z))
by XREAL_1:59;
:: thesis: verum
end;
hence
sup (rng (min (min f,g),h,x,z)) <= min (sup (rng (min f,h,x,z))),(sup (rng (min g,h,x,z)))
by A7, XXREAL_0:20; :: thesis: verum