Theorem cnmpt22f 14615

Description: The composition of continuous functions is continuous. (Contributed by Mario Carneiro, 5-May-2014.) (Revised by Mario Carneiro, 22-Aug-2015.)

Hypotheses

Ref	Expression
cnmpt21.j	⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
cnmpt21.k	⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑌))
cnmpt21.a	⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐴) ∈ ((𝐽 ×t 𝐾) Cn 𝐿))
cnmpt2t.b	⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐵) ∈ ((𝐽 ×t 𝐾) Cn 𝑀))
cnmpt22f.f	⊢ (𝜑 → 𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁))

Assertion

Ref	Expression
cnmpt22f	⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ (𝐴𝐹𝐵)) ∈ ((𝐽 ×t 𝐾) Cn 𝑁))

Distinct variable groups:   𝑥,𝑦,𝐹   𝑥,𝐿,𝑦   𝜑,𝑥,𝑦   𝑥,𝑋,𝑦   𝑥,𝑀,𝑦   𝑥,𝑁,𝑦   𝑥,𝑌,𝑦

Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑥,𝑦)   𝐽(𝑥,𝑦)   𝐾(𝑥,𝑦)

Proof of Theorem cnmpt22f

Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cnmpt21.j	. 2 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
2		cnmpt21.k	. 2 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑌))
3		cnmpt21.a	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐴) ∈ ((𝐽 ×t 𝐾) Cn 𝐿))
4		cnmpt2t.b	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐵) ∈ ((𝐽 ×t 𝐾) Cn 𝑀))
5		cntop2 14522	. . . 4 ⊢ ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐴) ∈ ((𝐽 ×t 𝐾) Cn 𝐿) → 𝐿 ∈ Top)
6	3, 5	syl 14	. . 3 ⊢ (𝜑 → 𝐿 ∈ Top)
7		toptopon2 14339	. . 3 ⊢ (𝐿 ∈ Top ↔ 𝐿 ∈ (TopOn‘∪ 𝐿))
8	6, 7	sylib 122	. 2 ⊢ (𝜑 → 𝐿 ∈ (TopOn‘∪ 𝐿))
9		cntop2 14522	. . . 4 ⊢ ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐵) ∈ ((𝐽 ×t 𝐾) Cn 𝑀) → 𝑀 ∈ Top)
10	4, 9	syl 14	. . 3 ⊢ (𝜑 → 𝑀 ∈ Top)
11		toptopon2 14339	. . 3 ⊢ (𝑀 ∈ Top ↔ 𝑀 ∈ (TopOn‘∪ 𝑀))
12	10, 11	sylib 122	. 2 ⊢ (𝜑 → 𝑀 ∈ (TopOn‘∪ 𝑀))
13		txtopon 14582	. . . . . . 7 ⊢ ((𝐿 ∈ (TopOn‘∪ 𝐿) ∧ 𝑀 ∈ (TopOn‘∪ 𝑀)) → (𝐿 ×t 𝑀) ∈ (TopOn‘(∪ 𝐿 × ∪ 𝑀)))
14	8, 12, 13	syl2anc 411	. . . . . 6 ⊢ (𝜑 → (𝐿 ×t 𝑀) ∈ (TopOn‘(∪ 𝐿 × ∪ 𝑀)))
15		cnmpt22f.f	. . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁))
16		cntop2 14522	. . . . . . . 8 ⊢ (𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁) → 𝑁 ∈ Top)
17	15, 16	syl 14	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ Top)
18		toptopon2 14339	. . . . . . 7 ⊢ (𝑁 ∈ Top ↔ 𝑁 ∈ (TopOn‘∪ 𝑁))
19	17, 18	sylib 122	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (TopOn‘∪ 𝑁))
20		cnf2 14525	. . . . . 6 ⊢ (((𝐿 ×t 𝑀) ∈ (TopOn‘(∪ 𝐿 × ∪ 𝑀)) ∧ 𝑁 ∈ (TopOn‘∪ 𝑁) ∧ 𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁)) → 𝐹:(∪ 𝐿 × ∪ 𝑀)⟶∪ 𝑁)
21	14, 19, 15, 20	syl3anc 1249	. . . . 5 ⊢ (𝜑 → 𝐹:(∪ 𝐿 × ∪ 𝑀)⟶∪ 𝑁)
22	21	ffnd 5411	. . . 4 ⊢ (𝜑 → 𝐹 Fn (∪ 𝐿 × ∪ 𝑀))
23		fnovim 6035	. . . 4 ⊢ (𝐹 Fn (∪ 𝐿 × ∪ 𝑀) → 𝐹 = (𝑧 ∈ ∪ 𝐿, 𝑤 ∈ ∪ 𝑀 ↦ (𝑧𝐹𝑤)))
24	22, 23	syl 14	. . 3 ⊢ (𝜑 → 𝐹 = (𝑧 ∈ ∪ 𝐿, 𝑤 ∈ ∪ 𝑀 ↦ (𝑧𝐹𝑤)))
25	24, 15	eqeltrrd 2274	. 2 ⊢ (𝜑 → (𝑧 ∈ ∪ 𝐿, 𝑤 ∈ ∪ 𝑀 ↦ (𝑧𝐹𝑤)) ∈ ((𝐿 ×t 𝑀) Cn 𝑁))
26		oveq12 5934	. 2 ⊢ ((𝑧 = 𝐴 ∧ 𝑤 = 𝐵) → (𝑧𝐹𝑤) = (𝐴𝐹𝐵))
27	1, 2, 3, 4, 8, 12, 25, 26	cnmpt22 14614	1 ⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ (𝐴𝐹𝐵)) ∈ ((𝐽 ×t 𝐾) Cn 𝑁))

Syntax hints:   → wi 4   = wceq 1364   ∈ wcel 2167  ∪ cuni 3840   × cxp 4662   Fn wfn 5254  ⟶wf 5255  ‘cfv 5259  (class class class)co 5925   ∈ cmpo 5927  Topctop 14317  TopOnctopon 14330   Cn ccn 14505   ×_t ctx 14572

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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-map 6718  df-topgen 12962  df-top 14318  df-topon 14331  df-bases 14363  df-cn 14508  df-tx 14573

This theorem is referenced by:  cnmptcom  14618  divcnap  14885  cnrehmeocntop  14930