Theorem necon1i 2989

Description: Contrapositive inference for inequality. (Contributed by NM, 18-Mar-2007.)

Hypothesis

Ref	Expression
necon1i.1	⊢ (𝐴 ≠ 𝐵 → 𝐶 = 𝐷)

Assertion

Ref	Expression
necon1i	⊢ (𝐶 ≠ 𝐷 → 𝐴 = 𝐵)

Proof of Theorem necon1i

Step	Hyp	Ref	Expression
1		df-ne 2957	. . 3 ⊢ (𝐴 ≠ 𝐵 ↔ ¬ 𝐴 = 𝐵)
2		necon1i.1	. . 3 ⊢ (𝐴 ≠ 𝐵 → 𝐶 = 𝐷)
3	1, 2	sylbir 238	. 2 ⊢ (¬ 𝐴 = 𝐵 → 𝐶 = 𝐷)
4	3	necon1ai 2983	1 ⊢ (𝐶 ≠ 𝐷 → 𝐴 = 𝐵)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = 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)