Theorem cnpdis 23187

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 776	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → {𝐴} ∈ 𝐽)
2		simpll3 1215	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → 𝐴 ∈ 𝑋)
3		snidg 4627	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑋 → 𝐴 ∈ {𝐴})
4	2, 3	syl 17	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → 𝐴 ∈ {𝐴})
5		simprr 772	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → (𝑓‘𝐴) ∈ 𝑥)
6		simplrr 777	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → 𝑓:𝑋⟶𝑌)
7		ffn 6691	. . . . . . . . . . 11 ⊢ (𝑓:𝑋⟶𝑌 → 𝑓 Fn 𝑋)
8		elpreima 7033	. . . . . . . . . . 11 ⊢ (𝑓 Fn 𝑋 → (𝐴 ∈ (◡𝑓 “ 𝑥) ↔ (𝐴 ∈ 𝑋 ∧ (𝑓‘𝐴) ∈ 𝑥)))
9	6, 7, 8	3syl 18	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → (𝐴 ∈ (◡𝑓 “ 𝑥) ↔ (𝐴 ∈ 𝑋 ∧ (𝑓‘𝐴) ∈ 𝑥)))
10	2, 5, 9	mpbir2and 713	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → 𝐴 ∈ (◡𝑓 “ 𝑥))
11	10	snssd 4776	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → {𝐴} ⊆ (◡𝑓 “ 𝑥))
12		eleq2 2818	. . . . . . . . . 10 ⊢ (𝑦 = {𝐴} → (𝐴 ∈ 𝑦 ↔ 𝐴 ∈ {𝐴}))
13		sseq1 3975	. . . . . . . . . 10 ⊢ (𝑦 = {𝐴} → (𝑦 ⊆ (◡𝑓 “ 𝑥) ↔ {𝐴} ⊆ (◡𝑓 “ 𝑥)))
14	12, 13	anbi12d 632	. . . . . . . . 9 ⊢ (𝑦 = {𝐴} → ((𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥)) ↔ (𝐴 ∈ {𝐴} ∧ {𝐴} ⊆ (◡𝑓 “ 𝑥))))
15	14	rspcev 3591	. . . . . . . 8 ⊢ (({𝐴} ∈ 𝐽 ∧ (𝐴 ∈ {𝐴} ∧ {𝐴} ⊆ (◡𝑓 “ 𝑥))) → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥)))
16	1, 4, 11, 15	syl12anc 836	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥)))
17	16	expr 456	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ 𝑥 ∈ 𝐾) → ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))
18	17	ralrimiva 3126	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) → ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))
19	18	expr 456	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓:𝑋⟶𝑌 → ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥)))))
20	19	pm4.71d 561	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓:𝑋⟶𝑌 ↔ (𝑓:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))))
21		simpl2 1193	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → 𝐾 ∈ (TopOn‘𝑌))
22		toponmax 22820	. . . . 5 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝑌 ∈ 𝐾)
23	21, 22	syl 17	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → 𝑌 ∈ 𝐾)
24		simpl1 1192	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → 𝐽 ∈ (TopOn‘𝑋))
25		toponmax 22820	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
26	24, 25	syl 17	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → 𝑋 ∈ 𝐽)
27	23, 26	elmapd 8816	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓 ∈ (𝑌 ↑m 𝑋) ↔ 𝑓:𝑋⟶𝑌))
28		iscnp3 23138	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝑓:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))))
29	28	adantr 480	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝑓:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))))
30	20, 27, 29	3bitr4rd 312	. 2 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ 𝑓 ∈ (𝑌 ↑m 𝑋)))
31	30	eqrdv 2728	1 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → ((𝐽 CnP 𝐾)‘𝐴) = (𝑌 ↑m 𝑋))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3045  ∃wrex 3054   ⊆ wss 3917  {csn 4592  ^◡ccnv 5640   “ cima 5644   Fn wfn 6509  ⟶wf 6510  ‘cfv 6514  (class class class)co 7390   ↑_m cmap 8802  TopOnctopon 22804   CnP ccnp 23119

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-sbc 3757  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-fv 6522  df-ov 7393  df-oprab 7394  df-mpo 7395  df-map 8804  df-top 22788  df-topon 22805  df-cnp 23122

This theorem is referenced by: (None)