ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  xrmaxiflemcl Unicode version
Theorem xrmaxiflemcl 11208
Description: Lemma for xrmaxif 11214. 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 7972 . . 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 485 . . 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 491 . . . . 5 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ A = -oo ) -> B e. RR* )
8 simplr 525 . . . . . . . 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 9733 . . . . . . . . . 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 491 . . . . . . . 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 1345 . . . . . . 7 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ -. A = -oo ) -> A e. RR )
14 simp-4r 537 . . . . . . . 8 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ -. A = -oo ) -> -. B = +oo )
15 simpllr 529 . . . . . . . 8 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ -. A = -oo ) -> -. B = -oo )
16 elxr 9733 . . . . . . . . . 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 491 . . . . . . . 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 1345 . . . . . . 7 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ -. A = -oo ) -> B e. RR )
20 maxcl 11174 . . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> sup ( { A , B } , RR , < ) e. RR )
2113, 19, 20syl2anc 409 . . . . . 6 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ -. A = -oo ) -> sup ( { A , B } , RR , < ) e. RR )
2221rexrd 7969 . . . . 5 |- ( ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) /\ -. A = -oo ) -> sup ( { A , B } , RR , < ) e. RR* )
23 xrmnfdc 9800 . . . . . 6 |- ( A e. RR* -> DECID A = -oo )
2423ad4antr 491 . . . . 5 |- ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) /\ -. A = +oo ) -> DECID A = -oo )
257, 22, 24ifcldadc 3555 . . . 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 9799 . . . . . 6 |- ( A e. RR* -> DECID A = +oo )
273, 26syl 14 . . . . 5 |- ( ( A e. RR* /\ B e. RR* ) -> DECID A = +oo )
2827ad2antrr 485 . . . 4 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) /\ -. B = -oo ) -> DECID A = +oo )
295, 25, 28ifcldadc 3555 . . 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 9800 . . . 4 |- ( B e. RR* -> DECID B = -oo )
3130ad2antlr 486 . . 3 |- ( ( ( A e. RR* /\ B e. RR* ) /\ -. B = +oo ) -> DECID B = -oo )
324, 29, 31ifcldadc 3555 . 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 9799 . . 3 |- ( B e. RR* -> DECID B = +oo )
346, 33syl 14 . 2 |- ( ( A e. RR* /\ B e. RR* ) -> DECID B = +oo )
352, 32, 34ifcldadc 3555 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 829   \/ w3o 972   = wceq 1348   e. wcel 2141   ifcif 3526   {cpr 3584   supcsup 6959   RRcr 7773   +oocpnf 7951   -oocmnf 7952   RR*cxr 7953   < clt 7954
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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-iinf 4572  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-mulrcl 7873  ax-addcom 7874  ax-mulcom 7875  ax-addass 7876  ax-mulass 7877  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-1rid 7881  ax-0id 7882  ax-rnegex 7883  ax-precex 7884  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-apti 7889  ax-pre-ltadd 7890  ax-pre-mulgt0 7891  ax-pre-mulext 7892  ax-arch 7893  ax-caucvg 7894
This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rmo 2456  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-if 3527  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-po 4281  df-iso 4282  df-iord 4351  df-on 4353  df-ilim 4354  df-suc 4356  df-iom 4575  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-recs 6284  df-frec 6370  df-sup 6961  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093  df-reap 8494  df-ap 8501  df-div 8590  df-inn 8879  df-2 8937  df-3 8938  df-4 8939  df-n0 9136  df-z 9213  df-uz 9488  df-rp 9611  df-seqfrec 10402  df-exp 10476  df-cj 10806  df-re 10807  df-im 10808  df-rsqrt 10962  df-abs 10963
This theorem is referenced by:  xrmaxiflemlub  11211  xrmaxiflemval  11213  xrmaxcl  11215
  Copyright terms: Public domain W3C validator