| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > in4 | Structured version Visualization version GIF version | ||
| Description: Rearrangement of intersection of 4 classes. (Contributed by NM, 21-Apr-2001.) |
| Ref | Expression |
|---|---|
| in4 | ⊢ ((𝐴 ∩ 𝐵) ∩ (𝐶 ∩ 𝐷)) = ((𝐴 ∩ 𝐶) ∩ (𝐵 ∩ 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | in12 4182 | . . 3 ⊢ (𝐵 ∩ (𝐶 ∩ 𝐷)) = (𝐶 ∩ (𝐵 ∩ 𝐷)) | |
| 2 | 1 | ineq2i 4170 | . 2 ⊢ (𝐴 ∩ (𝐵 ∩ (𝐶 ∩ 𝐷))) = (𝐴 ∩ (𝐶 ∩ (𝐵 ∩ 𝐷))) |
| 3 | inass 4181 | . 2 ⊢ ((𝐴 ∩ 𝐵) ∩ (𝐶 ∩ 𝐷)) = (𝐴 ∩ (𝐵 ∩ (𝐶 ∩ 𝐷))) | |
| 4 | inass 4181 | . 2 ⊢ ((𝐴 ∩ 𝐶) ∩ (𝐵 ∩ 𝐷)) = (𝐴 ∩ (𝐶 ∩ (𝐵 ∩ 𝐷))) | |
| 5 | 2, 3, 4 | 3eqtr4i 2770 | 1 ⊢ ((𝐴 ∩ 𝐵) ∩ (𝐶 ∩ 𝐷)) = ((𝐴 ∩ 𝐶) ∩ (𝐵 ∩ 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∩ cin 3901 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3401 df-v 3443 df-in 3909 |
| This theorem is referenced by: inindi 4188 inindir 4189 fh2 31677 disjxpin 32645 |
| Copyright terms: Public domain | W3C validator |