Theorem cocnv 37715

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

Assertion

Ref	Expression
cocnv	⊢ ((Fun 𝐹 ∧ Fun 𝐺) → ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐹 ↾ ran 𝐺))

Proof of Theorem cocnv

Step	Hyp	Ref	Expression
1		coass 6214	. 2 ⊢ ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐹 ∘ (𝐺 ∘ ◡𝐺))
2		funcocnv2 6789	. . . . 5 ⊢ (Fun 𝐺 → (𝐺 ∘ ◡𝐺) = ( I ↾ ran 𝐺))
3	2	adantl 481	. . . 4 ⊢ ((Fun 𝐹 ∧ Fun 𝐺) → (𝐺 ∘ ◡𝐺) = ( I ↾ ran 𝐺))
4	3	coeq2d 5805	. . 3 ⊢ ((Fun 𝐹 ∧ Fun 𝐺) → (𝐹 ∘ (𝐺 ∘ ◡𝐺)) = (𝐹 ∘ ( I ↾ ran 𝐺)))
5		resco 6199	. . . 4 ⊢ ((𝐹 ∘ I ) ↾ ran 𝐺) = (𝐹 ∘ ( I ↾ ran 𝐺))
6		funrel 6499	. . . . . . 7 ⊢ (Fun 𝐹 → Rel 𝐹)
7		coi1 6211	. . . . . . 7 ⊢ (Rel 𝐹 → (𝐹 ∘ I ) = 𝐹)
8	6, 7	syl 17	. . . . . 6 ⊢ (Fun 𝐹 → (𝐹 ∘ I ) = 𝐹)
9	8	reseq1d 5929	. . . . 5 ⊢ (Fun 𝐹 → ((𝐹 ∘ I ) ↾ ran 𝐺) = (𝐹 ↾ ran 𝐺))
10	9	adantr 480	. . . 4 ⊢ ((Fun 𝐹 ∧ Fun 𝐺) → ((𝐹 ∘ I ) ↾ ran 𝐺) = (𝐹 ↾ ran 𝐺))
11	5, 10	eqtr3id 2778	. . 3 ⊢ ((Fun 𝐹 ∧ Fun 𝐺) → (𝐹 ∘ ( I ↾ ran 𝐺)) = (𝐹 ↾ ran 𝐺))
12	4, 11	eqtrd 2764	. 2 ⊢ ((Fun 𝐹 ∧ Fun 𝐺) → (𝐹 ∘ (𝐺 ∘ ◡𝐺)) = (𝐹 ↾ ran 𝐺))
13	1, 12	eqtrid 2776	1 ⊢ ((Fun 𝐹 ∧ Fun 𝐺) → ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐹 ↾ ran 𝐺))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   I cid 5513  ^◡ccnv 5618  ran crn 5620   ↾ cres 5621   ∘ ccom 5623  Rel wrel 5624  Fun wfun 6476

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-11 2158  ax-ext 2701  ax-sep 5235  ax-nul 5245  ax-pr 5371

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3395  df-v 3438  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4285  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-br 5093  df-opab 5155  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-fun 6484

This theorem is referenced by: (None)