![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > funcoeqres | Structured version Visualization version GIF version |
Description: Re-express a constraint on a composition as a constraint on the composand. (Contributed by Stefan O'Rear, 7-Mar-2015.) |
Ref | Expression |
---|---|
funcoeqres | ⊢ ((Fun 𝐺 ∧ (𝐹 ∘ 𝐺) = 𝐻) → (𝐹 ↾ ran 𝐺) = (𝐻 ∘ ◡𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | funcocnv2 6161 | . . . 4 ⊢ (Fun 𝐺 → (𝐺 ∘ ◡𝐺) = ( I ↾ ran 𝐺)) | |
2 | 1 | coeq2d 5284 | . . 3 ⊢ (Fun 𝐺 → (𝐹 ∘ (𝐺 ∘ ◡𝐺)) = (𝐹 ∘ ( I ↾ ran 𝐺))) |
3 | coass 5654 | . . . 4 ⊢ ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐹 ∘ (𝐺 ∘ ◡𝐺)) | |
4 | 3 | eqcomi 2631 | . . 3 ⊢ (𝐹 ∘ (𝐺 ∘ ◡𝐺)) = ((𝐹 ∘ 𝐺) ∘ ◡𝐺) |
5 | coires1 5653 | . . 3 ⊢ (𝐹 ∘ ( I ↾ ran 𝐺)) = (𝐹 ↾ ran 𝐺) | |
6 | 2, 4, 5 | 3eqtr3g 2679 | . 2 ⊢ (Fun 𝐺 → ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐹 ↾ ran 𝐺)) |
7 | coeq1 5279 | . 2 ⊢ ((𝐹 ∘ 𝐺) = 𝐻 → ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐻 ∘ ◡𝐺)) | |
8 | 6, 7 | sylan9req 2677 | 1 ⊢ ((Fun 𝐺 ∧ (𝐹 ∘ 𝐺) = 𝐻) → (𝐹 ↾ ran 𝐺) = (𝐻 ∘ ◡𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 I cid 5023 ◡ccnv 5113 ran crn 5115 ↾ cres 5116 ∘ ccom 5118 Fun wfun 5882 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-br 4654 df-opab 4713 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-fun 5890 |
This theorem is referenced by: evlseu 19516 frlmup4 20140 |
Copyright terms: Public domain | W3C validator |