Theorem coires1 6110

Description: Composition with a restricted identity relation. (Contributed by FL, 19-Jun-2011.) (Revised by Stefan O'Rear, 7-Mar-2015.)

Assertion

Ref	Expression
coires1	⊢ (𝐴 ∘ ( I ↾ 𝐵)) = (𝐴 ↾ 𝐵)

Proof of Theorem coires1

Step	Hyp	Ref	Expression
1		cocnvcnv1 6103	. . . . 5 ⊢ (◡◡𝐴 ∘ I ) = (𝐴 ∘ I )
2		relcnv 5960	. . . . . 6 ⊢ Rel ◡◡𝐴
3		coi1 6108	. . . . . 6 ⊢ (Rel ◡◡𝐴 → (◡◡𝐴 ∘ I ) = ◡◡𝐴)
4	2, 3	ax-mp 5	. . . . 5 ⊢ (◡◡𝐴 ∘ I ) = ◡◡𝐴
5	1, 4	eqtr3i 2844	. . . 4 ⊢ (𝐴 ∘ I ) = ◡◡𝐴
6	5	reseq1i 5842	. . 3 ⊢ ((𝐴 ∘ I ) ↾ 𝐵) = (◡◡𝐴 ↾ 𝐵)
7		resco 6096	. . 3 ⊢ ((𝐴 ∘ I ) ↾ 𝐵) = (𝐴 ∘ ( I ↾ 𝐵))
8	6, 7	eqtr3i 2844	. 2 ⊢ (◡◡𝐴 ↾ 𝐵) = (𝐴 ∘ ( I ↾ 𝐵))
9		rescnvcnv 6054	. 2 ⊢ (◡◡𝐴 ↾ 𝐵) = (𝐴 ↾ 𝐵)
10	8, 9	eqtr3i 2844	1 ⊢ (𝐴 ∘ ( I ↾ 𝐵)) = (𝐴 ↾ 𝐵)

Syntax hints:   = wceq 1531   I cid 5452  ^◡ccnv 5547   ↾ cres 5550   ∘ ccom 5552  Rel wrel 5553

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791  ax-sep 5194  ax-nul 5201  ax-pr 5320

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ral 3141  df-rex 3142  df-rab 3145  df-v 3495  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-nul 4290  df-if 4466  df-sn 4560  df-pr 4562  df-op 4566  df-br 5058  df-opab 5120  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560

This theorem is referenced by:  relcoi1  6122  funcoeqres  6638  relexpaddg  14404  psrass1lem  20149  lindfres  20959  lindsmm  20964  kgencn2  22157  ustssco  22815  symgcom  30720  cycpmconjv  30777  cycpmconjslem1  30789  erdsze2lem2  32444  poimirlem9  34893  mzpresrename  39337  diophrw  39346  eldioph2  39349  diophren  39400  relexpiidm  40039  relexpaddss  40053  cotrclrcl  40077  funcrngcsetcALT  44260