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

Theorem xrmaxrecl 11129
 Description: The maximum of two real numbers is the same when taken as extended reals or as reals. (Contributed by Jim Kingdon, 30-Apr-2023.)
Assertion
Ref Expression
xrmaxrecl ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → sup({𝐴, 𝐵}, ℝ*, < ) = sup({𝐴, 𝐵}, ℝ, < ))

Proof of Theorem xrmaxrecl
StepHypRef Expression
1 rexr 7902 . . . 4 (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*)
2 rexr 7902 . . . 4 (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*)
3 xrmaxif 11125 . . . 4 ((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) → sup({𝐴, 𝐵}, ℝ*, < ) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))
41, 2, 3syl2an 287 . . 3 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → sup({𝐴, 𝐵}, ℝ*, < ) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))
5 renepnf 7904 . . . . . 6 (𝐵 ∈ ℝ → 𝐵 ≠ +∞)
65neneqd 2345 . . . . 5 (𝐵 ∈ ℝ → ¬ 𝐵 = +∞)
76adantl 275 . . . 4 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ¬ 𝐵 = +∞)
87iffalsed 3511 . . 3 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
9 renemnf 7905 . . . . . 6 (𝐵 ∈ ℝ → 𝐵 ≠ -∞)
109neneqd 2345 . . . . 5 (𝐵 ∈ ℝ → ¬ 𝐵 = -∞)
1110adantl 275 . . . 4 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ¬ 𝐵 = -∞)
1211iffalsed 3511 . . 3 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
134, 8, 123eqtrd 2191 . 2 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → sup({𝐴, 𝐵}, ℝ*, < ) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
14 renepnf 7904 . . . . 5 (𝐴 ∈ ℝ → 𝐴 ≠ +∞)
1514neneqd 2345 . . . 4 (𝐴 ∈ ℝ → ¬ 𝐴 = +∞)
1615adantr 274 . . 3 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ¬ 𝐴 = +∞)
1716iffalsed 3511 . 2 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))) = if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
18 renemnf 7905 . . . . 5 (𝐴 ∈ ℝ → 𝐴 ≠ -∞)
1918neneqd 2345 . . . 4 (𝐴 ∈ ℝ → ¬ 𝐴 = -∞)
2019adantr 274 . . 3 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ¬ 𝐴 = -∞)
2120iffalsed 3511 . 2 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )) = sup({𝐴, 𝐵}, ℝ, < ))
2213, 17, 213eqtrd 2191 1 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → sup({𝐴, 𝐵}, ℝ*, < ) = sup({𝐴, 𝐵}, ℝ, < ))
 Colors of variables: wff set class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   = wceq 1332   ∈ wcel 2125  ifcif 3501  {cpr 3557  supcsup 6914  ℝcr 7710  +∞cpnf 7888  -∞cmnf 7889  ℝ*cxr 7890   < clt 7891 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 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1481  ax-10 1482  ax-11 1483  ax-i12 1484  ax-bndl 1486  ax-4 1487  ax-17 1503  ax-i9 1507  ax-ial 1511  ax-i5r 1512  ax-13 2127  ax-14 2128  ax-ext 2136  ax-coll 4075  ax-sep 4078  ax-nul 4086  ax-pow 4130  ax-pr 4164  ax-un 4388  ax-setind 4490  ax-iinf 4541  ax-cnex 7802  ax-resscn 7803  ax-1cn 7804  ax-1re 7805  ax-icn 7806  ax-addcl 7807  ax-addrcl 7808  ax-mulcl 7809  ax-mulrcl 7810  ax-addcom 7811  ax-mulcom 7812  ax-addass 7813  ax-mulass 7814  ax-distr 7815  ax-i2m1 7816  ax-0lt1 7817  ax-1rid 7818  ax-0id 7819  ax-rnegex 7820  ax-precex 7821  ax-cnre 7822  ax-pre-ltirr 7823  ax-pre-ltwlin 7824  ax-pre-lttrn 7825  ax-pre-apti 7826  ax-pre-ltadd 7827  ax-pre-mulgt0 7828  ax-pre-mulext 7829  ax-arch 7830  ax-caucvg 7831 This theorem depends on definitions:  df-bi 116  df-dc 821  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1740  df-eu 2006  df-mo 2007  df-clab 2141  df-cleq 2147  df-clel 2150  df-nfc 2285  df-ne 2325  df-nel 2420  df-ral 2437  df-rex 2438  df-reu 2439  df-rmo 2440  df-rab 2441  df-v 2711  df-sbc 2934  df-csb 3028  df-dif 3100  df-un 3102  df-in 3104  df-ss 3111  df-nul 3391  df-if 3502  df-pw 3541  df-sn 3562  df-pr 3563  df-op 3565  df-uni 3769  df-int 3804  df-iun 3847  df-br 3962  df-opab 4022  df-mpt 4023  df-tr 4059  df-id 4248  df-po 4251  df-iso 4252  df-iord 4321  df-on 4323  df-ilim 4324  df-suc 4326  df-iom 4544  df-xp 4585  df-rel 4586  df-cnv 4587  df-co 4588  df-dm 4589  df-rn 4590  df-res 4591  df-ima 4592  df-iota 5128  df-fun 5165  df-fn 5166  df-f 5167  df-f1 5168  df-fo 5169  df-f1o 5170  df-fv 5171  df-riota 5770  df-ov 5817  df-oprab 5818  df-mpo 5819  df-1st 6078  df-2nd 6079  df-recs 6242  df-frec 6328  df-sup 6916  df-pnf 7893  df-mnf 7894  df-xr 7895  df-ltxr 7896  df-le 7897  df-sub 8027  df-neg 8028  df-reap 8429  df-ap 8436  df-div 8525  df-inn 8813  df-2 8871  df-3 8872  df-4 8873  df-n0 9070  df-z 9147  df-uz 9419  df-rp 9539  df-seqfrec 10323  df-exp 10397  df-cj 10719  df-re 10720  df-im 10721  df-rsqrt 10875  df-abs 10876 This theorem is referenced by:  xrmaxltsup  11132  xrminrecl  11147  xrminrpcl  11148  qtopbas  12869
 Copyright terms: Public domain W3C validator
The provided text is a formal proof in a logical system, specifically the Intuitionistic Logic Explorer, which proves a theorem about the maximum of two real numbers when considered as extended reals or as reals.
no_question

the text does not contain a mathematical question or a word problem. it is a formal proof of a theorem, and no specific question is being asked.
Given a text passage, determine:
    1. If it contains a mathematical question (including word problems or calculations)
    2. If an answer to that mathematical question is provided in the text

First, describe the content structure you found in 1-2 sentences.

Then provide your analysis in the following format:
TYPE: <one of the following values>
- NO_QUESTION
- SINGLE_QUESTION
- SINGLE_QUESTION_WITH_ANSWER
- MULTIPLE_QUESTIONS
- MULTIPLE_QUESTIONS_WITH_ANSWERS
system
Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  xrmaxrecl GIF version

Theorem xrmaxrecl 11129
 Description: The maximum of two real numbers is the same when taken as extended reals or as reals. (Contributed by Jim Kingdon, 30-Apr-2023.)
Assertion
Ref Expression
xrmaxrecl ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → sup({𝐴, 𝐵}, ℝ*, < ) = sup({𝐴, 𝐵}, ℝ, < ))

