Theorem funcocnv2 6842

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

Assertion

Ref	Expression
funcocnv2	⊢ (Fun 𝐹 → (𝐹 ∘ ◡𝐹) = ( I ↾ ran 𝐹))

Proof of Theorem funcocnv2

Step	Hyp	Ref	Expression
1		df-fun 6533	. . 3 ⊢ (Fun 𝐹 ↔ (Rel 𝐹 ∧ (𝐹 ∘ ◡𝐹) ⊆ I ))
2	1	simprbi 503	. 2 ⊢ (Fun 𝐹 → (𝐹 ∘ ◡𝐹) ⊆ I )
3		iss 6029	. . 3 ⊢ ((𝐹 ∘ ◡𝐹) ⊆ I ↔ (𝐹 ∘ ◡𝐹) = ( I ↾ dom (𝐹 ∘ ◡𝐹)))
4		dfdm4 5877	. . . . . . 7 ⊢ dom 𝐹 = ran ◡𝐹
5		dmcoeq 5962	. . . . . . 7 ⊢ (dom 𝐹 = ran ◡𝐹 → dom (𝐹 ∘ ◡𝐹) = dom ◡𝐹)
6	4, 5	ax-mp 5	. . . . . 6 ⊢ dom (𝐹 ∘ ◡𝐹) = dom ◡𝐹
7		df-rn 5662	. . . . . 6 ⊢ ran 𝐹 = dom ◡𝐹
8	6, 7	eqtr4i 2787	. . . . 5 ⊢ dom (𝐹 ∘ ◡𝐹) = ran 𝐹
9	8	reseq2i 5967	. . . 4 ⊢ ( I ↾ dom (𝐹 ∘ ◡𝐹)) = ( I ↾ ran 𝐹)
10	9	eqeq2i 2774	. . 3 ⊢ ((𝐹 ∘ ◡𝐹) = ( I ↾ dom (𝐹 ∘ ◡𝐹)) ↔ (𝐹 ∘ ◡𝐹) = ( I ↾ ran 𝐹))
11	3, 10	bitri 278	. 2 ⊢ ((𝐹 ∘ ◡𝐹) ⊆ I ↔ (𝐹 ∘ ◡𝐹) = ( I ↾ ran 𝐹))
12	2, 11	sylib 221	1 ⊢ (Fun 𝐹 → (𝐹 ∘ ◡𝐹) = ( I ↾ ran 𝐹))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ⊆ wss 3899   I cid 5545  ^◡ccnv 5650  dom cdm 5651  ran crn 5652   ↾ cres 5653   ∘ ccom 5655  Rel wrel 5656  Fun wfun 6525

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-fun 6533

This theorem is used by:  fococnv2  6843  f1cocnv2  6845  funcoeqres  6848  fcoinver  33180  tocyc01  33661  cocnv  38627  frege131d  44723  gricushgr  48959