ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mincncf Unicode version

Theorem mincncf 15717
Description: The minimum of two continuous real functions is continuous. (Contributed by Jim Kingdon, 19-Jul-2025.)
Hypotheses
Ref Expression
mincncf.a  |-  ( ph  ->  ( x  e.  X  |->  A )  e.  ( X -cn-> RR ) )
mincncf.b  |-  ( ph  ->  ( x  e.  X  |->  B )  e.  ( X -cn-> RR ) )
Assertion
Ref Expression
mincncf  |-  ( ph  ->  ( x  e.  X  |-> inf ( { A ,  B } ,  RR ,  <  ) )  e.  ( X -cn-> RR ) )
Distinct variable groups:    x, X    ph, x
Allowed substitution hints:    A( x)    B( x)

Proof of Theorem mincncf
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 mincncf.a . . . . . 6  |-  ( ph  ->  ( x  e.  X  |->  A )  e.  ( X -cn-> RR ) )
2 cncff 15678 . . . . . 6  |-  ( ( x  e.  X  |->  A )  e.  ( X
-cn-> RR )  ->  (
x  e.  X  |->  A ) : X --> RR )
31, 2syl 14 . . . . 5  |-  ( ph  ->  ( x  e.  X  |->  A ) : X --> RR )
43fvmptelcdm 5861 . . . 4  |-  ( (
ph  /\  x  e.  X )  ->  A  e.  RR )
5 mincncf.b . . . . . 6  |-  ( ph  ->  ( x  e.  X  |->  B )  e.  ( X -cn-> RR ) )
6 cncff 15678 . . . . . 6  |-  ( ( x  e.  X  |->  B )  e.  ( X
-cn-> RR )  ->  (
x  e.  X  |->  B ) : X --> RR )
75, 6syl 14 . . . . 5  |-  ( ph  ->  ( x  e.  X  |->  B ) : X --> RR )
87fvmptelcdm 5861 . . . 4  |-  ( (
ph  /\  x  e.  X )  ->  B  e.  RR )
9 minabs 12002 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR )  -> inf ( { A ,  B } ,  RR ,  <  )  =  ( ( ( A  +  B
)  -  ( abs `  ( A  -  B
) ) )  / 
2 ) )
104, 8, 9syl2anc 415 . . 3  |-  ( (
ph  /\  x  e.  X )  -> inf ( { A ,  B } ,  RR ,  <  )  =  ( ( ( A  +  B )  -  ( abs `  ( A  -  B )
) )  /  2
) )
1110mpteq2dva 4221 . 2  |-  ( ph  ->  ( x  e.  X  |-> inf ( { A ,  B } ,  RR ,  <  ) )  =  ( x  e.  X  |->  ( ( ( A  +  B )  -  ( abs `  ( A  -  B ) ) )  /  2 ) ) )
124, 8readdcld 8355 . . . . . 6  |-  ( (
ph  /\  x  e.  X )  ->  ( A  +  B )  e.  RR )
134, 8resubcld 8708 . . . . . . . 8  |-  ( (
ph  /\  x  e.  X )  ->  ( A  -  B )  e.  RR )
1413recnd 8354 . . . . . . 7  |-  ( (
ph  /\  x  e.  X )  ->  ( A  -  B )  e.  CC )
1514abscld 11947 . . . . . 6  |-  ( (
ph  /\  x  e.  X )  ->  ( abs `  ( A  -  B ) )  e.  RR )
1612, 15resubcld 8708 . . . . 5  |-  ( (
ph  /\  x  e.  X )  ->  (
( A  +  B
)  -  ( abs `  ( A  -  B
) ) )  e.  RR )
1716rehalfcld 9552 . . . 4  |-  ( (
ph  /\  x  e.  X )  ->  (
( ( A  +  B )  -  ( abs `  ( A  -  B ) ) )  /  2 )  e.  RR )
1817fmpttd 5863 . . 3  |-  ( ph  ->  ( x  e.  X  |->  ( ( ( A  +  B )  -  ( abs `  ( A  -  B ) ) )  /  2 ) ) : X --> RR )
19 ax-resscn 8271 . . . 4  |-  RR  C_  CC
20 ssid 3268 . . . . . . . . 9  |-  CC  C_  CC
21 cncfss 15684 . . . . . . . . 9  |-  ( ( RR  C_  CC  /\  CC  C_  CC )  ->  ( X -cn-> RR )  C_  ( X -cn-> CC ) )
2219, 20, 21mp2an 430 . . . . . . . 8  |-  ( X
-cn-> RR )  C_  ( X -cn-> CC )
2322, 1sselid 3246 . . . . . . 7  |-  ( ph  ->  ( x  e.  X  |->  A )  e.  ( X -cn-> CC ) )
2422, 5sselid 3246 . . . . . . 7  |-  ( ph  ->  ( x  e.  X  |->  B )  e.  ( X -cn-> CC ) )
2523, 24addcncf 15713 . . . . . 6  |-  ( ph  ->  ( x  e.  X  |->  ( A  +  B
) )  e.  ( X -cn-> CC ) )
26 cncfss 15684 . . . . . . . . . 10  |-  ( ( RR  C_  CC  /\  CC  C_  CC )  ->  ( CC -cn-> RR )  C_  ( CC -cn-> CC ) )
2719, 20, 26mp2an 430 . . . . . . . . 9  |-  ( CC
-cn-> RR )  C_  ( CC -cn-> CC )
28 abscncf 15686 . . . . . . . . 9  |-  abs  e.  ( CC -cn-> RR )
2927, 28sselii 3245 . . . . . . . 8  |-  abs  e.  ( CC -cn-> CC )
3029a1i 9 . . . . . . 7  |-  ( ph  ->  abs  e.  ( CC
-cn-> CC ) )
3123, 24subcncf 15714 . . . . . . 7  |-  ( ph  ->  ( x  e.  X  |->  ( A  -  B
) )  e.  ( X -cn-> CC ) )
3230, 31cncfmpt1f 15699 . . . . . 6  |-  ( ph  ->  ( x  e.  X  |->  ( abs `  ( A  -  B )
) )  e.  ( X -cn-> CC ) )
3325, 32subcncf 15714 . . . . 5  |-  ( ph  ->  ( x  e.  X  |->  ( ( A  +  B )  -  ( abs `  ( A  -  B ) ) ) )  e.  ( X
-cn-> CC ) )
34 2cn 9375 . . . . . . 7  |-  2  e.  CC
35 2ap0 9397 . . . . . . 7  |-  2 #  0
36 breq1 4133 . . . . . . . 8  |-  ( y  =  2  ->  (
y #  0  <->  2 #  0
) )
3736elrab 2982 . . . . . . 7  |-  ( 2  e.  { y  e.  CC  |  y #  0 }  <->  ( 2  e.  CC  /\  2 #  0 ) )
3834, 35, 37mpbir2an 955 . . . . . 6  |-  2  e.  { y  e.  CC  |  y #  0 }
39 cncfrss 15676 . . . . . . 7  |-  ( ( x  e.  X  |->  A )  e.  ( X
-cn-> RR )  ->  X  C_  CC )
401, 39syl 14 . . . . . 6  |-  ( ph  ->  X  C_  CC )
41 apsscn 8975 . . . . . . 7  |-  { y  e.  CC  |  y #  0 }  C_  CC
4241a1i 9 . . . . . 6  |-  ( ph  ->  { y  e.  CC  |  y #  0 }  C_  CC )
43 cncfmptc 15697 . . . . . 6  |-  ( ( 2  e.  { y  e.  CC  |  y #  0 }  /\  X  C_  CC  /\  { y  e.  CC  |  y #  0 }  C_  CC )  ->  ( x  e.  X  |->  2 )  e.  ( X -cn-> { y  e.  CC  |  y #  0 } ) )
4438, 40, 42, 43mp3an2i 1383 . . . . 5  |-  ( ph  ->  ( x  e.  X  |->  2 )  e.  ( X -cn-> { y  e.  CC  |  y #  0 }
) )
4533, 44divcncfap 15715 . . . 4  |-  ( ph  ->  ( x  e.  X  |->  ( ( ( A  +  B )  -  ( abs `  ( A  -  B ) ) )  /  2 ) )  e.  ( X
-cn-> CC ) )
46 cncfcdm 15683 . . . 4  |-  ( ( RR  C_  CC  /\  (
x  e.  X  |->  ( ( ( A  +  B )  -  ( abs `  ( A  -  B ) ) )  /  2 ) )  e.  ( X -cn-> CC ) )  ->  (
( x  e.  X  |->  ( ( ( A  +  B )  -  ( abs `  ( A  -  B ) ) )  /  2 ) )  e.  ( X
-cn-> RR )  <->  ( x  e.  X  |->  ( ( ( A  +  B
)  -  ( abs `  ( A  -  B
) ) )  / 
2 ) ) : X --> RR ) )
4719, 45, 46sylancr 418 . . 3  |-  ( ph  ->  ( ( x  e.  X  |->  ( ( ( A  +  B )  -  ( abs `  ( A  -  B )
) )  /  2
) )  e.  ( X -cn-> RR )  <->  ( x  e.  X  |->  ( ( ( A  +  B
)  -  ( abs `  ( A  -  B
) ) )  / 
2 ) ) : X --> RR ) )
4818, 47mpbird 167 . 2  |-  ( ph  ->  ( x  e.  X  |->  ( ( ( A  +  B )  -  ( abs `  ( A  -  B ) ) )  /  2 ) )  e.  ( X
-cn-> RR ) )
4911, 48eqeltrd 2315 1  |-  ( ph  ->  ( x  e.  X  |-> inf ( { A ,  B } ,  RR ,  <  ) )  e.  ( X -cn-> RR ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   {crab 2532    C_ wss 3220   {cpr 3710   class class class wbr 4130    |-> cmpt 4192   -->wf 5373   ` cfv 5377  (class class class)co 6085  infcinf 7323   CCcc 8177   RRcr 8178   0cc0 8179    + caddc 8182    < clt 8360    - cmin 8497   # cap 8909    / cdiv 9002   2c2 9355   abscabs 11763   -cn->ccncf 15671
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298  ax-caucvg 8299  ax-addf 8301
This proof depends on definitions:  df-bi 117  df-stab 843  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-isom 5386  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-map 6924  df-sup 7324  df-inf 7325  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-n0 9564  df-z 9645  df-uz 9922  df-q 10020  df-rp 10055  df-xneg 10174  df-xadd 10175  df-seqfrec 10885  df-exp 10976  df-cj 11607  df-re 11608  df-im 11609  df-rsqrt 11764  df-abs 11765  df-rest 13595  df-topgen 13614  df-psmet 14880  df-xmet 14881  df-met 14882  df-bl 14883  df-mopn 14884  df-top 15099  df-topon 15112  df-bases 15144  df-cn 15289  df-cnp 15290  df-tx 15354  df-cncf 15672
This theorem is used by:  hovercncf  15747
  Copyright terms: Public domain W3C validator