![]() |
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 5903 | . . . . 5 ⊢ Ⅎ𝑥◡𝐹 |
4 | nfcv 2908 | . . . . . 6 ⊢ Ⅎ𝑥-∞ | |
5 | nfcv 2908 | . . . . . 6 ⊢ Ⅎ𝑥(,) | |
6 | rfcnpre2.1 | . . . . . 6 ⊢ Ⅎ𝑥𝐵 | |
7 | 4, 5, 6 | nfov 7478 | . . . . 5 ⊢ Ⅎ𝑥(-∞(,)𝐵) |
8 | 3, 7 | nfima 6097 | . . . 4 ⊢ Ⅎ𝑥(◡𝐹 “ (-∞(,)𝐵)) |
9 | nfrab1 3464 | . . . 4 ⊢ Ⅎ𝑥{𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} | |
10 | rfcnpre2.4 | . . . . . . . . 9 ⊢ 𝐾 = (topGen‘ran (,)) | |
11 | rfcnpre2.5 | . . . . . . . . 9 ⊢ 𝑋 = ∪ 𝐽 | |
12 | eqid 2740 | . . . . . . . . 9 ⊢ (𝐽 Cn 𝐾) = (𝐽 Cn 𝐾) | |
13 | rfcnpre2.8 | . . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾)) | |
14 | 10, 11, 12, 13 | fcnre 44925 | . . . . . . . 8 ⊢ (𝜑 → 𝐹:𝑋⟶ℝ) |
15 | 14 | ffvelcdmda 7118 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ∈ ℝ) |
16 | rfcnpre2.7 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ*) | |
17 | elioomnf 13504 | . . . . . . . . 9 ⊢ (𝐵 ∈ ℝ* → ((𝐹‘𝑥) ∈ (-∞(,)𝐵) ↔ ((𝐹‘𝑥) ∈ ℝ ∧ (𝐹‘𝑥) < 𝐵))) | |
18 | 16, 17 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → ((𝐹‘𝑥) ∈ (-∞(,)𝐵) ↔ ((𝐹‘𝑥) ∈ ℝ ∧ (𝐹‘𝑥) < 𝐵))) |
19 | 18 | baibd 539 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹‘𝑥) ∈ ℝ) → ((𝐹‘𝑥) ∈ (-∞(,)𝐵) ↔ (𝐹‘𝑥) < 𝐵)) |
20 | 15, 19 | syldan 590 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐹‘𝑥) ∈ (-∞(,)𝐵) ↔ (𝐹‘𝑥) < 𝐵)) |
21 | 20 | pm5.32da 578 | . . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) ∈ (-∞(,)𝐵)) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) < 𝐵))) |
22 | ffn 6747 | . . . . . 6 ⊢ (𝐹:𝑋⟶ℝ → 𝐹 Fn 𝑋) | |
23 | elpreima 7091 | . . . . . 6 ⊢ (𝐹 Fn 𝑋 → (𝑥 ∈ (◡𝐹 “ (-∞(,)𝐵)) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) ∈ (-∞(,)𝐵)))) | |
24 | 14, 22, 23 | 3syl 18 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ (◡𝐹 “ (-∞(,)𝐵)) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) ∈ (-∞(,)𝐵)))) |
25 | rabid 3465 | . . . . . 6 ⊢ (𝑥 ∈ {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) < 𝐵)) | |
26 | 25 | a1i 11 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) < 𝐵))) |
27 | 21, 24, 26 | 3bitr4d 311 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ (◡𝐹 “ (-∞(,)𝐵)) ↔ 𝑥 ∈ {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵})) |
28 | 1, 8, 9, 27 | eqrd 4028 | . . 3 ⊢ (𝜑 → (◡𝐹 “ (-∞(,)𝐵)) = {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵}) |
29 | rfcnpre2.6 | . . 3 ⊢ 𝐴 = {𝑥 ∈ 𝑋 ∣ (𝐹‘𝑥) < 𝐵} | |
30 | 28, 29 | eqtr4di 2798 | . 2 ⊢ (𝜑 → (◡𝐹 “ (-∞(,)𝐵)) = 𝐴) |
31 | iooretop 24807 | . . . . 5 ⊢ (-∞(,)𝐵) ∈ (topGen‘ran (,)) | |
32 | 31 | a1i 11 | . . . 4 ⊢ (𝜑 → (-∞(,)𝐵) ∈ (topGen‘ran (,))) |
33 | 32, 10 | eleqtrrdi 2855 | . . 3 ⊢ (𝜑 → (-∞(,)𝐵) ∈ 𝐾) |
34 | cnima 23294 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ (-∞(,)𝐵) ∈ 𝐾) → (◡𝐹 “ (-∞(,)𝐵)) ∈ 𝐽) | |
35 | 13, 33, 34 | syl2anc 583 | . 2 ⊢ (𝜑 → (◡𝐹 “ (-∞(,)𝐵)) ∈ 𝐽) |
36 | 30, 35 | eqeltrrd 2845 | 1 ⊢ (𝜑 → 𝐴 ∈ 𝐽) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 Ⅎwnf 1781 ∈ wcel 2108 Ⅎwnfc 2893 {crab 3443 ∪ cuni 4931 class class class wbr 5166 ◡ccnv 5699 ran crn 5701 “ cima 5703 Fn wfn 6568 ⟶wf 6569 ‘cfv 6573 (class class class)co 7448 ℝcr 11183 -∞cmnf 11322 ℝ*cxr 11323 < clt 11324 (,)cioo 13407 topGenctg 17497 Cn ccn 23253 |
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 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 ax-pre-sup 11262 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-er 8763 df-map 8886 df-en 9004 df-dom 9005 df-sdom 9006 df-sup 9511 df-inf 9512 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-div 11948 df-nn 12294 df-n0 12554 df-z 12640 df-uz 12904 df-q 13014 df-ioo 13411 df-topgen 17503 df-top 22921 df-topon 22938 df-bases 22974 df-cn 23256 |
This theorem is referenced by: stoweidlem52 45973 cnfsmf 46661 |
Copyright terms: Public domain | W3C validator |