Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cncfrss | Structured version Visualization version GIF version |
Description: Reverse closure of the continuous function predicate. (Contributed by Mario Carneiro, 25-Aug-2014.) |
Ref | Expression |
---|---|
cncfrss | ⊢ (𝐹 ∈ (𝐴–cn→𝐵) → 𝐴 ⊆ ℂ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-cncf 23489 | . . 3 ⊢ –cn→ = (𝑎 ∈ 𝒫 ℂ, 𝑏 ∈ 𝒫 ℂ ↦ {𝑓 ∈ (𝑏 ↑m 𝑎) ∣ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝑎 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)}) | |
2 | 1 | elmpocl1 7391 | . 2 ⊢ (𝐹 ∈ (𝐴–cn→𝐵) → 𝐴 ∈ 𝒫 ℂ) |
3 | 2 | elpwid 4553 | 1 ⊢ (𝐹 ∈ (𝐴–cn→𝐵) → 𝐴 ⊆ ℂ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2113 ∀wral 3141 ∃wrex 3142 {crab 3145 ⊆ wss 3939 𝒫 cpw 4542 class class class wbr 5069 ‘cfv 6358 (class class class)co 7159 ↑m cmap 8409 ℂcc 10538 < clt 10678 − cmin 10873 ℝ+crp 12392 abscabs 14596 –cn→ccncf 23487 |
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 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ral 3146 df-rex 3147 df-rab 3150 df-v 3499 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-br 5070 df-opab 5132 df-xp 5564 df-dm 5568 df-iota 6317 df-fv 6366 df-ov 7162 df-oprab 7163 df-mpo 7164 df-cncf 23489 |
This theorem is referenced by: cncff 23504 cncfi 23505 rescncf 23508 cncffvrn 23509 cncfco 23518 cncfmpt2f 23525 cncfcnvcn 23532 cncombf 24262 cnlimci 24490 ulmcn 24990 efmul2picn 31871 mulcncff 42157 subcncff 42169 negcncfg 42170 addcncff 42173 ioccncflimc 42174 icocncflimc 42178 divcncff 42180 cncfcompt2 42188 |
Copyright terms: Public domain | W3C validator |