Theorem otthne 5432

Description: Contrapositive of the ordered triple theorem. (Contributed by Scott Fenton, 31-Jan-2025.)

Hypotheses

Ref	Expression
otthne.1	⊢ 𝐴 ∈ V
otthne.2	⊢ 𝐵 ∈ V
otthne.3	⊢ 𝐶 ∈ V

Assertion

Ref	Expression
otthne	⊢ (⟨𝐴, 𝐵, 𝐶⟩ ≠ ⟨𝐷, 𝐸, 𝐹⟩ ↔ (𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐸 ∨ 𝐶 ≠ 𝐹))

Proof of Theorem otthne

Step	Hyp	Ref	Expression
1		otthne.1	. . . . 5 ⊢ 𝐴 ∈ V
2		otthne.2	. . . . 5 ⊢ 𝐵 ∈ V
3		otthne.3	. . . . 5 ⊢ 𝐶 ∈ V
4	1, 2, 3	otth 5430	. . . 4 ⊢ (⟨𝐴, 𝐵, 𝐶⟩ = ⟨𝐷, 𝐸, 𝐹⟩ ↔ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹))
5	4	notbii 320	. . 3 ⊢ (¬ ⟨𝐴, 𝐵, 𝐶⟩ = ⟨𝐷, 𝐸, 𝐹⟩ ↔ ¬ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹))
6		3ianor 1106	. . 3 ⊢ (¬ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹) ↔ (¬ 𝐴 = 𝐷 ∨ ¬ 𝐵 = 𝐸 ∨ ¬ 𝐶 = 𝐹))
7	5, 6	bitri 275	. 2 ⊢ (¬ ⟨𝐴, 𝐵, 𝐶⟩ = ⟨𝐷, 𝐸, 𝐹⟩ ↔ (¬ 𝐴 = 𝐷 ∨ ¬ 𝐵 = 𝐸 ∨ ¬ 𝐶 = 𝐹))
8		df-ne 2931	. 2 ⊢ (⟨𝐴, 𝐵, 𝐶⟩ ≠ ⟨𝐷, 𝐸, 𝐹⟩ ↔ ¬ ⟨𝐴, 𝐵, 𝐶⟩ = ⟨𝐷, 𝐸, 𝐹⟩)
9		df-ne 2931	. . 3 ⊢ (𝐴 ≠ 𝐷 ↔ ¬ 𝐴 = 𝐷)
10		df-ne 2931	. . 3 ⊢ (𝐵 ≠ 𝐸 ↔ ¬ 𝐵 = 𝐸)
11		df-ne 2931	. . 3 ⊢ (𝐶 ≠ 𝐹 ↔ ¬ 𝐶 = 𝐹)
12	9, 10, 11	3orbi123i 1156	. 2 ⊢ ((𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐸 ∨ 𝐶 ≠ 𝐹) ↔ (¬ 𝐴 = 𝐷 ∨ ¬ 𝐵 = 𝐸 ∨ ¬ 𝐶 = 𝐹))
13	7, 8, 12	3bitr4i 303	1 ⊢ (⟨𝐴, 𝐵, 𝐶⟩ ≠ ⟨𝐷, 𝐸, 𝐹⟩ ↔ (𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐸 ∨ 𝐶 ≠ 𝐹))

Syntax hints:  ¬ wn 3   ↔ wb 206   ∨ w3o 1085   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   ≠ wne 2930  Vcvv 3438  ⟨cotp 4586

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-ne 2931  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-ot 4587

This theorem is referenced by:  xpord3lem  8089  xpord3pred  8092  xpord3inddlem  8094