Theorem cocnv 37726

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 6241	. 2 ⊢ ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐹 ∘ (𝐺 ∘ ◡𝐺))
2		funcocnv2 6828	. . . . 5 ⊢ (Fun 𝐺 → (𝐺 ∘ ◡𝐺) = ( I ↾ ran 𝐺))
3	2	adantl 481	. . . 4 ⊢ ((Fun 𝐹 ∧ Fun 𝐺) → (𝐺 ∘ ◡𝐺) = ( I ↾ ran 𝐺))
4	3	coeq2d 5829	. . 3 ⊢ ((Fun 𝐹 ∧ Fun 𝐺) → (𝐹 ∘ (𝐺 ∘ ◡𝐺)) = (𝐹 ∘ ( I ↾ ran 𝐺)))
5		resco 6226	. . . 4 ⊢ ((𝐹 ∘ I ) ↾ ran 𝐺) = (𝐹 ∘ ( I ↾ ran 𝐺))
6		funrel 6536	. . . . . . 7 ⊢ (Fun 𝐹 → Rel 𝐹)
7		coi1 6238	. . . . . . 7 ⊢ (Rel 𝐹 → (𝐹 ∘ I ) = 𝐹)
8	6, 7	syl 17	. . . . . 6 ⊢ (Fun 𝐹 → (𝐹 ∘ I ) = 𝐹)
9	8	reseq1d 5952	. . . . 5 ⊢ (Fun 𝐹 → ((𝐹 ∘ I ) ↾ ran 𝐺) = (𝐹 ↾ ran 𝐺))
10	9	adantr 480	. . . 4 ⊢ ((Fun 𝐹 ∧ Fun 𝐺) → ((𝐹 ∘ I ) ↾ ran 𝐺) = (𝐹 ↾ ran 𝐺))
11	5, 10	eqtr3id 2779	. . 3 ⊢ ((Fun 𝐹 ∧ Fun 𝐺) → (𝐹 ∘ ( I ↾ ran 𝐺)) = (𝐹 ↾ ran 𝐺))
12	4, 11	eqtrd 2765	. 2 ⊢ ((Fun 𝐹 ∧ Fun 𝐺) → (𝐹 ∘ (𝐺 ∘ ◡𝐺)) = (𝐹 ↾ ran 𝐺))
13	1, 12	eqtrid 2777	1 ⊢ ((Fun 𝐹 ∧ Fun 𝐺) → ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐹 ↾ ran 𝐺))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   I cid 5535  ^◡ccnv 5640  ran crn 5642   ↾ cres 5643   ∘ ccom 5645  Rel wrel 5646  Fun wfun 6508

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-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390

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-nf 1784  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-br 5111  df-opab 5173  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-fun 6516

This theorem is referenced by: (None)