| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xpindir | Structured version Visualization version GIF version | ||
| Description: Distributive law for Cartesian product over intersection. Similar to Theorem 102 of [Suppes] p. 52. (Contributed by NM, 26-Sep-2004.) |
| Ref | Expression |
|---|---|
| xpindir | ⊢ ((𝐴 ∩ 𝐵) × 𝐶) = ((𝐴 × 𝐶) ∩ (𝐵 × 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | inxp 5812 | . 2 ⊢ ((𝐴 × 𝐶) ∩ (𝐵 × 𝐶)) = ((𝐴 ∩ 𝐵) × (𝐶 ∩ 𝐶)) | |
| 2 | inidm 4172 | . . 3 ⊢ (𝐶 ∩ 𝐶) = 𝐶 | |
| 3 | 2 | xpeq2i 5682 | . 2 ⊢ ((𝐴 ∩ 𝐵) × (𝐶 ∩ 𝐶)) = ((𝐴 ∩ 𝐵) × 𝐶) |
| 4 | 1, 3 | eqtr2i 2784 | 1 ⊢ ((𝐴 ∩ 𝐵) × 𝐶) = ((𝐴 × 𝐶) ∩ (𝐵 × 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∩ cin 3898 × cxp 5653 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5251 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-opab 5168 df-xp 5661 df-rel 5662 |
| This theorem is used by: resres 5985 resindi 5988 imainrect 6174 resdmres 6228 txhaus 23874 ustund 24449 |
| Copyright terms: Public domain | W3C validator |