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.) |
Ref | Expression |
---|---|
elopabr | ⊢ (𝐴 ∈ {〈𝑥, 𝑦〉 ∣ 𝑥𝑅𝑦} → 𝐴 ∈ 𝑅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elopab 5433 | . 2 ⊢ (𝐴 ∈ {〈𝑥, 𝑦〉 ∣ 𝑥𝑅𝑦} ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝑥𝑅𝑦)) | |
2 | df-br 5071 | . . . . . 6 ⊢ (𝑥𝑅𝑦 ↔ 〈𝑥, 𝑦〉 ∈ 𝑅) | |
3 | 2 | biimpi 215 | . . . . 5 ⊢ (𝑥𝑅𝑦 → 〈𝑥, 𝑦〉 ∈ 𝑅) |
4 | eleq1 2826 | . . . . 5 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (𝐴 ∈ 𝑅 ↔ 〈𝑥, 𝑦〉 ∈ 𝑅)) | |
5 | 3, 4 | syl5ibr 245 | . . . 4 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (𝑥𝑅𝑦 → 𝐴 ∈ 𝑅)) |
6 | 5 | imp 406 | . . 3 ⊢ ((𝐴 = 〈𝑥, 𝑦〉 ∧ 𝑥𝑅𝑦) → 𝐴 ∈ 𝑅) |
7 | 6 | exlimivv 1936 | . 2 ⊢ (∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝑥𝑅𝑦) → 𝐴 ∈ 𝑅) |
8 | 1, 7 | sylbi 216 | 1 ⊢ (𝐴 ∈ {〈𝑥, 𝑦〉 ∣ 𝑥𝑅𝑦} → 𝐴 ∈ 𝑅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∃wex 1783 ∈ wcel 2108 〈cop 4564 class class class wbr 5070 {copab 5132 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-v 3424 df-dif 3886 df-un 3888 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-br 5071 df-opab 5133 |
This theorem is referenced by: elopabran 5467 |
Copyright terms: Public domain | W3C validator |