| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > disjeq0 | Structured version Visualization version GIF version | ||
| Description: Two disjoint sets are equal iff both are empty. (Contributed by AV, 19-Jun-2022.) |
| Ref | Expression |
|---|---|
| disjeq0 | ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐴 = 𝐵 ↔ (𝐴 = ∅ ∧ 𝐵 = ∅))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ineq1 4112 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐵)) | |
| 2 | inidm 4125 | . . . . . 6 ⊢ (𝐵 ∩ 𝐵) = 𝐵 | |
| 3 | 1, 2 | eqtrdi 2817 | . . . . 5 ⊢ (𝐴 = 𝐵 → (𝐴 ∩ 𝐵) = 𝐵) |
| 4 | 3 | eqeq1d 2768 | . . . 4 ⊢ (𝐴 = 𝐵 → ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐵 = ∅)) |
| 5 | eqtr 2786 | . . . . . 6 ⊢ ((𝐴 = 𝐵 ∧ 𝐵 = ∅) → 𝐴 = ∅) | |
| 6 | simpr 490 | . . . . . 6 ⊢ ((𝐴 = 𝐵 ∧ 𝐵 = ∅) → 𝐵 = ∅) | |
| 7 | 5, 6 | jca 521 | . . . . 5 ⊢ ((𝐴 = 𝐵 ∧ 𝐵 = ∅) → (𝐴 = ∅ ∧ 𝐵 = ∅)) |
| 8 | 7 | ex 418 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝐵 = ∅ → (𝐴 = ∅ ∧ 𝐵 = ∅))) |
| 9 | 4, 8 | sylbid 243 | . . 3 ⊢ (𝐴 = 𝐵 → ((𝐴 ∩ 𝐵) = ∅ → (𝐴 = ∅ ∧ 𝐵 = ∅))) |
| 10 | 9 | com12 33 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐴 = 𝐵 → (𝐴 = ∅ ∧ 𝐵 = ∅))) |
| 11 | eqtr3 2788 | . 2 ⊢ ((𝐴 = ∅ ∧ 𝐵 = ∅) → 𝐴 = 𝐵) | |
| 12 | 10, 11 | impbid1 228 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐴 = 𝐵 ↔ (𝐴 = ∅ ∧ 𝐵 = ∅))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1572 ∩ cin 4091 ∅c0 4280 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1575 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-rab 3416 df-v 3455 df-in 4093 |
| This theorem is used by: epnsym 9646 erscottd 35885 |
| Copyright terms: Public domain | W3C validator |