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

Theorem otth2 5431
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
StepHypRef Expression
1 otth.1 . . . 4 𝐴 ∈ V
2 otth.2 . . . 4 𝐵 ∈ V
31, 2opth 5424 . . 3 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝐴 = 𝐶𝐵 = 𝐷))
43anbi1i 624 . 2 ((⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ∧ 𝑅 = 𝑆) ↔ ((𝐴 = 𝐶𝐵 = 𝐷) ∧ 𝑅 = 𝑆))
5 opex 5412 . . 3 𝐴, 𝐵⟩ ∈ V
6 otth.3 . . 3 𝑅 ∈ V
75, 6opth 5424 . 2 (⟨⟨𝐴, 𝐵⟩, 𝑅⟩ = ⟨⟨𝐶, 𝐷⟩, 𝑆⟩ ↔ (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ∧ 𝑅 = 𝑆))
8 df-3an 1088 . 2 ((𝐴 = 𝐶𝐵 = 𝐷𝑅 = 𝑆) ↔ ((𝐴 = 𝐶𝐵 = 𝐷) ∧ 𝑅 = 𝑆))
94, 7, 83bitr4i 303 1 (⟨⟨𝐴, 𝐵⟩, 𝑅⟩ = ⟨⟨𝐶, 𝐷⟩, 𝑆⟩ ↔ (𝐴 = 𝐶𝐵 = 𝐷𝑅 = 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  Vcvv 3440  cop 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 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377
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 2715  df-cleq 2728  df-clel 2811  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587
This theorem is referenced by:  otth  5432  oprabidw  7389  oprabid  7390  eloprabga  7467
  Copyright terms: Public domain W3C validator