| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > xrminrpcl | GIF version | ||
| Description: The minimum of two positive reals is a positive real. (Contributed by Jim Kingdon, 4-May-2023.) |
| Ref | Expression |
|---|---|
| xrminrpcl | ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → inf({𝐴, 𝐵}, ℝ*, < ) ∈ ℝ+) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rpxr 9896 | . . . 4 ⊢ (𝐴 ∈ ℝ+ → 𝐴 ∈ ℝ*) | |
| 2 | rpxr 9896 | . . . 4 ⊢ (𝐵 ∈ ℝ+ → 𝐵 ∈ ℝ*) | |
| 3 | xrminmax 11830 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → inf({𝐴, 𝐵}, ℝ*, < ) = -𝑒sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < )) | |
| 4 | 1, 2, 3 | syl2an 289 | . . 3 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → inf({𝐴, 𝐵}, ℝ*, < ) = -𝑒sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < )) |
| 5 | rpre 9895 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ+ → 𝐴 ∈ ℝ) | |
| 6 | rexneg 10065 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → -𝑒𝐴 = -𝐴) | |
| 7 | renegcl 8440 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
| 8 | 6, 7 | eqeltrd 2308 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → -𝑒𝐴 ∈ ℝ) |
| 9 | 5, 8 | syl 14 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ+ → -𝑒𝐴 ∈ ℝ) |
| 10 | rpre 9895 | . . . . . . . 8 ⊢ (𝐵 ∈ ℝ+ → 𝐵 ∈ ℝ) | |
| 11 | rexneg 10065 | . . . . . . . . 9 ⊢ (𝐵 ∈ ℝ → -𝑒𝐵 = -𝐵) | |
| 12 | renegcl 8440 | . . . . . . . . 9 ⊢ (𝐵 ∈ ℝ → -𝐵 ∈ ℝ) | |
| 13 | 11, 12 | eqeltrd 2308 | . . . . . . . 8 ⊢ (𝐵 ∈ ℝ → -𝑒𝐵 ∈ ℝ) |
| 14 | 10, 13 | syl 14 | . . . . . . 7 ⊢ (𝐵 ∈ ℝ+ → -𝑒𝐵 ∈ ℝ) |
| 15 | xrmaxrecl 11820 | . . . . . . 7 ⊢ ((-𝑒𝐴 ∈ ℝ ∧ -𝑒𝐵 ∈ ℝ) → sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < ) = sup({-𝑒𝐴, -𝑒𝐵}, ℝ, < )) | |
| 16 | 9, 14, 15 | syl2an 289 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < ) = sup({-𝑒𝐴, -𝑒𝐵}, ℝ, < )) |
| 17 | maxcl 11775 | . . . . . . 7 ⊢ ((-𝑒𝐴 ∈ ℝ ∧ -𝑒𝐵 ∈ ℝ) → sup({-𝑒𝐴, -𝑒𝐵}, ℝ, < ) ∈ ℝ) | |
| 18 | 9, 14, 17 | syl2an 289 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → sup({-𝑒𝐴, -𝑒𝐵}, ℝ, < ) ∈ ℝ) |
| 19 | 16, 18 | eqeltrd 2308 | . . . . 5 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < ) ∈ ℝ) |
| 20 | rexneg 10065 | . . . . 5 ⊢ (sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < ) ∈ ℝ → -𝑒sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < ) = -sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < )) | |
| 21 | 19, 20 | syl 14 | . . . 4 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → -𝑒sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < ) = -sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < )) |
| 22 | 19 | renegcld 8559 | . . . 4 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → -sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < ) ∈ ℝ) |
| 23 | 21, 22 | eqeltrd 2308 | . . 3 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → -𝑒sup({-𝑒𝐴, -𝑒𝐵}, ℝ*, < ) ∈ ℝ) |
| 24 | 4, 23 | eqeltrd 2308 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → inf({𝐴, 𝐵}, ℝ*, < ) ∈ ℝ) |
| 25 | rpgt0 9900 | . . . 4 ⊢ (𝐴 ∈ ℝ+ → 0 < 𝐴) | |
| 26 | rpgt0 9900 | . . . 4 ⊢ (𝐵 ∈ ℝ+ → 0 < 𝐵) | |
| 27 | 25, 26 | anim12i 338 | . . 3 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → (0 < 𝐴 ∧ 0 < 𝐵)) |
| 28 | 0xr 8226 | . . . 4 ⊢ 0 ∈ ℝ* | |
| 29 | xrltmininf 11835 | . . . 4 ⊢ ((0 ∈ ℝ* ∧ 𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (0 < inf({𝐴, 𝐵}, ℝ*, < ) ↔ (0 < 𝐴 ∧ 0 < 𝐵))) | |
| 30 | 28, 1, 2, 29 | mp3an3an 1379 | . . 3 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → (0 < inf({𝐴, 𝐵}, ℝ*, < ) ↔ (0 < 𝐴 ∧ 0 < 𝐵))) |
| 31 | 27, 30 | mpbird 167 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → 0 < inf({𝐴, 𝐵}, ℝ*, < )) |
| 32 | 24, 31 | elrpd 9928 | 1 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → inf({𝐴, 𝐵}, ℝ*, < ) ∈ ℝ+) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1397 ∈ wcel 2202 {cpr 3670 class class class wbr 4088 supcsup 7181 infcinf 7182 ℝcr 8031 0cc0 8032 ℝ*cxr 8213 < clt 8214 -cneg 8351 ℝ+crp 9888 -𝑒cxne 10004 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-mulrcl 8131 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-precex 8142 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 ax-pre-mulgt0 8149 ax-pre-mulext 8150 ax-arch 8151 ax-caucvg 8152 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-po 4393 df-iso 4394 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-isom 5335 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-recs 6471 df-frec 6557 df-sup 7183 df-inf 7184 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-reap 8755 df-ap 8762 df-div 8853 df-inn 9144 df-2 9202 df-3 9203 df-4 9204 df-n0 9403 df-z 9480 df-uz 9756 df-rp 9889 df-xneg 10007 df-seqfrec 10711 df-exp 10802 df-cj 11407 df-re 11408 df-im 11409 df-rsqrt 11563 df-abs 11564 |
| This theorem is referenced by: blin2 15162 xmettx 15240 |
| Copyright terms: Public domain | W3C validator |