MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cnmpt22f Structured version   Visualization version   GIF version

Theorem cnmpt22f 23658
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.
StepHypRef 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 23224 . . . 4 ((𝑥𝑋, 𝑦𝑌𝐴) ∈ ((𝐽 ×t 𝐾) Cn 𝐿) → 𝐿 ∈ Top)
63, 5syl 17 . . 3 (𝜑𝐿 ∈ Top)
7 toptopon2 22901 . . 3 (𝐿 ∈ Top ↔ 𝐿 ∈ (TopOn‘ 𝐿))
86, 7sylib 219 . 2 (𝜑𝐿 ∈ (TopOn‘ 𝐿))
9 cntop2 23224 . . . 4 ((𝑥𝑋, 𝑦𝑌𝐵) ∈ ((𝐽 ×t 𝐾) Cn 𝑀) → 𝑀 ∈ Top)
104, 9syl 17 . . 3 (𝜑𝑀 ∈ Top)
11 toptopon2 22901 . . 3 (𝑀 ∈ Top ↔ 𝑀 ∈ (TopOn‘ 𝑀))
1210, 11sylib 219 . 2 (𝜑𝑀 ∈ (TopOn‘ 𝑀))
13 txtopon 23574 . . . . . . 7 ((𝐿 ∈ (TopOn‘ 𝐿) ∧ 𝑀 ∈ (TopOn‘ 𝑀)) → (𝐿 ×t 𝑀) ∈ (TopOn‘( 𝐿 × 𝑀)))
148, 12, 13syl2anc 590 . . . . . 6 (𝜑 → (𝐿 ×t 𝑀) ∈ (TopOn‘( 𝐿 × 𝑀)))
15 cnmpt22f.f . . . . . . . 8 (𝜑𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁))
16 cntop2 23224 . . . . . . . 8 (𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁) → 𝑁 ∈ Top)
1715, 16syl 17 . . . . . . 7 (𝜑𝑁 ∈ Top)
18 toptopon2 22901 . . . . . . 7 (𝑁 ∈ Top ↔ 𝑁 ∈ (TopOn‘ 𝑁))
1917, 18sylib 219 . . . . . 6 (𝜑𝑁 ∈ (TopOn‘ 𝑁))
20 cnf2 23232 . . . . . 6 (((𝐿 ×t 𝑀) ∈ (TopOn‘( 𝐿 × 𝑀)) ∧ 𝑁 ∈ (TopOn‘ 𝑁) ∧ 𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁)) → 𝐹:( 𝐿 × 𝑀)⟶ 𝑁)
2114, 19, 15, 20syl3anc 1379 . . . . 5 (𝜑𝐹:( 𝐿 × 𝑀)⟶ 𝑁)
2221ffnd 6656 . . . 4 (𝜑𝐹 Fn ( 𝐿 × 𝑀))
23 fnov 7487 . . . 4 (𝐹 Fn ( 𝐿 × 𝑀) ↔ 𝐹 = (𝑧 𝐿, 𝑤 𝑀 ↦ (𝑧𝐹𝑤)))
2422, 23sylib 219 . . 3 (𝜑𝐹 = (𝑧 𝐿, 𝑤 𝑀 ↦ (𝑧𝐹𝑤)))
2524, 15eqeltrrd 2840 . 2 (𝜑 → (𝑧 𝐿, 𝑤 𝑀 ↦ (𝑧𝐹𝑤)) ∈ ((𝐿 ×t 𝑀) Cn 𝑁))
26 oveq12 7365 . 2 ((𝑧 = 𝐴𝑤 = 𝐵) → (𝑧𝐹𝑤) = (𝐴𝐹𝐵))
271, 2, 3, 4, 8, 12, 25, 26cnmpt22 23657 1 (𝜑 → (𝑥𝑋, 𝑦𝑌 ↦ (𝐴𝐹𝐵)) ∈ ((𝐽 ×t 𝐾) Cn 𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1547  wcel 2119   cuni 4838   × cxp 5616   Fn wfn 6480  wf 6481  cfv 6485  (class class class)co 7356  cmpo 7358  Topctop 22876  TopOnctopon 22893   Cn ccn 23207   ×t ctx 23543
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1st 7931  df-2nd 7932  df-map 8765  df-topgen 17397  df-top 22877  df-topon 22894  df-bases 22929  df-cn 23210  df-tx 23545
This theorem is referenced by:  cnmptcom  23661  cnmpt2plusg  24071  istgp2  24074  cnmpt2vsca  24178  cnmpt2ds  24827  cnrehmeo  24938  htpycom  24961  htpyco1  24963  htpycc  24965  reparphti  24982  pcohtpylem  25004  cnmpt2ip  25233  vmcn  30788  dipcn  30809  mndpluscn  34110  cvxsconn  35471
  Copyright terms: Public domain W3C validator