Theorem necon4bid 3001

Description: Contrapositive law deduction for inequality. (Contributed by NM, 29-Jun-2007.)

Hypothesis

Ref	Expression
necon4bid.1	⊢ (𝜑 → (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷))

Assertion

Ref	Expression
necon4bid	⊢ (𝜑 → (𝐴 = 𝐵 ↔ 𝐶 = 𝐷))

Proof of Theorem necon4bid

Step	Hyp	Ref	Expression
1		necon4bid.1	. . 3 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷))
2	1	necon2bbid 2999	. 2 ⊢ (𝜑 → (𝐶 = 𝐷 ↔ ¬ 𝐴 ≠ 𝐵))
3		nne 2960	. 2 ⊢ (¬ 𝐴 ≠ 𝐵 ↔ 𝐴 = 𝐵)
4	2, 3	bitr2di 291	1 ⊢ (𝜑 → (𝐴 = 𝐵 ↔ 𝐶 = 𝐷))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   = 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-ne 2957

This theorem is used by:  nebi  3036  rpexp  16898  norm-i  31731  trlid0b  41235  oduoppcciso  50673