| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fnco | Structured version Visualization version GIF version | ||
| Description: Composition of two functions with domains as a function with domain. (Contributed by NM, 22-May-2006.) (Proof shortened by AV, 20-Sep-2024.) |
| Ref | Expression |
|---|---|
| fnco | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ ran 𝐺 ⊆ 𝐴) → (𝐹 ∘ 𝐺) Fn 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fnfun 6592 | . . . 4 ⊢ (𝐺 Fn 𝐵 → Fun 𝐺) | |
| 2 | fncofn 6609 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ Fun 𝐺) → (𝐹 ∘ 𝐺) Fn (◡𝐺 “ 𝐴)) | |
| 3 | 1, 2 | sylan2 599 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) → (𝐹 ∘ 𝐺) Fn (◡𝐺 “ 𝐴)) |
| 4 | 3 | 3adant3 1138 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ ran 𝐺 ⊆ 𝐴) → (𝐹 ∘ 𝐺) Fn (◡𝐺 “ 𝐴)) |
| 5 | cnvimassrndm 6110 | . . . . 5 ⊢ (ran 𝐺 ⊆ 𝐴 → (◡𝐺 “ 𝐴) = dom 𝐺) | |
| 6 | 5 | 3ad2ant3 1141 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ ran 𝐺 ⊆ 𝐴) → (◡𝐺 “ 𝐴) = dom 𝐺) |
| 7 | fndm 6595 | . . . . 5 ⊢ (𝐺 Fn 𝐵 → dom 𝐺 = 𝐵) | |
| 8 | 7 | 3ad2ant2 1140 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ ran 𝐺 ⊆ 𝐴) → dom 𝐺 = 𝐵) |
| 9 | 6, 8 | eqtr2d 2776 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ ran 𝐺 ⊆ 𝐴) → 𝐵 = (◡𝐺 “ 𝐴)) |
| 10 | 9 | fneq2d 6586 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ ran 𝐺 ⊆ 𝐴) → ((𝐹 ∘ 𝐺) Fn 𝐵 ↔ (𝐹 ∘ 𝐺) Fn (◡𝐺 “ 𝐴))) |
| 11 | 4, 10 | mpbird 258 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ ran 𝐺 ⊆ 𝐴) → (𝐹 ∘ 𝐺) Fn 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1092 = wceq 1547 ⊆ wss 3890 ◡ccnv 5624 dom cdm 5625 ran crn 5626 “ cima 5628 ∘ ccom 5629 Fun wfun 6486 Fn wfn 6487 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-pr 5369 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-br 5080 df-opab 5142 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-fun 6494 df-fn 6495 |
| This theorem is referenced by: fnfco 6699 fsplitfpar 8064 fipreima 9265 updjudhcoinlf 9854 updjudhcoinrg 9855 cshco 14796 swrdco 14797 isofn 17740 prdsinvlem 19023 prdsmgp 20130 pws1 20302 frlmbas 21737 frlmup3 21782 frlmup4 21783 evlslem1 22065 upxp 23613 uptx 23615 0vfval 30702 xppreima2 32750 psgnfzto1stlem 33188 tocycfvres1 33198 tocycfvres2 33199 cycpmfvlem 33200 cycpmfv3 33203 cycpmco2 33221 sseqfv1 34580 sseqfn 34581 sseqfv2 34585 volsupnfl 38039 ftc1anclem5 38071 ftc1anclem8 38074 choicefi 45653 fourierdlem42 46599 fcoreslem4 47536 ackvalsucsucval 49186 isofnALT 49528 |
| Copyright terms: Public domain | W3C validator |