Theorem cncnpi 21888

Description: A continuous function is continuous at all points. One direction of Theorem 7.2(g) of [Munkres] p. 107. (Contributed by Raph Levien, 20-Nov-2006.) (Proof shortened by Mario Carneiro, 21-Aug-2015.)

Hypothesis

Ref	Expression
cnsscnp.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
cncnpi	⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴))

Proof of Theorem cncnpi

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

Step	Hyp	Ref	Expression
1		cnsscnp.1	. . . 4 ⊢ 𝑋 = ∪ 𝐽
2		eqid 2823	. . . 4 ⊢ ∪ 𝐾 = ∪ 𝐾
3	1, 2	cnf 21856	. . 3 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋⟶∪ 𝐾)
4	3	adantr 483	. 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐹:𝑋⟶∪ 𝐾)
5		cnima 21875	. . . . . 6 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑦 ∈ 𝐾) → (◡𝐹 “ 𝑦) ∈ 𝐽)
6	5	ad2ant2r 745	. . . . 5 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → (◡𝐹 “ 𝑦) ∈ 𝐽)
7		simpr 487	. . . . . . 7 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
8	7	adantr 483	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → 𝐴 ∈ 𝑋)
9		simprr 771	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → (𝐹‘𝐴) ∈ 𝑦)
10	3	ad2antrr 724	. . . . . . 7 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → 𝐹:𝑋⟶∪ 𝐾)
11		ffn 6516	. . . . . . 7 ⊢ (𝐹:𝑋⟶∪ 𝐾 → 𝐹 Fn 𝑋)
12		elpreima 6830	. . . . . . 7 ⊢ (𝐹 Fn 𝑋 → (𝐴 ∈ (◡𝐹 “ 𝑦) ↔ (𝐴 ∈ 𝑋 ∧ (𝐹‘𝐴) ∈ 𝑦)))
13	10, 11, 12	3syl 18	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → (𝐴 ∈ (◡𝐹 “ 𝑦) ↔ (𝐴 ∈ 𝑋 ∧ (𝐹‘𝐴) ∈ 𝑦)))
14	8, 9, 13	mpbir2and 711	. . . . 5 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → 𝐴 ∈ (◡𝐹 “ 𝑦))
15		eqimss 4025	. . . . . . . 8 ⊢ (𝑥 = (◡𝐹 “ 𝑦) → 𝑥 ⊆ (◡𝐹 “ 𝑦))
16	15	biantrud 534	. . . . . . 7 ⊢ (𝑥 = (◡𝐹 “ 𝑦) → (𝐴 ∈ 𝑥 ↔ (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦))))
17		eleq2 2903	. . . . . . 7 ⊢ (𝑥 = (◡𝐹 “ 𝑦) → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ (◡𝐹 “ 𝑦)))
18	16, 17	bitr3d 283	. . . . . 6 ⊢ (𝑥 = (◡𝐹 “ 𝑦) → ((𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦)) ↔ 𝐴 ∈ (◡𝐹 “ 𝑦)))
19	18	rspcev 3625	. . . . 5 ⊢ (((◡𝐹 “ 𝑦) ∈ 𝐽 ∧ 𝐴 ∈ (◡𝐹 “ 𝑦)) → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦)))
20	6, 14, 19	syl2anc 586	. . . 4 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦)))
21	20	expr 459	. . 3 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → ((𝐹‘𝐴) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦))))
22	21	ralrimiva 3184	. 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → ∀𝑦 ∈ 𝐾 ((𝐹‘𝐴) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦))))
23		cntop1 21850	. . . . 5 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
24	23	adantr 483	. . . 4 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐽 ∈ Top)
25	1	toptopon 21527	. . . 4 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
26	24, 25	sylib 220	. . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐽 ∈ (TopOn‘𝑋))
27		cntop2 21851	. . . . 5 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
28	27	adantr 483	. . . 4 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐾 ∈ Top)
29	2	toptopon 21527	. . . 4 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
30	28, 29	sylib 220	. . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐾 ∈ (TopOn‘∪ 𝐾))
31		iscnp3 21854	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝐴 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝐹:𝑋⟶∪ 𝐾 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝐴) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦))))))
32	26, 30, 7, 31	syl3anc 1367	. 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝐹:𝑋⟶∪ 𝐾 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝐴) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦))))))
33	4, 22, 32	mpbir2and 711	1 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1537   ∈ wcel 2114  ∀wral 3140  ∃wrex 3141   ⊆ wss 3938  ∪ cuni 4840  ^◡ccnv 5556   “ cima 5560   Fn wfn 6352  ⟶wf 6353  ‘cfv 6357  (class class class)co 7158  Topctop 21503  TopOnctopon 21520   Cn ccn 21834   CnP ccnp 21835

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-fv 6365  df-ov 7161  df-oprab 7162  df-mpo 7163  df-map 8410  df-top 21504  df-topon 21521  df-cn 21837  df-cnp 21838

This theorem is referenced by:  cnsscnp  21889  cncnp  21890  lmcn  21915  ptcn  22237  tmdcn2  22699  ghmcnp  22725  tsmsmhm  22756  tsmsadd  22757  dvcnp2  24519  dvaddbr  24537  dvmulbr  24538  dvcobr  24545  dvcjbr  24548  dvcnvlem  24575  lhop1lem  24612  dvcnvrelem2  24617  ftc1cn  24642  taylthlem2  24964  psercn  25016  abelth  25031  cxpcn3  25331  efrlim  25549  blocni  28584  cvmlift2lem11  32562  cvmlift2lem12  32563  cvmlift3lem7  32574  poimir  34927  ftc1cnnc  34968  cncfiooicclem1  42183  fouriercn  42524