| 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 5869 | . . . . 5 ⊢ Ⅎ𝑥◡𝐹 |
| 4 | nfcv 2928 | . . . . . 6 ⊢ Ⅎ𝑥-∞ | |
| 5 | nfcv 2928 | . . . . . 6 ⊢ Ⅎ𝑥(,) | |
| 6 | rfcnpre2.1 | . . . . . 6 ⊢ Ⅎ𝑥𝐵 | |
| 7 | 4, 5, 6 | nfov 7453 | . . . . 5 ⊢ Ⅎ𝑥(-∞(,)𝐵) |
| 8 | 3, 7 | nfima 6075 | . . . 4 ⊢ Ⅎ𝑥(◡𝐹 “ (-∞(,)𝐵)) |
| 9 | nfrab1 3439 | . . . 4 ⊢ Ⅎ𝑥{𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} | |
| 10 | rfcnpre2.4 | . . . . . . . . 9 ⊢ 𝐾 = (topGen‘ran (,)) | |
| 11 | rfcnpre2.5 | . . . . . . . . 9 ⊢ 𝑋 = ∪ 𝐽 | |
| 12 | eqid 2766 | . . . . . . . . 9 ⊢ (𝐽 Cn 𝐾) = (𝐽 Cn 𝐾) | |
| 13 | rfcnpre2.8 | . . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾)) | |
| 14 | 10, 11, 12, 13 | fcnre 45786 | . . . . . . . 8 ⊢ (𝜑 → 𝐹:𝑋⟶ℝ) |
| 15 | 14 | ffvelcdmda 7086 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ∈ ℝ) |
| 16 | rfcnpre2.7 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ*) | |
| 17 | elioomnf 13489 | . . . . . . . . 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 6712 | . . . . . 6 ⊢ (𝐹:𝑋⟶ℝ → 𝐹 Fn 𝑋) | |
| 23 | elpreima 7060 | . . . . . 6 ⊢ (𝐹 Fn 𝑋 → (𝑥 ∈ (◡𝐹 “ (-∞(,)𝐵)) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) ∈ (-∞(,)𝐵)))) | |
| 24 | 14, 22, 23 | 3syl 19 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ (◡𝐹 “ (-∞(,)𝐵)) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) ∈ (-∞(,)𝐵)))) |
| 25 | rabid 3440 | . . . . . 6 ⊢ (𝑥 ∈ {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) < 𝐵)) | |
| 26 | 25 | a1i 11 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) < 𝐵))) |
| 27 | 21, 24, 26 | 3bitr4d 314 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ (◡𝐹 “ (-∞(,)𝐵)) ↔ 𝑥 ∈ {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵})) |
| 28 | 1, 8, 9, 27 | eqrd 3959 | . . 3 ⊢ (𝜑 → (◡𝐹 “ (-∞(,)𝐵)) = {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵}) |
| 29 | rfcnpre2.6 | . . 3 ⊢ 𝐴 = {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} | |
| 30 | 28, 29 | eqtr4di 2819 | . 2 ⊢ (𝜑 → (◡𝐹 “ (-∞(,)𝐵)) = 𝐴) |
| 31 | iooretop 24959 | . . . . 5 ⊢ (-∞(,)𝐵) ∈ (topGen‘ran (,)) | |
| 32 | 31 | a1i 11 | . . . 4 ⊢ (𝜑 → (-∞(,)𝐵) ∈ (topGen‘ran (,))) |
| 33 | 32, 10 | eleqtrrdi 2877 | . . 3 ⊢ (𝜑 → (-∞(,)𝐵) ∈ 𝐾) |
| 34 | cnima 23459 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ (-∞(,)𝐵) ∈ 𝐾) → (◡𝐹 “ (-∞(,)𝐵)) ∈ 𝐽) | |
| 35 | 13, 33, 34 | syl2anc 596 | . 2 ⊢ (𝜑 → (◡𝐹 “ (-∞(,)𝐵)) ∈ 𝐽) |
| 36 | 30, 35 | eqeltrrd 2867 | 1 ⊢ (𝜑 → 𝐴 ∈ 𝐽) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2146 Ⅎwnfc 2913 {crab 3419 ∪ cuni 4877 class class class wbr 5114 ◡ccnv 5665 ran crn 5667 “ cima 5669 Fn wfn 6538 ⟶wf 6539 ‘cfv 6543 (class class class)co 7423 ℝcr 11117 -∞cmnf 11259 ℝ*cxr 11260 < clt 11261 (,)cioo 13390 topGenctg 17515 Cn ccn 23418 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 ax-pre-sup 11196 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-er 8703 df-map 8835 df-en 8953 df-dom 8954 df-sdom 8955 df-sup 9412 df-inf 9413 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-div 11890 df-nn 12252 df-n0 12523 df-z 12610 df-uz 12881 df-q 12991 df-ioo 13394 df-topgen 17521 df-top 23088 df-topon 23105 df-bases 23140 df-cn 23421 |
| This theorem is used by: stoweidlem52 46807 cnfsmf 47495 |
| Copyright terms: Public domain | W3C validator |