Theorem funcocnv2 6847

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 6539	. . 3 ⊢ (Fun 𝐹 ↔ (Rel 𝐹 ∧ (𝐹 ∘ ◡𝐹) ⊆ I ))
2	1	simprbi 503	. 2 ⊢ (Fun 𝐹 → (𝐹 ∘ ◡𝐹) ⊆ I )
3		iss 6035	. . 3 ⊢ ((𝐹 ∘ ◡𝐹) ⊆ I ↔ (𝐹 ∘ ◡𝐹) = ( I ↾ dom (𝐹 ∘ ◡𝐹)))
4		dfdm4 5883	. . . . . . 7 ⊢ dom 𝐹 = ran ◡𝐹
5		dmcoeq 5968	. . . . . . 7 ⊢ (dom 𝐹 = ran ◡𝐹 → dom (𝐹 ∘ ◡𝐹) = dom ◡𝐹)
6	4, 5	ax-mp 5	. . . . . 6 ⊢ dom (𝐹 ∘ ◡𝐹) = dom ◡𝐹
7		df-rn 5670	. . . . . 6 ⊢ ran 𝐹 = dom ◡𝐹
8	6, 7	eqtr4i 2788	. . . . 5 ⊢ dom (𝐹 ∘ ◡𝐹) = ran 𝐹
9	8	reseq2i 5973	. . . 4 ⊢ ( I ↾ dom (𝐹 ∘ ◡𝐹)) = ( I ↾ ran 𝐹)
10	9	eqeq2i 2775	. . 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 3902   I cid 5553  ^◡ccnv 5658  dom cdm 5659  ran crn 5660   ↾ cres 5661   ∘ ccom 5663  Rel wrel 5664  Fun wfun 6531

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 2734  ax-sep 5255  ax-pr 5402

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 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-fun 6539

This theorem is used by:  fococnv2  6848  f1cocnv2  6850  funcoeqres  6853  fcoinver  33085  tocyc01  33566  cocnv  38483  frege131d  44612  gricushgr  48841