Theorem cndis 23517

Description: Every function is continuous when the domain is discrete. (Contributed by Mario Carneiro, 19-Mar-2015.) (Revised by Mario Carneiro, 21-Aug-2015.)

Assertion

Ref	Expression
cndis	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝒫 𝐴 Cn 𝐽) = (𝑋 ↑m 𝐴))

Proof of Theorem cndis

Dummy variables 𝑥 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cnvimass 6078	. . . . . . . 8 ⊢ (◡𝑓 “ 𝑥) ⊆ dom 𝑓
2		fdm 6713	. . . . . . . . 9 ⊢ (𝑓:𝐴⟶𝑋 → dom 𝑓 = 𝐴)
3	2	adantl 487	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → dom 𝑓 = 𝐴)
4	1, 3	sseqtrid 3973	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑓:𝐴⟶𝑋) → (◡𝑓 “ 𝑥) ⊆ 𝐴)
5		elpw2g 5298	. . . . . . . 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 23152	. . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
12		id 23	. . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ 𝑉)
13		elmapg 8839	. . . 4 ⊢ ((𝑋 ∈ 𝐽 ∧ 𝐴 ∈ 𝑉) → (𝑓 ∈ (𝑋 ↑m 𝐴) ↔ 𝑓:𝐴⟶𝑋))
14	11, 12, 13	syl2anr 609	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑓 ∈ (𝑋 ↑m 𝐴) ↔ 𝑓:𝐴⟶𝑋))
15		distopon 23223	. . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ (TopOn‘𝐴))
16		iscn 23461	. . . 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 𝐴))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076   ⊆ wss 3899  𝒫 cpw 4557  ^◡ccnv 5654  dom cdm 5655   “ cima 5658  ⟶wf 6529  ‘cfv 6533  (class class class)co 7414   ↑_m cmap 8827  TopOnctopon 23136   Cn ccn 23450

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-map 8829  df-top 23120  df-topon 23137  df-cn 23453

This theorem is used by:  xkopt  23882  distgp  24326  efmndtmd  24328  symgtgp  24333