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

Theorem xrmaxifle 11027
Description: An upper bound for {𝐴, 𝐵} in the extended reals. (Contributed by Jim Kingdon, 26-Apr-2023.)
Assertion
Ref Expression
xrmaxifle ((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) → 𝐴 ≤ if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))

Proof of Theorem xrmaxifle
StepHypRef Expression
1 pnfge 9587 . . . 4 (𝐴 ∈ ℝ*𝐴 ≤ +∞)
21ad2antrr 479 . . 3 (((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → 𝐴 ≤ +∞)
3 simpr 109 . . . 4 (((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → 𝐵 = +∞)
43iftrued 3481 . . 3 (((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = +∞)
52, 4breqtrrd 3956 . 2 (((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → 𝐴 ≤ if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))
6 xrleid 9598 . . . . . 6 (𝐴 ∈ ℝ*𝐴𝐴)
76ad3antrrr 483 . . . . 5 ((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐴𝐴)
8 simpr 109 . . . . . 6 ((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐵 = -∞)
98iftrued 3481 . . . . 5 ((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = 𝐴)
107, 9breqtrrd 3956 . . . 4 ((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐴 ≤ if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
111ad4antr 485 . . . . . . 7 (((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → 𝐴 ≤ +∞)
12 simpr 109 . . . . . . . 8 (((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → 𝐴 = +∞)
1312iftrued 3481 . . . . . . 7 (((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))) = +∞)
1411, 13breqtrrd 3956 . . . . . 6 (((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → 𝐴 ≤ if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
15 mnfle 9590 . . . . . . . . . 10 (𝐵 ∈ ℝ* → -∞ ≤ 𝐵)
1615ad5antlr 488 . . . . . . . . 9 ((((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ 𝐴 = -∞) → -∞ ≤ 𝐵)
17 simpr 109 . . . . . . . . 9 ((((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ 𝐴 = -∞) → 𝐴 = -∞)
1817iftrued 3481 . . . . . . . . 9 ((((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ 𝐴 = -∞) → if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )) = 𝐵)
1916, 17, 183brtr4d 3960 . . . . . . . 8 ((((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ 𝐴 = -∞) → 𝐴 ≤ if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
20 simplr 519 . . . . . . . . . . 11 ((((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐴 = +∞)
21 simpr 109 . . . . . . . . . . 11 ((((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐴 = -∞)
22 elxr 9575 . . . . . . . . . . . . 13 (𝐴 ∈ ℝ* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
2322biimpi 119 . . . . . . . . . . . 12 (𝐴 ∈ ℝ* → (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
2423ad5antr 487 . . . . . . . . . . 11 ((((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
2520, 21, 24ecase23d 1328 . . . . . . . . . 10 ((((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 ∈ ℝ)
26 simpr 109 . . . . . . . . . . . 12 (((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) → ¬ 𝐵 = +∞)
2726ad3antrrr 483 . . . . . . . . . . 11 ((((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐵 = +∞)
28 simpr 109 . . . . . . . . . . . 12 ((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → ¬ 𝐵 = -∞)
2928ad2antrr 479 . . . . . . . . . . 11 ((((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐵 = -∞)
30 elxr 9575 . . . . . . . . . . . . 13 (𝐵 ∈ ℝ* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
3130biimpi 119 . . . . . . . . . . . 12 (𝐵 ∈ ℝ* → (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
3231ad5antlr 488 . . . . . . . . . . 11 ((((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
3327, 29, 32ecase23d 1328 . . . . . . . . . 10 ((((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐵 ∈ ℝ)
34 maxle1 10995 . . . . . . . . . 10 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐴 ≤ sup({𝐴, 𝐵}, ℝ, < ))
3525, 33, 34syl2anc 408 . . . . . . . . 9 ((((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 ≤ sup({𝐴, 𝐵}, ℝ, < ))
3621iffalsed 3484 . . . . . . . . 9 ((((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )) = sup({𝐴, 𝐵}, ℝ, < ))
3735, 36breqtrrd 3956 . . . . . . . 8 ((((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 ≤ if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
38 xrmnfdc 9638 . . . . . . . . . 10 (𝐴 ∈ ℝ*DECID 𝐴 = -∞)
39 exmiddc 821 . . . . . . . . . 10 (DECID 𝐴 = -∞ → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
4038, 39syl 14 . . . . . . . . 9 (𝐴 ∈ ℝ* → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
4140ad4antr 485 . . . . . . . 8 (((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
4219, 37, 41mpjaodan 787 . . . . . . 7 (((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → 𝐴 ≤ if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
43 simpr 109 . . . . . . . 8 (((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → ¬ 𝐴 = +∞)
4443iffalsed 3484 . . . . . . 7 (((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))) = if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
4542, 44breqtrrd 3956 . . . . . 6 (((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → 𝐴 ≤ if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
46 xrpnfdc 9637 . . . . . . . 8 (𝐴 ∈ ℝ*DECID 𝐴 = +∞)
47 exmiddc 821 . . . . . . . 8 (DECID 𝐴 = +∞ → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
4846, 47syl 14 . . . . . . 7 (𝐴 ∈ ℝ* → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
4948ad3antrrr 483 . . . . . 6 ((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
5014, 45, 49mpjaodan 787 . . . . 5 ((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → 𝐴 ≤ if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
5128iffalsed 3484 . . . . 5 ((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
5250, 51breqtrrd 3956 . . . 4 ((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → 𝐴 ≤ if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
53 xrmnfdc 9638 . . . . . 6 (𝐵 ∈ ℝ*DECID 𝐵 = -∞)
54 exmiddc 821 . . . . . 6 (DECID 𝐵 = -∞ → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
5553, 54syl 14 . . . . 5 (𝐵 ∈ ℝ* → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
5655ad2antlr 480 . . . 4 (((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
5710, 52, 56mpjaodan 787 . . 3 (((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) → 𝐴 ≤ if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
5826iffalsed 3484 . . 3 (((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
5957, 58breqtrrd 3956 . 2 (((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) → 𝐴 ≤ if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))
60 xrpnfdc 9637 . . . 4 (𝐵 ∈ ℝ*DECID 𝐵 = +∞)
61 exmiddc 821 . . . 4 (DECID 𝐵 = +∞ → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
6260, 61syl 14 . . 3 (𝐵 ∈ ℝ* → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
6362adantl 275 . 2 ((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
645, 59, 63mpjaodan 787 1 ((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) → 𝐴 ≤ if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wo 697  DECID wdc 819  w3o 961   = wceq 1331  wcel 1480  ifcif 3474  {cpr 3528   class class class wbr 3929  supcsup 6869  cr 7631  +∞cpnf 7809  -∞cmnf 7810  *cxr 7811   < clt 7812  cle 7813
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 7723  ax-resscn 7724  ax-1cn 7725  ax-1re 7726  ax-icn 7727  ax-addcl 7728  ax-addrcl 7729  ax-mulcl 7730  ax-mulrcl 7731  ax-addcom 7732  ax-mulcom 7733  ax-addass 7734  ax-mulass 7735  ax-distr 7736  ax-i2m1 7737  ax-0lt1 7738  ax-1rid 7739  ax-0id 7740  ax-rnegex 7741  ax-precex 7742  ax-cnre 7743  ax-pre-ltirr 7744  ax-pre-ltwlin 7745  ax-pre-lttrn 7746  ax-pre-apti 7747  ax-pre-ltadd 7748  ax-pre-mulgt0 7749  ax-pre-mulext 7750  ax-arch 7751  ax-caucvg 7752
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 7814  df-mnf 7815  df-xr 7816  df-ltxr 7817  df-le 7818  df-sub 7947  df-neg 7948  df-reap 8349  df-ap 8356  df-div 8445  df-inn 8733  df-2 8791  df-3 8792  df-4 8793  df-n0 8990  df-z 9067  df-uz 9339  df-rp 9454  df-seqfrec 10231  df-exp 10305  df-cj 10626  df-re 10627  df-im 10628  df-rsqrt 10782  df-abs 10783
This theorem is referenced by:  xrmaxiflemval  11031  xrmax1sup  11034
  Copyright terms: Public domain W3C validator