| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > xrminrecl | GIF version | ||
| Description: The minimum of two real numbers is the same when taken as extended reals or as reals. (Contributed by Jim Kingdon, 18-May-2023.) |
| Ref | Expression |
|---|---|
| xrminrecl | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → inf({𝐴, 𝐵}, ℝ*, < ) = inf({𝐴, 𝐵}, ℝ, < )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rexneg 10187 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → -𝑒𝐴 = -𝐴) | |
| 2 | 1 | adantr 276 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → -𝑒𝐴 = -𝐴) |
| 3 | rexneg 10187 | . . . . . . . 8 ⊢ (𝐵 ∈ ℝ → -𝑒𝐵 = -𝐵) | |
| 4 | 3 | adantl 277 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → -𝑒𝐵 = -𝐵) |
| 5 | 2, 4 | preq12d 3782 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → {-𝑒𝐴, -𝑒𝐵} = {-𝐴, -𝐵}) |
| 6 | 5 | supeq1d 7293 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < ) = sup({-𝐴, -𝐵}, ℝ*, < )) |
| 7 | renegcl 8553 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
| 8 | renegcl 8553 | . . . . . 6 ⊢ (𝐵 ∈ ℝ → -𝐵 ∈ ℝ) | |
| 9 | xrmaxrecl 11971 | . . . . . 6 ⊢ ((-𝐴 ∈ ℝ ∧ -𝐵 ∈ ℝ) → sup({-𝐴, -𝐵}, ℝ*, < ) = sup({-𝐴, -𝐵}, ℝ, < )) | |
| 10 | 7, 8, 9 | syl2an 289 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → sup({-𝐴, -𝐵}, ℝ*, < ) = sup({-𝐴, -𝐵}, ℝ, < )) |
| 11 | 6, 10 | eqtrd 2267 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < ) = sup({-𝐴, -𝐵}, ℝ, < )) |
| 12 | xnegeq 10184 | . . . 4 ⊢ (sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < ) = sup({-𝐴, -𝐵}, ℝ, < ) → -𝑒sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < ) = -𝑒sup({-𝐴, -𝐵}, ℝ, < )) | |
| 13 | 11, 12 | syl 14 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → -𝑒sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < ) = -𝑒sup({-𝐴, -𝐵}, ℝ, < )) |
| 14 | maxcl 11926 | . . . . 5 ⊢ ((-𝐴 ∈ ℝ ∧ -𝐵 ∈ ℝ) → sup({-𝐴, -𝐵}, ℝ, < ) ∈ ℝ) | |
| 15 | 7, 8, 14 | syl2an 289 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → sup({-𝐴, -𝐵}, ℝ, < ) ∈ ℝ) |
| 16 | rexneg 10187 | . . . 4 ⊢ (sup({-𝐴, -𝐵}, ℝ, < ) ∈ ℝ → -𝑒sup({-𝐴, -𝐵}, ℝ, < ) = -sup({-𝐴, -𝐵}, ℝ, < )) | |
| 17 | 15, 16 | syl 14 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → -𝑒sup({-𝐴, -𝐵}, ℝ, < ) = -sup({-𝐴, -𝐵}, ℝ, < )) |
| 18 | 13, 17 | eqtrd 2267 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → -𝑒sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < ) = -sup({-𝐴, -𝐵}, ℝ, < )) |
| 19 | rexr 8337 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
| 20 | rexr 8337 | . . 3 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
| 21 | xrminmax 11981 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → inf({𝐴, 𝐵}, ℝ*, < ) = -𝑒sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < )) | |
| 22 | 19, 20, 21 | syl2an 289 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → inf({𝐴, 𝐵}, ℝ*, < ) = -𝑒sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < )) |
| 23 | minmax 11946 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → inf({𝐴, 𝐵}, ℝ, < ) = -sup({-𝐴, -𝐵}, ℝ, < )) | |
| 24 | 18, 22, 23 | 3eqtr4d 2277 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → inf({𝐴, 𝐵}, ℝ*, < ) = inf({𝐴, 𝐵}, ℝ, < )) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 {cpr 3696 supcsup 7288 infcinf 7289 ℝcr 8144 ℝ*cxr 8325 < clt 8326 -cneg 8464 -𝑒cxne 10126 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2208 ax-ext 2216 ax-coll 4231 ax-sep 4234 ax-nul 4242 ax-pow 4293 ax-pr 4328 ax-un 4560 ax-setind 4666 ax-iinf 4717 ax-cnex 8236 ax-resscn 8237 ax-1cn 8238 ax-1re 8239 ax-icn 8240 ax-addcl 8241 ax-addrcl 8242 ax-mulcl 8243 ax-mulrcl 8244 ax-addcom 8245 ax-mulcom 8246 ax-addass 8247 ax-mulass 8248 ax-distr 8249 ax-i2m1 8250 ax-0lt1 8251 ax-1rid 8252 ax-0id 8253 ax-rnegex 8254 ax-precex 8255 ax-cnre 8256 ax-pre-ltirr 8257 ax-pre-ltwlin 8258 ax-pre-lttrn 8259 ax-pre-apti 8260 ax-pre-ltadd 8261 ax-pre-mulgt0 8262 ax-pre-mulext 8263 ax-arch 8264 ax-caucvg 8265 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-if 3626 df-pw 3677 df-sn 3701 df-pr 3702 df-op 3704 df-uni 3921 df-int 3956 df-iun 3999 df-br 4116 df-opab 4178 df-mpt 4179 df-tr 4215 df-id 4420 df-po 4423 df-iso 4424 df-iord 4493 df-on 4495 df-ilim 4496 df-suc 4498 df-iom 4720 df-xp 4762 df-rel 4763 df-cnv 4764 df-co 4765 df-dm 4766 df-rn 4767 df-res 4768 df-ima 4769 df-iota 5319 df-fun 5361 df-fn 5362 df-f 5363 df-f1 5364 df-fo 5365 df-f1o 5366 df-fv 5367 df-isom 5368 df-riota 6013 df-ov 6063 df-oprab 6064 df-mpo 6065 df-1st 6349 df-2nd 6350 df-recs 6551 df-frec 6637 df-sup 7290 df-inf 7291 df-pnf 8328 df-mnf 8329 df-xr 8330 df-ltxr 8331 df-le 8332 df-sub 8465 df-neg 8466 df-reap 8869 df-ap 8876 df-div 8969 df-inn 9260 df-2 9318 df-3 9319 df-4 9320 df-n0 9519 df-z 9600 df-uz 9877 df-rp 10010 df-xneg 10129 df-seqfrec 10839 df-exp 10930 df-cj 11557 df-re 11558 df-im 11559 df-rsqrt 11714 df-abs 11715 |
| This theorem is referenced by: xrbdtri 11992 qtopbas 15519 |
| Copyright terms: Public domain | W3C validator |