Theorem necon1bbid 3000

Description: Contrapositive inference for inequality. (Contributed by NM, 31-Jan-2008.)

Hypothesis

Ref	Expression
necon1bbid.1	⊢ (𝜑 → (𝐴 ≠ 𝐵 ↔ 𝜓))

Assertion

Ref	Expression
necon1bbid	⊢ (𝜑 → (¬ 𝜓 ↔ 𝐴 = 𝐵))

Proof of Theorem necon1bbid

Step	Hyp	Ref	Expression
1		df-ne 2962	. . 3 ⊢ (𝐴 ≠ 𝐵 ↔ ¬ 𝐴 = 𝐵)
2		necon1bbid.1	. . 3 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ↔ 𝜓))
3	1, 2	bitr3id 288	. 2 ⊢ (𝜑 → (¬ 𝐴 = 𝐵 ↔ 𝜓))
4	3	con1bid 358	1 ⊢ (𝜑 → (¬ 𝜓 ↔ 𝐴 = 𝐵))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   = wceq 1570   ≠ wne 2961

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 2962

This theorem is used by:  necon4abid  3001  blssioo  24989  metdstri  25046  rrxmvallem  25600  dchrpt  27468  lgsquad3  27588  eupth2lem2  30607  lkrpssN  39978  dochshpsat  42269  aks6d1c6lem3  42980