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

Theorem elopabw 5499
Description: Membership in a class abstraction of ordered pairs. Weaker version of elopab 5500 with a sethood antecedent, avoiding ax-sep 5248, ax-nul 5259, and ax-pr 5390. Originally a subproof of elopab 5500. (Contributed by SN, 11-Dec-2024.)
Assertion
Ref Expression
elopabw (𝐴 ∈ 𝑉 → (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
Distinct variable groups:   𝑥,𝐴   𝑦,𝐴
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝑉(𝑥, 𝑦)

Proof of Theorem elopabw
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eqeq1 2764 . . . 4 (𝑧 = 𝐴 → (𝑧 = ⟨𝑥, 𝑦⟩ ↔ 𝐴 = ⟨𝑥, 𝑦⟩))
21anbi1d 643 . . 3 (𝑧 = 𝐴 → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
322exbidv 1956 . 2 (𝑧 = 𝐴 → (∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
4 df-opab 5167 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
53, 4elab2g 3633 1 (𝐴 ∈ 𝑉 → (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ⟨cop 4589  {copab 5166
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-opab 5167
This theorem is used by:  elopab  5500  iunopab  5533  ssrel  5758  cnv0  5860
  Copyright terms: Public domain W3C validator