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

Theorem dmopabelb 5910
Description: A set is an element of the domain of a ordered pair class abstraction iff there is a second set so that both sets fulfil the wff of the class abstraction. (Contributed by AV, 19-Oct-2023.)
Hypothesis
Ref Expression
dmopabel.d (𝑥 = 𝑋 → (𝜑𝜓))
Assertion
Ref Expression
dmopabelb (𝑋𝑉 → (𝑋 ∈ dom {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑦𝜓))
Distinct variable groups:   𝑥,𝑋,𝑦   𝜓,𝑥
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑦)   𝑉(𝑥,𝑦)

Proof of Theorem dmopabelb
StepHypRef Expression
1 dmopab 5909 . . 3 dom {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑥 ∣ ∃𝑦𝜑}
21eleq2i 2819 . 2 (𝑋 ∈ dom {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝑋 ∈ {𝑥 ∣ ∃𝑦𝜑})
3 dmopabel.d . . . 4 (𝑥 = 𝑋 → (𝜑𝜓))
43exbidv 1916 . . 3 (𝑥 = 𝑋 → (∃𝑦𝜑 ↔ ∃𝑦𝜓))
5 eqid 2726 . . 3 {𝑥 ∣ ∃𝑦𝜑} = {𝑥 ∣ ∃𝑦𝜑}
64, 5elab2g 3665 . 2 (𝑋𝑉 → (𝑋 ∈ {𝑥 ∣ ∃𝑦𝜑} ↔ ∃𝑦𝜓))
72, 6bitrid 283 1 (𝑋𝑉 → (𝑋 ∈ dom {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑦𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205   = wceq 1533  wex 1773  wcel 2098  {cab 2703  {copab 5203  dom cdm 5669
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-sn 4624  df-pr 4626  df-op 4630  df-br 5142  df-opab 5204  df-dm 5679
This theorem is referenced by:  dmopab2rex  5911  dmopab3rexdif  34924
  Copyright terms: Public domain W3C validator