| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > undisj1 | Structured version Visualization version GIF version | ||
| Description: The union of disjoint classes is disjoint. (Contributed by NM, 26-Sep-2004.) |
| Ref | Expression |
|---|---|
| undisj1 | ⊢ (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐶) = ∅) ↔ ((𝐴 ∪ 𝐵) ∩ 𝐶) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | un00 4399 | . 2 ⊢ (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐶) = ∅) ↔ ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) = ∅) | |
| 2 | indir 4240 | . . 3 ⊢ ((𝐴 ∪ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) | |
| 3 | 2 | eqeq1i 2742 | . 2 ⊢ (((𝐴 ∪ 𝐵) ∩ 𝐶) = ∅ ↔ ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) = ∅) |
| 4 | 1, 3 | bitr4i 278 | 1 ⊢ (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐶) = ∅) ↔ ((𝐴 ∪ 𝐵) ∩ 𝐶) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1542 ∪ cun 3901 ∩ cin 3902 ∅c0 4287 |
| 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-or 849 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 |
| This theorem is referenced by: disjtpsn 4674 disjtp2 4675 funtp 6557 prinfzo0 13626 hash7g 14421 f1oun2prg 14852 cnfldfunALT 21336 cnfldfunALTOLD 21349 |
| Copyright terms: Public domain | W3C validator |