Theorem cnpdis 14910

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 𝐾)‘𝐴) = (𝑌 ↑𝑚 𝑋))

Proof of Theorem cnpdis

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

Step	Hyp	Ref	Expression
1		simplrl 535	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → {𝐴} ∈ 𝐽)
2		simpll3 1062	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → 𝐴 ∈ 𝑋)
3		snidg 3695	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑋 → 𝐴 ∈ {𝐴})
4	2, 3	syl 14	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → 𝐴 ∈ {𝐴})
5		simprr 531	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → (𝑓‘𝐴) ∈ 𝑥)
6		simplrr 536	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → 𝑓:𝑋⟶𝑌)
7		ffn 5472	. . . . . . . . . . 11 ⊢ (𝑓:𝑋⟶𝑌 → 𝑓 Fn 𝑋)
8		elpreima 5753	. . . . . . . . . . 11 ⊢ (𝑓 Fn 𝑋 → (𝐴 ∈ (◡𝑓 “ 𝑥) ↔ (𝐴 ∈ 𝑋 ∧ (𝑓‘𝐴) ∈ 𝑥)))
9	6, 7, 8	3syl 17	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → (𝐴 ∈ (◡𝑓 “ 𝑥) ↔ (𝐴 ∈ 𝑋 ∧ (𝑓‘𝐴) ∈ 𝑥)))
10	2, 5, 9	mpbir2and 950	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → 𝐴 ∈ (◡𝑓 “ 𝑥))
11	10	snssd 3812	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → {𝐴} ⊆ (◡𝑓 “ 𝑥))
12		eleq2 2293	. . . . . . . . . 10 ⊢ (𝑦 = {𝐴} → (𝐴 ∈ 𝑦 ↔ 𝐴 ∈ {𝐴}))
13		sseq1 3247	. . . . . . . . . 10 ⊢ (𝑦 = {𝐴} → (𝑦 ⊆ (◡𝑓 “ 𝑥) ↔ {𝐴} ⊆ (◡𝑓 “ 𝑥)))
14	12, 13	anbi12d 473	. . . . . . . . 9 ⊢ (𝑦 = {𝐴} → ((𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥)) ↔ (𝐴 ∈ {𝐴} ∧ {𝐴} ⊆ (◡𝑓 “ 𝑥))))
15	14	rspcev 2907	. . . . . . . 8 ⊢ (({𝐴} ∈ 𝐽 ∧ (𝐴 ∈ {𝐴} ∧ {𝐴} ⊆ (◡𝑓 “ 𝑥))) → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥)))
16	1, 4, 11, 15	syl12anc 1269	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥)))
17	16	expr 375	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ 𝑥 ∈ 𝐾) → ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))
18	17	ralrimiva 2603	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) → ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))
19	18	expr 375	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓:𝑋⟶𝑌 → ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥)))))
20	19	pm4.71d 393	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓:𝑋⟶𝑌 ↔ (𝑓:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))))
21		simpl2 1025	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → 𝐾 ∈ (TopOn‘𝑌))
22		toponmax 14693	. . . . 5 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝑌 ∈ 𝐾)
23	21, 22	syl 14	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → 𝑌 ∈ 𝐾)
24		simpl1 1024	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → 𝐽 ∈ (TopOn‘𝑋))
25		toponmax 14693	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
26	24, 25	syl 14	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → 𝑋 ∈ 𝐽)
27	23, 26	elmapd 6807	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓 ∈ (𝑌 ↑𝑚 𝑋) ↔ 𝑓:𝑋⟶𝑌))
28		iscnp3 14871	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝑓:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))))
29	28	adantr 276	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝑓:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))))
30	20, 27, 29	3bitr4rd 221	. 2 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ 𝑓 ∈ (𝑌 ↑𝑚 𝑋)))
31	30	eqrdv 2227	1 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → ((𝐽 CnP 𝐾)‘𝐴) = (𝑌 ↑𝑚 𝑋))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1002   = wceq 1395   ∈ wcel 2200  ∀wral 2508  ∃wrex 2509   ⊆ wss 3197  {csn 3666  ^◡ccnv 4717   “ cima 4721   Fn wfn 5312  ⟶wf 5313  ‘cfv 5317  (class class class)co 6000   ↑_𝑚 cmap 6793  TopOnctopon 14678   CnP ccnp 14854

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-fv 5325  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-map 6795  df-top 14666  df-topon 14679  df-cnp 14857

This theorem is referenced by: (None)