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

Theorem otth2 5466
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 5459 . . 3 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝐴 = 𝐶𝐵 = 𝐷))
43anbi1i 635 . 2 ((⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ∧ 𝑅 = 𝑆) ↔ ((𝐴 = 𝐶𝐵 = 𝐷) ∧ 𝑅 = 𝑆))
5 opex 5446 . . 3 𝐴, 𝐵⟩ ∈ V
6 otth.3 . . 3 𝑅 ∈ V
75, 6opth 5459 . 2 (⟨⟨𝐴, 𝐵⟩, 𝑅⟩ = ⟨⟨𝐶, 𝐷⟩, 𝑆⟩ ↔ (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ∧ 𝑅 = 𝑆))
8 df-3an 1103 . 2 ((𝐴 = 𝐶𝐵 = 𝐷𝑅 = 𝑆) ↔ ((𝐴 = 𝐶𝐵 = 𝐷) ∧ 𝑅 = 𝑆))
94, 7, 83bitr4i 306 1 (⟨⟨𝐴, 𝐵⟩, 𝑅⟩ = ⟨⟨𝐶, 𝐷⟩, 𝑆⟩ ↔ (𝐴 = 𝐶𝐵 = 𝐷𝑅 = 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400  w3a 1101   = wceq 1567  wcel 2149  Vcvv 3463  cop 4600
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601
This theorem is referenced by:  otth  5467  oprabidw  7442  oprabid  7443  eloprabga  7520
  Copyright terms: Public domain W3C validator