Theorem exmidne 2966

Description: Excluded middle with equality and inequality. (Contributed by NM, 3-Feb-2012.) (Proof shortened by Wolf Lammen, 17-Nov-2019.)

Assertion

Ref	Expression
exmidne	⊢ (𝐴 = 𝐵 ∨ 𝐴 ≠ 𝐵)

Proof of Theorem exmidne

Step	Hyp	Ref	Expression
1		neqne 2964	. 2 ⊢ (¬ 𝐴 = 𝐵 → 𝐴 ≠ 𝐵)
2	1	orri 876	1 ⊢ (𝐴 = 𝐵 ∨ 𝐴 ≠ 𝐵)

This proof depends on syntax axioms:   ∨ wo 861   = wceq 1570   ≠ wne 2956

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This proof depends on definitions:  df-bi 210  df-or 862  df-ne 2957

This theorem is used by:  elnn1uz2  13045  hashv01gt1  14482  numclwwlk3lem2lem  30977  fconst7v  33207  hashxpe  33392  drngmxidlr  33995  constrfin  34371  constrelextdg2  34372  subfacp1lem6  35929  tendoeq2  41811  ax6e2ndeqVD  45876  ax6e2ndeqALT  45898