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

Theorem elopabran 5441
Description: Membership in a class abstraction of pairs, defined by a restricted binary relation. (Contributed by AV, 16-Feb-2021.)
Assertion
Ref Expression
elopabran (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝜓)} → 𝐴𝑅)
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝑅,𝑦
Allowed substitution hints:   𝜓(𝑥,𝑦)

Proof of Theorem elopabran
StepHypRef Expression
1 simpl 485 . . . 4 ((𝑥𝑅𝑦𝜓) → 𝑥𝑅𝑦)
21ssopab2i 5430 . . 3 {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝜓)} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦}
32sseli 3963 . 2 (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝜓)} → 𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦})
4 elopabr 5440 . 2 (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦} → 𝐴𝑅)
53, 4syl 17 1 (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝜓)} → 𝐴𝑅)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  wcel 2110   class class class wbr 5059  {copab 5121
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-sep 5196  ax-nul 5203  ax-pr 5322
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-v 3497  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4562  df-pr 4564  df-op 4568  df-br 5060  df-opab 5122
This theorem is referenced by:  clwlkwlk  27550
  Copyright terms: Public domain W3C validator