| 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 7069 | . . 3 ⊢ ((𝐵:𝐶⟶𝐷 ∧ 𝑥 ∈ 𝐶) → (𝐵‘𝑥) ∈ 𝐷) | |
| 2 | 1 | adantll 727 | . 2 ⊢ (((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) ∧ 𝑥 ∈ 𝐶) → (𝐵‘𝑥) ∈ 𝐷) |
| 3 | ffn 6697 | . . . 4 ⊢ (𝐵:𝐶⟶𝐷 → 𝐵 Fn 𝐶) | |
| 4 | 3 | adantl 487 | . . 3 ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐵 Fn 𝐶) |
| 5 | dffn5 6931 | . . 3 ⊢ (𝐵 Fn 𝐶 ↔ 𝐵 = (𝑥 ∈ 𝐶 ↦ (𝐵‘𝑥))) | |
| 6 | 4, 5 | sylib 221 | . 2 ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐵 = (𝑥 ∈ 𝐶 ↦ (𝐵‘𝑥))) |
| 7 | ffn 6697 | . . . 4 ⊢ (𝐴:𝐷⟶𝐸 → 𝐴 Fn 𝐷) | |
| 8 | 7 | adantr 486 | . . 3 ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐴 Fn 𝐷) |
| 9 | dffn5 6931 | . . 3 ⊢ (𝐴 Fn 𝐷 ↔ 𝐴 = (𝑦 ∈ 𝐷 ↦ (𝐴‘𝑦))) | |
| 10 | 8, 9 | sylib 221 | . 2 ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐴 = (𝑦 ∈ 𝐷 ↦ (𝐴‘𝑦))) |
| 11 | fveq2 6873 | . 2 ⊢ (𝑦 = (𝐵‘𝑥) → (𝐴‘𝑦) = (𝐴‘(𝐵‘𝑥))) | |
| 12 | 2, 6, 10, 11 | fmptco 7118 | 1 ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → (𝐴 ∘ 𝐵) = (𝑥 ∈ 𝐶 ↦ (𝐴‘(𝐵‘𝑥)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ↦ cmpt 5185 ∘ ccom 5651 Fn wfn 6522 ⟶wf 6523 ‘cfv 6527 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 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 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 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-dif 3901 df-un 3903 df-in 3905 df-ss 3915 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 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-fv 6535 |
| This theorem is used by: 2fvcoidd 7293 revco 14953 repsco 14959 caucvgrlem2 15810 fucidcl 18105 fucsect 18112 dfinito3 18142 dftermo3 18143 prf1st 18340 prf2nd 18341 curfcl 18368 yonedalem4c 18413 yonedalem3b 18415 yonedainv 18417 mhmvlin 18958 frmdup3 19025 smndex1gid 19062 smndex1gidOLD 19063 efginvrel1 19904 frgpup3lem 19953 frgpup3 19954 dprdfinv 20197 grpvlinv 22675 grpvrinv 22676 chcoeffeqlem 23165 prdstps 23910 imasdsf1olem 24654 gamcvg2lem 27350 cofmpt2 33162 meascnbl 34786 elmrsubrn 36206 mzprename 43698 mendassa 44135 fcomptss 46138 mulc1cncfg 46523 expcnfg 46525 cncficcgt0 46820 fprodsubrecnncnvlem 46839 fprodaddrecnncnvlem 46841 dvsinax 46845 dirkercncflem2 47036 fourierdlem18 47057 fourierdlem53 47091 fourierdlem93 47131 fourierdlem101 47139 fourierdlem111 47149 sge0resrnlem 47335 omeiunle 47449 ovolval3 47579 fucorid2 50393 precofval2 50399 amgmwlem 50909 |
| Copyright terms: Public domain | W3C validator |