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

Theorem brtp 5505
Description: A necessary and sufficient condition for two sets to be related under a binary relation which is an unordered triple. (Contributed by Scott Fenton, 8-Jun-2011.)
Hypotheses
Ref Expression
brtp.1 𝑋 ∈ V
brtp.2 𝑌 ∈ V
Assertion
Ref Expression
brtp (𝑋{⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩, ⟨𝐸, 𝐹⟩}𝑌 ↔ ((𝑋 = 𝐴𝑌 = 𝐵) ∨ (𝑋 = 𝐶𝑌 = 𝐷) ∨ (𝑋 = 𝐸𝑌 = 𝐹)))

Proof of Theorem brtp
StepHypRef Expression
1 df-br 5111 . 2 (𝑋{⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩, ⟨𝐸, 𝐹⟩}𝑌 ↔ ⟨𝑋, 𝑌⟩ ∈ {⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩, ⟨𝐸, 𝐹⟩})
2 opex 5443 . . 3 𝑋, 𝑌⟩ ∈ V
32eltp 4657 . 2 (⟨𝑋, 𝑌⟩ ∈ {⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩, ⟨𝐸, 𝐹⟩} ↔ (⟨𝑋, 𝑌⟩ = ⟨𝐴, 𝐵⟩ ∨ ⟨𝑋, 𝑌⟩ = ⟨𝐶, 𝐷⟩ ∨ ⟨𝑋, 𝑌⟩ = ⟨𝐸, 𝐹⟩))
4 brtp.1 . . . 4 𝑋 ∈ V
5 brtp.2 . . . 4 𝑌 ∈ V
64, 5opth 5456 . . 3 (⟨𝑋, 𝑌⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝑋 = 𝐴𝑌 = 𝐵))
74, 5opth 5456 . . 3 (⟨𝑋, 𝑌⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝑋 = 𝐶𝑌 = 𝐷))
84, 5opth 5456 . . 3 (⟨𝑋, 𝑌⟩ = ⟨𝐸, 𝐹⟩ ↔ (𝑋 = 𝐸𝑌 = 𝐹))
96, 7, 83orbi123i 1172 . 2 ((⟨𝑋, 𝑌⟩ = ⟨𝐴, 𝐵⟩ ∨ ⟨𝑋, 𝑌⟩ = ⟨𝐶, 𝐷⟩ ∨ ⟨𝑋, 𝑌⟩ = ⟨𝐸, 𝐹⟩) ↔ ((𝑋 = 𝐴𝑌 = 𝐵) ∨ (𝑋 = 𝐶𝑌 = 𝐷) ∨ (𝑋 = 𝐸𝑌 = 𝐹)))
101, 3, 93bitri 300 1 (𝑋{⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩, ⟨𝐸, 𝐹⟩}𝑌 ↔ ((𝑋 = 𝐴𝑌 = 𝐵) ∨ (𝑋 = 𝐶𝑌 = 𝐷) ∨ (𝑋 = 𝐸𝑌 = 𝐹)))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400  w3o 1100   = wceq 1567  wcel 2149  Vcvv 3463  {ctp 4595  cop 4597   class class class wbr 5110
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 5258  ax-pr 5402
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  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 4490  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-br 5111
This theorem is referenced by:  ltsval2  27782  ltsintdifex  27787  ltsres  27788  noextendlt  27795  noextendgt  27796  nolesgn2o  27797  nogesgn1o  27799  ltssolem1  27801  nosepnelem  27805  nosep1o  27807  nosep2o  27808  nosepdmlem  27809  nodenselem8  27817  nodense  27818  nolt02o  27821  nogt01o  27822  nosupbnd2lem1  27841  noinfbnd2lem1  27856
  Copyright terms: Public domain W3C validator