Proof of Theorem xrmaxrecl
StepHypRef Expression
1 rexr 7902 . . . 4 (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*)
2 rexr 7902 . . . 4 (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*)
3 xrmaxif 11125 . . . 4 ((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) → sup({𝐴, 𝐵}, ℝ*, < ) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))
41, 2, 3syl2an 287 . . 3 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → sup({𝐴, 𝐵}, ℝ*, < ) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))
5 renepnf 7904 . . . . . 6 (𝐵 ∈ ℝ → 𝐵 ≠ +∞)
65neneqd 2345 . . . . 5 (𝐵 ∈ ℝ → ¬ 𝐵 = +∞)
76adantl 275 . . . 4 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ¬ 𝐵 = +∞)
87iffalsed 3511 . . 3 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
9 renemnf 7905 . . . . . 6 (𝐵 ∈ ℝ → 𝐵 ≠ -∞)
109neneqd 2345 . . . . 5 (𝐵 ∈ ℝ → ¬ 𝐵 = -∞)
1110adantl 275 . . . 4 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ¬ 𝐵 = -∞)
1211iffalsed 3511 . . 3 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
134, 8, 123eqtrd 2191 . 2 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → sup({𝐴, 𝐵}, ℝ*, < ) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
14 renepnf 7904 . . . . 5 (𝐴 ∈ ℝ → 𝐴 ≠ +∞)
1514neneqd 2345 . . . 4 (𝐴 ∈ ℝ → ¬ 𝐴 = +∞)
1615adantr 274 . . 3 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ¬ 𝐴 = +∞)
1716iffalsed 3511 . 2 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))) = if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
18 renemnf 7905 . . . . 5 (𝐴 ∈ ℝ → 𝐴 ≠ -∞)
1918neneqd 2345 . . . 4 (𝐴 ∈ ℝ → ¬ 𝐴 = -∞)
2019adantr 274 . . 3 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ¬ 𝐴 = -∞)
2120iffalsed 3511 . 2 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )) = sup({𝐴, 𝐵}, ℝ, < ))
2213, 17, 213eqtrd 2191 1 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → sup({𝐴, 𝐵}, ℝ*, < ) = sup({𝐴, 𝐵}, ℝ, < ))
 Colors of variables: wff set class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   = wceq 1332   ∈ wcel 2125  ifcif 3501  {cpr 3557  supcsup 6914  ℝcr 7710  +∞cpnf 7888  -∞cmnf 7889  ℝ*cxr 7890   < clt 7891 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 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1481  ax-10 1482  ax-11 1483  ax-i12 1484  ax-bndl 1486  ax-4 1487  ax-17 1503  ax-i9 1507  ax-ial 1511  ax-i5r 1512  ax-13 2127  ax-14 2128  ax-ext 2136  ax-coll 4075  ax-sep 4078  ax-nul 4086  ax-pow 4130  ax-pr 4164  ax-un 4388  ax-setind 4490  ax-iinf 4541  ax-cnex 7802  ax-resscn 7803  ax-1cn 7804  ax-1re 7805  ax-icn 7806  ax-addcl 7807  ax-addrcl 7808  ax-mulcl 7809  ax-mulrcl 7810  ax-addcom 7811  ax-mulcom 7812  ax-addass 7813  ax-mulass 7814  ax-distr 7815  ax-i2m1 7816  ax-0lt1 7817  ax-1rid 7818  ax-0id 7819  ax-rnegex 7820  ax-precex 7821  ax-cnre 7822  ax-pre-ltirr 7823  ax-pre-ltwlin 7824  ax-pre-lttrn 7825  ax-pre-apti 7826  ax-pre-ltadd 7827  ax-pre-mulgt0 7828  ax-pre-mulext 7829  ax-arch 7830  ax-caucvg 7831 This theorem depends on definitions:  df-bi 116  df-dc 821  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1740  df-eu 2006  df-mo 2007  df-clab 2141  df-cleq 2147  df-clel 2150  df-nfc 2285  df-ne 2325  df-nel 2420  df-ral 2437  df-rex 2438  df-reu 2439  df-rmo 2440  df-rab 2441  df-v 2711  df-sbc 2934  df-csb 3028  df-dif 3100  df-un 3102  df-in 3104  df-ss 3111  df-nul 3391  df-if 3502  df-pw 3541  df-sn 3562  df-pr 3563  df-op 3565  df-uni 3769  df-int 3804  df-iun 3847  df-br 3962  df-opab 4022  df-mpt 4023  df-tr 4059  df-id 4248  df-po 4251  df-iso 4252  df-iord 4321  df-on 4323  df-ilim 4324  df-suc 4326  df-iom 4544  df-xp 4585  df-rel 4586  df-cnv 4587  df-co 4588  df-dm 4589  df-rn 4590  df-res 4591  df-ima 4592  df-iota 5128  df-fun 5165  df-fn 5166  df-f 5167  df-f1 5168  df-fo 5169  df-f1o 5170  df-fv 5171  df-riota 5770  df-ov 5817  df-oprab 5818  df-mpo 5819  df-1st 6078  df-2nd 6079  df-recs 6242  df-frec 6328  df-sup 6916  df-pnf 7893  df-mnf 7894  df-xr 7895  df-ltxr 7896  df-le 7897  df-sub 8027  df-neg 8028  df-reap 8429  df-ap 8436  df-div 8525  df-inn 8813  df-2 8871  df-3 8872  df-4 8873  df-n0 9070  df-z 9147  df-uz 9419  df-rp 9539  df-seqfrec 10323  df-exp 10397  df-cj 10719  df-re 10720  df-im 10721  df-rsqrt 10875  df-abs 10876 This theorem is referenced by:  xrmaxltsup  11132  xrminrecl  11147  xrminrpcl  11148  qtopbas  12869
 Copyright terms: Public domain W3C validator
user
The provided text is a formal proof in a logical system, specifically the Intuitionistic Logic Explorer, which proves a theorem about the maximum of two real numbers when considered as extended reals or as reals.

TYPE: NO_QUESTION

The text does not contain a mathematical question or a word problem. It is a formal proof of a theorem, and no specific question is being asked.