Metamath Proof Explorer


Theorem cocnv

Description: Composition with a function and then with the converse. (Contributed by Jeff Madsen, 2-Sep-2009)

Ref Expression
Assertion cocnv ⊢ Fun ⁡ F ∧ Fun ⁡ G → F ∘ G ∘ G -1 = F ↾ ran ⁡ G

Proof

Step Hyp Ref Expression
1 coass ⊢ F ∘ G ∘ G -1 = F ∘ G ∘ G -1
2 funcocnv2 ⊢ Fun ⁡ G → G ∘ G -1 = I ↾ ran ⁡ G
3 2 adantl ⊢ Fun ⁡ F ∧ Fun ⁡ G → G ∘ G -1 = I ↾ ran ⁡ G
4 3 coeq2d ⊢ Fun ⁡ F ∧ Fun ⁡ G → F ∘ G ∘ G -1 = F ∘ I ↾ ran ⁡ G
5 resco ⊢ F ∘ I ↾ ran ⁡ G = F ∘ I ↾ ran ⁡ G
6 funrel ⊢ Fun ⁡ F → Rel ⁡ F
7 coi1 ⊢ Rel ⁡ F → F ∘ I = F
8 6 7 syl ⊢ Fun ⁡ F → F ∘ I = F
9 8 reseq1d ⊢ Fun ⁡ F → F ∘ I ↾ ran ⁡ G = F ↾ ran ⁡ G
10 9 adantr ⊢ Fun ⁡ F ∧ Fun ⁡ G → F ∘ I ↾ ran ⁡ G = F ↾ ran ⁡ G
11 5 10 eqtr3id ⊢ Fun ⁡ F ∧ Fun ⁡ G → F ∘ I ↾ ran ⁡ G = F ↾ ran ⁡ G
12 4 11 eqtrd ⊢ Fun ⁡ F ∧ Fun ⁡ G → F ∘ G ∘ G -1 = F ↾ ran ⁡ G
13 1 12 eqtrid ⊢ Fun ⁡ F ∧ Fun ⁡ G → F ∘ G ∘ G -1 = F ↾ ran ⁡ G