Theorem cnpdis 12411

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 524	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → {𝐴} ∈ 𝐽)
2		simpll3 1022	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → 𝐴 ∈ 𝑋)
3		snidg 3554	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑋 → 𝐴 ∈ {𝐴})
4	2, 3	syl 14	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → 𝐴 ∈ {𝐴})
5		simprr 521	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → (𝑓‘𝐴) ∈ 𝑥)
6		simplrr 525	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → 𝑓:𝑋⟶𝑌)
7		ffn 5272	. . . . . . . . . . 11 ⊢ (𝑓:𝑋⟶𝑌 → 𝑓 Fn 𝑋)
8		elpreima 5539	. . . . . . . . . . 11 ⊢ (𝑓 Fn 𝑋 → (𝐴 ∈ (◡𝑓 “ 𝑥) ↔ (𝐴 ∈ 𝑋 ∧ (𝑓‘𝐴) ∈ 𝑥)))
9	6, 7, 8	3syl 17	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → (𝐴 ∈ (◡𝑓 “ 𝑥) ↔ (𝐴 ∈ 𝑋 ∧ (𝑓‘𝐴) ∈ 𝑥)))
10	2, 5, 9	mpbir2and 928	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → 𝐴 ∈ (◡𝑓 “ 𝑥))
11	10	snssd 3665	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → {𝐴} ⊆ (◡𝑓 “ 𝑥))
12		eleq2 2203	. . . . . . . . . 10 ⊢ (𝑦 = {𝐴} → (𝐴 ∈ 𝑦 ↔ 𝐴 ∈ {𝐴}))
13		sseq1 3120	. . . . . . . . . 10 ⊢ (𝑦 = {𝐴} → (𝑦 ⊆ (◡𝑓 “ 𝑥) ↔ {𝐴} ⊆ (◡𝑓 “ 𝑥)))
14	12, 13	anbi12d 464	. . . . . . . . 9 ⊢ (𝑦 = {𝐴} → ((𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥)) ↔ (𝐴 ∈ {𝐴} ∧ {𝐴} ⊆ (◡𝑓 “ 𝑥))))
15	14	rspcev 2789	. . . . . . . 8 ⊢ (({𝐴} ∈ 𝐽 ∧ (𝐴 ∈ {𝐴} ∧ {𝐴} ⊆ (◡𝑓 “ 𝑥))) → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥)))
16	1, 4, 11, 15	syl12anc 1214	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ (𝑥 ∈ 𝐾 ∧ (𝑓‘𝐴) ∈ 𝑥)) → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥)))
17	16	expr 372	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) ∧ 𝑥 ∈ 𝐾) → ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))
18	17	ralrimiva 2505	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ ({𝐴} ∈ 𝐽 ∧ 𝑓:𝑋⟶𝑌)) → ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))
19	18	expr 372	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓:𝑋⟶𝑌 → ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥)))))
20	19	pm4.71d 390	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓:𝑋⟶𝑌 ↔ (𝑓:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))))
21		simpl2 985	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → 𝐾 ∈ (TopOn‘𝑌))
22		toponmax 12192	. . . . 5 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝑌 ∈ 𝐾)
23	21, 22	syl 14	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → 𝑌 ∈ 𝐾)
24		simpl1 984	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → 𝐽 ∈ (TopOn‘𝑋))
25		toponmax 12192	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
26	24, 25	syl 14	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → 𝑋 ∈ 𝐽)
27	23, 26	elmapd 6556	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓 ∈ (𝑌 ↑𝑚 𝑋) ↔ 𝑓:𝑋⟶𝑌))
28		iscnp3 12372	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝑓:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))))
29	28	adantr 274	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝑓:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝐾 ((𝑓‘𝐴) ∈ 𝑥 → ∃𝑦 ∈ 𝐽 (𝐴 ∈ 𝑦 ∧ 𝑦 ⊆ (◡𝑓 “ 𝑥))))))
30	20, 27, 29	3bitr4rd 220	. 2 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → (𝑓 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ 𝑓 ∈ (𝑌 ↑𝑚 𝑋)))
31	30	eqrdv 2137	1 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐴 ∈ 𝑋) ∧ {𝐴} ∈ 𝐽) → ((𝐽 CnP 𝐾)‘𝐴) = (𝑌 ↑𝑚 𝑋))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   ∧ w3a 962   = wceq 1331   ∈ wcel 1480  ∀wral 2416  ∃wrex 2417   ⊆ wss 3071  {csn 3527  ^◡ccnv 4538   “ cima 4542   Fn wfn 5118  ⟶wf 5119  ‘cfv 5123  (class class class)co 5774   ↑_𝑚 cmap 6542  TopOnctopon 12177   CnP ccnp 12355

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-map 6544  df-top 12165  df-topon 12178  df-cnp 12358

This theorem is referenced by: (None)