Theorem resindir 5413

Description: Class restriction distributes over intersection. (Contributed by NM, 18-Dec-2008.)

Assertion

Ref	Expression
resindir	|- ( ( A i^i B ) |` C ) = ( ( A |` C ) i^i ( B |` C ) )

Proof of Theorem resindir

Step	Hyp	Ref	Expression
1		inindir 3831	. 2 |- ( ( A i^i B ) i^i ( C X. _V ) ) = ( ( A i^i ( C X. _V ) ) i^i ( B i^i ( C X. _V ) ) )
2		df-res 5126	. 2 |- ( ( A i^i B ) |` C ) = ( ( A i^i B ) i^i ( C X. _V ) )
3		df-res 5126	. . 3 |- ( A |` C ) = ( A i^i ( C X. _V ) )
4		df-res 5126	. . 3 |- ( B |` C ) = ( B i^i ( C X. _V ) )
5	3, 4	ineq12i 3812	. 2 |- ( ( A |` C ) i^i ( B |` C ) ) = ( ( A i^i ( C X. _V ) ) i^i ( B i^i ( C X. _V ) ) )
6	1, 2, 5	3eqtr4i 2654	1 |- ( ( A i^i B ) |` C ) = ( ( A |` C ) i^i ( B |` C ) )

Syntax hints:   = wceq 1483   _Vcvv 3200   i^i cin 3573   X. cxp 5112   |` cres 5116

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-v 3202  df-in 3581  df-res 5126

This theorem is referenced by:  inimass  5549  fnreseql  6327