| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ioorinv2 | Structured version Visualization version GIF version | ||
| Description: The function 𝐹 is an "inverse" of sorts to the open interval function. (Contributed by Mario Carneiro, 26-Mar-2015.) (Revised by AV, 13-Sep-2020.) |
| Ref | Expression |
|---|---|
| ioorf.1 | ⊢ 𝐹 = (𝑥 ∈ ran (,) ↦ if(𝑥 = ∅, 〈0, 0〉, 〈inf(𝑥, ℝ*, < ), sup(𝑥, ℝ*, < )〉)) |
| Ref | Expression |
|---|---|
| ioorinv2 | ⊢ ((𝐴(,)𝐵) ≠ ∅ → (𝐹‘(𝐴(,)𝐵)) = 〈𝐴, 𝐵〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ioorebas 13342 | . . 3 ⊢ (𝐴(,)𝐵) ∈ ran (,) | |
| 2 | ioorf.1 | . . . 4 ⊢ 𝐹 = (𝑥 ∈ ran (,) ↦ if(𝑥 = ∅, 〈0, 0〉, 〈inf(𝑥, ℝ*, < ), sup(𝑥, ℝ*, < )〉)) | |
| 3 | 2 | ioorval 25456 | . . 3 ⊢ ((𝐴(,)𝐵) ∈ ran (,) → (𝐹‘(𝐴(,)𝐵)) = if((𝐴(,)𝐵) = ∅, 〈0, 0〉, 〈inf((𝐴(,)𝐵), ℝ*, < ), sup((𝐴(,)𝐵), ℝ*, < )〉)) |
| 4 | 1, 3 | ax-mp 5 | . 2 ⊢ (𝐹‘(𝐴(,)𝐵)) = if((𝐴(,)𝐵) = ∅, 〈0, 0〉, 〈inf((𝐴(,)𝐵), ℝ*, < ), sup((𝐴(,)𝐵), ℝ*, < )〉) |
| 5 | ifnefalse 4484 | . . 3 ⊢ ((𝐴(,)𝐵) ≠ ∅ → if((𝐴(,)𝐵) = ∅, 〈0, 0〉, 〈inf((𝐴(,)𝐵), ℝ*, < ), sup((𝐴(,)𝐵), ℝ*, < )〉) = 〈inf((𝐴(,)𝐵), ℝ*, < ), sup((𝐴(,)𝐵), ℝ*, < )〉) | |
| 6 | n0 4300 | . . . . . . 7 ⊢ ((𝐴(,)𝐵) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝐴(,)𝐵)) | |
| 7 | eliooxr 13295 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)) | |
| 8 | 7 | exlimiv 1930 | . . . . . . 7 ⊢ (∃𝑥 𝑥 ∈ (𝐴(,)𝐵) → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)) |
| 9 | 6, 8 | sylbi 217 | . . . . . 6 ⊢ ((𝐴(,)𝐵) ≠ ∅ → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)) |
| 10 | 9 | simpld 494 | . . . . 5 ⊢ ((𝐴(,)𝐵) ≠ ∅ → 𝐴 ∈ ℝ*) |
| 11 | 9 | simprd 495 | . . . . 5 ⊢ ((𝐴(,)𝐵) ≠ ∅ → 𝐵 ∈ ℝ*) |
| 12 | id 22 | . . . . 5 ⊢ ((𝐴(,)𝐵) ≠ ∅ → (𝐴(,)𝐵) ≠ ∅) | |
| 13 | df-ioo 13240 | . . . . . 6 ⊢ (,) = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)}) | |
| 14 | idd 24 | . . . . . 6 ⊢ ((𝑤 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝑤 < 𝐵 → 𝑤 < 𝐵)) | |
| 15 | xrltle 13039 | . . . . . 6 ⊢ ((𝑤 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝑤 < 𝐵 → 𝑤 ≤ 𝐵)) | |
| 16 | idd 24 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) → (𝐴 < 𝑤 → 𝐴 < 𝑤)) | |
| 17 | xrltle 13039 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) → (𝐴 < 𝑤 → 𝐴 ≤ 𝑤)) | |
| 18 | 13, 14, 15, 16, 17 | ixxlb 13258 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ (𝐴(,)𝐵) ≠ ∅) → inf((𝐴(,)𝐵), ℝ*, < ) = 𝐴) |
| 19 | 10, 11, 12, 18 | syl3anc 1373 | . . . 4 ⊢ ((𝐴(,)𝐵) ≠ ∅ → inf((𝐴(,)𝐵), ℝ*, < ) = 𝐴) |
| 20 | 13, 14, 15, 16, 17 | ixxub 13257 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ (𝐴(,)𝐵) ≠ ∅) → sup((𝐴(,)𝐵), ℝ*, < ) = 𝐵) |
| 21 | 10, 11, 12, 20 | syl3anc 1373 | . . . 4 ⊢ ((𝐴(,)𝐵) ≠ ∅ → sup((𝐴(,)𝐵), ℝ*, < ) = 𝐵) |
| 22 | 19, 21 | opeq12d 4830 | . . 3 ⊢ ((𝐴(,)𝐵) ≠ ∅ → 〈inf((𝐴(,)𝐵), ℝ*, < ), sup((𝐴(,)𝐵), ℝ*, < )〉 = 〈𝐴, 𝐵〉) |
| 23 | 5, 22 | eqtrd 2764 | . 2 ⊢ ((𝐴(,)𝐵) ≠ ∅ → if((𝐴(,)𝐵) = ∅, 〈0, 0〉, 〈inf((𝐴(,)𝐵), ℝ*, < ), sup((𝐴(,)𝐵), ℝ*, < )〉) = 〈𝐴, 𝐵〉) |
| 24 | 4, 23 | eqtrid 2776 | 1 ⊢ ((𝐴(,)𝐵) ≠ ∅ → (𝐹‘(𝐴(,)𝐵)) = 〈𝐴, 𝐵〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∃wex 1779 ∈ wcel 2109 ≠ wne 2925 ∅c0 4280 ifcif 4472 〈cop 4579 class class class wbr 5088 ↦ cmpt 5169 ran crn 5614 ‘cfv 6476 (class class class)co 7340 supcsup 9318 infcinf 9319 0cc0 10997 ℝ*cxr 11136 < clt 11137 (,)cioo 13236 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5367 ax-un 7662 ax-cnex 11053 ax-resscn 11054 ax-1cn 11055 ax-icn 11056 ax-addcl 11057 ax-addrcl 11058 ax-mulcl 11059 ax-mulrcl 11060 ax-mulcom 11061 ax-addass 11062 ax-mulass 11063 ax-distr 11064 ax-i2m1 11065 ax-1ne0 11066 ax-1rid 11067 ax-rnegex 11068 ax-rrecex 11069 ax-cnre 11070 ax-pre-lttri 11071 ax-pre-lttrn 11072 ax-pre-ltadd 11073 ax-pre-mulgt0 11074 ax-pre-sup 11075 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3393 df-v 3435 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-iun 4940 df-br 5089 df-opab 5151 df-mpt 5170 df-tr 5196 df-id 5508 df-eprel 5513 df-po 5521 df-so 5522 df-fr 5566 df-we 5568 df-xp 5619 df-rel 5620 df-cnv 5621 df-co 5622 df-dm 5623 df-rn 5624 df-res 5625 df-ima 5626 df-pred 6243 df-ord 6304 df-on 6305 df-lim 6306 df-suc 6307 df-iota 6432 df-fun 6478 df-fn 6479 df-f 6480 df-f1 6481 df-fo 6482 df-f1o 6483 df-fv 6484 df-riota 7297 df-ov 7343 df-oprab 7344 df-mpo 7345 df-om 7791 df-1st 7915 df-2nd 7916 df-frecs 8205 df-wrecs 8236 df-recs 8285 df-rdg 8323 df-er 8616 df-en 8864 df-dom 8865 df-sdom 8866 df-sup 9320 df-inf 9321 df-pnf 11139 df-mnf 11140 df-xr 11141 df-ltxr 11142 df-le 11143 df-sub 11337 df-neg 11338 df-div 11766 df-nn 12117 df-n0 12373 df-z 12460 df-uz 12724 df-q 12838 df-ioo 13240 |
| This theorem is referenced by: ioorinv 25458 ioorcl 25459 |
| Copyright terms: Public domain | W3C validator |