| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > disjel | Structured version Visualization version GIF version | ||
| Description: A set can't belong to both members of disjoint classes. (Contributed by NM, 28-Feb-2015.) |
| Ref | Expression |
|---|---|
| disjel | ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ 𝐶 ∈ 𝐴) → ¬ 𝐶 ∈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | disj3 4404 | . . 3 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐴 = (𝐴 ∖ 𝐵)) | |
| 2 | eleq2 2820 | . . . 4 ⊢ (𝐴 = (𝐴 ∖ 𝐵) → (𝐶 ∈ 𝐴 ↔ 𝐶 ∈ (𝐴 ∖ 𝐵))) | |
| 3 | eldifn 4082 | . . . 4 ⊢ (𝐶 ∈ (𝐴 ∖ 𝐵) → ¬ 𝐶 ∈ 𝐵) | |
| 4 | 2, 3 | biimtrdi 253 | . . 3 ⊢ (𝐴 = (𝐴 ∖ 𝐵) → (𝐶 ∈ 𝐴 → ¬ 𝐶 ∈ 𝐵)) |
| 5 | 1, 4 | sylbi 217 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐶 ∈ 𝐴 → ¬ 𝐶 ∈ 𝐵)) |
| 6 | 5 | imp 406 | 1 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ 𝐶 ∈ 𝐴) → ¬ 𝐶 ∈ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ∖ cdif 3899 ∩ cin 3901 ∅c0 4283 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-ral 3048 df-v 3438 df-dif 3905 df-in 3909 df-nul 4284 |
| This theorem is referenced by: disjxun 5089 fvun1 6913 dedekindle 11274 fprodsplit 15870 unelldsys 34166 dvasin 37743 |
| Copyright terms: Public domain | W3C validator |