| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mingeb | GIF version | ||
| Description: Equivalence of ≤ and being equal to the minimum of two reals. (Contributed by Jim Kingdon, 14-Oct-2024.) |
| Ref | Expression |
|---|---|
| mingeb | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ inf({𝐴, 𝐵}, ℝ, < ) = 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | renegcl 8577 | . . . . 5 ⊢ (𝐵 ∈ ℝ → -𝐵 ∈ ℝ) | |
| 2 | renegcl 8577 | . . . . 5 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
| 3 | maxcl 11954 | . . . . 5 ⊢ ((-𝐵 ∈ ℝ ∧ -𝐴 ∈ ℝ) → sup({-𝐵, -𝐴}, ℝ, < ) ∈ ℝ) | |
| 4 | 1, 2, 3 | syl2anr 290 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → sup({-𝐵, -𝐴}, ℝ, < ) ∈ ℝ) |
| 5 | 4 | recnd 8344 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → sup({-𝐵, -𝐴}, ℝ, < ) ∈ ℂ) |
| 6 | 2 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → -𝐴 ∈ ℝ) |
| 7 | 6 | recnd 8344 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → -𝐴 ∈ ℂ) |
| 8 | 5, 7 | neg11ad 8623 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (-sup({-𝐵, -𝐴}, ℝ, < ) = --𝐴 ↔ sup({-𝐵, -𝐴}, ℝ, < ) = -𝐴)) |
| 9 | mincom 11973 | . . . 4 ⊢ inf({𝐴, 𝐵}, ℝ, < ) = inf({𝐵, 𝐴}, ℝ, < ) | |
| 10 | minmax 11974 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → inf({𝐵, 𝐴}, ℝ, < ) = -sup({-𝐵, -𝐴}, ℝ, < )) | |
| 11 | 10 | ancoms 268 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → inf({𝐵, 𝐴}, ℝ, < ) = -sup({-𝐵, -𝐴}, ℝ, < )) |
| 12 | 9, 11 | eqtrid 2283 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → inf({𝐴, 𝐵}, ℝ, < ) = -sup({-𝐵, -𝐴}, ℝ, < )) |
| 13 | simpl 109 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐴 ∈ ℝ) | |
| 14 | 13 | recnd 8344 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐴 ∈ ℂ) |
| 15 | 14 | negnegd 8618 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → --𝐴 = 𝐴) |
| 16 | 15 | eqcomd 2244 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐴 = --𝐴) |
| 17 | 12, 16 | eqeq12d 2253 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (inf({𝐴, 𝐵}, ℝ, < ) = 𝐴 ↔ -sup({-𝐵, -𝐴}, ℝ, < ) = --𝐴)) |
| 18 | leneg 8783 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ -𝐵 ≤ -𝐴)) | |
| 19 | maxleb 11960 | . . . 4 ⊢ ((-𝐵 ∈ ℝ ∧ -𝐴 ∈ ℝ) → (-𝐵 ≤ -𝐴 ↔ sup({-𝐵, -𝐴}, ℝ, < ) = -𝐴)) | |
| 20 | 1, 2, 19 | syl2anr 290 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (-𝐵 ≤ -𝐴 ↔ sup({-𝐵, -𝐴}, ℝ, < ) = -𝐴)) |
| 21 | 18, 20 | bitrd 188 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ sup({-𝐵, -𝐴}, ℝ, < ) = -𝐴)) |
| 22 | 8, 17, 21 | 3bitr4rd 221 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ inf({𝐴, 𝐵}, ℝ, < ) = 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 {cpr 3706 class class class wbr 4125 supcsup 7312 infcinf 7313 ℝcr 8168 < clt 8350 ≤ cle 8351 -cneg 8488 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4241 ax-sep 4244 ax-nul 4254 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-iinf 4730 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-mulrcl 8268 ax-addcom 8269 ax-mulcom 8270 ax-addass 8271 ax-mulass 8272 ax-distr 8273 ax-i2m1 8274 ax-0lt1 8275 ax-1rid 8276 ax-0id 8277 ax-rnegex 8278 ax-precex 8279 ax-cnre 8280 ax-pre-ltirr 8281 ax-pre-ltwlin 8282 ax-pre-lttrn 8283 ax-pre-apti 8284 ax-pre-ltadd 8285 ax-pre-mulgt0 8286 ax-pre-mulext 8287 ax-arch 8288 ax-caucvg 8289 |
| This theorem depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3636 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-tr 4225 df-id 4433 df-po 4436 df-iso 4437 df-iord 4506 df-on 4508 df-ilim 4509 df-suc 4511 df-iom 4733 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-isom 5381 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-1st 6364 df-2nd 6365 df-recs 6566 df-frec 6652 df-sup 7314 df-inf 7315 df-pnf 8352 df-mnf 8353 df-xr 8354 df-ltxr 8355 df-le 8356 df-sub 8489 df-neg 8490 df-reap 8893 df-ap 8900 df-div 8993 df-inn 9284 df-2 9342 df-3 9343 df-4 9344 df-n0 9543 df-z 9624 df-uz 9901 df-rp 10034 df-seqfrec 10863 df-exp 10954 df-cj 11585 df-re 11586 df-im 11587 df-rsqrt 11742 df-abs 11743 |
| This theorem is referenced by: 2zinfmin 11987 hovergt0 15674 repiecele0 16980 repiecege0 16981 |
| Copyright terms: Public domain | W3C validator |