| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > disjne | 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 3540 | . . 3 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵) | |
| 2 | eleq1 2292 | . . . . . 6 ⊢ (𝑥 = 𝐶 → (𝑥 ∈ 𝐵 ↔ 𝐶 ∈ 𝐵)) | |
| 3 | 2 | notbid 671 | . . . . 5 ⊢ (𝑥 = 𝐶 → (¬ 𝑥 ∈ 𝐵 ↔ ¬ 𝐶 ∈ 𝐵)) |
| 4 | 3 | rspccva 2906 | . . . 4 ⊢ ((∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵 ∧ 𝐶 ∈ 𝐴) → ¬ 𝐶 ∈ 𝐵) |
| 5 | eleq1a 2301 | . . . . 5 ⊢ (𝐷 ∈ 𝐵 → (𝐶 = 𝐷 → 𝐶 ∈ 𝐵)) | |
| 6 | 5 | necon3bd 2443 | . . . 4 ⊢ (𝐷 ∈ 𝐵 → (¬ 𝐶 ∈ 𝐵 → 𝐶 ≠ 𝐷)) |
| 7 | 4, 6 | syl5com 29 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵 ∧ 𝐶 ∈ 𝐴) → (𝐷 ∈ 𝐵 → 𝐶 ≠ 𝐷)) |
| 8 | 1, 7 | sylanb 284 | . 2 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ 𝐶 ∈ 𝐴) → (𝐷 ∈ 𝐵 → 𝐶 ≠ 𝐷)) |
| 9 | 8 | 3impia 1224 | 1 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → 𝐶 ≠ 𝐷) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ≠ wne 2400 ∀wral 2508 ∩ cin 3196 ∅c0 3491 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-v 2801 df-dif 3199 df-in 3203 df-nul 3492 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |