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 5457 | . . . 4 ⊢ (Fun 𝐺 → (𝐺 ∘ ◡𝐺) = ( I ↾ ran 𝐺)) | |
2 | 1 | coeq2d 4766 | . . 3 ⊢ (Fun 𝐺 → (𝐹 ∘ (𝐺 ∘ ◡𝐺)) = (𝐹 ∘ ( I ↾ ran 𝐺))) |
3 | coass 5122 | . . . 4 ⊢ ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐹 ∘ (𝐺 ∘ ◡𝐺)) | |
4 | 3 | eqcomi 2169 | . . 3 ⊢ (𝐹 ∘ (𝐺 ∘ ◡𝐺)) = ((𝐹 ∘ 𝐺) ∘ ◡𝐺) |
5 | coires1 5121 | . . 3 ⊢ (𝐹 ∘ ( I ↾ ran 𝐺)) = (𝐹 ↾ ran 𝐺) | |
6 | 2, 4, 5 | 3eqtr3g 2222 | . 2 ⊢ (Fun 𝐺 → ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐹 ↾ ran 𝐺)) |
7 | coeq1 4761 | . 2 ⊢ ((𝐹 ∘ 𝐺) = 𝐻 → ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐻 ∘ ◡𝐺)) | |
8 | 6, 7 | sylan9req 2220 | 1 ⊢ ((Fun 𝐺 ∧ (𝐹 ∘ 𝐺) = 𝐻) → (𝐹 ↾ ran 𝐺) = (𝐻 ∘ ◡𝐺)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1343 I cid 4266 ◡ccnv 4603 ran crn 4605 ↾ cres 4606 ∘ ccom 4608 Fun wfun 5182 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ral 2449 df-rex 2450 df-v 2728 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-br 3983 df-opab 4044 df-id 4271 df-xp 4610 df-rel 4611 df-cnv 4612 df-co 4613 df-dm 4614 df-rn 4615 df-res 4616 df-fun 5190 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |