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

Theorem cnmpt22f 23732
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 23298 . . . 4 ((𝑥𝑋, 𝑦𝑌𝐴) ∈ ((𝐽 ×t 𝐾) Cn 𝐿) → 𝐿 ∈ Top)
63, 5syl 17 . . 3 (𝜑𝐿 ∈ Top)
7 toptopon2 22975 . . 3 (𝐿 ∈ Top ↔ 𝐿 ∈ (TopOn‘ 𝐿))
86, 7sylib 220 . 2 (𝜑𝐿 ∈ (TopOn‘ 𝐿))
9 cntop2 23298 . . . 4 ((𝑥𝑋, 𝑦𝑌𝐵) ∈ ((𝐽 ×t 𝐾) Cn 𝑀) → 𝑀 ∈ Top)
104, 9syl 17 . . 3 (𝜑𝑀 ∈ Top)
11 toptopon2 22975 . . 3 (𝑀 ∈ Top ↔ 𝑀 ∈ (TopOn‘ 𝑀))
1210, 11sylib 220 . 2 (𝜑𝑀 ∈ (TopOn‘ 𝑀))
13 txtopon 23648 . . . . . . 7 ((𝐿 ∈ (TopOn‘ 𝐿) ∧ 𝑀 ∈ (TopOn‘ 𝑀)) → (𝐿 ×t 𝑀) ∈ (TopOn‘( 𝐿 × 𝑀)))
148, 12, 13syl2anc 593 . . . . . 6 (𝜑 → (𝐿 ×t 𝑀) ∈ (TopOn‘( 𝐿 × 𝑀)))
15 cnmpt22f.f . . . . . . . 8 (𝜑𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁))
16 cntop2 23298 . . . . . . . 8 (𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁) → 𝑁 ∈ Top)
1715, 16syl 17 . . . . . . 7 (𝜑𝑁 ∈ Top)
18 toptopon2 22975 . . . . . . 7 (𝑁 ∈ Top ↔ 𝑁 ∈ (TopOn‘ 𝑁))
1917, 18sylib 220 . . . . . 6 (𝜑𝑁 ∈ (TopOn‘ 𝑁))
20 cnf2 23306 . . . . . 6 (((𝐿 ×t 𝑀) ∈ (TopOn‘( 𝐿 × 𝑀)) ∧ 𝑁 ∈ (TopOn‘ 𝑁) ∧ 𝐹 ∈ ((𝐿 ×t 𝑀) Cn 𝑁)) → 𝐹:( 𝐿 × 𝑀)⟶ 𝑁)
2114, 19, 15, 20syl3anc 1390 . . . . 5 (𝜑𝐹:( 𝐿 × 𝑀)⟶ 𝑁)
2221ffnd 6692 . . . 4 (𝜑𝐹 Fn ( 𝐿 × 𝑀))
23 fnov 7527 . . . 4 (𝐹 Fn ( 𝐿 × 𝑀) ↔ 𝐹 = (𝑧 𝐿, 𝑤 𝑀 ↦ (𝑧𝐹𝑤)))
2422, 23sylib 220 . . 3 (𝜑𝐹 = (𝑧 𝐿, 𝑤 𝑀 ↦ (𝑧𝐹𝑤)))
2524, 15eqeltrrd 2863 . 2 (𝜑 → (𝑧 𝐿, 𝑤 𝑀 ↦ (𝑧𝐹𝑤)) ∈ ((𝐿 ×t 𝑀) Cn 𝑁))
26 oveq12 7405 . 2 ((𝑧 = 𝐴𝑤 = 𝐵) → (𝑧𝐹𝑤) = (𝐴𝐹𝐵))
271, 2, 3, 4, 8, 12, 25, 26cnmpt22 23731 1 (𝜑 → (𝑥𝑋, 𝑦𝑌 ↦ (𝐴𝐹𝐵)) ∈ ((𝐽 ×t 𝐾) Cn 𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1560  wcel 2142   cuni 4865   × cxp 5645   Fn wfn 6516  wf 6517  cfv 6521  (class class class)co 7396  cmpo 7398  Topctop 22950  TopOnctopon 22967   Cn ccn 23281   ×t ctx 23617
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-fv 6529  df-ov 7399  df-oprab 7400  df-mpo 7401  df-1st 7970  df-2nd 7971  df-map 8810  df-topgen 17472  df-top 22951  df-topon 22968  df-bases 23003  df-cn 23284  df-tx 23619
This theorem is referenced by:  cnmptcom  23735  cnmpt2plusg  24145  istgp2  24148  cnmpt2vsca  24252  cnmpt2ds  24901  cnrehmeo  25012  htpycom  25035  htpyco1  25037  htpycc  25039  reparphti  25056  pcohtpylem  25078  cnmpt2ip  25307  vmcn  30899  dipcn  30920  mndpluscn  34220  cvxsconn  35590
  Copyright terms: Public domain W3C validator