Theorem cncnpi 14671

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 2204	. . . 4 ⊢ ∪ 𝐾 = ∪ 𝐾
3	1, 2	cnf 14647	. . 3 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋⟶∪ 𝐾)
4	3	adantr 276	. 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐹:𝑋⟶∪ 𝐾)
5		cnima 14663	. . . . . 6 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑦 ∈ 𝐾) → (◡𝐹 “ 𝑦) ∈ 𝐽)
6	5	ad2ant2r 509	. . . . 5 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → (◡𝐹 “ 𝑦) ∈ 𝐽)
7		simpr 110	. . . . . . 7 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
8	7	adantr 276	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → 𝐴 ∈ 𝑋)
9		simprr 531	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → (𝐹‘𝐴) ∈ 𝑦)
10	3	ad2antrr 488	. . . . . . 7 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → 𝐹:𝑋⟶∪ 𝐾)
11		ffn 5424	. . . . . . 7 ⊢ (𝐹:𝑋⟶∪ 𝐾 → 𝐹 Fn 𝑋)
12		elpreima 5698	. . . . . . 7 ⊢ (𝐹 Fn 𝑋 → (𝐴 ∈ (◡𝐹 “ 𝑦) ↔ (𝐴 ∈ 𝑋 ∧ (𝐹‘𝐴) ∈ 𝑦)))
13	10, 11, 12	3syl 17	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → (𝐴 ∈ (◡𝐹 “ 𝑦) ↔ (𝐴 ∈ 𝑋 ∧ (𝐹‘𝐴) ∈ 𝑦)))
14	8, 9, 13	mpbir2and 946	. . . . 5 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → 𝐴 ∈ (◡𝐹 “ 𝑦))
15		eqimss 3246	. . . . . . . 8 ⊢ (𝑥 = (◡𝐹 “ 𝑦) → 𝑥 ⊆ (◡𝐹 “ 𝑦))
16	15	biantrud 304	. . . . . . 7 ⊢ (𝑥 = (◡𝐹 “ 𝑦) → (𝐴 ∈ 𝑥 ↔ (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦))))
17		eleq2 2268	. . . . . . 7 ⊢ (𝑥 = (◡𝐹 “ 𝑦) → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ (◡𝐹 “ 𝑦)))
18	16, 17	bitr3d 190	. . . . . 6 ⊢ (𝑥 = (◡𝐹 “ 𝑦) → ((𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦)) ↔ 𝐴 ∈ (◡𝐹 “ 𝑦)))
19	18	rspcev 2876	. . . . 5 ⊢ (((◡𝐹 “ 𝑦) ∈ 𝐽 ∧ 𝐴 ∈ (◡𝐹 “ 𝑦)) → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦)))
20	6, 14, 19	syl2anc 411	. . . 4 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦)))
21	20	expr 375	. . 3 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → ((𝐹‘𝐴) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦))))
22	21	ralrimiva 2578	. 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → ∀𝑦 ∈ 𝐾 ((𝐹‘𝐴) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦))))
23		cntop1 14644	. . . . 5 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
24	23	adantr 276	. . . 4 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐽 ∈ Top)
25	1	toptopon 14461	. . . 4 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
26	24, 25	sylib 122	. . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐽 ∈ (TopOn‘𝑋))
27		cntop2 14645	. . . . 5 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
28	27	adantr 276	. . . 4 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐾 ∈ Top)
29	2	toptopon 14461	. . . 4 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
30	28, 29	sylib 122	. . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐾 ∈ (TopOn‘∪ 𝐾))
31		iscnp3 14646	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝐴 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝐹:𝑋⟶∪ 𝐾 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝐴) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦))))))
32	26, 30, 7, 31	syl3anc 1249	. 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝐹:𝑋⟶∪ 𝐾 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝐴) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦))))))
33	4, 22, 32	mpbir2and 946	1 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1372   ∈ wcel 2175  ∀wral 2483  ∃wrex 2484   ⊆ wss 3165  ∪ cuni 3849  ^◡ccnv 4673   “ cima 4677   Fn wfn 5265  ⟶wf 5266  ‘cfv 5270  (class class class)co 5943  Topctop 14440  TopOnctopon 14453   Cn ccn 14628   CnP ccnp 14629

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 615  ax-in2 616  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252  ax-un 4479  ax-setind 4584

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-ral 2488  df-rex 2489  df-rab 2492  df-v 2773  df-sbc 2998  df-csb 3093  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-iun 3928  df-br 4044  df-opab 4105  df-mpt 4106  df-id 4339  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-res 4686  df-ima 4687  df-iota 5231  df-fun 5272  df-fn 5273  df-f 5274  df-fv 5278  df-ov 5946  df-oprab 5947  df-mpo 5948  df-1st 6225  df-2nd 6226  df-map 6736  df-top 14441  df-topon 14454  df-cn 14631  df-cnp 14632

This theorem is referenced by:  cnsscnp  14672  cncnp  14673  lmcn  14694  dvcnp2cntop  15142  dvaddxxbr  15144  dvmulxxbr  15145  dvcoapbr  15150  dvcjbr  15151