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

Theorem cnmpt22f 23800
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 23366 . . . 4 ((𝑥𝑋, 𝑦𝑌𝐴) ∈ ((𝐽 ×t 𝐾) Cn 𝐿) → 𝐿 ∈ Top)
63, 5syl 18 . . 3 (𝜑𝐿 ∈ Top)
7 toptopon2 23043 . . 3 (𝐿 ∈ Top ↔ 𝐿 ∈ (TopOn‘ 𝐿))
86, 7sylib 221 . 2 (𝜑𝐿 ∈ (TopOn‘ 𝐿))
9 cntop2 23366 . . . 4 ((𝑥𝑋, 𝑦𝑌𝐵) ∈ ((𝐽 ×t 𝐾) Cn 𝑀) → 𝑀 ∈ Top)
104, 9syl 18 . . 3 (𝜑𝑀 ∈ Top)
11 toptopon2 23043 . . 3 (𝑀 ∈ Top ↔ 𝑀 ∈ (TopOn‘ 𝑀))
1210, 11sylib 221 . 2 (𝜑𝑀 ∈ (TopOn‘ 𝑀))
13 txtopon 23716 . . . . . . 7 ((𝐿 ∈ (TopOn‘ 𝐿) ∧ 𝑀 ∈ (TopOn‘ 𝑀)) → (𝐿 ×t 𝑀) ∈ (TopOn‘( 𝐿 × 𝑀)))
148, 12, 13syl2anc 595 . . . . . 6 (𝜑 → (𝐿 ×t 𝑀) ∈ (TopOn‘( 𝐿 × 𝑀)))
15 cnmpt22f.f . . . . . . . 8 (𝜑𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁))
16 cntop2 23366 . . . . . . . 8 (𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁) → 𝑁 ∈ Top)
1715, 16syl 18 . . . . . . 7 (𝜑𝑁 ∈ Top)
18 toptopon2 23043 . . . . . . 7 (𝑁 ∈ Top ↔ 𝑁 ∈ (TopOn‘ 𝑁))
1917, 18sylib 221 . . . . . 6 (𝜑𝑁 ∈ (TopOn‘ 𝑁))
20 cnf2 23374 . . . . . 6 (((𝐿 ×t 𝑀) ∈ (TopOn‘( 𝐿 × 𝑀)) ∧ 𝑁 ∈ (TopOn‘ 𝑁) ∧ 𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁)) → 𝐹:( 𝐿 × 𝑀)⟶ 𝑁)
2114, 19, 15, 20syl3anc 1396 . . . . 5 (𝜑𝐹:( 𝐿 × 𝑀)⟶ 𝑁)
2221ffnd 6707 . . . 4 (𝜑𝐹 Fn ( 𝐿 × 𝑀))
23 fnov 7542 . . . 4 (𝐹 Fn ( 𝐿 × 𝑀) ↔ 𝐹 = (𝑧 𝐿, 𝑤 𝑀 ↦ (𝑧𝐹𝑤)))
2422, 23sylib 221 . . 3 (𝜑𝐹 = (𝑧 𝐿, 𝑤 𝑀 ↦ (𝑧𝐹𝑤)))
2524, 15eqeltrrd 2870 . 2 (𝜑 → (𝑧 𝐿, 𝑤 𝑀 ↦ (𝑧𝐹𝑤)) ∈ ((𝐿 ×t 𝑀) Cn 𝑁))
26 oveq12 7420 . 2 ((𝑧 = 𝐴𝑤 = 𝐵) → (𝑧𝐹𝑤) = (𝐴𝐹𝐵))
271, 2, 3, 4, 8, 12, 25, 26cnmpt22 23799 1 (𝜑 → (𝑥𝑋, 𝑦𝑌 ↦ (𝐴𝐹𝐵)) ∈ ((𝐽 ×t 𝐾) Cn 𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1567  wcel 2149   cuni 4876   × cxp 5660   Fn wfn 6532  wf 6533  cfv 6537  (class class class)co 7411  cmpo 7413  Topctop 23018  TopOnctopon 23035   Cn ccn 23349   ×t ctx 23685
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-1st 7985  df-2nd 7986  df-map 8825  df-topgen 17495  df-top 23019  df-topon 23036  df-bases 23071  df-cn 23352  df-tx 23687
This theorem is referenced by:  cnmptcom  23803  cnmpt2plusg  24213  istgp2  24216  cnmpt2vsca  24320  cnmpt2ds  24969  cnrehmeo  25080  htpycom  25103  htpyco1  25105  htpycc  25107  reparphti  25124  pcohtpylem  25146  cnmpt2ip  25375  vmcn  30991  dipcn  31012  mndpluscn  34260  cvxsconn  35633
  Copyright terms: Public domain W3C validator