| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fcompt | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| fcompt | ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → (𝐴 ∘ 𝐵) = (𝑥 ∈ 𝐶 ↦ (𝐴‘(𝐵‘𝑥)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ffvelcdm 7025 | . . 3 ⊢ ((𝐵:𝐶⟶𝐷 ∧ 𝑥 ∈ 𝐶) → (𝐵‘𝑥) ∈ 𝐷) | |
| 2 | 1 | adantll 715 | . 2 ⊢ (((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) ∧ 𝑥 ∈ 𝐶) → (𝐵‘𝑥) ∈ 𝐷) |
| 3 | ffn 6660 | . . . 4 ⊢ (𝐵:𝐶⟶𝐷 → 𝐵 Fn 𝐶) | |
| 4 | 3 | adantl 481 | . . 3 ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐵 Fn 𝐶) |
| 5 | dffn5 6890 | . . 3 ⊢ (𝐵 Fn 𝐶 ↔ 𝐵 = (𝑥 ∈ 𝐶 ↦ (𝐵‘𝑥))) | |
| 6 | 4, 5 | sylib 218 | . 2 ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐵 = (𝑥 ∈ 𝐶 ↦ (𝐵‘𝑥))) |
| 7 | ffn 6660 | . . . 4 ⊢ (𝐴:𝐷⟶𝐸 → 𝐴 Fn 𝐷) | |
| 8 | 7 | adantr 480 | . . 3 ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐴 Fn 𝐷) |
| 9 | dffn5 6890 | . . 3 ⊢ (𝐴 Fn 𝐷 ↔ 𝐴 = (𝑦 ∈ 𝐷 ↦ (𝐴‘𝑦))) | |
| 10 | 8, 9 | sylib 218 | . 2 ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐴 = (𝑦 ∈ 𝐷 ↦ (𝐴‘𝑦))) |
| 11 | fveq2 6832 | . 2 ⊢ (𝑦 = (𝐵‘𝑥) → (𝐴‘𝑦) = (𝐴‘(𝐵‘𝑥))) | |
| 12 | 2, 6, 10, 11 | fmptco 7074 | 1 ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → (𝐴 ∘ 𝐵) = (𝑥 ∈ 𝐶 ↦ (𝐴‘(𝐵‘𝑥)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ↦ cmpt 5167 ∘ ccom 5626 Fn wfn 6485 ⟶wf 6486 ‘cfv 6490 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pr 5368 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-fv 6498 |
| This theorem is referenced by: 2fvcoidd 7243 revco 14758 repsco 14764 caucvgrlem2 15599 fucidcl 17893 fucsect 17900 dfinito3 17930 dftermo3 17931 prf1st 18128 prf2nd 18129 curfcl 18156 yonedalem4c 18201 yonedalem3b 18203 yonedainv 18205 mhmvlin 18727 frmdup3 18793 smndex1gid 18830 smndex1gidOLD 18831 efginvrel1 19661 frgpup3lem 19710 frgpup3 19711 dprdfinv 19954 grpvlinv 22341 grpvrinv 22342 chcoeffeqlem 22828 prdstps 23572 imasdsf1olem 24316 gamcvg2lem 27009 cofmpt2 32696 meascnbl 34369 elmrsubrn 35708 mzprename 43180 mendassa 43621 fcomptss 45635 mulc1cncfg 46023 expcnfg 46025 cncficcgt0 46320 fprodsubrecnncnvlem 46339 fprodaddrecnncnvlem 46341 dvsinax 46345 dirkercncflem2 46536 fourierdlem18 46557 fourierdlem53 46591 fourierdlem93 46631 fourierdlem101 46639 fourierdlem111 46649 sge0resrnlem 46835 omeiunle 46949 ovolval3 47079 fucorid2 49796 precofval2 49802 amgmwlem 50235 |
| Copyright terms: Public domain | W3C validator |