| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elopabw | Structured version Visualization version GIF version | ||
| Description: Membership in a class abstraction of ordered pairs. Weaker version of elopab 5496 with a sethood antecedent, avoiding ax-sep 5245, ax-nul 5255, and ax-pr 5389. Originally a subproof of elopab 5496. (Contributed by SN, 11-Dec-2024.) |
| Ref | Expression |
|---|---|
| elopabw | ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq1 2765 | . . . 4 ⊢ (𝑧 = 𝐴 → (𝑧 = 〈𝑥, 𝑦〉 ↔ 𝐴 = 〈𝑥, 𝑦〉)) | |
| 2 | 1 | anbi1d 640 | . . 3 ⊢ (𝑧 = 𝐴 → ((𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑))) |
| 3 | 2 | 2exbidv 1943 | . 2 ⊢ (𝑧 = 𝐴 → (∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑))) |
| 4 | df-opab 5162 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)} | |
| 5 | 3, 4 | elab2g 3639 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∃wex 1798 ∈ wcel 2141 〈cop 4587 {copab 5161 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1562 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-opab 5162 |
| This theorem is referenced by: elopab 5496 iunopab 5528 ssrel 5753 cnv0 5853 |
| Copyright terms: Public domain | W3C validator |