| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cncfrss2 | GIF version | ||
| Description: Reverse closure of the continuous function predicate. (Contributed by Mario Carneiro, 25-Aug-2014.) |
| Ref | Expression |
|---|---|
| cncfrss2 | ⊢ (𝐹 ∈ (𝐴–cn→𝐵) → 𝐵 ⊆ ℂ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-cncf 15253 | . . 3 ⊢ –cn→ = (𝑎 ∈ 𝒫 ℂ, 𝑏 ∈ 𝒫 ℂ ↦ {𝑓 ∈ (𝑏 ↑𝑚 𝑎) ∣ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ 𝑎 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)}) | |
| 2 | 1 | elmpocl2 6208 | . 2 ⊢ (𝐹 ∈ (𝐴–cn→𝐵) → 𝐵 ∈ 𝒫 ℂ) |
| 3 | 2 | elpwid 3660 | 1 ⊢ (𝐹 ∈ (𝐴–cn→𝐵) → 𝐵 ⊆ ℂ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∈ wcel 2200 ∀wral 2508 ∃wrex 2509 {crab 2512 ⊆ wss 3197 𝒫 cpw 3649 class class class wbr 4083 ‘cfv 5318 (class class class)co 6007 ↑𝑚 cmap 6803 ℂcc 8005 < clt 8189 − cmin 8325 ℝ+crp 9857 abscabs 11516 –cn→ccncf 15252 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4258 ax-pr 4293 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-v 2801 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-br 4084 df-opab 4146 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-iota 5278 df-fun 5320 df-fv 5326 df-ov 6010 df-oprab 6011 df-mpo 6012 df-cncf 15253 |
| This theorem is referenced by: cncff 15259 cncfi 15260 rescncf 15263 climcncf 15266 cncfco 15273 cnlimci 15355 |
| Copyright terms: Public domain | W3C validator |