| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > rfcnpre2 | Structured version Visualization version GIF version | ||
| Description: If 𝐹 is a continuous function with respect to the standard topology, then the preimage A of the values smaller than a given extended real 𝐵, is an open set. (Contributed by Glauco Siliprandi, 20-Apr-2017.) |
| Ref | Expression |
|---|---|
| rfcnpre2.1 | ⊢ Ⅎ𝑥𝐵 |
| rfcnpre2.2 | ⊢ Ⅎ𝑥𝐹 |
| rfcnpre2.3 | ⊢ Ⅎ𝑥𝜑 |
| rfcnpre2.4 | ⊢ 𝐾 = (topGen‘ran (,)) |
| rfcnpre2.5 | ⊢ 𝑋 = ∪ 𝐽 |
| rfcnpre2.6 | ⊢ 𝐴 = {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} |
| rfcnpre2.7 | ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
| rfcnpre2.8 | ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾)) |
| Ref | Expression |
|---|---|
| rfcnpre2 | ⊢ (𝜑 → 𝐴 ∈ 𝐽) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rfcnpre2.3 | . . . 4 ⊢ Ⅎ𝑥𝜑 | |
| 2 | rfcnpre2.2 | . . . . . 6 ⊢ Ⅎ𝑥𝐹 | |
| 3 | 2 | nfcnv 5866 | . . . . 5 ⊢ Ⅎ𝑥◡𝐹 |
| 4 | nfcv 2925 | . . . . . 6 ⊢ Ⅎ𝑥-∞ | |
| 5 | nfcv 2925 | . . . . . 6 ⊢ Ⅎ𝑥(,) | |
| 6 | rfcnpre2.1 | . . . . . 6 ⊢ Ⅎ𝑥𝐵 | |
| 7 | 4, 5, 6 | nfov 7442 | . . . . 5 ⊢ Ⅎ𝑥(-∞(,)𝐵) |
| 8 | 3, 7 | nfima 6072 | . . . 4 ⊢ Ⅎ𝑥(◡𝐹 “ (-∞(,)𝐵)) |
| 9 | nfrab1 3436 | . . . 4 ⊢ Ⅎ𝑥{𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} | |
| 10 | rfcnpre2.4 | . . . . . . . . 9 ⊢ 𝐾 = (topGen‘ran (,)) | |
| 11 | rfcnpre2.5 | . . . . . . . . 9 ⊢ 𝑋 = ∪ 𝐽 | |
| 12 | eqid 2763 | . . . . . . . . 9 ⊢ (𝐽 Cn 𝐾) = (𝐽 Cn 𝐾) | |
| 13 | rfcnpre2.8 | . . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾)) | |
| 14 | 10, 11, 12, 13 | fcnre 45728 | . . . . . . . 8 ⊢ (𝜑 → 𝐹:𝑋⟶ℝ) |
| 15 | 14 | ffvelcdmda 7081 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ∈ ℝ) |
| 16 | rfcnpre2.7 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ*) | |
| 17 | elioomnf 13472 | . . . . . . . . 9 ⊢ (𝐵 ∈ ℝ* → ((𝐹‘𝑥) ∈ (-∞(,)𝐵) ↔ ((𝐹‘𝑥) ∈ ℝ ∧ (𝐹‘𝑥) < 𝐵))) | |
| 18 | 16, 17 | syl 18 | . . . . . . . 8 ⊢ (𝜑 → ((𝐹‘𝑥) ∈ (-∞(,)𝐵) ↔ ((𝐹‘𝑥) ∈ ℝ ∧ (𝐹‘𝑥) < 𝐵))) |
| 19 | 18 | baibd 548 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹‘𝑥) ∈ ℝ) → ((𝐹‘𝑥) ∈ (-∞(,)𝐵) ↔ (𝐹‘𝑥) < 𝐵)) |
| 20 | 15, 19 | syldan 602 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐹‘𝑥) ∈ (-∞(,)𝐵) ↔ (𝐹‘𝑥) < 𝐵)) |
| 21 | 20 | pm5.32da 589 | . . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) ∈ (-∞(,)𝐵)) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) < 𝐵))) |
| 22 | ffn 6707 | . . . . . 6 ⊢ (𝐹:𝑋⟶ℝ → 𝐹 Fn 𝑋) | |
| 23 | elpreima 7055 | . . . . . 6 ⊢ (𝐹 Fn 𝑋 → (𝑥 ∈ (◡𝐹 “ (-∞(,)𝐵)) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) ∈ (-∞(,)𝐵)))) | |
| 24 | 14, 22, 23 | 3syl 19 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ (◡𝐹 “ (-∞(,)𝐵)) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) ∈ (-∞(,)𝐵)))) |
| 25 | rabid 3437 | . . . . . 6 ⊢ (𝑥 ∈ {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) < 𝐵)) | |
| 26 | 25 | a1i 11 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) < 𝐵))) |
| 27 | 21, 24, 26 | 3bitr4d 314 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ (◡𝐹 “ (-∞(,)𝐵)) ↔ 𝑥 ∈ {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵})) |
| 28 | 1, 8, 9, 27 | eqrd 3957 | . . 3 ⊢ (𝜑 → (◡𝐹 “ (-∞(,)𝐵)) = {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵}) |
| 29 | rfcnpre2.6 | . . 3 ⊢ 𝐴 = {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} | |
| 30 | 28, 29 | eqtr4di 2816 | . 2 ⊢ (𝜑 → (◡𝐹 “ (-∞(,)𝐵)) = 𝐴) |
| 31 | iooretop 24903 | . . . . 5 ⊢ (-∞(,)𝐵) ∈ (topGen‘ran (,)) | |
| 32 | 31 | a1i 11 | . . . 4 ⊢ (𝜑 → (-∞(,)𝐵) ∈ (topGen‘ran (,))) |
| 33 | 32, 10 | eleqtrrdi 2874 | . . 3 ⊢ (𝜑 → (-∞(,)𝐵) ∈ 𝐾) |
| 34 | cnima 23403 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ (-∞(,)𝐵) ∈ 𝐾) → (◡𝐹 “ (-∞(,)𝐵)) ∈ 𝐽) | |
| 35 | 13, 33, 34 | syl2anc 595 | . 2 ⊢ (𝜑 → (◡𝐹 “ (-∞(,)𝐵)) ∈ 𝐽) |
| 36 | 30, 35 | eqeltrrd 2864 | 1 ⊢ (𝜑 → 𝐴 ∈ 𝐽) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 Ⅎwnf 1813 ∈ wcel 2143 Ⅎwnfc 2910 {crab 3416 ∪ cuni 4873 class class class wbr 5110 ◡ccnv 5662 ran crn 5664 “ cima 5666 Fn wfn 6533 ⟶wf 6534 ‘cfv 6538 (class class class)co 7412 ℝcr 11100 -∞cmnf 11242 ℝ*cxr 11243 < clt 11244 (,)cioo 13373 topGenctg 17491 Cn ccn 23362 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 ax-pre-sup 11179 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-er 8695 df-map 8827 df-en 8945 df-dom 8946 df-sdom 8947 df-sup 9403 df-inf 9404 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-div 11873 df-nn 12235 df-n0 12506 df-z 12593 df-uz 12864 df-q 12974 df-ioo 13377 df-topgen 17497 df-top 23032 df-topon 23049 df-bases 23084 df-cn 23365 |
| This theorem is referenced by: stoweidlem52 46749 cnfsmf 47437 |
| Copyright terms: Public domain | W3C validator |