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

Theorem otth 4953
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 4186 . . 3 𝐴, 𝐵, 𝑅⟩ = ⟨⟨𝐴, 𝐵⟩, 𝑅
2 df-ot 4186 . . 3 𝐶, 𝐷, 𝑆⟩ = ⟨⟨𝐶, 𝐷⟩, 𝑆
31, 2eqeq12i 2636 . 2 (⟨𝐴, 𝐵, 𝑅⟩ = ⟨𝐶, 𝐷, 𝑆⟩ ↔ ⟨⟨𝐴, 𝐵⟩, 𝑅⟩ = ⟨⟨𝐶, 𝐷⟩, 𝑆⟩)
4 otth.1 . . 3 𝐴 ∈ V
5 otth.2 . . 3 𝐵 ∈ V
6 otth.3 . . 3 𝑅 ∈ V
74, 5, 6otth2 4952 . 2 (⟨⟨𝐴, 𝐵⟩, 𝑅⟩ = ⟨⟨𝐶, 𝐷⟩, 𝑆⟩ ↔ (𝐴 = 𝐶𝐵 = 𝐷𝑅 = 𝑆))
83, 7bitri 264 1 (⟨𝐴, 𝐵, 𝑅⟩ = ⟨𝐶, 𝐷, 𝑆⟩ ↔ (𝐴 = 𝐶𝐵 = 𝐷𝑅 = 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wb 196  w3a 1037   = wceq 1483  wcel 1990  Vcvv 3200  cop 4183  cotp 4185
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-ot 4186
This theorem is referenced by:  euotd  4975  mthmpps  31479
  Copyright terms: Public domain W3C validator