![]() |
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 6102 | . . . . . . . 8 ⊢ (◡𝑓 “ 𝑥) ⊆ dom 𝑓 | |
2 | fdm 6746 | . . . . . . . . 9 ⊢ (𝑓:𝐴⟶𝑋 → dom 𝑓 = 𝐴) | |
3 | 2 | adantl 481 | . . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → dom 𝑓 = 𝐴) |
4 | 1, 3 | sseqtrid 4048 | . . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → (◡𝑓 “ 𝑥) ⊆ 𝐴) |
5 | elpw2g 5339 | . . . . . . . 8 ⊢ (𝐴 ∈ 𝑉 → ((◡𝑓 “ 𝑥) ∈ 𝒫 𝐴 ↔ (◡𝑓 “ 𝑥) ⊆ 𝐴)) | |
6 | 5 | ad2antrr 726 | . . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → ((◡𝑓 “ 𝑥) ∈ 𝒫 𝐴 ↔ (◡𝑓 “ 𝑥) ⊆ 𝐴)) |
7 | 4, 6 | mpbird 257 | . . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴) |
8 | 7 | ralrimivw 3148 | . . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → ∀𝑥 ∈ 𝐽 (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴) |
9 | 8 | ex 412 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓:𝐴⟶𝑋 → ∀𝑥 ∈ 𝐽 (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴)) |
10 | 9 | pm4.71d 561 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓:𝐴⟶𝑋 ↔ (𝑓:𝐴⟶𝑋 ∧ ∀𝑥 ∈ 𝐽 (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴))) |
11 | toponmax 22948 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽) | |
12 | id 22 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ 𝑉) | |
13 | elmapg 8878 | . . . 4 ⊢ ((𝑋 ∈ 𝐽 ∧ 𝐴 ∈ 𝑉) → (𝑓 ∈ (𝑋 ↑m 𝐴) ↔ 𝑓:𝐴⟶𝑋)) | |
14 | 11, 12, 13 | syl2anr 597 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓 ∈ (𝑋 ↑m 𝐴) ↔ 𝑓:𝐴⟶𝑋)) |
15 | distopon 23020 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ (TopOn‘𝐴)) | |
16 | iscn 23259 | . . . 4 ⊢ ((𝒫 𝐴 ∈ (TopOn‘𝐴) ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓 ∈ (𝒫 𝐴 Cn 𝐽) ↔ (𝑓:𝐴⟶𝑋 ∧ ∀𝑥 ∈ 𝐽 (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴))) | |
17 | 15, 16 | sylan 580 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓 ∈ (𝒫 𝐴 Cn 𝐽) ↔ (𝑓:𝐴⟶𝑋 ∧ ∀𝑥 ∈ 𝐽 (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴))) |
18 | 10, 14, 17 | 3bitr4rd 312 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓 ∈ (𝒫 𝐴 Cn 𝐽) ↔ 𝑓 ∈ (𝑋 ↑m 𝐴))) |
19 | 18 | eqrdv 2733 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝒫 𝐴 Cn 𝐽) = (𝑋 ↑m 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ∀wral 3059 ⊆ wss 3963 𝒫 cpw 4605 ◡ccnv 5688 dom cdm 5689 “ cima 5692 ⟶wf 6559 ‘cfv 6563 (class class class)co 7431 ↑m cmap 8865 TopOnctopon 22932 Cn ccn 23248 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-sbc 3792 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-fv 6571 df-ov 7434 df-oprab 7435 df-mpo 7436 df-map 8867 df-top 22916 df-topon 22933 df-cn 23251 |
This theorem is referenced by: xkopt 23679 distgp 24123 efmndtmd 24125 symgtgp 24130 |
Copyright terms: Public domain | W3C validator |