Theorem otth 5468

Description: Ordered triple theorem. (Contributed by NM, 25-Sep-2014.) (Revised by Mario Carneiro, 26-Apr-2015.)

Hypotheses

Ref	Expression
otth.1	⊢ 𝐴 ∈ V
otth.2	⊢ 𝐵 ∈ V
otth.3	⊢ 𝑅 ∈ V

Assertion

Ref	Expression
otth	⊢ (⟨𝐴, 𝐵, 𝑅⟩ = ⟨𝐶, 𝐷, 𝑆⟩ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆))

Proof of Theorem otth

Step	Hyp	Ref	Expression
1		df-ot 4600	. . 3 ⊢ ⟨𝐴, 𝐵, 𝑅⟩ = ⟨⟨𝐴, 𝐵⟩, 𝑅⟩
2		df-ot 4600	. . 3 ⊢ ⟨𝐶, 𝐷, 𝑆⟩ = ⟨⟨𝐶, 𝐷⟩, 𝑆⟩
3	1, 2	eqeq12i 2783	. 2 ⊢ (⟨𝐴, 𝐵, 𝑅⟩ = ⟨𝐶, 𝐷, 𝑆⟩ ↔ ⟨⟨𝐴, 𝐵⟩, 𝑅⟩ = ⟨⟨𝐶, 𝐷⟩, 𝑆⟩)
4		otth.1	. . 3 ⊢ 𝐴 ∈ V
5		otth.2	. . 3 ⊢ 𝐵 ∈ V
6		otth.3	. . 3 ⊢ 𝑅 ∈ V
7	4, 5, 6	otth2 5467	. 2 ⊢ (⟨⟨𝐴, 𝐵⟩, 𝑅⟩ = ⟨⟨𝐶, 𝐷⟩, 𝑆⟩ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆))
8	3, 7	bitri 278	1 ⊢ (⟨𝐴, 𝐵, 𝑅⟩ = ⟨𝐶, 𝐷, 𝑆⟩ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆))

This proof depends on syntax axioms:   ↔ wb 209   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  Vcvv 3457  ⟨cop 4597  ⟨cotp 4599

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 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-ot 4600

This theorem is used by:  otthne  5470  euotd  5498  mthmpps  36113  ackval40  49532  arweuthinc  50366  arweutermc  50367