Theorem otthne 5455

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 5453	. . . 4 ⊢ (⟨𝐴, 𝐵, 𝐶⟩ = ⟨𝐷, 𝐸, 𝐹⟩ ↔ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹))
5	4	notbii 323	. . 3 ⊢ (¬ ⟨𝐴, 𝐵, 𝐶⟩ = ⟨𝐷, 𝐸, 𝐹⟩ ↔ ¬ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹))
6		3ianor 1124	. . 3 ⊢ (¬ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹) ↔ (¬ 𝐴 = 𝐷 ∨ ¬ 𝐵 = 𝐸 ∨ ¬ 𝐶 = 𝐹))
7	5, 6	bitri 278	. 2 ⊢ (¬ ⟨𝐴, 𝐵, 𝐶⟩ = ⟨𝐷, 𝐸, 𝐹⟩ ↔ (¬ 𝐴 = 𝐷 ∨ ¬ 𝐵 = 𝐸 ∨ ¬ 𝐶 = 𝐹))
8		df-ne 2957	. 2 ⊢ (⟨𝐴, 𝐵, 𝐶⟩ ≠ ⟨𝐷, 𝐸, 𝐹⟩ ↔ ¬ ⟨𝐴, 𝐵, 𝐶⟩ = ⟨𝐷, 𝐸, 𝐹⟩)
9		df-ne 2957	. . 3 ⊢ (𝐴 ≠ 𝐷 ↔ ¬ 𝐴 = 𝐷)
10		df-ne 2957	. . 3 ⊢ (𝐵 ≠ 𝐸 ↔ ¬ 𝐵 = 𝐸)
11		df-ne 2957	. . 3 ⊢ (𝐶 ≠ 𝐹 ↔ ¬ 𝐶 = 𝐹)
12	9, 10, 11	3orbi123i 1174	. 2 ⊢ ((𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐸 ∨ 𝐶 ≠ 𝐹) ↔ (¬ 𝐴 = 𝐷 ∨ ¬ 𝐵 = 𝐸 ∨ ¬ 𝐶 = 𝐹))
13	7, 8, 12	3bitr4i 306	1 ⊢ (⟨𝐴, 𝐵, 𝐶⟩ ≠ ⟨𝐷, 𝐸, 𝐹⟩ ↔ (𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐸 ∨ 𝐶 ≠ 𝐹))

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∨ w3o 1102   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  Vcvv 3451  ⟨cotp 4592

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-ot 4593

This theorem is used by:  xpord3lem  8166  xpord3pred  8169  xpord3inddlem  8171