Theorem cnmpt22f 15396

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 15303	. . . 4 ⊢ ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐴) ∈ ((𝐽 ×t 𝐾) Cn 𝐿) → 𝐿 ∈ Top)
6	3, 5	syl 14	. . 3 ⊢ (𝜑 → 𝐿 ∈ Top)
7		toptopon2 15120	. . 3 ⊢ (𝐿 ∈ Top ↔ 𝐿 ∈ (TopOn‘∪ 𝐿))
8	6, 7	sylib 122	. 2 ⊢ (𝜑 → 𝐿 ∈ (TopOn‘∪ 𝐿))
9		cntop2 15303	. . . 4 ⊢ ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐵) ∈ ((𝐽 ×t 𝐾) Cn 𝑀) → 𝑀 ∈ Top)
10	4, 9	syl 14	. . 3 ⊢ (𝜑 → 𝑀 ∈ Top)
11		toptopon2 15120	. . 3 ⊢ (𝑀 ∈ Top ↔ 𝑀 ∈ (TopOn‘∪ 𝑀))
12	10, 11	sylib 122	. 2 ⊢ (𝜑 → 𝑀 ∈ (TopOn‘∪ 𝑀))
13		txtopon 15363	. . . . . . 7 ⊢ ((𝐿 ∈ (TopOn‘∪ 𝐿) ∧ 𝑀 ∈ (TopOn‘∪ 𝑀)) → (𝐿 ×t 𝑀) ∈ (TopOn‘(∪ 𝐿 × ∪ 𝑀)))
14	8, 12, 13	syl2anc 415	. . . . . 6 ⊢ (𝜑 → (𝐿 ×t 𝑀) ∈ (TopOn‘(∪ 𝐿 × ∪ 𝑀)))
15		cnmpt22f.f	. . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁))
16		cntop2 15303	. . . . . . . 8 ⊢ (𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁) → 𝑁 ∈ Top)
17	15, 16	syl 14	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ Top)
18		toptopon2 15120	. . . . . . 7 ⊢ (𝑁 ∈ Top ↔ 𝑁 ∈ (TopOn‘∪ 𝑁))
19	17, 18	sylib 122	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (TopOn‘∪ 𝑁))
20		cnf2 15306	. . . . . 6 ⊢ (((𝐿 ×t 𝑀) ∈ (TopOn‘(∪ 𝐿 × ∪ 𝑀)) ∧ 𝑁 ∈ (TopOn‘∪ 𝑁) ∧ 𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁)) → 𝐹:(∪ 𝐿 × ∪ 𝑀)⟶∪ 𝑁)
21	14, 19, 15, 20	syl3anc 1278	. . . . 5 ⊢ (𝜑 → 𝐹:(∪ 𝐿 × ∪ 𝑀)⟶∪ 𝑁)
22	21	ffnd 5534	. . . 4 ⊢ (𝜑 → 𝐹 Fn (∪ 𝐿 × ∪ 𝑀))
23		fnovim 6197	. . . 4 ⊢ (𝐹 Fn (∪ 𝐿 × ∪ 𝑀) → 𝐹 = (𝑧 ∈ ∪ 𝐿, 𝑤 ∈ ∪ 𝑀 ↦ (𝑧𝐹𝑤)))
24	22, 23	syl 14	. . 3 ⊢ (𝜑 → 𝐹 = (𝑧 ∈ ∪ 𝐿, 𝑤 ∈ ∪ 𝑀 ↦ (𝑧𝐹𝑤)))
25	24, 15	eqeltrrd 2316	. 2 ⊢ (𝜑 → (𝑧 ∈ ∪ 𝐿, 𝑤 ∈ ∪ 𝑀 ↦ (𝑧𝐹𝑤)) ∈ ((𝐿 ×t 𝑀) Cn 𝑁))
26		oveq12 6094	. 2 ⊢ ((𝑧 = 𝐴 ∧ 𝑤 = 𝐵) → (𝑧𝐹𝑤) = (𝐴𝐹𝐵))
27	1, 2, 3, 4, 8, 12, 25, 26	cnmpt22 15395	1 ⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ (𝐴𝐹𝐵)) ∈ ((𝐽 ×t 𝐾) Cn 𝑁))

This proof depends on syntax axioms:   → wi 4   = wceq 1402   ∈ wcel 2209  ∪ cuni 3935   × cxp 4772   Fn wfn 5372  ⟶wf 5373  ‘cfv 5377  (class class class)co 6085   ∈ cmpo 6087  Topctop 15098  TopOnctopon 15111   Cn ccn 15286   ×_t ctx 15353

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-coll 4246  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-reu 2535  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-nul 3521  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-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-map 6924  df-topgen 13614  df-top 15099  df-topon 15112  df-bases 15144  df-cn 15289  df-tx 15354

This theorem is used by:  cnmptcom  15399  divcnap  15666  cnrehmeocntop  15711