Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  otth Structured version   Visualization version   GIF version

Theorem otth 4918
 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
StepHypRef Expression
1 df-ot 4162 . . 3 𝐴, 𝐵, 𝑅⟩ = ⟨⟨𝐴, 𝐵⟩, 𝑅
2 df-ot 4162 . . 3 𝐶, 𝐷, 𝑆⟩ = ⟨⟨𝐶, 𝐷⟩, 𝑆
31, 2eqeq12i 2640 . 2 (⟨𝐴, 𝐵, 𝑅⟩ = ⟨𝐶, 𝐷, 𝑆⟩ ↔ ⟨⟨𝐴, 𝐵⟩, 𝑅⟩ = ⟨⟨𝐶, 𝐷⟩, 𝑆⟩)
4 otth.1 . . 3 𝐴 ∈ V
5 otth.2 . . 3 𝐵 ∈ V
6 otth.3 . . 3 𝑅 ∈ V
74, 5, 6otth2 4917 . 2 (⟨⟨𝐴, 𝐵⟩, 𝑅⟩ = ⟨⟨𝐶, 𝐷⟩, 𝑆⟩ ↔ (𝐴 = 𝐶𝐵 = 𝐷𝑅 = 𝑆))
83, 7bitri 264 1 (⟨𝐴, 𝐵, 𝑅⟩ = ⟨𝐶, 𝐷, 𝑆⟩ ↔ (𝐴 = 𝐶𝐵 = 𝐷𝑅 = 𝑆))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∧ w3a 1036   = wceq 1480   ∈ wcel 1992  Vcvv 3191  ⟨cop 4159  ⟨cotp 4161 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1841  ax-6 1890  ax-7 1937  ax-9 2001  ax-10 2021  ax-11 2036  ax-12 2049  ax-13 2250  ax-ext 2606  ax-sep 4746  ax-nul 4754  ax-pr 4872 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1883  df-clab 2613  df-cleq 2619  df-clel 2622  df-nfc 2756  df-rab 2921  df-v 3193  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3897  df-if 4064  df-sn 4154  df-pr 4156  df-op 4160  df-ot 4162 This theorem is referenced by:  euotd  4940  mthmpps  31179
 Copyright terms: Public domain W3C validator