Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > funresfunco | Structured version Visualization version GIF version |
Description: Composition of two functions, generalization of funco 6397. (Contributed by Alexander van der Vekens, 25-Jul-2017.) |
Ref | Expression |
---|---|
funresfunco | ⊢ ((Fun (𝐹 ↾ ran 𝐺) ∧ Fun 𝐺) → Fun (𝐹 ∘ 𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | funco 6397 | . 2 ⊢ ((Fun (𝐹 ↾ ran 𝐺) ∧ Fun 𝐺) → Fun ((𝐹 ↾ ran 𝐺) ∘ 𝐺)) | |
2 | ssid 3991 | . . . . 5 ⊢ ran 𝐺 ⊆ ran 𝐺 | |
3 | cores 6104 | . . . . 5 ⊢ (ran 𝐺 ⊆ ran 𝐺 → ((𝐹 ↾ ran 𝐺) ∘ 𝐺) = (𝐹 ∘ 𝐺)) | |
4 | 2, 3 | ax-mp 5 | . . . 4 ⊢ ((𝐹 ↾ ran 𝐺) ∘ 𝐺) = (𝐹 ∘ 𝐺) |
5 | 4 | eqcomi 2832 | . . 3 ⊢ (𝐹 ∘ 𝐺) = ((𝐹 ↾ ran 𝐺) ∘ 𝐺) |
6 | 5 | funeqi 6378 | . 2 ⊢ (Fun (𝐹 ∘ 𝐺) ↔ Fun ((𝐹 ↾ ran 𝐺) ∘ 𝐺)) |
7 | 1, 6 | sylibr 236 | 1 ⊢ ((Fun (𝐹 ↾ ran 𝐺) ∧ Fun 𝐺) → Fun (𝐹 ∘ 𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ⊆ wss 3938 ran crn 5558 ↾ cres 5559 ∘ ccom 5561 Fun wfun 6351 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pr 5332 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-br 5069 df-opab 5131 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-fun 6359 |
This theorem is referenced by: fnresfnco 43283 |
Copyright terms: Public domain | W3C validator |