Theorem funcocnv2 6846

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 6538	. . 3 ⊢ (Fun 𝐹 ↔ (Rel 𝐹 ∧ (𝐹 ∘ ◡𝐹) ⊆ I ))
2	1	simprbi 502	. 2 ⊢ (Fun 𝐹 → (𝐹 ∘ ◡𝐹) ⊆ I )
3		iss 6036	. . 3 ⊢ ((𝐹 ∘ ◡𝐹) ⊆ I ↔ (𝐹 ∘ ◡𝐹) = ( I ↾ dom (𝐹 ∘ ◡𝐹)))
4		dfdm4 5884	. . . . . . 7 ⊢ dom 𝐹 = ran ◡𝐹
5		dmcoeq 5969	. . . . . . 7 ⊢ (dom 𝐹 = ran ◡𝐹 → dom (𝐹 ∘ ◡𝐹) = dom ◡𝐹)
6	4, 5	ax-mp 5	. . . . . 6 ⊢ dom (𝐹 ∘ ◡𝐹) = dom ◡𝐹
7		df-rn 5671	. . . . . 6 ⊢ ran 𝐹 = dom ◡𝐹
8	6, 7	eqtr4i 2788	. . . . 5 ⊢ dom (𝐹 ∘ ◡𝐹) = ran 𝐹
9	8	reseq2i 5974	. . . 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 1569   ⊆ wss 3904   I cid 5554  ^◡ccnv 5659  dom cdm 5660  ran crn 5661   ↾ cres 5662   ∘ ccom 5664  Rel wrel 5665  Fun wfun 6530

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-fun 6538

This theorem is used by:  fococnv2  6847  f1cocnv2  6849  funcoeqres  6852  fcoinver  32960  tocyc01  33447  cocnv  38404  frege131d  44518  gricushgr  48710