Theorem mteqand 3017

Description: A modus tollens deduction for inequality. (Contributed by Steven Nguyen, 1-Jun-2023.)

Hypotheses

Ref	Expression
mteqand.1	⊢ (𝜑 → 𝐶 ≠ 𝐷)
mteqand.2	⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐶 = 𝐷)

Assertion

Ref	Expression
mteqand	⊢ (𝜑 → 𝐴 ≠ 𝐵)

Proof of Theorem mteqand

Step	Hyp	Ref	Expression
1		mteqand.1	. . . 4 ⊢ (𝜑 → 𝐶 ≠ 𝐷)
2	1	neneqd 2931	. . 3 ⊢ (𝜑 → ¬ 𝐶 = 𝐷)
3		mteqand.2	. . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐶 = 𝐷)
4	2, 3	mtand 815	. 2 ⊢ (𝜑 → ¬ 𝐴 = 𝐵)
5	4	neqned 2933	1 ⊢ (𝜑 → 𝐴 ≠ 𝐵)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ≠ wne 2926

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 207  df-an 396  df-ne 2927

This theorem is referenced by:  isdrngd  20681  imadrhmcl  20713  fracfld  33265  qsidomlem2  33431  rprmasso  33503  vr1nz  33566  rtelextdg2lem  33723  2sqr3minply  33777  cos9thpiminplylem2  33780  zarcmplem  33878  expeq1d  42319  remul01  42402  remulinvcom  42428  mulgt0b2d  42473  sn-inelr  42482  ricdrng1  42523  prjspersym  42602  prjspreln0  42604  prjspner1  42621  flt0  42632  fltne  42639  eufunc  49515