| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cndis | Structured version Visualization version GIF version | ||
| Description: Every function is continuous when the domain is discrete. (Contributed by Mario Carneiro, 19-Mar-2015.) (Revised by Mario Carneiro, 21-Aug-2015.) |
| Ref | Expression |
|---|---|
| cndis | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝒫 𝐴 Cn 𝐽) = (𝑋 ↑m 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnvimass 6201 | . . . . . . . 8 ⊢ (◡𝑓 “ 𝑥) ⊆ dom 𝑓 | |
| 2 | fdm 6724 | . . . . . . . . 9 ⊢ (𝑓:𝐴⟶𝑋 → dom 𝑓 = 𝐴) | |
| 3 | 2 | adantl 487 | . . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → dom 𝑓 = 𝐴) |
| 4 | 1, 3 | sseqtrid 3951 | . . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → (◡𝑓 “ 𝑥) ⊆ 𝐴) |
| 5 | elpw2g 5295 | . . . . . . . 8 ⊢ (𝐴 ∈ 𝑉 → ((◡𝑓 “ 𝑥) ∈ 𝒫 𝐴 ↔ (◡𝑓 “ 𝑥) ⊆ 𝐴)) | |
| 6 | 5 | ad2antrr 739 | . . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → ((◡𝑓 “ 𝑥) ∈ 𝒫 𝐴 ↔ (◡𝑓 “ 𝑥) ⊆ 𝐴)) |
| 7 | 4, 6 | mpbird 260 | . . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴) |
| 8 | 7 | ralrimivw 3158 | . . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → ∀𝑥 ∈ 𝐽 (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴) |
| 9 | 8 | ex 418 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓:𝐴⟶𝑋 → ∀𝑥 ∈ 𝐽 (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴)) |
| 10 | 9 | pm4.71d 571 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓:𝐴⟶𝑋 ↔ (𝑓:𝐴⟶𝑋 ∧ ∀𝑥 ∈ 𝐽 (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴))) |
| 11 | toponmax 23253 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽) | |
| 12 | id 23 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ 𝑉) | |
| 13 | elmapg 8867 | . . . 4 ⊢ ((𝑋 ∈ 𝐽 ∧ 𝐴 ∈ 𝑉) → (𝑓 ∈ (𝑋 ↑m 𝐴) ↔ 𝑓:𝐴⟶𝑋)) | |
| 14 | 11, 12, 13 | syl2anr 609 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓 ∈ (𝑋 ↑m 𝐴) ↔ 𝑓:𝐴⟶𝑋)) |
| 15 | distopon 23324 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ (TopOn‘𝐴)) | |
| 16 | iscn 23562 | . . . 4 ⊢ ((𝒫 𝐴 ∈ (TopOn‘𝐴) ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓 ∈ (𝒫 𝐴 Cn 𝐽) ↔ (𝑓:𝐴⟶𝑋 ∧ ∀𝑥 ∈ 𝐽 (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴))) | |
| 17 | 15, 16 | sylan 592 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓 ∈ (𝒫 𝐴 Cn 𝐽) ↔ (𝑓:𝐴⟶𝑋 ∧ ∀𝑥 ∈ 𝐽 (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴))) |
| 18 | 10, 14, 17 | 3bitr4rd 315 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓 ∈ (𝒫 𝐴 Cn 𝐽) ↔ 𝑓 ∈ (𝑋 ↑m 𝐴))) |
| 19 | 18 | eqrdv 2758 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝒫 𝐴 Cn 𝐽) = (𝑋 ↑m 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∀wral 3076 ⊆ wss 3896 𝒫 cpw 4556 ◡ccnv 5650 dom cdm 5651 “ cima 5654 ⟶wf 6539 ‘cfv 6543 (class class class)co 7424 ↑m cmap 8855 TopOnctopon 23237 Cn ccn 23551 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-fv 6551 df-ov 7427 df-oprab 7428 df-mpo 7429 df-map 8857 df-top 23221 df-topon 23238 df-cn 23554 |
| This theorem is used by: xkopt 23983 distgp 24427 efmndtmd 24429 symgtgp 24434 |
| Copyright terms: Public domain | W3C validator |