Theorem ne3anior 2424

Description: A De Morgan's law for inequality. (Contributed by NM, 30-Sep-2013.) (Proof rewritten by Jim Kingdon, 19-May-2018.)

Assertion

Ref	Expression
ne3anior	⊢ ((𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐷 ∧ 𝐸 ≠ 𝐹) ↔ ¬ (𝐴 = 𝐵 ∨ 𝐶 = 𝐷 ∨ 𝐸 = 𝐹))

Proof of Theorem ne3anior

Step	Hyp	Ref	Expression
1		df-ne 2337	. . 3 ⊢ (𝐴 ≠ 𝐵 ↔ ¬ 𝐴 = 𝐵)
2		df-ne 2337	. . 3 ⊢ (𝐶 ≠ 𝐷 ↔ ¬ 𝐶 = 𝐷)
3		df-ne 2337	. . 3 ⊢ (𝐸 ≠ 𝐹 ↔ ¬ 𝐸 = 𝐹)
4	1, 2, 3	3anbi123i 1178	. 2 ⊢ ((𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐷 ∧ 𝐸 ≠ 𝐹) ↔ (¬ 𝐴 = 𝐵 ∧ ¬ 𝐶 = 𝐷 ∧ ¬ 𝐸 = 𝐹))
5		3ioran 983	. 2 ⊢ (¬ (𝐴 = 𝐵 ∨ 𝐶 = 𝐷 ∨ 𝐸 = 𝐹) ↔ (¬ 𝐴 = 𝐵 ∧ ¬ 𝐶 = 𝐷 ∧ ¬ 𝐸 = 𝐹))
6	4, 5	bitr4i 186	1 ⊢ ((𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐷 ∧ 𝐸 ≠ 𝐹) ↔ ¬ (𝐴 = 𝐵 ∨ 𝐶 = 𝐷 ∨ 𝐸 = 𝐹))

Syntax hints:  ¬ wn 3   ↔ wb 104   ∨ w3o 967   ∧ w3a 968   = 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-3or 969  df-3an 970  df-ne 2337

This theorem is referenced by:  eldiftp  3622