Theorem cnmpt22f 15018

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 14925	. . . 4 ⊢ ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐴) ∈ ((𝐽 ×t 𝐾) Cn 𝐿) → 𝐿 ∈ Top)
6	3, 5	syl 14	. . 3 ⊢ (𝜑 → 𝐿 ∈ Top)
7		toptopon2 14742	. . 3 ⊢ (𝐿 ∈ Top ↔ 𝐿 ∈ (TopOn‘∪ 𝐿))
8	6, 7	sylib 122	. 2 ⊢ (𝜑 → 𝐿 ∈ (TopOn‘∪ 𝐿))
9		cntop2 14925	. . . 4 ⊢ ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐵) ∈ ((𝐽 ×t 𝐾) Cn 𝑀) → 𝑀 ∈ Top)
10	4, 9	syl 14	. . 3 ⊢ (𝜑 → 𝑀 ∈ Top)
11		toptopon2 14742	. . 3 ⊢ (𝑀 ∈ Top ↔ 𝑀 ∈ (TopOn‘∪ 𝑀))
12	10, 11	sylib 122	. 2 ⊢ (𝜑 → 𝑀 ∈ (TopOn‘∪ 𝑀))
13		txtopon 14985	. . . . . . 7 ⊢ ((𝐿 ∈ (TopOn‘∪ 𝐿) ∧ 𝑀 ∈ (TopOn‘∪ 𝑀)) → (𝐿 ×t 𝑀) ∈ (TopOn‘(∪ 𝐿 × ∪ 𝑀)))
14	8, 12, 13	syl2anc 411	. . . . . 6 ⊢ (𝜑 → (𝐿 ×t 𝑀) ∈ (TopOn‘(∪ 𝐿 × ∪ 𝑀)))
15		cnmpt22f.f	. . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁))
16		cntop2 14925	. . . . . . . 8 ⊢ (𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁) → 𝑁 ∈ Top)
17	15, 16	syl 14	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ Top)
18		toptopon2 14742	. . . . . . 7 ⊢ (𝑁 ∈ Top ↔ 𝑁 ∈ (TopOn‘∪ 𝑁))
19	17, 18	sylib 122	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (TopOn‘∪ 𝑁))
20		cnf2 14928	. . . . . 6 ⊢ (((𝐿 ×t 𝑀) ∈ (TopOn‘(∪ 𝐿 × ∪ 𝑀)) ∧ 𝑁 ∈ (TopOn‘∪ 𝑁) ∧ 𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁)) → 𝐹:(∪ 𝐿 × ∪ 𝑀)⟶∪ 𝑁)
21	14, 19, 15, 20	syl3anc 1273	. . . . 5 ⊢ (𝜑 → 𝐹:(∪ 𝐿 × ∪ 𝑀)⟶∪ 𝑁)
22	21	ffnd 5483	. . . 4 ⊢ (𝜑 → 𝐹 Fn (∪ 𝐿 × ∪ 𝑀))
23		fnovim 6129	. . . 4 ⊢ (𝐹 Fn (∪ 𝐿 × ∪ 𝑀) → 𝐹 = (𝑧 ∈ ∪ 𝐿, 𝑤 ∈ ∪ 𝑀 ↦ (𝑧𝐹𝑤)))
24	22, 23	syl 14	. . 3 ⊢ (𝜑 → 𝐹 = (𝑧 ∈ ∪ 𝐿, 𝑤 ∈ ∪ 𝑀 ↦ (𝑧𝐹𝑤)))
25	24, 15	eqeltrrd 2309	. 2 ⊢ (𝜑 → (𝑧 ∈ ∪ 𝐿, 𝑤 ∈ ∪ 𝑀 ↦ (𝑧𝐹𝑤)) ∈ ((𝐿 ×t 𝑀) Cn 𝑁))
26		oveq12 6026	. 2 ⊢ ((𝑧 = 𝐴 ∧ 𝑤 = 𝐵) → (𝑧𝐹𝑤) = (𝐴𝐹𝐵))
27	1, 2, 3, 4, 8, 12, 25, 26	cnmpt22 15017	1 ⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ (𝐴𝐹𝐵)) ∈ ((𝐽 ×t 𝐾) Cn 𝑁))

Syntax hints:   → wi 4   = wceq 1397   ∈ wcel 2202  ∪ cuni 3893   × cxp 4723   Fn wfn 5321  ⟶wf 5322  ‘cfv 5326  (class class class)co 6017   ∈ cmpo 6019  Topctop 14720  TopOnctopon 14733   Cn ccn 14908   ×_t ctx 14975

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-map 6818  df-topgen 13342  df-top 14721  df-topon 14734  df-bases 14766  df-cn 14911  df-tx 14976

This theorem is referenced by:  cnmptcom  15021  divcnap  15288  cnrehmeocntop  15333