Theorem elopabr 5543

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

Step	Hyp	Ref	Expression
1		opabss 5173	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦} ⊆ 𝑅
2	1	sseli 3930	1 ⊢ (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦} → 𝐴 ∈ 𝑅)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2145   class class class wbr 5107  {copab 5171

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ss 3919  df-br 5108  df-opab 5172

This theorem is used by: (None)