Theorem otthg 5431

Description: Ordered triple theorem, closed form. (Contributed by Alexander van der Vekens, 10-Mar-2018.)

Assertion

Ref	Expression
otthg	⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (⟨𝐴, 𝐵, 𝐶⟩ = ⟨𝐷, 𝐸, 𝐹⟩ ↔ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹)))

Proof of Theorem otthg

Step	Hyp	Ref	Expression
1		df-ot 4587	. . 3 ⊢ ⟨𝐴, 𝐵, 𝐶⟩ = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩
2		df-ot 4587	. . 3 ⊢ ⟨𝐷, 𝐸, 𝐹⟩ = ⟨⟨𝐷, 𝐸⟩, 𝐹⟩
3	1, 2	eqeq12i 2752	. 2 ⊢ (⟨𝐴, 𝐵, 𝐶⟩ = ⟨𝐷, 𝐸, 𝐹⟩ ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝐷, 𝐸⟩, 𝐹⟩)
4		opex 5410	. . . . 5 ⊢ ⟨𝐴, 𝐵⟩ ∈ V
5		opthg 5423	. . . . 5 ⊢ ((⟨𝐴, 𝐵⟩ ∈ V ∧ 𝐶 ∈ 𝑊) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝐷, 𝐸⟩, 𝐹⟩ ↔ (⟨𝐴, 𝐵⟩ = ⟨𝐷, 𝐸⟩ ∧ 𝐶 = 𝐹)))
6	4, 5	mpan 690	. . . 4 ⊢ (𝐶 ∈ 𝑊 → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝐷, 𝐸⟩, 𝐹⟩ ↔ (⟨𝐴, 𝐵⟩ = ⟨𝐷, 𝐸⟩ ∧ 𝐶 = 𝐹)))
7		opthg 5423	. . . . . 6 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) → (⟨𝐴, 𝐵⟩ = ⟨𝐷, 𝐸⟩ ↔ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸)))
8	7	anbi1d 631	. . . . 5 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) → ((⟨𝐴, 𝐵⟩ = ⟨𝐷, 𝐸⟩ ∧ 𝐶 = 𝐹) ↔ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐸) ∧ 𝐶 = 𝐹)))
9		df-3an 1088	. . . . 5 ⊢ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹) ↔ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐸) ∧ 𝐶 = 𝐹))
10	8, 9	bitr4di 289	. . . 4 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) → ((⟨𝐴, 𝐵⟩ = ⟨𝐷, 𝐸⟩ ∧ 𝐶 = 𝐹) ↔ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹)))
11	6, 10	sylan9bbr 510	. . 3 ⊢ (((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ 𝐶 ∈ 𝑊) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝐷, 𝐸⟩, 𝐹⟩ ↔ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹)))
12	11	3impa 1109	. 2 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝐷, 𝐸⟩, 𝐹⟩ ↔ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹)))
13	3, 12	bitrid 283	1 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (⟨𝐴, 𝐵, 𝐶⟩ = ⟨𝐷, 𝐸, 𝐹⟩ ↔ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  Vcvv 3438  ⟨cop 4584  ⟨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-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  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:  otsndisj  5465  otiunsndisj  5466  otiunsndisjX  47467