Metamath Proof Explorer


Theorem resundi

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

Ref Expression
Assertion resundi A B C = A B A C

Proof

Step Hyp Ref Expression
1 xpundir B C × V = B × V C × V
2 1 ineq2i A B C × V = A B × V C × V
3 indi A B × V C × V = A B × V A C × V
4 2 3 eqtri A B C × V = A B × V A C × V
5 df-res A B C = A B C × V
6 df-res A B = A B × V
7 df-res A C = A C × V
8 6 7 uneq12i A B A C = A B × V A C × V
9 4 5 8 3eqtr4i A B C = A B A C