Theorem resindm 5105

Description: When restricting a relation, intersecting with the domain of the relation has no effect. (Contributed by FL, 6-Oct-2008.)

Assertion

Ref	Expression
resindm	|- ( Rel A -> ( A |` ( B i^i dom A ) ) = ( A |` B ) )

Proof of Theorem resindm

Step	Hyp	Ref	Expression
1		resdm 5102	. . 3 |- ( Rel A -> ( A |` dom A ) = A )
2	1	ineq2d 3432	. 2 |- ( Rel A -> ( ( A |` B ) i^i ( A |` dom A ) ) = ( ( A |` B ) i^i A ) )
3		resindi 5078	. 2 |- ( A |` ( B i^i dom A ) ) = ( ( A |` B ) i^i ( A |` dom A ) )
4		incom 3421	. . 3 |- ( ( A |` B ) i^i A ) = ( A i^i ( A |` B ) )
5		inres 5080	. . 3 |- ( A i^i ( A |` B ) ) = ( ( A i^i A ) |` B )
6		inidm 3440	. . . 4 |- ( A i^i A ) = A
7	6	reseq1i 5059	. . 3 |- ( ( A i^i A ) |` B ) = ( A |` B )
8	4, 5, 7	3eqtrri 2264	. 2 |- ( A |` B ) = ( ( A |` B ) i^i A )
9	2, 3, 8	3eqtr4g 2296	1 |- ( Rel A -> ( A |` ( B i^i dom A ) ) = ( A |` B ) )

This proof depends on syntax axioms:   -> wi 4   = wceq 1402   i^i cin 3219   dom cdm 4774   |` cres 4776   Rel wrel 4779

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-xp 4780  df-rel 4781  df-dm 4784  df-res 4786

This theorem is used by:  resdmdfsn  5106