Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  necon4addc GIF version

Theorem necon4addc 2378
 Description: Contrapositive inference for inequality. (Contributed by Jim Kingdon, 17-May-2018.)
Hypothesis
Ref Expression
necon4addc.1 (𝜑 → (DECID 𝐴 = 𝐵 → (𝐴𝐵 → ¬ 𝜓)))
Assertion
Ref Expression
necon4addc (𝜑 → (DECID 𝐴 = 𝐵 → (𝜓𝐴 = 𝐵)))

Proof of Theorem necon4addc
StepHypRef Expression
1 necon4addc.1 . 2 (𝜑 → (DECID 𝐴 = 𝐵 → (𝐴𝐵 → ¬ 𝜓)))
2 df-ne 2309 . . . 4 (𝐴𝐵 ↔ ¬ 𝐴 = 𝐵)
32imbi1i 237 . . 3 ((𝐴𝐵 → ¬ 𝜓) ↔ (¬ 𝐴 = 𝐵 → ¬ 𝜓))
4 condc 838 . . 3 (DECID 𝐴 = 𝐵 → ((¬ 𝐴 = 𝐵 → ¬ 𝜓) → (𝜓𝐴 = 𝐵)))
53, 4syl5bi 151 . 2 (DECID 𝐴 = 𝐵 → ((𝐴𝐵 → ¬ 𝜓) → (𝜓𝐴 = 𝐵)))
61, 5sylcom 28 1 (𝜑 → (DECID 𝐴 = 𝐵 → (𝜓𝐴 = 𝐵)))
 Colors of variables: wff set class Syntax hints:  ¬ wn 3   → wi 4  DECID wdc 819   = wceq 1331   ≠ wne 2308 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 603  ax-in2 604  ax-io 698 This theorem depends on definitions:  df-bi 116  df-stab 816  df-dc 820  df-ne 2309 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator