set C = [.0,1.];

defpred S_{1}[ set , set ] means ( $1 = 0 or $2 = 0 );

deffunc H_{1}( Element of [.0,1.], Element of [.0,1.]) -> Element of [.0,1.] = In ((max ($1,$2)),[.0,1.]);

deffunc H_{2}( Element of [.0,1.], Element of [.0,1.]) -> Element of [.0,1.] = In (1,[.0,1.]);

ex f being Function of [:[.0,1.],[.0,1.]:],[.0,1.] st

for c, d being Element of [.0,1.] st [c,d] in dom f holds

( ( S_{1}[c,d] implies f . [c,d] = H_{1}(c,d) ) & ( not S_{1}[c,d] implies f . [c,d] = H_{2}(c,d) ) )
from SCHEME1:sch 21();

then consider f being Function of [:[.0,1.],[.0,1.]:],[.0,1.] such that

A1: for c, d being Element of [.0,1.] st [c,d] in dom f holds

( ( S_{1}[c,d] implies f . [c,d] = H_{1}(c,d) ) & ( not S_{1}[c,d] implies f . [c,d] = H_{2}(c,d) ) )
;

take f ; :: thesis: for a, b being Element of [.0,1.] holds

( ( min (a,b) = 0 implies f . (a,b) = max (a,b) ) & ( min (a,b) <> 0 implies f . (a,b) = 1 ) )

A0: dom f = [:[.0,1.],[.0,1.]:] by FUNCT_2:def 1;

let a, b be Element of [.0,1.]; :: thesis: ( ( min (a,b) = 0 implies f . (a,b) = max (a,b) ) & ( min (a,b) <> 0 implies f . (a,b) = 1 ) )

cc: ( max (a,b) = a or max (a,b) = b ) by XXREAL_0:16;

AA: [a,b] in dom f by A0, ZFMISC_1:87;

( ( min (a,b) = 0 implies f . (a,b) = max (a,b) ) & ( min (a,b) <> 0 implies f . (a,b) = 1 ) )

defpred S

deffunc H

deffunc H

ex f being Function of [:[.0,1.],[.0,1.]:],[.0,1.] st

for c, d being Element of [.0,1.] st [c,d] in dom f holds

( ( S

then consider f being Function of [:[.0,1.],[.0,1.]:],[.0,1.] such that

A1: for c, d being Element of [.0,1.] st [c,d] in dom f holds

( ( S

take f ; :: thesis: for a, b being Element of [.0,1.] holds

( ( min (a,b) = 0 implies f . (a,b) = max (a,b) ) & ( min (a,b) <> 0 implies f . (a,b) = 1 ) )

A0: dom f = [:[.0,1.],[.0,1.]:] by FUNCT_2:def 1;

let a, b be Element of [.0,1.]; :: thesis: ( ( min (a,b) = 0 implies f . (a,b) = max (a,b) ) & ( min (a,b) <> 0 implies f . (a,b) = 1 ) )

cc: ( max (a,b) = a or max (a,b) = b ) by XXREAL_0:16;

AA: [a,b] in dom f by A0, ZFMISC_1:87;

( ( min (a,b) = 0 implies f . (a,b) = max (a,b) ) & ( min (a,b) <> 0 implies f . (a,b) = 1 ) )

proof

hence
( ( min (a,b) = 0 implies f . (a,b) = max (a,b) ) & ( min (a,b) <> 0 implies f . (a,b) = 1 ) )
; :: thesis: verum
thus
( min (a,b) = 0 implies f . (a,b) = max (a,b) )
:: thesis: ( min (a,b) <> 0 implies f . (a,b) = 1 )

( a <> 0 & b <> 0 )_{2}(a,b)
by A1, AA

.= 1 by XXREAL_1:1, SUBSET_1:def 8 ;

hence f . (a,b) = 1 ; :: thesis: verum

end;proof

assume B0:
min (a,b) <> 0
; :: thesis: f . (a,b) = 1
assume
min (a,b) = 0
; :: thesis: f . (a,b) = max (a,b)

then ( a = 0 or b = 0 ) by XXREAL_0:15;

then f . [a,b] = H_{1}(a,b)
by A1, AA

.= max (a,b) by SUBSET_1:def 8, cc ;

hence f . (a,b) = max (a,b) ; :: thesis: verum

end;then ( a = 0 or b = 0 ) by XXREAL_0:15;

then f . [a,b] = H

.= max (a,b) by SUBSET_1:def 8, cc ;

hence f . (a,b) = max (a,b) ; :: thesis: verum

( a <> 0 & b <> 0 )

proof

then f . [a,b] =
H
assume
( a = 0 or b = 0 )
; :: thesis: contradiction

end;.= 1 by XXREAL_1:1, SUBSET_1:def 8 ;

hence f . (a,b) = 1 ; :: thesis: verum