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

Theorem elopabr 5533
Description: Membership in an ordered-pair class abstraction defined by a binary relation. (Contributed by AV, 16-Feb-2021.) (Proof shortened by SN, 11-Dec-2024.)
Assertion
Ref Expression
elopabr (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦} → 𝐴𝑅)
Distinct variable groups:   𝑥,𝑅   𝑦,𝑅
Allowed substitution hints:   𝐴(𝑥,𝑦)

Proof of Theorem elopabr
StepHypRef Expression
1 opabss 5166 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦} ⊆ 𝑅
21sseli 3934 1 (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦} → 𝐴𝑅)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2144   class class class wbr 5102  {copab 5164
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-ext 2736
This theorem depends on definitions:  df-bi 209  df-an 400  df-tru 1565  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-ss 3923  df-br 5103  df-opab 5165
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator