![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > elopabr | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
elopabr | ⊢ (𝐴 ∈ {〈𝑥, 𝑦〉 ∣ 𝑥𝑅𝑦} → 𝐴 ∈ 𝑅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opabss 5230 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ 𝑥𝑅𝑦} ⊆ 𝑅 | |
2 | 1 | sseli 4004 | 1 ⊢ (𝐴 ∈ {〈𝑥, 𝑦〉 ∣ 𝑥𝑅𝑦} → 𝐴 ∈ 𝑅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2108 class class class wbr 5166 {copab 5228 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1540 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ss 3993 df-br 5167 df-opab 5229 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |