| 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 5858 | . . . . 5 ⊢ Ⅎ𝑥◡𝐹 |
| 4 | nfcv 2898 | . . . . . 6 ⊢ Ⅎ𝑥-∞ | |
| 5 | nfcv 2898 | . . . . . 6 ⊢ Ⅎ𝑥(,) | |
| 6 | rfcnpre2.1 | . . . . . 6 ⊢ Ⅎ𝑥𝐵 | |
| 7 | 4, 5, 6 | nfov 7435 | . . . . 5 ⊢ Ⅎ𝑥(-∞(,)𝐵) |
| 8 | 3, 7 | nfima 6055 | . . . 4 ⊢ Ⅎ𝑥(◡𝐹 “ (-∞(,)𝐵)) |
| 9 | nfrab1 3436 | . . . 4 ⊢ Ⅎ𝑥{𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} | |
| 10 | rfcnpre2.4 | . . . . . . . . 9 ⊢ 𝐾 = (topGen‘ran (,)) | |
| 11 | rfcnpre2.5 | . . . . . . . . 9 ⊢ 𝑋 = ∪ 𝐽 | |
| 12 | eqid 2735 | . . . . . . . . 9 ⊢ (𝐽 Cn 𝐾) = (𝐽 Cn 𝐾) | |
| 13 | rfcnpre2.8 | . . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾)) | |
| 14 | 10, 11, 12, 13 | fcnre 45049 | . . . . . . . 8 ⊢ (𝜑 → 𝐹:𝑋⟶ℝ) |
| 15 | 14 | ffvelcdmda 7074 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ∈ ℝ) |
| 16 | rfcnpre2.7 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ*) | |
| 17 | elioomnf 13461 | . . . . . . . . 9 ⊢ (𝐵 ∈ ℝ* → ((𝐹‘𝑥) ∈ (-∞(,)𝐵) ↔ ((𝐹‘𝑥) ∈ ℝ ∧ (𝐹‘𝑥) < 𝐵))) | |
| 18 | 16, 17 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → ((𝐹‘𝑥) ∈ (-∞(,)𝐵) ↔ ((𝐹‘𝑥) ∈ ℝ ∧ (𝐹‘𝑥) < 𝐵))) |
| 19 | 18 | baibd 539 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹‘𝑥) ∈ ℝ) → ((𝐹‘𝑥) ∈ (-∞(,)𝐵) ↔ (𝐹‘𝑥) < 𝐵)) |
| 20 | 15, 19 | syldan 591 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐹‘𝑥) ∈ (-∞(,)𝐵) ↔ (𝐹‘𝑥) < 𝐵)) |
| 21 | 20 | pm5.32da 579 | . . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) ∈ (-∞(,)𝐵)) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) < 𝐵))) |
| 22 | ffn 6706 | . . . . . 6 ⊢ (𝐹:𝑋⟶ℝ → 𝐹 Fn 𝑋) | |
| 23 | elpreima 7048 | . . . . . 6 ⊢ (𝐹 Fn 𝑋 → (𝑥 ∈ (◡𝐹 “ (-∞(,)𝐵)) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) ∈ (-∞(,)𝐵)))) | |
| 24 | 14, 22, 23 | 3syl 18 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ (◡𝐹 “ (-∞(,)𝐵)) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) ∈ (-∞(,)𝐵)))) |
| 25 | rabid 3437 | . . . . . 6 ⊢ (𝑥 ∈ {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) < 𝐵)) | |
| 26 | 25 | a1i 11 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) < 𝐵))) |
| 27 | 21, 24, 26 | 3bitr4d 311 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ (◡𝐹 “ (-∞(,)𝐵)) ↔ 𝑥 ∈ {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵})) |
| 28 | 1, 8, 9, 27 | eqrd 3978 | . . 3 ⊢ (𝜑 → (◡𝐹 “ (-∞(,)𝐵)) = {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵}) |
| 29 | rfcnpre2.6 | . . 3 ⊢ 𝐴 = {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} | |
| 30 | 28, 29 | eqtr4di 2788 | . 2 ⊢ (𝜑 → (◡𝐹 “ (-∞(,)𝐵)) = 𝐴) |
| 31 | iooretop 24704 | . . . . 5 ⊢ (-∞(,)𝐵) ∈ (topGen‘ran (,)) | |
| 32 | 31 | a1i 11 | . . . 4 ⊢ (𝜑 → (-∞(,)𝐵) ∈ (topGen‘ran (,))) |
| 33 | 32, 10 | eleqtrrdi 2845 | . . 3 ⊢ (𝜑 → (-∞(,)𝐵) ∈ 𝐾) |
| 34 | cnima 23203 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ (-∞(,)𝐵) ∈ 𝐾) → (◡𝐹 “ (-∞(,)𝐵)) ∈ 𝐽) | |
| 35 | 13, 33, 34 | syl2anc 584 | . 2 ⊢ (𝜑 → (◡𝐹 “ (-∞(,)𝐵)) ∈ 𝐽) |
| 36 | 30, 35 | eqeltrrd 2835 | 1 ⊢ (𝜑 → 𝐴 ∈ 𝐽) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 Ⅎwnf 1783 ∈ wcel 2108 Ⅎwnfc 2883 {crab 3415 ∪ cuni 4883 class class class wbr 5119 ◡ccnv 5653 ran crn 5655 “ cima 5657 Fn wfn 6526 ⟶wf 6527 ‘cfv 6531 (class class class)co 7405 ℝcr 11128 -∞cmnf 11267 ℝ*cxr 11268 < clt 11269 (,)cioo 13362 topGenctg 17451 Cn ccn 23162 |
| 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 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-cnex 11185 ax-resscn 11186 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-addrcl 11190 ax-mulcl 11191 ax-mulrcl 11192 ax-mulcom 11193 ax-addass 11194 ax-mulass 11195 ax-distr 11196 ax-i2m1 11197 ax-1ne0 11198 ax-1rid 11199 ax-rnegex 11200 ax-rrecex 11201 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-pre-ltadd 11205 ax-pre-mulgt0 11206 ax-pre-sup 11207 |
| 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 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7862 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-er 8719 df-map 8842 df-en 8960 df-dom 8961 df-sdom 8962 df-sup 9454 df-inf 9455 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-sub 11468 df-neg 11469 df-div 11895 df-nn 12241 df-n0 12502 df-z 12589 df-uz 12853 df-q 12965 df-ioo 13366 df-topgen 17457 df-top 22832 df-topon 22849 df-bases 22884 df-cn 23165 |
| This theorem is referenced by: stoweidlem52 46081 cnfsmf 46769 |
| Copyright terms: Public domain | W3C validator |