Theorem nebidc 2325

Description: Contraposition law for inequality. (Contributed by Jim Kingdon, 19-May-2018.)

Assertion

Ref	Expression
nebidc	⊢ (DECID 𝐴 = 𝐵 → (DECID 𝐶 = 𝐷 → ((𝐴 = 𝐵 ↔ 𝐶 = 𝐷) ↔ (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷))))

Proof of Theorem nebidc

Step	Hyp	Ref	Expression
1		id 19	. . . 4 ⊢ ((𝐴 = 𝐵 ↔ 𝐶 = 𝐷) → (𝐴 = 𝐵 ↔ 𝐶 = 𝐷))
2	1	necon3bid 2286	. . 3 ⊢ ((𝐴 = 𝐵 ↔ 𝐶 = 𝐷) → (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷))
3		id 19	. . . . . . . 8 ⊢ ((𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷) → (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷))
4	3	a1d 22	. . . . . . 7 ⊢ ((𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷) → (DECID 𝐶 = 𝐷 → (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷)))
5	4	a1d 22	. . . . . 6 ⊢ ((𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷) → (DECID 𝐴 = 𝐵 → (DECID 𝐶 = 𝐷 → (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷))))
6	5	necon4biddc 2320	. . . . 5 ⊢ ((𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷) → (DECID 𝐴 = 𝐵 → (DECID 𝐶 = 𝐷 → (𝐴 = 𝐵 ↔ 𝐶 = 𝐷))))
7	6	com3l 80	. . . 4 ⊢ (DECID 𝐴 = 𝐵 → (DECID 𝐶 = 𝐷 → ((𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷) → (𝐴 = 𝐵 ↔ 𝐶 = 𝐷))))
8	7	imp 122	. . 3 ⊢ ((DECID 𝐴 = 𝐵 ∧ DECID 𝐶 = 𝐷) → ((𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷) → (𝐴 = 𝐵 ↔ 𝐶 = 𝐷)))
9	2, 8	impbid2 141	. 2 ⊢ ((DECID 𝐴 = 𝐵 ∧ DECID 𝐶 = 𝐷) → ((𝐴 = 𝐵 ↔ 𝐶 = 𝐷) ↔ (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷)))
10	9	ex 113	1 ⊢ (DECID 𝐴 = 𝐵 → (DECID 𝐶 = 𝐷 → ((𝐴 = 𝐵 ↔ 𝐶 = 𝐷) ↔ (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷))))

Syntax hints:   → wi 4   ∧ wa 102   ↔ wb 103  DECID wdc 775   = wceq 1284   ≠ wne 2245

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662

This theorem depends on definitions:  df-bi 115  df-dc 776  df-ne 2246

This theorem is referenced by:  rpexp  10532