| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fvco2 | Structured version Visualization version GIF version | ||
| Description: Value of a function composition. Similar to second part of Theorem 3H of [Enderton] p. 47. (Contributed by NM, 9-Oct-2004.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) (Revised by Stefan O'Rear, 16-Oct-2014.) |
| Ref | Expression |
|---|---|
| fvco2 | ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | imaco 6238 | . . . . 5 ⊢ ((𝐹 ∘ 𝐺) “ {𝑋}) = (𝐹 “ (𝐺 “ {𝑋})) | |
| 2 | fnsnfv 6946 | . . . . . 6 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → {(𝐺‘𝑋)} = (𝐺 “ {𝑋})) | |
| 3 | 2 | imaeq2d 6049 | . . . . 5 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐹 “ {(𝐺‘𝑋)}) = (𝐹 “ (𝐺 “ {𝑋}))) |
| 4 | 1, 3 | eqtr4id 2816 | . . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺) “ {𝑋}) = (𝐹 “ {(𝐺‘𝑋)})) |
| 5 | 4 | eleq2d 2848 | . . 3 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋}) ↔ 𝑥 ∈ (𝐹 “ {(𝐺‘𝑋)}))) |
| 6 | 5 | iotabidv 6505 | . 2 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (℩𝑥𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋})) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐺‘𝑋)}))) |
| 7 | dffv3 6863 | . 2 ⊢ ((𝐹 ∘ 𝐺)‘𝑋) = (℩𝑥𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋})) | |
| 8 | dffv3 6863 | . 2 ⊢ (𝐹‘(𝐺‘𝑋)) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐺‘𝑋)})) | |
| 9 | 6, 7, 8 | 3eqtr4g 2822 | 1 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1560 ∈ wcel 2142 {csn 4582 “ cima 5650 ∘ ccom 5651 ℩cio 6475 Fn wfn 6516 ‘cfv 6521 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-nul 5256 ax-pr 5390 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 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 6477 df-fun 6523 df-fn 6524 df-fv 6529 |
| This theorem is referenced by: fvco 6965 fvco3 6967 fvco4i 6969 fvcofneq 7074 coof 7684 ofco 7685 curry1 8083 curry2 8086 fsplitfpar 8097 enfixsn 9058 updjudhcoinlf 9890 updjudhcoinrg 9891 updjud 9892 smobeth 10544 fpwwe 10604 addpqnq 10896 mulpqnq 10899 revco 14847 ccatco 14848 cshco 14849 swrdco 14850 isoval 17798 prdsidlem 18803 gsumwmhm 18879 prdsinvlem 19091 ghmquskerco 19324 gsmsymgrfixlem1 19467 f1omvdconj 19486 pmtrfinv 19501 symggen 19510 symgtrinv 19512 pmtr3ncomlem1 19513 prdsmgp 20197 ringidval 20233 lmhmco 21110 chrrhm 21583 cofipsgn 21645 dsmmbas2 21789 dsmm0cl 21792 frlmbas 21807 frlmup3 21852 frlmup4 21853 f1lindf 21874 lindfmm 21879 evlslem1 22135 evlsvar 22148 m1detdiag 22657 1stccnp 23522 prdstopn 23688 xpstopnlem2 23871 uniioombllem6 25650 precsexlem1 28300 precsexlem2 28301 precsexlem3 28302 precsexlem4 28303 precsexlem5 28304 ex-fpar 30664 0vfval 30809 cnre2csqlem 34207 mblfinlem2 38157 rabren3dioph 43392 hausgraph 43782 stoweidlem59 46633 afvco2 47770 gricushgr 48539 ackvalsucsucval 49310 |
| Copyright terms: Public domain | W3C validator |