Theorem cnpdis 23519

Description: If 𝐴 is an isolated point in 𝑋 (or equivalently, the singleton {𝐴} is open in 𝑋), then every function is continuous at 𝐴. (Contributed by Mario Carneiro, 9-Sep-2015.)

Assertion

Ref	Expression
cnpdis	⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → ((𝐽 CnP 𝐾)‘𝐴) = (𝑌 ↑m 𝑋))

Proof of Theorem cnpdis

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

Step	Hyp	Ref	Expression
1		simplrl 789	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → {𝐴} ∈ 𝐽)
2		simpll3 1233	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → 𝐴 ∈ 𝑋)
3		snidg 4621	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑋 → 𝐴 ∈ {𝐴})
4	2, 3	syl 18	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → 𝐴 ∈ {𝐴})
5		simprr 785	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → (𝑓‘𝐴) ∈ 𝑥)
6		simplrr 790	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → 𝑓:𝑋⟶𝑌)
7		ffn 6703	. . . . . . . . . . 11 ⊢ (𝑓:𝑋⟶𝑌 → 𝑓 Fn 𝑋)
8		elpreima 7051	. . . . . . . . . . 11 ⊢ (𝑓 Fn 𝑋 → (𝐴 ∈ (◡𝑓 “ 𝑥) ↔ (𝐴 ∈ 𝑋 ∧ (𝑓‘𝐴) ∈ 𝑥)))
9	6, 7, 8	3syl 19	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → (𝐴 ∈ (◡𝑓 “ 𝑥) ↔ (𝐴 ∈ 𝑋 ∧ (𝑓‘𝐴) ∈ 𝑥)))
10	2, 5, 9	mpbir2and 726	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → 𝐴 ∈ (◡𝑓 “ 𝑥))
11	10	snssd 4747	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → {𝐴} ⊆ (◡𝑓 “ 𝑥))
12		eleq2 2849	. . . . . . . . . 10 ⊢ (𝑦 = {𝐴} → (𝐴 ∈ 𝑦 ↔ 𝐴 ∈ {𝐴}))
13		sseq1 3956	. . . . . . . . . 10 ⊢ (𝑦 = {𝐴} → (𝑦 ⊆ (◡𝑓 “ 𝑥) ↔ {𝐴} ⊆ (◡𝑓 “ 𝑥)))
14	12, 13	anbi12d 644	. . . . . . . . 9 ⊢ (𝑦 = {𝐴} → ((𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥)) ↔ (𝐴 ∈ {𝐴} ∧ {𝐴} ⊆ (◡𝑓 “ 𝑥))))
15	14	rspcev 3576	. . . . . . . 8 ⊢ (({𝐴} ∈ 𝐽 ∧ (𝐴 ∈ {𝐴} ∧ {𝐴} ⊆ (◡𝑓 “ 𝑥))) → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥)))
16	1, 4, 11, 15	syl12anc 850	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥)))
17	16	expr 462	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ 𝑥 ∈ 𝐾) → ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))
18	17	ralrimiva 3154	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) → ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))
19	18	expr 462	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓:𝑋⟶𝑌 → ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥)))))
20	19	pm4.71d 571	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓:𝑋⟶𝑌 ↔ (𝑓:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))))
21		simpl2 1211	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → 𝐾 ∈ (TopOn‘𝑌))
22		toponmax 23152	. . . . 5 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝑌 ∈ 𝐾)
23	21, 22	syl 18	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → 𝑌 ∈ 𝐾)
24		simpl1 1210	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → 𝐽 ∈ (TopOn‘𝑋))
25		toponmax 23152	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
26	24, 25	syl 18	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → 𝑋 ∈ 𝐽)
27	23, 26	elmapd 8840	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓 ∈ (𝑌 ↑m 𝑋) ↔ 𝑓:𝑋⟶𝑌))
28		iscnp3 23470	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝑓:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))))
29	28	adantr 486	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝑓:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))))
30	20, 27, 29	3bitr4rd 315	. 2 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ 𝑓 ∈ (𝑌 ↑m 𝑋)))
31	30	eqrdv 2758	1 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → ((𝐽 CnP 𝐾)‘𝐴) = (𝑌 ↑m 𝑋))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086   ⊆ wss 3899  {csn 4584  ^◡ccnv 5654   “ cima 5658   Fn wfn 6528  ⟶wf 6529  ‘cfv 6533  (class class class)co 7414   ↑_m cmap 8827  TopOnctopon 23136   CnP ccnp 23451

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-cnp 23454

This theorem is used by: (None)