Theorem resundi 4981

Description: Distributive law for restriction over union. Theorem 31 of [Suppes] p. 65. (Contributed by NM, 30-Sep-2002.)

Assertion

Ref	Expression
resundi	|- ( A |` ( B u. C ) ) = ( ( A |` B ) u. ( A |` C ) )

Proof of Theorem resundi

Step	Hyp	Ref	Expression
1		xpundir 4740	. . . 4 |- ( ( B u. C ) X. _V ) = ( ( B X. _V ) u. ( C X. _V ) )
2	1	ineq2i 3375	. . 3 |- ( A i^i ( ( B u. C ) X. _V ) ) = ( A i^i ( ( B X. _V ) u. ( C X. _V ) ) )
3		indi 3424	. . 3 |- ( A i^i ( ( B X. _V ) u. ( C X. _V ) ) ) = ( ( A i^i ( B X. _V ) ) u. ( A i^i ( C X. _V ) ) )
4	2, 3	eqtri 2227	. 2 |- ( A i^i ( ( B u. C ) X. _V ) ) = ( ( A i^i ( B X. _V ) ) u. ( A i^i ( C X. _V ) ) )
5		df-res 4695	. 2 |- ( A |` ( B u. C ) ) = ( A i^i ( ( B u. C ) X. _V ) )
6		df-res 4695	. . 3 |- ( A |` B ) = ( A i^i ( B X. _V ) )
7		df-res 4695	. . 3 |- ( A |` C ) = ( A i^i ( C X. _V ) )
8	6, 7	uneq12i 3329	. 2 |- ( ( A |` B ) u. ( A |` C ) ) = ( ( A i^i ( B X. _V ) ) u. ( A i^i ( C X. _V ) ) )
9	4, 5, 8	3eqtr4i 2237	1 |- ( A |` ( B u. C ) ) = ( ( A |` B ) u. ( A |` C ) )

Syntax hints:   = wceq 1373   _Vcvv 2773   u. cun 3168   i^i cin 3169   X. cxp 4681   |` cres 4685

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2188

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-v 2775  df-un 3174  df-in 3176  df-opab 4114  df-xp 4689  df-res 4695

This theorem is referenced by:  imaundi  5104  relresfld  5221  relcoi1  5223  resasplitss  5467  fnsnsplitss  5796  fnsnsplitdc  6604  fnfi  7053  fseq1p1m1  10236  resunimafz0  10998