Theorem nebi 3036

Description: Contraposition law for inequality. (Contributed by NM, 28-Dec-2008.)

Assertion

Ref	Expression
nebi	⊢ ((𝐴 = 𝐵 ↔ 𝐶 = 𝐷) ↔ (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷))

Proof of Theorem nebi

Step	Hyp	Ref	Expression
1		id 23	. . 3 ⊢ ((𝐴 = 𝐵 ↔ 𝐶 = 𝐷) → (𝐴 = 𝐵 ↔ 𝐶 = 𝐷))
2	1	necon3bid 3000	. 2 ⊢ ((𝐴 = 𝐵 ↔ 𝐶 = 𝐷) → (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷))
3		id 23	. . 3 ⊢ ((𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷) → (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷))
4	3	necon4bid 3001	. 2 ⊢ ((𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷) → (𝐴 = 𝐵 ↔ 𝐶 = 𝐷))
5	2, 4	impbii 212	1 ⊢ ((𝐴 = 𝐵 ↔ 𝐶 = 𝐷) ↔ (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷))

This proof depends on syntax axioms:   ↔ 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: (None)