| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > exmidne | Structured version Visualization version GIF version | ||
| Description: Excluded middle with equality and inequality. (Contributed by NM, 3-Feb-2012.) (Proof shortened by Wolf Lammen, 17-Nov-2019.) |
| Ref | Expression |
|---|---|
| exmidne | ⊢ (𝐴 = 𝐵 ∨ 𝐴 ≠ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | neqne 2972 | . 2 ⊢ (¬ 𝐴 = 𝐵 → 𝐴 ≠ 𝐵) | |
| 2 | 1 | orri 875 | 1 ⊢ (𝐴 = 𝐵 ∨ 𝐴 ≠ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ∨ wo 860 = wceq 1567 ≠ wne 2964 |
| 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 210 df-or 861 df-ne 2965 |
| This theorem is referenced by: elnn1uz2 12945 hashv01gt1 14377 numclwwlk3lem2lem 30671 fconst7v 32902 hashxpe 33089 drngmxidlr 33701 constrfin 34077 constrelextdg2 34078 subfacp1lem6 35572 tendoeq2 41433 ax6e2ndeqVD 45502 ax6e2ndeqALT 45524 |
| Copyright terms: Public domain | W3C validator |