Theorem resundi 4956

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 4717	. . . 4 |- ( ( B u. C ) X. _V ) = ( ( B X. _V ) u. ( C X. _V ) )
2	1	ineq2i 3358	. . 3 |- ( A i^i ( ( B u. C ) X. _V ) ) = ( A i^i ( ( B X. _V ) u. ( C X. _V ) ) )
3		indi 3407	. . 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 2214	. 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 4672	. 2 |- ( A |` ( B u. C ) ) = ( A i^i ( ( B u. C ) X. _V ) )
6		df-res 4672	. . 3 |- ( A |` B ) = ( A i^i ( B X. _V ) )
7		df-res 4672	. . 3 |- ( A |` C ) = ( A i^i ( C X. _V ) )
8	6, 7	uneq12i 3312	. 2 |- ( ( A |` B ) u. ( A |` C ) ) = ( ( A i^i ( B X. _V ) ) u. ( A i^i ( C X. _V ) ) )
9	4, 5, 8	3eqtr4i 2224	1 |- ( A |` ( B u. C ) ) = ( ( A |` B ) u. ( A |` C ) )

Syntax hints:   = wceq 1364   _Vcvv 2760   u. cun 3152   i^i cin 3153   X. cxp 4658   |` cres 4662

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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-v 2762  df-un 3158  df-in 3160  df-opab 4092  df-xp 4666  df-res 4672

This theorem is referenced by:  imaundi  5079  relresfld  5196  relcoi1  5198  resasplitss  5434  fnsnsplitss  5758  fnsnsplitdc  6560  fnfi  6997  fseq1p1m1  10163  resunimafz0  10905