ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  xrmaxiflemcl Unicode version
Theorem xrmaxiflemcl 11014
Description: Lemma for xrmaxif 11020. Closure. (Contributed by Jim Kingdon, 29-Apr-2023.)
Assertion
Ref Expression
xrmaxiflemcl |- ( ( A e. RR* /\ B e. RR* ) -> if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) ) e. RR* )
Proof of Theorem xrmaxiflemcl
StepHypRef Expression
1 pnfxr 7818 . . 3 |- +oo e. RR*
21a1i 9 . 2 |- ( ( ( A e. RR* /\ B e. RR* ) /\ B = +oo ) -> +oo e. RR* )
3 simpl 108 . . . 4 |- ( ( A e. RR* /\ B e. RR* ) -> A e. RR* )
43ad2antrr 479 . . 3 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ B = -oo ) -> A e. RR* )
51a1i 9 . . . 4 |- ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ A = +oo ) -> +oo e. RR* )
6 simpr 109 . . . . . 6 |- ( ( A e. RR* /\ B e. RR* ) -> B e. RR* )
76ad4antr 485 . . . . 5 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ A = -oo ) -> B e. RR* )
8 simplr 519 . . . . . . . 8 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ -. A = -oo ) -> -. A = +oo )
9 simpr 109 . . . . . . . 8 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ -. A = -oo ) -> -. A = -oo )
10 elxr 9563 . . . . . . . . . 10 |- ( A e. RR* <-> ( A e. RR \/ A = +oo \/ A = -oo ) )
113, 10sylib 121 . . . . . . . . 9 |- ( ( A e. RR* /\ B e. RR* ) -> ( A e. RR \/ A = +oo \/ A = -oo ) )
1211ad4antr 485 . . . . . . . 8 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ -. A = -oo ) -> ( A e. RR \/ A = +oo \/ A = -oo ) )
138, 9, 12ecase23d 1328 . . . . . . 7 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ -. A = -oo ) -> A e. RR )
14 simp-4r 531 . . . . . . . 8 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ -. A = -oo ) -> -. B = +oo )
15 simpllr 523 . . . . . . . 8 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ -. A = -oo ) -> -. B = -oo )
16 elxr 9563 . . . . . . . . . 10 |- ( B e. RR* <-> ( B e. RR \/ B = +oo \/ B = -oo ) )
176, 16sylib 121 . . . . . . . . 9 |- ( ( A e. RR* /\ B e. RR* ) -> ( B e. RR \/ B = +oo \/ B = -oo ) )
1817ad4antr 485 . . . . . . . 8 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ -. A = -oo ) -> ( B e. RR \/ B = +oo \/ B = -oo ) )
1914, 15, 18ecase23d 1328 . . . . . . 7 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ -. A = -oo ) -> B e. RR )
20 maxcl 10982 . . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> sup ( { A , B } , RR , < ) e. RR )
2113, 19, 20syl2anc 408 . . . . . 6 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ -. A = -oo ) -> sup ( { A , B } , RR , < ) e. RR )
2221rexrd 7815 . . . . 5 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ -. A = -oo ) -> sup ( { A , B } , RR , < ) e. RR* )
23 xrmnfdc 9626 . . . . . 6 |- ( A e. RR* -> DECID A = -oo )
2423ad4antr 485 . . . . 5 |- ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) -> DECID A = -oo )
257, 22, 24ifcldadc 3501 . . . 4 |- ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) -> if ( A = -oo , B , sup ( { A , B } , RR , < ) ) e. RR* )
26 xrpnfdc 9625 . . . . . 6 |- ( A e. RR* -> DECID A = +oo )
273, 26syl 14 . . . . 5 |- ( ( A e. RR* /\ B e. RR* ) -> DECID A = +oo )
2827ad2antrr 479 . . . 4 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) -> DECID A = +oo )
295, 25, 28ifcldadc 3501 . . 3 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) -> if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) e. RR* )
30 xrmnfdc 9626 . . . 4 |- ( B e. RR* -> DECID B = -oo )
3130ad2antlr 480 . . 3 |- ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) -> DECID B = -oo )
324, 29, 31ifcldadc 3501 . 2 |- ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) -> if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) e. RR* )
33 xrpnfdc 9625 . . 3 |- ( B e. RR* -> DECID B = +oo )
346, 33syl 14 . 2 |- ( ( A e. RR* /\ B e. RR* ) -> DECID B = +oo )
352, 32, 34ifcldadc 3501 1 |- ( ( A e. RR* /\ B e. RR* ) -> if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) ) e. RR* )
Colors of variables: wff set class
Syntax hints:   -. wn 3   -> wi 4   /\ wa 103  DECID wdc 819   \/ w3o 961   = wceq 1331   e. wcel 1480   ifcif 3474   {cpr 3528   supcsup 6869   RRcr 7619   +oocpnf 7797   -oocmnf 7798   RR*cxr 7799   < clt 7800
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502  ax-cnex 7711  ax-resscn 7712  ax-1cn 7713  ax-1re 7714  ax-icn 7715  ax-addcl 7716  ax-addrcl 7717  ax-mulcl 7718  ax-mulrcl 7719  ax-addcom 7720  ax-mulcom 7721  ax-addass 7722  ax-mulass 7723  ax-distr 7724  ax-i2m1 7725  ax-0lt1 7726  ax-1rid 7727  ax-0id 7728  ax-rnegex 7729  ax-precex 7730  ax-cnre 7731  ax-pre-ltirr 7732  ax-pre-ltwlin 7733  ax-pre-lttrn 7734  ax-pre-apti 7735  ax-pre-ltadd 7736  ax-pre-mulgt0 7737  ax-pre-mulext 7738  ax-arch 7739  ax-caucvg 7740
This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-reu 2423  df-rmo 2424  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-if 3475  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-po 4218  df-iso 4219  df-iord 4288  df-on 4290  df-ilim 4291  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-riota 5730  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-recs 6202  df-frec 6288  df-sup 6871  df-pnf 7802  df-mnf 7803  df-xr 7804  df-ltxr 7805  df-le 7806  df-sub 7935  df-neg 7936  df-reap 8337  df-ap 8344  df-div 8433  df-inn 8721  df-2 8779  df-3 8780  df-4 8781  df-n0 8978  df-z 9055  df-uz 9327  df-rp 9442  df-seqfrec 10219  df-exp 10293  df-cj 10614  df-re 10615  df-im 10616  df-rsqrt 10770  df-abs 10771
This theorem is referenced by:  xrmaxiflemlub  11017  xrmaxiflemval  11019  xrmaxcl  11021
  Copyright terms: Public domain W3C validator