| 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 5856 | . . . . 5 ⊢ Ⅎ𝑥◡𝐹 |
| 4 | nfcv 2923 | . . . . . 6 ⊢ Ⅎ𝑥-∞ | |
| 5 | nfcv 2923 | . . . . . 6 ⊢ Ⅎ𝑥(,) | |
| 6 | rfcnpre2.1 | . . . . . 6 ⊢ Ⅎ𝑥𝐵 | |
| 7 | 4, 5, 6 | nfov 7442 | . . . . 5 ⊢ Ⅎ𝑥(-∞(,)𝐵) |
| 8 | 3, 7 | nfima 6062 | . . . 4 ⊢ Ⅎ𝑥(◡𝐹 “ (-∞(,)𝐵)) |
| 9 | nfrab1 3432 | . . . 4 ⊢ Ⅎ𝑥{𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} | |
| 10 | rfcnpre2.4 | . . . . . . . . 9 ⊢ 𝐾 = (topGen‘ran (,)) | |
| 11 | rfcnpre2.5 | . . . . . . . . 9 ⊢ 𝑋 = ∪ 𝐽 | |
| 12 | eqid 2761 | . . . . . . . . 9 ⊢ (𝐽 Cn 𝐾) = (𝐽 Cn 𝐾) | |
| 13 | rfcnpre2.8 | . . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾)) | |
| 14 | 10, 11, 12, 13 | fcnre 45985 | . . . . . . . 8 ⊢ (𝜑 → 𝐹:𝑋⟶ℝ) |
| 15 | 14 | ffvelcdmda 7076 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ∈ ℝ) |
| 16 | rfcnpre2.7 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ*) | |
| 17 | elioomnf 13556 | . . . . . . . . 9 ⊢ (𝐵 ∈ ℝ* → ((𝐹‘𝑥) ∈ (-∞(,)𝐵) ↔ ((𝐹‘𝑥) ∈ ℝ ∧ (𝐹‘𝑥) < 𝐵))) | |
| 18 | 16, 17 | syl 18 | . . . . . . . 8 ⊢ (𝜑 → ((𝐹‘𝑥) ∈ (-∞(,)𝐵) ↔ ((𝐹‘𝑥) ∈ ℝ ∧ (𝐹‘𝑥) < 𝐵))) |
| 19 | 18 | baibd 549 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹‘𝑥) ∈ ℝ) → ((𝐹‘𝑥) ∈ (-∞(,)𝐵) ↔ (𝐹‘𝑥) < 𝐵)) |
| 20 | 15, 19 | syldan 603 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐹‘𝑥) ∈ (-∞(,)𝐵) ↔ (𝐹‘𝑥) < 𝐵)) |
| 21 | 20 | pm5.32da 590 | . . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) ∈ (-∞(,)𝐵)) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) < 𝐵))) |
| 22 | ffn 6701 | . . . . . 6 ⊢ (𝐹:𝑋⟶ℝ → 𝐹 Fn 𝑋) | |
| 23 | elpreima 7049 | . . . . . 6 ⊢ (𝐹 Fn 𝑋 → (𝑥 ∈ (◡𝐹 “ (-∞(,)𝐵)) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) ∈ (-∞(,)𝐵)))) | |
| 24 | 14, 22, 23 | 3syl 19 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ (◡𝐹 “ (-∞(,)𝐵)) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) ∈ (-∞(,)𝐵)))) |
| 25 | rabid 3433 | . . . . . 6 ⊢ (𝑥 ∈ {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) < 𝐵)) | |
| 26 | 25 | a1i 11 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) < 𝐵))) |
| 27 | 21, 24, 26 | 3bitr4d 314 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ (◡𝐹 “ (-∞(,)𝐵)) ↔ 𝑥 ∈ {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵})) |
| 28 | 1, 8, 9, 27 | eqrd 3950 | . . 3 ⊢ (𝜑 → (◡𝐹 “ (-∞(,)𝐵)) = {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵}) |
| 29 | rfcnpre2.6 | . . 3 ⊢ 𝐴 = {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} | |
| 30 | 28, 29 | eqtr4di 2814 | . 2 ⊢ (𝜑 → (◡𝐹 “ (-∞(,)𝐵)) = 𝐴) |
| 31 | iooretop 25064 | . . . . 5 ⊢ (-∞(,)𝐵) ∈ (topGen‘ran (,)) | |
| 32 | 31 | a1i 11 | . . . 4 ⊢ (𝜑 → (-∞(,)𝐵) ∈ (topGen‘ran (,))) |
| 33 | 32, 10 | eleqtrrdi 2872 | . . 3 ⊢ (𝜑 → (-∞(,)𝐵) ∈ 𝐾) |
| 34 | cnima 23563 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ (-∞(,)𝐵) ∈ 𝐾) → (◡𝐹 “ (-∞(,)𝐵)) ∈ 𝐽) | |
| 35 | 13, 33, 34 | syl2anc 596 | . 2 ⊢ (𝜑 → (◡𝐹 “ (-∞(,)𝐵)) ∈ 𝐽) |
| 36 | 30, 35 | eqeltrrd 2862 | 1 ⊢ (𝜑 → 𝐴 ∈ 𝐽) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2145 Ⅎwnfc 2908 {crab 3413 ∪ cuni 4867 class class class wbr 5103 ◡ccnv 5650 ran crn 5652 “ cima 5654 Fn wfn 6526 ⟶wf 6527 ‘cfv 6531 (class class class)co 7412 ℝcr 11180 -∞cmnf 11322 ℝ*cxr 11323 < clt 11324 (,)cioo 13457 topGenctg 17588 Cn ccn 23522 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 ax-pre-sup 11259 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8701 df-map 8833 df-en 8958 df-dom 8959 df-sdom 8960 df-sup 9418 df-inf 9419 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-div 11955 df-nn 12317 df-n0 12588 df-z 12675 df-uz 12947 df-q 13057 df-ioo 13461 df-topgen 17594 df-top 23192 df-topon 23209 df-bases 23244 df-cn 23525 |
| This theorem is used by: stoweidlem52 47006 cnfsmf 47694 |
| Copyright terms: Public domain | W3C validator |