| 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 6215 | . . . . 5 ⊢ ((𝐹 ∘ 𝐺) “ {𝑋}) = (𝐹 “ (𝐺 “ {𝑋})) | |
| 2 | fnsnfv 6919 | . . . . . 6 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → {(𝐺‘𝑋)} = (𝐺 “ {𝑋})) | |
| 3 | 2 | imaeq2d 6025 | . . . . 5 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐹 “ {(𝐺‘𝑋)}) = (𝐹 “ (𝐺 “ {𝑋}))) |
| 4 | 1, 3 | eqtr4id 2790 | . . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺) “ {𝑋}) = (𝐹 “ {(𝐺‘𝑋)})) |
| 5 | 4 | eleq2d 2822 | . . 3 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋}) ↔ 𝑥 ∈ (𝐹 “ {(𝐺‘𝑋)}))) |
| 6 | 5 | iotabidv 6482 | . 2 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (℩𝑥𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋})) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐺‘𝑋)}))) |
| 7 | dffv3 6836 | . 2 ⊢ ((𝐹 ∘ 𝐺)‘𝑋) = (℩𝑥𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋})) | |
| 8 | dffv3 6836 | . 2 ⊢ (𝐹‘(𝐺‘𝑋)) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐺‘𝑋)})) | |
| 9 | 6, 7, 8 | 3eqtr4g 2796 | 1 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {csn 4567 “ cima 5634 ∘ ccom 5635 ℩cio 6452 Fn wfn 6493 ‘cfv 6498 |
| 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 2708 ax-sep 5231 ax-nul 5241 ax-pr 5375 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-fv 6506 |
| This theorem is referenced by: fvco 6938 fvco3 6939 fvco4i 6941 fvcofneq 7045 coof 7655 ofco 7656 curry1 8054 curry2 8057 fsplitfpar 8068 enfixsn 9024 updjudhcoinlf 9856 updjudhcoinrg 9857 updjud 9858 smobeth 10509 fpwwe 10569 addpqnq 10861 mulpqnq 10864 revco 14796 ccatco 14797 cshco 14798 swrdco 14799 isoval 17732 prdsidlem 18737 gsumwmhm 18813 prdsinvlem 19025 ghmquskerco 19259 gsmsymgrfixlem1 19402 f1omvdconj 19421 pmtrfinv 19436 symggen 19445 symgtrinv 19447 pmtr3ncomlem1 19448 prdsmgp 20132 ringidval 20164 lmhmco 21038 chrrhm 21511 cofipsgn 21573 dsmmbas2 21717 dsmm0cl 21720 frlmbas 21735 frlmup3 21780 frlmup4 21781 f1lindf 21802 lindfmm 21807 evlslem1 22060 evlsvar 22073 m1detdiag 22562 1stccnp 23427 prdstopn 23593 xpstopnlem2 23776 uniioombllem6 25555 precsexlem1 28199 precsexlem2 28200 precsexlem3 28201 precsexlem4 28202 precsexlem5 28203 ex-fpar 30532 0vfval 30677 cnre2csqlem 34054 mblfinlem2 37979 rabren3dioph 43243 hausgraph 43633 stoweidlem59 46487 afvco2 47624 gricushgr 48393 ackvalsucsucval 49164 |
| Copyright terms: Public domain | W3C validator |