| 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 5617 | . . . 4 ⊢ (Fun 𝐺 → (𝐺 ∘ ◡𝐺) = ( I ↾ ran 𝐺)) | |
| 2 | 1 | coeq2d 4898 | . . 3 ⊢ (Fun 𝐺 → (𝐹 ∘ (𝐺 ∘ ◡𝐺)) = (𝐹 ∘ ( I ↾ ran 𝐺))) |
| 3 | coass 5262 | . . . 4 ⊢ ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐹 ∘ (𝐺 ∘ ◡𝐺)) | |
| 4 | 3 | eqcomi 2235 | . . 3 ⊢ (𝐹 ∘ (𝐺 ∘ ◡𝐺)) = ((𝐹 ∘ 𝐺) ∘ ◡𝐺) |
| 5 | coires1 5261 | . . 3 ⊢ (𝐹 ∘ ( I ↾ ran 𝐺)) = (𝐹 ↾ ran 𝐺) | |
| 6 | 2, 4, 5 | 3eqtr3g 2287 | . 2 ⊢ (Fun 𝐺 → ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐹 ↾ ran 𝐺)) |
| 7 | coeq1 4893 | . 2 ⊢ ((𝐹 ∘ 𝐺) = 𝐻 → ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐻 ∘ ◡𝐺)) | |
| 8 | 6, 7 | sylan9req 2285 | 1 ⊢ ((Fun 𝐺 ∧ (𝐹 ∘ 𝐺) = 𝐻) → (𝐹 ↾ ran 𝐺) = (𝐻 ∘ ◡𝐺)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 I cid 4391 ◡ccnv 4730 ran crn 4732 ↾ cres 4733 ∘ ccom 4735 Fun wfun 5327 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-v 2805 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-br 4094 df-opab 4156 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-fun 5335 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |