| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > undisj2 | Structured version Visualization version GIF version | ||
| Description: The union of disjoint classes is disjoint. (Contributed by NM, 13-Sep-2004.) |
| Ref | Expression |
|---|---|
| undisj2 | ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ (𝐴 ∩ 𝐶) = ∅) ↔ (𝐴 ∩ (𝐵 ∪ 𝐶)) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | un00 4396 | . 2 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ (𝐴 ∩ 𝐶) = ∅) ↔ ((𝐴 ∩ 𝐵) ∪ (𝐴 ∩ 𝐶)) = ∅) | |
| 2 | indi 4234 | . . 3 ⊢ (𝐴 ∩ (𝐵 ∪ 𝐶)) = ((𝐴 ∩ 𝐵) ∪ (𝐴 ∩ 𝐶)) | |
| 3 | 2 | eqeq1i 2766 | . 2 ⊢ ((𝐴 ∩ (𝐵 ∪ 𝐶)) = ∅ ↔ ((𝐴 ∩ 𝐵) ∪ (𝐴 ∩ 𝐶)) = ∅) |
| 4 | 1, 3 | bitr4i 280 | 1 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ (𝐴 ∩ 𝐶) = ∅) ↔ (𝐴 ∩ (𝐵 ∪ 𝐶)) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∧ wa 399 = wceq 1559 ∪ cun 3900 ∩ cin 3901 ∅c0 4283 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 |
| This theorem is referenced by: disjtp2 4672 f1oun2prg 14924 cnfldfunALT 21427 dfttc4lem2 36850 |
| Copyright terms: Public domain | W3C validator |