Theorem necon1aidc 2387

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

Hypothesis

Ref	Expression
necon1aidc.1	⊢ (DECID 𝜑 → (¬ 𝜑 → 𝐴 = 𝐵))

Assertion

Ref	Expression
necon1aidc	⊢ (DECID 𝜑 → (𝐴 ≠ 𝐵 → 𝜑))

Proof of Theorem necon1aidc

Step	Hyp	Ref	Expression
1		df-ne 2337	. 2 ⊢ (𝐴 ≠ 𝐵 ↔ ¬ 𝐴 = 𝐵)
2		necon1aidc.1	. . 3 ⊢ (DECID 𝜑 → (¬ 𝜑 → 𝐴 = 𝐵))
3		con1dc 846	. . 3 ⊢ (DECID 𝜑 → ((¬ 𝜑 → 𝐴 = 𝐵) → (¬ 𝐴 = 𝐵 → 𝜑)))
4	2, 3	mpd 13	. 2 ⊢ (DECID 𝜑 → (¬ 𝐴 = 𝐵 → 𝜑))
5	1, 4	syl5bi 151	1 ⊢ (DECID 𝜑 → (𝐴 ≠ 𝐵 → 𝜑))

Syntax hints:  ¬ wn 3   → wi 4  DECID wdc 824   = wceq 1343   ≠ wne 2336

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699

This theorem depends on definitions:  df-bi 116  df-stab 821  df-dc 825  df-ne 2337

This theorem is referenced by:  necon1idc  2389  lgsne0  13579