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

Theorem fcompt 7134
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 7081 . . 3 ((𝐵:𝐶⟶𝐷 ∧ 𝑥 ∈ 𝐶) → (𝐵‘𝑥) ∈ 𝐷)
21adantll 727 . 2 (((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) ∧ 𝑥 ∈ 𝐶) → (𝐵‘𝑥) ∈ 𝐷)
3 ffn 6709 . . . 4 (𝐵:𝐶⟶𝐷 → 𝐵 Fn 𝐶)
43adantl 487 . . 3 ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐵 Fn 𝐶)
5 dffn5 6943 . . 3 (𝐵 Fn 𝐶 ↔ 𝐵 = (𝑥 ∈ 𝐶 ↦ (𝐵‘𝑥)))
64, 5sylib 221 . 2 ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐵 = (𝑥 ∈ 𝐶 ↦ (𝐵‘𝑥)))
7 ffn 6709 . . . 4 (𝐴:𝐷⟶𝐸 → 𝐴 Fn 𝐷)
87adantr 486 . . 3 ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐴 Fn 𝐷)
9 dffn5 6943 . . 3 (𝐴 Fn 𝐷 ↔ 𝐴 = (𝑦 ∈ 𝐷 ↦ (𝐴‘𝑦)))
108, 9sylib 221 . 2 ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐴 = (𝑦 ∈ 𝐷 ↦ (𝐴‘𝑦)))
11 fveq2 6885 . 2 (𝑦 = (𝐵‘𝑥) → (𝐴‘𝑦) = (𝐴‘(𝐵‘𝑥)))
122, 6, 10, 11fmptco 7130 1 ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → (𝐴 ∘ 𝐵) = (𝑥 ∈ 𝐶 ↦ (𝐴‘(𝐵‘𝑥))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ↦ cmpt 5185   ∘ ccom 5654   Fn wfn 6533  ⟶wf 6534  ‘cfv 6538
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546
This theorem is used by:  2fvcoidd  7305  revco  14986  repsco  14992  caucvgrlem2  15843  fucidcl  18144  fucsect  18151  dfinito3  18181  dftermo3  18182  prf1st  18379  prf2nd  18380  curfcl  18407  yonedalem4c  18452  yonedalem3b  18454  yonedainv  18456  mhmvlin  18997  frmdup3  19064  smndex1gid  19101  smndex1gidOLD  19102  efginvrel1  19943  frgpup3lem  19992  frgpup3  19993  dprdfinv  20236  grpvlinv  22714  grpvrinv  22715  chcoeffeqlem  23204  prdstps  23949  imasdsf1olem  24693  gamcvg2lem  27387  cofmpt2  33271  meascnbl  34895  elmrsubrn  36354  mzprename  43836  mendassa  44268  fcomptss  46293  mulc1cncfg  46677  expcnfg  46679  cncficcgt0  46974  fprodsubrecnncnvlem  46993  fprodaddrecnncnvlem  46995  dvsinax  46999  dirkercncflem2  47190  fourierdlem18  47211  fourierdlem53  47245  fourierdlem93  47285  fourierdlem101  47293  fourierdlem111  47303  sge0resrnlem  47489  omeiunle  47603  ovolval3  47733  fucorid2  50547  precofval2  50553  amgmwlem  51063
  Copyright terms: Public domain W3C validator