Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nonconne | Structured version Visualization version GIF version |
Description: Law of noncontradiction with equality and inequality. (Contributed by NM, 3-Feb-2012.) (Proof shortened by Wolf Lammen, 21-Dec-2019.) |
Ref | Expression |
---|---|
nonconne | ⊢ ¬ (𝐴 = 𝐵 ∧ 𝐴 ≠ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fal 1553 | . 2 ⊢ ¬ ⊥ | |
2 | eqneqall 2953 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ≠ 𝐵 → ⊥)) | |
3 | 2 | imp 406 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐴 ≠ 𝐵) → ⊥) |
4 | 1, 3 | mto 196 | 1 ⊢ ¬ (𝐴 = 𝐵 ∧ 𝐴 ≠ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ wa 395 = wceq 1539 ⊥wfal 1551 ≠ wne 2942 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1542 df-fal 1552 df-ne 2943 |
This theorem is referenced by: frxp2 33718 osumcllem11N 37907 pexmidlem8N 37918 dochexmidlem8 39408 |
Copyright terms: Public domain | W3C validator |