| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Distributive law for restriction over union. Theorem 31 of [Suppes] p. 65. |
| Ref | Expression |
|---|---|
| resundi |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xpundir 3226 |
. . . 4
| |
| 2 | 1 | ineq2i 2214 |
. . 3
|
| 3 | indi 2251 |
. . 3
| |
| 4 | 2, 3 | eqtr 1495 |
. 2
|
| 5 | df-res 3190 |
. 2
| |
| 6 | df-res 3190 |
. . 3
| |
| 7 | df-res 3190 |
. . 3
| |
| 8 | 6, 7 | uneq12i 2182 |
. 2
|
| 9 | 4, 5, 8 | 3eqtr4 1505 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: imaun 3460 mapunen 4502 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 962 ax-gen 963 ax-8 964 ax-10 966 ax-12 968 ax-17 971 ax-4 973 ax-5o 975 ax-6o 978 ax-9o 1123 ax-10o 1140 ax-16 1210 ax-11o 1218 ax-ext 1459 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 981 df-sb 1172 df-clab 1464 df-cleq 1469 df-clel 1472 df-v 1812 df-un 2050 df-in 2051 df-opab 2667 df-xp 3184 df-res 3190 |