Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > disjne | Structured version Visualization version GIF version |
Description: Members of disjoint sets are not equal. (Contributed by NM, 28-Mar-2007.) (Proof shortened by Andrew Salmon, 26-Jun-2011.) |
Ref | Expression |
---|---|
disjne | ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → 𝐶 ≠ 𝐷) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | disj 4381 | . . 3 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵) | |
2 | eleq1 2826 | . . . . . 6 ⊢ (𝑥 = 𝐶 → (𝑥 ∈ 𝐵 ↔ 𝐶 ∈ 𝐵)) | |
3 | 2 | notbid 318 | . . . . 5 ⊢ (𝑥 = 𝐶 → (¬ 𝑥 ∈ 𝐵 ↔ ¬ 𝐶 ∈ 𝐵)) |
4 | 3 | rspccva 3560 | . . . 4 ⊢ ((∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵 ∧ 𝐶 ∈ 𝐴) → ¬ 𝐶 ∈ 𝐵) |
5 | eleq1a 2834 | . . . . 5 ⊢ (𝐷 ∈ 𝐵 → (𝐶 = 𝐷 → 𝐶 ∈ 𝐵)) | |
6 | 5 | necon3bd 2957 | . . . 4 ⊢ (𝐷 ∈ 𝐵 → (¬ 𝐶 ∈ 𝐵 → 𝐶 ≠ 𝐷)) |
7 | 4, 6 | syl5com 31 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵 ∧ 𝐶 ∈ 𝐴) → (𝐷 ∈ 𝐵 → 𝐶 ≠ 𝐷)) |
8 | 1, 7 | sylanb 581 | . 2 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ 𝐶 ∈ 𝐴) → (𝐷 ∈ 𝐵 → 𝐶 ≠ 𝐷)) |
9 | 8 | 3impia 1116 | 1 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → 𝐶 ≠ 𝐷) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ∀wral 3064 ∩ cin 3886 ∅c0 4256 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ne 2944 df-ral 3069 df-dif 3890 df-in 3894 df-nul 4257 |
This theorem is referenced by: brdom7disj 10287 brdom6disj 10288 frlmssuvc1 21001 f1resrcmplf1dlem 33058 kelac1 40888 |
Copyright terms: Public domain | W3C validator |