Theorem cncnpi 15329

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 2238	. . . 4 ⊢ ∪ 𝐾 = ∪ 𝐾
3	1, 2	cnf 15305	. . 3 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋⟶∪ 𝐾)
4	3	adantr 276	. 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐹:𝑋⟶∪ 𝐾)
5		cnima 15321	. . . . . 6 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑦 ∈ 𝐾) → (◡𝐹 “ 𝑦) ∈ 𝐽)
6	5	ad2ant2r 513	. . . . 5 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → (◡𝐹 “ 𝑦) ∈ 𝐽)
7		simpr 110	. . . . . . 7 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
8	7	adantr 276	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → 𝐴 ∈ 𝑋)
9		simprr 537	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → (𝐹‘𝐴) ∈ 𝑦)
10	3	ad2antrr 492	. . . . . . 7 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → 𝐹:𝑋⟶∪ 𝐾)
11		ffn 5533	. . . . . . 7 ⊢ (𝐹:𝑋⟶∪ 𝐾 → 𝐹 Fn 𝑋)
12		elpreima 5828	. . . . . . 7 ⊢ (𝐹 Fn 𝑋 → (𝐴 ∈ (◡𝐹 “ 𝑦) ↔ (𝐴 ∈ 𝑋 ∧ (𝐹‘𝐴) ∈ 𝑦)))
13	10, 11, 12	3syl 17	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → (𝐴 ∈ (◡𝐹 “ 𝑦) ↔ (𝐴 ∈ 𝑋 ∧ (𝐹‘𝐴) ∈ 𝑦)))
14	8, 9, 13	mpbir2and 957	. . . . 5 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → 𝐴 ∈ (◡𝐹 “ 𝑦))
15		eqimss 3302	. . . . . . . 8 ⊢ (𝑥 = (◡𝐹 “ 𝑦) → 𝑥 ⊆ (◡𝐹 “ 𝑦))
16	15	biantrud 304	. . . . . . 7 ⊢ (𝑥 = (◡𝐹 “ 𝑦) → (𝐴 ∈ 𝑥 ↔ (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦))))
17		eleq2 2302	. . . . . . 7 ⊢ (𝑥 = (◡𝐹 “ 𝑦) → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ (◡𝐹 “ 𝑦)))
18	16, 17	bitr3d 190	. . . . . 6 ⊢ (𝑥 = (◡𝐹 “ 𝑦) → ((𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦)) ↔ 𝐴 ∈ (◡𝐹 “ 𝑦)))
19	18	rspcev 2929	. . . . 5 ⊢ (((◡𝐹 “ 𝑦) ∈ 𝐽 ∧ 𝐴 ∈ (◡𝐹 “ 𝑦)) → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦)))
20	6, 14, 19	syl2anc 415	. . . 4 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ (𝐹‘𝐴) ∈ 𝑦)) → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦)))
21	20	expr 375	. . 3 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → ((𝐹‘𝐴) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦))))
22	21	ralrimiva 2623	. 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → ∀𝑦 ∈ 𝐾 ((𝐹‘𝐴) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦))))
23		cntop1 15302	. . . . 5 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
24	23	adantr 276	. . . 4 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐽 ∈ Top)
25	1	toptopon 15119	. . . 4 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
26	24, 25	sylib 122	. . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐽 ∈ (TopOn‘𝑋))
27		cntop2 15303	. . . . 5 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
28	27	adantr 276	. . . 4 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐾 ∈ Top)
29	2	toptopon 15119	. . . 4 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
30	28, 29	sylib 122	. . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐾 ∈ (TopOn‘∪ 𝐾))
31		iscnp3 15304	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝐴 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝐹:𝑋⟶∪ 𝐾 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝐴) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦))))))
32	26, 30, 7, 31	syl3anc 1278	. 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴) ↔ (𝐹:𝑋⟶∪ 𝐾 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝐴) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (◡𝐹 “ 𝑦))))))
33	4, 22, 32	mpbir2and 957	1 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ 𝑋) → 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝐴))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529   ⊆ wss 3220  ∪ cuni 3935  ^◡ccnv 4773   “ cima 4777   Fn wfn 5372  ⟶wf 5373  ‘cfv 5377  (class class class)co 6085  Topctop 15098  TopOnctopon 15111   Cn ccn 15286   CnP ccnp 15287

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-map 6924  df-top 15099  df-topon 15112  df-cn 15289  df-cnp 15290

This theorem is used by:  cnsscnp  15330  cncnp  15331  lmcn  15352  dvcnp2cntop  15800  dvaddxxbr  15802  dvmulxxbr  15803  dvcoapbr  15808  dvcjbr  15809