Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  cnmpt1t GIF version

Theorem cnmpt1t 12645
 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
cnmptid.j (𝜑𝐽 ∈ (TopOn‘𝑋))
cnmpt11.a (𝜑 → (𝑥𝑋𝐴) ∈ (𝐽 Cn 𝐾))
cnmpt1t.b (𝜑 → (𝑥𝑋𝐵) ∈ (𝐽 Cn 𝐿))
Assertion
Ref Expression
cnmpt1t (𝜑 → (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩) ∈ (𝐽 Cn (𝐾 ×t 𝐿)))
Distinct variable groups:   𝜑,𝑥   𝑥,𝐽   𝑥,𝑋   𝑥,𝐾   𝑥,𝐿
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem cnmpt1t
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 cnmptid.j . . . 4 (𝜑𝐽 ∈ (TopOn‘𝑋))
2 toponuni 12373 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
3 mpteq1 4048 . . . 4 (𝑋 = 𝐽 → (𝑥𝑋 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩) = (𝑥 𝐽 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩))
41, 2, 33syl 17 . . 3 (𝜑 → (𝑥𝑋 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩) = (𝑥 𝐽 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩))
5 simpr 109 . . . . . 6 ((𝜑𝑥𝑋) → 𝑥𝑋)
6 cnmpt11.a . . . . . . . . . 10 (𝜑 → (𝑥𝑋𝐴) ∈ (𝐽 Cn 𝐾))
7 cntop2 12562 . . . . . . . . . 10 ((𝑥𝑋𝐴) ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
86, 7syl 14 . . . . . . . . 9 (𝜑𝐾 ∈ Top)
9 toptopon2 12377 . . . . . . . . 9 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘ 𝐾))
108, 9sylib 121 . . . . . . . 8 (𝜑𝐾 ∈ (TopOn‘ 𝐾))
11 cnf2 12565 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘ 𝐾) ∧ (𝑥𝑋𝐴) ∈ (𝐽 Cn 𝐾)) → (𝑥𝑋𝐴):𝑋 𝐾)
121, 10, 6, 11syl3anc 1220 . . . . . . 7 (𝜑 → (𝑥𝑋𝐴):𝑋 𝐾)
1312fvmptelrn 5617 . . . . . 6 ((𝜑𝑥𝑋) → 𝐴 𝐾)
14 eqid 2157 . . . . . . 7 (𝑥𝑋𝐴) = (𝑥𝑋𝐴)
1514fvmpt2 5548 . . . . . 6 ((𝑥𝑋𝐴 𝐾) → ((𝑥𝑋𝐴)‘𝑥) = 𝐴)
165, 13, 15syl2anc 409 . . . . 5 ((𝜑𝑥𝑋) → ((𝑥𝑋𝐴)‘𝑥) = 𝐴)
17 cnmpt1t.b . . . . . . . . . 10 (𝜑 → (𝑥𝑋𝐵) ∈ (𝐽 Cn 𝐿))
18 cntop2 12562 . . . . . . . . . 10 ((𝑥𝑋𝐵) ∈ (𝐽 Cn 𝐿) → 𝐿 ∈ Top)
1917, 18syl 14 . . . . . . . . 9 (𝜑𝐿 ∈ Top)
20 toptopon2 12377 . . . . . . . . 9 (𝐿 ∈ Top ↔ 𝐿 ∈ (TopOn‘ 𝐿))
2119, 20sylib 121 . . . . . . . 8 (𝜑𝐿 ∈ (TopOn‘ 𝐿))
22 cnf2 12565 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (TopOn‘ 𝐿) ∧ (𝑥𝑋𝐵) ∈ (𝐽 Cn 𝐿)) → (𝑥𝑋𝐵):𝑋 𝐿)
231, 21, 17, 22syl3anc 1220 . . . . . . 7 (𝜑 → (𝑥𝑋𝐵):𝑋 𝐿)
2423fvmptelrn 5617 . . . . . 6 ((𝜑𝑥𝑋) → 𝐵 𝐿)
25 eqid 2157 . . . . . . 7 (𝑥𝑋𝐵) = (𝑥𝑋𝐵)
2625fvmpt2 5548 . . . . . 6 ((𝑥𝑋𝐵 𝐿) → ((𝑥𝑋𝐵)‘𝑥) = 𝐵)
275, 24, 26syl2anc 409 . . . . 5 ((𝜑𝑥𝑋) → ((𝑥𝑋𝐵)‘𝑥) = 𝐵)
2816, 27opeq12d 3749 . . . 4 ((𝜑𝑥𝑋) → ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩ = ⟨𝐴, 𝐵⟩)
2928mpteq2dva 4054 . . 3 (𝜑 → (𝑥𝑋 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩) = (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩))
304, 29eqtr3d 2192 . 2 (𝜑 → (𝑥 𝐽 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩) = (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩))
31 eqid 2157 . . . 4 𝐽 = 𝐽
32 nfcv 2299 . . . . 5 𝑦⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩
33 nffvmpt1 5476 . . . . . 6 𝑥((𝑥𝑋𝐴)‘𝑦)
34 nffvmpt1 5476 . . . . . 6 𝑥((𝑥𝑋𝐵)‘𝑦)
3533, 34nfop 3757 . . . . 5 𝑥⟨((𝑥𝑋𝐴)‘𝑦), ((𝑥𝑋𝐵)‘𝑦)⟩
36 fveq2 5465 . . . . . 6 (𝑥 = 𝑦 → ((𝑥𝑋𝐴)‘𝑥) = ((𝑥𝑋𝐴)‘𝑦))
37 fveq2 5465 . . . . . 6 (𝑥 = 𝑦 → ((𝑥𝑋𝐵)‘𝑥) = ((𝑥𝑋𝐵)‘𝑦))
3836, 37opeq12d 3749 . . . . 5 (𝑥 = 𝑦 → ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩ = ⟨((𝑥𝑋𝐴)‘𝑦), ((𝑥𝑋𝐵)‘𝑦)⟩)
3932, 35, 38cbvmpt 4059 . . . 4 (𝑥 𝐽 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩) = (𝑦 𝐽 ↦ ⟨((𝑥𝑋𝐴)‘𝑦), ((𝑥𝑋𝐵)‘𝑦)⟩)
4031, 39txcnmpt 12633 . . 3 (((𝑥𝑋𝐴) ∈ (𝐽 Cn 𝐾) ∧ (𝑥𝑋𝐵) ∈ (𝐽 Cn 𝐿)) → (𝑥 𝐽 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩) ∈ (𝐽 Cn (𝐾 ×t 𝐿)))
416, 17, 40syl2anc 409 . 2 (𝜑 → (𝑥 𝐽 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩) ∈ (𝐽 Cn (𝐾 ×t 𝐿)))
4230, 41eqeltrrd 2235 1 (𝜑 → (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩) ∈ (𝐽 Cn (𝐾 ×t 𝐿)))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   = wceq 1335   ∈ wcel 2128  ⟨cop 3563  ∪ cuni 3772   ↦ cmpt 4025  ⟶wf 5163  ‘cfv 5167  (class class class)co 5818  Topctop 12355  TopOnctopon 12368   Cn ccn 12545   ×t ctx 12612 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-13 2130  ax-14 2131  ax-ext 2139  ax-coll 4079  ax-sep 4082  ax-pow 4134  ax-pr 4168  ax-un 4392  ax-setind 4494 This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1338  df-fal 1341  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ne 2328  df-ral 2440  df-rex 2441  df-reu 2442  df-rab 2444  df-v 2714  df-sbc 2938  df-csb 3032  df-dif 3104  df-un 3106  df-in 3108  df-ss 3115  df-nul 3395  df-pw 3545  df-sn 3566  df-pr 3567  df-op 3569  df-uni 3773  df-iun 3851  df-br 3966  df-opab 4026  df-mpt 4027  df-id 4252  df-xp 4589  df-rel 4590  df-cnv 4591  df-co 4592  df-dm 4593  df-rn 4594  df-res 4595  df-ima 4596  df-iota 5132  df-fun 5169  df-fn 5170  df-f 5171  df-f1 5172  df-fo 5173  df-f1o 5174  df-fv 5175  df-ov 5821  df-oprab 5822  df-mpo 5823  df-1st 6082  df-2nd 6083  df-map 6588  df-topgen 12332  df-top 12356  df-topon 12369  df-bases 12401  df-cn 12548  df-tx 12613 This theorem is referenced by:  cnmpt12f  12646  imasnopn  12659  cnrehmeocntop  12953
 Copyright terms: Public domain W3C validator