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

Theorem cnmpt22f 23640
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 23206 . . . 4 ((𝑥𝑋, 𝑦𝑌𝐴) ∈ ((𝐽 ×t 𝐾) Cn 𝐿) → 𝐿 ∈ Top)
63, 5syl 17 . . 3 (𝜑𝐿 ∈ Top)
7 toptopon2 22883 . . 3 (𝐿 ∈ Top ↔ 𝐿 ∈ (TopOn‘ 𝐿))
86, 7sylib 218 . 2 (𝜑𝐿 ∈ (TopOn‘ 𝐿))
9 cntop2 23206 . . . 4 ((𝑥𝑋, 𝑦𝑌𝐵) ∈ ((𝐽 ×t 𝐾) Cn 𝑀) → 𝑀 ∈ Top)
104, 9syl 17 . . 3 (𝜑𝑀 ∈ Top)
11 toptopon2 22883 . . 3 (𝑀 ∈ Top ↔ 𝑀 ∈ (TopOn‘ 𝑀))
1210, 11sylib 218 . 2 (𝜑𝑀 ∈ (TopOn‘ 𝑀))
13 txtopon 23556 . . . . . . 7 ((𝐿 ∈ (TopOn‘ 𝐿) ∧ 𝑀 ∈ (TopOn‘ 𝑀)) → (𝐿 ×t 𝑀) ∈ (TopOn‘( 𝐿 × 𝑀)))
148, 12, 13syl2anc 585 . . . . . 6 (𝜑 → (𝐿 ×t 𝑀) ∈ (TopOn‘( 𝐿 × 𝑀)))
15 cnmpt22f.f . . . . . . . 8 (𝜑𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁))
16 cntop2 23206 . . . . . . . 8 (𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁) → 𝑁 ∈ Top)
1715, 16syl 17 . . . . . . 7 (𝜑𝑁 ∈ Top)
18 toptopon2 22883 . . . . . . 7 (𝑁 ∈ Top ↔ 𝑁 ∈ (TopOn‘ 𝑁))
1917, 18sylib 218 . . . . . 6 (𝜑𝑁 ∈ (TopOn‘ 𝑁))
20 cnf2 23214 . . . . . 6 (((𝐿 ×t 𝑀) ∈ (TopOn‘( 𝐿 × 𝑀)) ∧ 𝑁 ∈ (TopOn‘ 𝑁) ∧ 𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁)) → 𝐹:( 𝐿 × 𝑀)⟶ 𝑁)
2114, 19, 15, 20syl3anc 1374 . . . . 5 (𝜑𝐹:( 𝐿 × 𝑀)⟶ 𝑁)
2221ffnd 6669 . . . 4 (𝜑𝐹 Fn ( 𝐿 × 𝑀))
23 fnov 7498 . . . 4 (𝐹 Fn ( 𝐿 × 𝑀) ↔ 𝐹 = (𝑧 𝐿, 𝑤 𝑀 ↦ (𝑧𝐹𝑤)))
2422, 23sylib 218 . . 3 (𝜑𝐹 = (𝑧 𝐿, 𝑤 𝑀 ↦ (𝑧𝐹𝑤)))
2524, 15eqeltrrd 2837 . 2 (𝜑 → (𝑧 𝐿, 𝑤 𝑀 ↦ (𝑧𝐹𝑤)) ∈ ((𝐿 ×t 𝑀) Cn 𝑁))
26 oveq12 7376 . 2 ((𝑧 = 𝐴𝑤 = 𝐵) → (𝑧𝐹𝑤) = (𝐴𝐹𝐵))
271, 2, 3, 4, 8, 12, 25, 26cnmpt22 23639 1 (𝜑 → (𝑥𝑋, 𝑦𝑌 ↦ (𝐴𝐹𝐵)) ∈ ((𝐽 ×t 𝐾) Cn 𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114   cuni 4850   × cxp 5629   Fn wfn 6493  wf 6494  cfv 6498  (class class class)co 7367  cmpo 7369  Topctop 22858  TopOnctopon 22875   Cn ccn 23189   ×t ctx 23525
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-map 8775  df-topgen 17406  df-top 22859  df-topon 22876  df-bases 22911  df-cn 23192  df-tx 23527
This theorem is referenced by:  cnmptcom  23643  cnmpt2plusg  24053  istgp2  24056  cnmpt2vsca  24160  cnmpt2ds  24809  cnrehmeo  24920  htpycom  24943  htpyco1  24945  htpycc  24947  reparphti  24964  pcohtpylem  24986  cnmpt2ip  25215  vmcn  30770  dipcn  30791  mndpluscn  34070  cvxsconn  35425
  Copyright terms: Public domain W3C validator