![]() |
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 6272 | . . . . 5 ⊢ ((𝐹 ∘ 𝐺) “ {𝑋}) = (𝐹 “ (𝐺 “ {𝑋})) | |
2 | fnsnfv 6987 | . . . . . 6 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → {(𝐺‘𝑋)} = (𝐺 “ {𝑋})) | |
3 | 2 | imaeq2d 6079 | . . . . 5 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐹 “ {(𝐺‘𝑋)}) = (𝐹 “ (𝐺 “ {𝑋}))) |
4 | 1, 3 | eqtr4id 2793 | . . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺) “ {𝑋}) = (𝐹 “ {(𝐺‘𝑋)})) |
5 | 4 | eleq2d 2824 | . . 3 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋}) ↔ 𝑥 ∈ (𝐹 “ {(𝐺‘𝑋)}))) |
6 | 5 | iotabidv 6546 | . 2 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (℩𝑥𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋})) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐺‘𝑋)}))) |
7 | dffv3 6902 | . 2 ⊢ ((𝐹 ∘ 𝐺)‘𝑋) = (℩𝑥𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋})) | |
8 | dffv3 6902 | . 2 ⊢ (𝐹‘(𝐺‘𝑋)) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐺‘𝑋)})) | |
9 | 6, 7, 8 | 3eqtr4g 2799 | 1 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1536 ∈ wcel 2105 {csn 4630 “ cima 5691 ∘ ccom 5692 ℩cio 6513 Fn wfn 6557 ‘cfv 6562 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-sep 5301 ax-nul 5311 ax-pr 5437 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-ne 2938 df-ral 3059 df-rex 3068 df-rab 3433 df-v 3479 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-nul 4339 df-if 4531 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-br 5148 df-opab 5210 df-id 5582 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-iota 6515 df-fun 6564 df-fn 6565 df-fv 6570 |
This theorem is referenced by: fvco 7006 fvco3 7007 fvco4i 7009 fvcofneq 7112 coof 7720 ofco 7721 curry1 8127 curry2 8130 fsplitfpar 8141 enfixsn 9119 updjudhcoinlf 9969 updjudhcoinrg 9970 updjud 9971 smobeth 10623 fpwwe 10683 addpqnq 10975 mulpqnq 10978 revco 14869 ccatco 14870 cshco 14871 swrdco 14872 isoval 17812 prdsidlem 18794 gsumwmhm 18870 prdsinvlem 19079 ghmquskerco 19314 gsmsymgrfixlem1 19459 f1omvdconj 19478 pmtrfinv 19493 symggen 19502 symgtrinv 19504 pmtr3ncomlem1 19505 prdsmgp 20168 ringidval 20200 lmhmco 21059 chrrhm 21563 cofipsgn 21628 dsmmbas2 21774 dsmm0cl 21777 frlmbas 21792 frlmup3 21837 frlmup4 21838 f1lindf 21859 lindfmm 21864 evlslem1 22123 evlsvar 22131 m1detdiag 22618 1stccnp 23485 prdstopn 23651 xpstopnlem2 23834 uniioombllem6 25636 precsexlem1 28245 precsexlem2 28246 precsexlem3 28247 precsexlem4 28248 precsexlem5 28249 ex-fpar 30490 0vfval 30634 cnre2csqlem 33870 mblfinlem2 37644 rabren3dioph 42802 hausgraph 43193 stoweidlem59 46014 afvco2 47125 gricushgr 47823 ackvalsucsucval 48537 |
Copyright terms: Public domain | W3C validator |