Theorem funcocnv2 6853

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 6545	. . 3 ⊢ (Fun 𝐹 ↔ (Rel 𝐹 ∧ (𝐹 ∘ ◡𝐹) ⊆ I ))
2	1	simprbi 503	. 2 ⊢ (Fun 𝐹 → (𝐹 ∘ ◡𝐹) ⊆ I )
3		iss 6042	. . 3 ⊢ ((𝐹 ∘ ◡𝐹) ⊆ I ↔ (𝐹 ∘ ◡𝐹) = ( I ↾ dom (𝐹 ∘ ◡𝐹)))
4		dfdm4 5890	. . . . . . 7 ⊢ dom 𝐹 = ran ◡𝐹
5		dmcoeq 5975	. . . . . . 7 ⊢ (dom 𝐹 = ran ◡𝐹 → dom (𝐹 ∘ ◡𝐹) = dom ◡𝐹)
6	4, 5	ax-mp 5	. . . . . 6 ⊢ dom (𝐹 ∘ ◡𝐹) = dom ◡𝐹
7		df-rn 5677	. . . . . 6 ⊢ ran 𝐹 = dom ◡𝐹
8	6, 7	eqtr4i 2792	. . . . 5 ⊢ dom (𝐹 ∘ ◡𝐹) = ran 𝐹
9	8	reseq2i 5980	. . . 4 ⊢ ( I ↾ dom (𝐹 ∘ ◡𝐹)) = ( I ↾ ran 𝐹)
10	9	eqeq2i 2779	. . 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 3908   I cid 5560  ^◡ccnv 5665  dom cdm 5666  ran crn 5667   ↾ cres 5668   ∘ ccom 5670  Rel wrel 5671  Fun wfun 6537

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 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-pr 5409

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 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-fun 6545

This theorem is used by:  fococnv2  6854  f1cocnv2  6856  funcoeqres  6859  fcoinver  32986  tocyc01  33469  cocnv  38417  frege131d  44531  gricushgr  48723