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

Theorem cnmpt1t 12296
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 12025 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
3 mpteq1 3972 . . . 4 (𝑋 = 𝐽 → (𝑥𝑋 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩) = (𝑥 𝐽 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩))
41, 2, 33syl 17 . . 3 (𝜑 → (𝑥𝑋 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩) = (𝑥 𝐽 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩))
5 simpr 109 . . . . . 6 ((𝜑𝑥𝑋) → 𝑥𝑋)
6 cnmpt11.a . . . . . . . . . 10 (𝜑 → (𝑥𝑋𝐴) ∈ (𝐽 Cn 𝐾))
7 cntop2 12213 . . . . . . . . . 10 ((𝑥𝑋𝐴) ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
86, 7syl 14 . . . . . . . . 9 (𝜑𝐾 ∈ Top)
9 toptopon2 12029 . . . . . . . . 9 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘ 𝐾))
108, 9sylib 121 . . . . . . . 8 (𝜑𝐾 ∈ (TopOn‘ 𝐾))
11 cnf2 12216 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘ 𝐾) ∧ (𝑥𝑋𝐴) ∈ (𝐽 Cn 𝐾)) → (𝑥𝑋𝐴):𝑋 𝐾)
121, 10, 6, 11syl3anc 1199 . . . . . . 7 (𝜑 → (𝑥𝑋𝐴):𝑋 𝐾)
1312fvmptelrn 5527 . . . . . 6 ((𝜑𝑥𝑋) → 𝐴 𝐾)
14 eqid 2115 . . . . . . 7 (𝑥𝑋𝐴) = (𝑥𝑋𝐴)
1514fvmpt2 5458 . . . . . 6 ((𝑥𝑋𝐴 𝐾) → ((𝑥𝑋𝐴)‘𝑥) = 𝐴)
165, 13, 15syl2anc 406 . . . . 5 ((𝜑𝑥𝑋) → ((𝑥𝑋𝐴)‘𝑥) = 𝐴)
17 cnmpt1t.b . . . . . . . . . 10 (𝜑 → (𝑥𝑋𝐵) ∈ (𝐽 Cn 𝐿))
18 cntop2 12213 . . . . . . . . . 10 ((𝑥𝑋𝐵) ∈ (𝐽 Cn 𝐿) → 𝐿 ∈ Top)
1917, 18syl 14 . . . . . . . . 9 (𝜑𝐿 ∈ Top)
20 toptopon2 12029 . . . . . . . . 9 (𝐿 ∈ Top ↔ 𝐿 ∈ (TopOn‘ 𝐿))
2119, 20sylib 121 . . . . . . . 8 (𝜑𝐿 ∈ (TopOn‘ 𝐿))
22 cnf2 12216 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (TopOn‘ 𝐿) ∧ (𝑥𝑋𝐵) ∈ (𝐽 Cn 𝐿)) → (𝑥𝑋𝐵):𝑋 𝐿)
231, 21, 17, 22syl3anc 1199 . . . . . . 7 (𝜑 → (𝑥𝑋𝐵):𝑋 𝐿)
2423fvmptelrn 5527 . . . . . 6 ((𝜑𝑥𝑋) → 𝐵 𝐿)
25 eqid 2115 . . . . . . 7 (𝑥𝑋𝐵) = (𝑥𝑋𝐵)
2625fvmpt2 5458 . . . . . 6 ((𝑥𝑋𝐵 𝐿) → ((𝑥𝑋𝐵)‘𝑥) = 𝐵)
275, 24, 26syl2anc 406 . . . . 5 ((𝜑𝑥𝑋) → ((𝑥𝑋𝐵)‘𝑥) = 𝐵)
2816, 27opeq12d 3679 . . . 4 ((𝜑𝑥𝑋) → ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩ = ⟨𝐴, 𝐵⟩)
2928mpteq2dva 3978 . . 3 (𝜑 → (𝑥𝑋 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩) = (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩))
304, 29eqtr3d 2149 . 2 (𝜑 → (𝑥 𝐽 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩) = (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩))
31 eqid 2115 . . . 4 𝐽 = 𝐽
32 nfcv 2255 . . . . 5 𝑦⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩
33 nffvmpt1 5386 . . . . . 6 𝑥((𝑥𝑋𝐴)‘𝑦)
34 nffvmpt1 5386 . . . . . 6 𝑥((𝑥𝑋𝐵)‘𝑦)
3533, 34nfop 3687 . . . . 5 𝑥⟨((𝑥𝑋𝐴)‘𝑦), ((𝑥𝑋𝐵)‘𝑦)⟩
36 fveq2 5375 . . . . . 6 (𝑥 = 𝑦 → ((𝑥𝑋𝐴)‘𝑥) = ((𝑥𝑋𝐴)‘𝑦))
37 fveq2 5375 . . . . . 6 (𝑥 = 𝑦 → ((𝑥𝑋𝐵)‘𝑥) = ((𝑥𝑋𝐵)‘𝑦))
3836, 37opeq12d 3679 . . . . 5 (𝑥 = 𝑦 → ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩ = ⟨((𝑥𝑋𝐴)‘𝑦), ((𝑥𝑋𝐵)‘𝑦)⟩)
3932, 35, 38cbvmpt 3983 . . . 4 (𝑥 𝐽 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩) = (𝑦 𝐽 ↦ ⟨((𝑥𝑋𝐴)‘𝑦), ((𝑥𝑋𝐵)‘𝑦)⟩)
4031, 39txcnmpt 12284 . . 3 (((𝑥𝑋𝐴) ∈ (𝐽 Cn 𝐾) ∧ (𝑥𝑋𝐵) ∈ (𝐽 Cn 𝐿)) → (𝑥 𝐽 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩) ∈ (𝐽 Cn (𝐾 ×t 𝐿)))
416, 17, 40syl2anc 406 . 2 (𝜑 → (𝑥 𝐽 ↦ ⟨((𝑥𝑋𝐴)‘𝑥), ((𝑥𝑋𝐵)‘𝑥)⟩) ∈ (𝐽 Cn (𝐾 ×t 𝐿)))
4230, 41eqeltrrd 2192 1 (𝜑 → (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩) ∈ (𝐽 Cn (𝐾 ×t 𝐿)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1314  wcel 1463  cop 3496   cuni 3702  cmpt 3949  wf 5077  cfv 5081  (class class class)co 5728  Topctop 12007  TopOnctopon 12020   Cn ccn 12197   ×t ctx 12263
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-13 1474  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-coll 4003  ax-sep 4006  ax-pow 4058  ax-pr 4091  ax-un 4315  ax-setind 4412
This theorem depends on definitions:  df-bi 116  df-3an 947  df-tru 1317  df-fal 1320  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2244  df-ne 2283  df-ral 2395  df-rex 2396  df-reu 2397  df-rab 2399  df-v 2659  df-sbc 2879  df-csb 2972  df-dif 3039  df-un 3041  df-in 3043  df-ss 3050  df-nul 3330  df-pw 3478  df-sn 3499  df-pr 3500  df-op 3502  df-uni 3703  df-iun 3781  df-br 3896  df-opab 3950  df-mpt 3951  df-id 4175  df-xp 4505  df-rel 4506  df-cnv 4507  df-co 4508  df-dm 4509  df-rn 4510  df-res 4511  df-ima 4512  df-iota 5046  df-fun 5083  df-fn 5084  df-f 5085  df-f1 5086  df-fo 5087  df-f1o 5088  df-fv 5089  df-ov 5731  df-oprab 5732  df-mpo 5733  df-1st 5992  df-2nd 5993  df-map 6498  df-topgen 11984  df-top 12008  df-topon 12021  df-bases 12053  df-cn 12200  df-tx 12264
This theorem is referenced by:  cnmpt12f  12297  imasnopn  12310
  Copyright terms: Public domain W3C validator