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

Theorem fcompt 7158
Description: Express composition of two functions as a maps-to applying both in sequence. (Contributed by Stefan O'Rear, 5-Oct-2014.) (Proof shortened by Mario Carneiro, 27-Dec-2014.)
Assertion
Ref Expression
fcompt ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → (𝐴 ∘ 𝐵) = (𝑥 ∈ 𝐶 ↦ (𝐴‘(𝐵‘𝑥))))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝑥,𝐷   𝑥,𝐸

Proof of Theorem fcompt
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 ffvelcdm 7105 . . 3 ((𝐵:𝐶⟶𝐷 ∧ 𝑥 ∈ 𝐶) → (𝐵‘𝑥) ∈ 𝐷)
21adantll 727 . 2 (((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) ∧ 𝑥 ∈ 𝐶) → (𝐵‘𝑥) ∈ 𝐷)
3 ffn 6731 . . . 4 (𝐵:𝐶⟶𝐷 → 𝐵 Fn 𝐶)
43adantl 487 . . 3 ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐵 Fn 𝐶)
5 dffn5 6966 . . 3 (𝐵 Fn 𝐶 ↔ 𝐵 = (𝑥 ∈ 𝐶 ↦ (𝐵‘𝑥)))
64, 5sylib 221 . 2 ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐵 = (𝑥 ∈ 𝐶 ↦ (𝐵‘𝑥)))
7 ffn 6731 . . . 4 (𝐴:𝐷⟶𝐸 → 𝐴 Fn 𝐷)
87adantr 486 . . 3 ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐴 Fn 𝐷)
9 dffn5 6966 . . 3 (𝐴 Fn 𝐷 ↔ 𝐴 = (𝑦 ∈ 𝐷 ↦ (𝐴‘𝑦)))
108, 9sylib 221 . 2 ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐴 = (𝑦 ∈ 𝐷 ↦ (𝐴‘𝑦)))
11 fveq2 6908 . 2 (𝑦 = (𝐵‘𝑥) → (𝐴‘𝑦) = (𝐴‘(𝐵‘𝑥)))
122, 6, 10, 11fmptco 7154 1 ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → (𝐴 ∘ 𝐵) = (𝑥 ∈ 𝐶 ↦ (𝐴‘(𝐵‘𝑥))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ↦ cmpt 5189   ∘ ccom 5659   Fn wfn 6553  ⟶wf 6554  ‘cfv 6558
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-fv 6566
This theorem is used by:  2fvcoidd  7328  revco  15013  repsco  15019  caucvgrlem2  15871  fucidcl  18172  fucsect  18179  dfinito3  18209  dftermo3  18210  prf1st  18407  prf2nd  18408  curfcl  18435  yonedalem4c  18480  yonedalem3b  18482  yonedainv  18484  mhmvlin  19025  frmdup3  19092  smndex1gid  19129  smndex1gidOLD  19130  efginvrel1  19972  frgpup3lem  20021  frgpup3  20022  dprdfinv  20265  grpvlinv  22743  grpvrinv  22744  chcoeffeqlem  23233  prdstps  23978  imasdsf1olem  24722  gamcvg2lem  27416  cofmpt2  33300  meascnbl  34922  elmrsubrn  36452  mzprename  43953  mendassa  44384  fcomptss  46422  mulc1cncfg  46806  expcnfg  46808  cncficcgt0  47103  fprodsubrecnncnvlem  47122  fprodaddrecnncnvlem  47124  dvsinax  47128  dirkercncflem2  47319  fourierdlem18  47340  fourierdlem53  47374  fourierdlem93  47414  fourierdlem101  47422  fourierdlem111  47432  sge0resrnlem  47618  omeiunle  47732  ovolval3  47862  fucorid2  50690  precofval2  50709  amgmwlem  51267
  Copyright terms: Public domain W3C validator