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 13211 | . . 3 ⊢ (𝐴(,)𝐵) ∈ ran (,) | |
2 | ioorf.1 | . . . 4 ⊢ 𝐹 = (𝑥 ∈ ran (,) ↦ if(𝑥 = ∅, 〈0, 0〉, 〈inf(𝑥, ℝ*, < ), sup(𝑥, ℝ*, < )〉)) | |
3 | 2 | ioorval 24766 | . . 3 ⊢ ((𝐴(,)𝐵) ∈ ran (,) → (𝐹‘(𝐴(,)𝐵)) = if((𝐴(,)𝐵) = ∅, 〈0, 0〉, 〈inf((𝐴(,)𝐵), ℝ*, < ), sup((𝐴(,)𝐵), ℝ*, < )〉)) |
4 | 1, 3 | ax-mp 5 | . 2 ⊢ (𝐹‘(𝐴(,)𝐵)) = if((𝐴(,)𝐵) = ∅, 〈0, 0〉, 〈inf((𝐴(,)𝐵), ℝ*, < ), sup((𝐴(,)𝐵), ℝ*, < )〉) |
5 | ifnefalse 4474 | . . 3 ⊢ ((𝐴(,)𝐵) ≠ ∅ → if((𝐴(,)𝐵) = ∅, 〈0, 0〉, 〈inf((𝐴(,)𝐵), ℝ*, < ), sup((𝐴(,)𝐵), ℝ*, < )〉) = 〈inf((𝐴(,)𝐵), ℝ*, < ), sup((𝐴(,)𝐵), ℝ*, < )〉) | |
6 | n0 4283 | . . . . . . 7 ⊢ ((𝐴(,)𝐵) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝐴(,)𝐵)) | |
7 | eliooxr 13165 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)) | |
8 | 7 | exlimiv 1929 | . . . . . . 7 ⊢ (∃𝑥 𝑥 ∈ (𝐴(,)𝐵) → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)) |
9 | 6, 8 | sylbi 216 | . . . . . 6 ⊢ ((𝐴(,)𝐵) ≠ ∅ → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)) |
10 | 9 | simpld 494 | . . . . 5 ⊢ ((𝐴(,)𝐵) ≠ ∅ → 𝐴 ∈ ℝ*) |
11 | 9 | simprd 495 | . . . . 5 ⊢ ((𝐴(,)𝐵) ≠ ∅ → 𝐵 ∈ ℝ*) |
12 | id 22 | . . . . 5 ⊢ ((𝐴(,)𝐵) ≠ ∅ → (𝐴(,)𝐵) ≠ ∅) | |
13 | df-ioo 13111 | . . . . . 6 ⊢ (,) = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)}) | |
14 | idd 24 | . . . . . 6 ⊢ ((𝑤 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝑤 < 𝐵 → 𝑤 < 𝐵)) | |
15 | xrltle 12911 | . . . . . 6 ⊢ ((𝑤 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝑤 < 𝐵 → 𝑤 ≤ 𝐵)) | |
16 | idd 24 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) → (𝐴 < 𝑤 → 𝐴 < 𝑤)) | |
17 | xrltle 12911 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) → (𝐴 < 𝑤 → 𝐴 ≤ 𝑤)) | |
18 | 13, 14, 15, 16, 17 | ixxlb 13129 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ (𝐴(,)𝐵) ≠ ∅) → inf((𝐴(,)𝐵), ℝ*, < ) = 𝐴) |
19 | 10, 11, 12, 18 | syl3anc 1369 | . . . 4 ⊢ ((𝐴(,)𝐵) ≠ ∅ → inf((𝐴(,)𝐵), ℝ*, < ) = 𝐴) |
20 | 13, 14, 15, 16, 17 | ixxub 13128 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ (𝐴(,)𝐵) ≠ ∅) → sup((𝐴(,)𝐵), ℝ*, < ) = 𝐵) |
21 | 10, 11, 12, 20 | syl3anc 1369 | . . . 4 ⊢ ((𝐴(,)𝐵) ≠ ∅ → sup((𝐴(,)𝐵), ℝ*, < ) = 𝐵) |
22 | 19, 21 | opeq12d 4814 | . . 3 ⊢ ((𝐴(,)𝐵) ≠ ∅ → 〈inf((𝐴(,)𝐵), ℝ*, < ), sup((𝐴(,)𝐵), ℝ*, < )〉 = 〈𝐴, 𝐵〉) |
23 | 5, 22 | eqtrd 2773 | . 2 ⊢ ((𝐴(,)𝐵) ≠ ∅ → if((𝐴(,)𝐵) = ∅, 〈0, 0〉, 〈inf((𝐴(,)𝐵), ℝ*, < ), sup((𝐴(,)𝐵), ℝ*, < )〉) = 〈𝐴, 𝐵〉) |
24 | 4, 23 | eqtrid 2785 | 1 ⊢ ((𝐴(,)𝐵) ≠ ∅ → (𝐹‘(𝐴(,)𝐵)) = 〈𝐴, 𝐵〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∃wex 1777 ∈ wcel 2101 ≠ wne 2938 ∅c0 4259 ifcif 4462 〈cop 4570 class class class wbr 5077 ↦ cmpt 5160 ran crn 5592 ‘cfv 6447 (class class class)co 7295 supcsup 9227 infcinf 9228 0cc0 10899 ℝ*cxr 11036 < clt 11037 (,)cioo 13107 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2103 ax-9 2111 ax-10 2132 ax-11 2149 ax-12 2166 ax-ext 2704 ax-sep 5226 ax-nul 5233 ax-pow 5291 ax-pr 5355 ax-un 7608 ax-cnex 10955 ax-resscn 10956 ax-1cn 10957 ax-icn 10958 ax-addcl 10959 ax-addrcl 10960 ax-mulcl 10961 ax-mulrcl 10962 ax-mulcom 10963 ax-addass 10964 ax-mulass 10965 ax-distr 10966 ax-i2m1 10967 ax-1ne0 10968 ax-1rid 10969 ax-rnegex 10970 ax-rrecex 10971 ax-cnre 10972 ax-pre-lttri 10973 ax-pre-lttrn 10974 ax-pre-ltadd 10975 ax-pre-mulgt0 10976 ax-pre-sup 10977 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2063 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2884 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3222 df-reu 3223 df-rab 3224 df-v 3436 df-sbc 3719 df-csb 3835 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3908 df-nul 4260 df-if 4463 df-pw 4538 df-sn 4565 df-pr 4567 df-op 4571 df-uni 4842 df-iun 4929 df-br 5078 df-opab 5140 df-mpt 5161 df-tr 5195 df-id 5491 df-eprel 5497 df-po 5505 df-so 5506 df-fr 5546 df-we 5548 df-xp 5597 df-rel 5598 df-cnv 5599 df-co 5600 df-dm 5601 df-rn 5602 df-res 5603 df-ima 5604 df-pred 6206 df-ord 6273 df-on 6274 df-lim 6275 df-suc 6276 df-iota 6399 df-fun 6449 df-fn 6450 df-f 6451 df-f1 6452 df-fo 6453 df-f1o 6454 df-fv 6455 df-riota 7252 df-ov 7298 df-oprab 7299 df-mpo 7300 df-om 7733 df-1st 7851 df-2nd 7852 df-frecs 8117 df-wrecs 8148 df-recs 8222 df-rdg 8261 df-er 8518 df-en 8754 df-dom 8755 df-sdom 8756 df-sup 9229 df-inf 9230 df-pnf 11039 df-mnf 11040 df-xr 11041 df-ltxr 11042 df-le 11043 df-sub 11235 df-neg 11236 df-div 11661 df-nn 12002 df-n0 12262 df-z 12348 df-uz 12611 df-q 12717 df-ioo 13111 |
This theorem is referenced by: ioorinv 24768 ioorcl 24769 |
Copyright terms: Public domain | W3C validator |