Theorem necon4ddc 2439

Description: Contrapositive inference for inequality. (Contributed by Jim Kingdon, 17-May-2018.)

Hypothesis

Ref	Expression
necon4ddc.1	⊢ (𝜑 → (DECID 𝐴 = 𝐵 → (𝐴 ≠ 𝐵 → 𝐶 ≠ 𝐷)))

Assertion

Ref	Expression
necon4ddc	⊢ (𝜑 → (DECID 𝐴 = 𝐵 → (𝐶 = 𝐷 → 𝐴 = 𝐵)))

Proof of Theorem necon4ddc

Step	Hyp	Ref	Expression
1		necon4ddc.1	. . 3 ⊢ (𝜑 → (DECID 𝐴 = 𝐵 → (𝐴 ≠ 𝐵 → 𝐶 ≠ 𝐷)))
2		df-ne 2368	. . . 4 ⊢ (𝐴 ≠ 𝐵 ↔ ¬ 𝐴 = 𝐵)
3		df-ne 2368	. . . 4 ⊢ (𝐶 ≠ 𝐷 ↔ ¬ 𝐶 = 𝐷)
4	2, 3	imbi12i 239	. . 3 ⊢ ((𝐴 ≠ 𝐵 → 𝐶 ≠ 𝐷) ↔ (¬ 𝐴 = 𝐵 → ¬ 𝐶 = 𝐷))
5	1, 4	imbitrdi 161	. 2 ⊢ (𝜑 → (DECID 𝐴 = 𝐵 → (¬ 𝐴 = 𝐵 → ¬ 𝐶 = 𝐷)))
6		condc 854	. 2 ⊢ (DECID 𝐴 = 𝐵 → ((¬ 𝐴 = 𝐵 → ¬ 𝐶 = 𝐷) → (𝐶 = 𝐷 → 𝐴 = 𝐵)))
7	5, 6	sylcom 28	1 ⊢ (𝜑 → (DECID 𝐴 = 𝐵 → (𝐶 = 𝐷 → 𝐴 = 𝐵)))

Syntax hints:  ¬ wn 3   → wi 4  DECID wdc 835   = wceq 1364   ≠ wne 2367

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710

This theorem depends on definitions:  df-bi 117  df-stab 832  df-dc 836  df-ne 2368

This theorem is referenced by: (None)