![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > funcoeqres | GIF version |
Description: 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 5525 | . . . 4 ⊢ (Fun 𝐺 → (𝐺 ∘ ◡𝐺) = ( I ↾ ran 𝐺)) | |
2 | 1 | coeq2d 4824 | . . 3 ⊢ (Fun 𝐺 → (𝐹 ∘ (𝐺 ∘ ◡𝐺)) = (𝐹 ∘ ( I ↾ ran 𝐺))) |
3 | coass 5184 | . . . 4 ⊢ ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐹 ∘ (𝐺 ∘ ◡𝐺)) | |
4 | 3 | eqcomi 2197 | . . 3 ⊢ (𝐹 ∘ (𝐺 ∘ ◡𝐺)) = ((𝐹 ∘ 𝐺) ∘ ◡𝐺) |
5 | coires1 5183 | . . 3 ⊢ (𝐹 ∘ ( I ↾ ran 𝐺)) = (𝐹 ↾ ran 𝐺) | |
6 | 2, 4, 5 | 3eqtr3g 2249 | . 2 ⊢ (Fun 𝐺 → ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐹 ↾ ran 𝐺)) |
7 | coeq1 4819 | . 2 ⊢ ((𝐹 ∘ 𝐺) = 𝐻 → ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐻 ∘ ◡𝐺)) | |
8 | 6, 7 | sylan9req 2247 | 1 ⊢ ((Fun 𝐺 ∧ (𝐹 ∘ 𝐺) = 𝐻) → (𝐹 ↾ ran 𝐺) = (𝐻 ∘ ◡𝐺)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 I cid 4319 ◡ccnv 4658 ran crn 4660 ↾ cres 4661 ∘ ccom 4663 Fun wfun 5248 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ral 2477 df-rex 2478 df-v 2762 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-br 4030 df-opab 4091 df-id 4324 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-fun 5256 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |