Theorem otth2 5470

Description: Ordered triple theorem, with triple expressed with ordered pairs. (Contributed by NM, 1-May-1995.) (Revised by Mario Carneiro, 26-Apr-2015.)

Hypotheses

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

Assertion

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

Proof of Theorem otth2

Step	Hyp	Ref	Expression
1		otth.1	. . . 4 ⊢ 𝐴 ∈ V
2		otth.2	. . . 4 ⊢ 𝐵 ∈ V
3	1, 2	opth 5463	. . 3 ⊢ (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))
4	3	anbi1i 636	. 2 ⊢ ((⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ∧ 𝑅 = 𝑆) ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∧ 𝑅 = 𝑆))
5		opex 5450	. . 3 ⊢ ⟨𝐴, 𝐵⟩ ∈ V
6		otth.3	. . 3 ⊢ 𝑅 ∈ V
7	5, 6	opth 5463	. 2 ⊢ (⟨⟨𝐴, 𝐵⟩, 𝑅⟩ = ⟨⟨𝐶, 𝐷⟩, 𝑆⟩ ↔ (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ∧ 𝑅 = 𝑆))
8		df-3an 1105	. 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆) ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∧ 𝑅 = 𝑆))
9	4, 7, 8	3bitr4i 306	1 ⊢ (⟨⟨𝐴, 𝐵⟩, 𝑅⟩ = ⟨⟨𝐶, 𝐷⟩, 𝑆⟩ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  Vcvv 3458  ⟨cop 4600

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 2738  ax-sep 5262  ax-pr 5409

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 2745  df-cleq 2758  df-clel 2841  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601

This theorem is used by:  otth  5471  oprabidw  7454  oprabid  7455  eloprabga  7532