![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > cndis | 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 𝐽) = (𝑋 ↑𝑚 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cnvimass 4860 | . . . . . . . 8 ⊢ (◡𝑓 “ 𝑥) ⊆ dom 𝑓 | |
2 | fdm 5236 | . . . . . . . . 9 ⊢ (𝑓:𝐴⟶𝑋 → dom 𝑓 = 𝐴) | |
3 | 2 | adantl 273 | . . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → dom 𝑓 = 𝐴) |
4 | 1, 3 | sseqtrid 3113 | . . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → (◡𝑓 “ 𝑥) ⊆ 𝐴) |
5 | elpw2g 4041 | . . . . . . . 8 ⊢ (𝐴 ∈ 𝑉 → ((◡𝑓 “ 𝑥) ∈ 𝒫 𝐴 ↔ (◡𝑓 “ 𝑥) ⊆ 𝐴)) | |
6 | 5 | ad2antrr 477 | . . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → ((◡𝑓 “ 𝑥) ∈ 𝒫 𝐴 ↔ (◡𝑓 “ 𝑥) ⊆ 𝐴)) |
7 | 4, 6 | mpbird 166 | . . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴) |
8 | 7 | ralrimivw 2480 | . . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → ∀𝑥 ∈ 𝐽 (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴) |
9 | 8 | ex 114 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓:𝐴⟶𝑋 → ∀𝑥 ∈ 𝐽 (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴)) |
10 | 9 | pm4.71d 388 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓:𝐴⟶𝑋 ↔ (𝑓:𝐴⟶𝑋 ∧ ∀𝑥 ∈ 𝐽 (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴))) |
11 | toponmax 12035 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽) | |
12 | id 19 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ 𝑉) | |
13 | elmapg 6509 | . . . 4 ⊢ ((𝑋 ∈ 𝐽 ∧ 𝐴 ∈ 𝑉) → (𝑓 ∈ (𝑋 ↑𝑚 𝐴) ↔ 𝑓:𝐴⟶𝑋)) | |
14 | 11, 12, 13 | syl2anr 286 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓 ∈ (𝑋 ↑𝑚 𝐴) ↔ 𝑓:𝐴⟶𝑋)) |
15 | distopon 12099 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ (TopOn‘𝐴)) | |
16 | iscn 12208 | . . . 4 ⊢ ((𝒫 𝐴 ∈ (TopOn‘𝐴) ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓 ∈ (𝒫 𝐴 Cn 𝐽) ↔ (𝑓:𝐴⟶𝑋 ∧ ∀𝑥 ∈ 𝐽 (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴))) | |
17 | 15, 16 | sylan 279 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓 ∈ (𝒫 𝐴 Cn 𝐽) ↔ (𝑓:𝐴⟶𝑋 ∧ ∀𝑥 ∈ 𝐽 (◡𝑓 “ 𝑥) ∈ 𝒫 𝐴))) |
18 | 10, 14, 17 | 3bitr4rd 220 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓 ∈ (𝒫 𝐴 Cn 𝐽) ↔ 𝑓 ∈ (𝑋 ↑𝑚 𝐴))) |
19 | 18 | eqrdv 2113 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝒫 𝐴 Cn 𝐽) = (𝑋 ↑𝑚 𝐴)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1314 ∈ wcel 1463 ∀wral 2390 ⊆ wss 3037 𝒫 cpw 3476 ◡ccnv 4498 dom cdm 4499 “ cima 4502 ⟶wf 5077 ‘cfv 5081 (class class class)co 5728 ↑𝑚 cmap 6496 TopOnctopon 12020 Cn ccn 12197 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 586 ax-in2 587 ax-io 681 ax-5 1406 ax-7 1407 ax-gen 1408 ax-ie1 1452 ax-ie2 1453 ax-8 1465 ax-10 1466 ax-11 1467 ax-i12 1468 ax-bndl 1469 ax-4 1470 ax-13 1474 ax-14 1475 ax-17 1489 ax-i9 1493 ax-ial 1497 ax-i5r 1498 ax-ext 2097 ax-sep 4006 ax-pow 4058 ax-pr 4091 ax-un 4315 ax-setind 4412 |
This theorem depends on definitions: df-bi 116 df-3an 947 df-tru 1317 df-fal 1320 df-nf 1420 df-sb 1719 df-eu 1978 df-mo 1979 df-clab 2102 df-cleq 2108 df-clel 2111 df-nfc 2244 df-ne 2283 df-ral 2395 df-rex 2396 df-rab 2399 df-v 2659 df-sbc 2879 df-csb 2972 df-dif 3039 df-un 3041 df-in 3043 df-ss 3050 df-pw 3478 df-sn 3499 df-pr 3500 df-op 3502 df-uni 3703 df-iun 3781 df-br 3896 df-opab 3950 df-mpt 3951 df-id 4175 df-xp 4505 df-rel 4506 df-cnv 4507 df-co 4508 df-dm 4509 df-rn 4510 df-res 4511 df-ima 4512 df-iota 5046 df-fun 5083 df-fn 5084 df-f 5085 df-fv 5089 df-ov 5731 df-oprab 5732 df-mpo 5733 df-1st 5992 df-2nd 5993 df-map 6498 df-top 12008 df-topon 12021 df-cn 12200 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |