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

Theorem dmopabss 5873
Description: Upper bound for the domain of a restricted class of ordered pairs. (Contributed by NM, 31-Jan-2004.)
Assertion
Ref Expression
dmopabss dom {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} ⊆ 𝐴
Distinct variable group:   𝑥,𝑦,𝐴
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem dmopabss
StepHypRef Expression
1 dmopab 5870 . 2 dom {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} = {𝑥 ∣ ∃𝑦(𝑥𝐴𝜑)}
2 19.42v 1955 . . . 4 (∃𝑦(𝑥𝐴𝜑) ↔ (𝑥𝐴 ∧ ∃𝑦𝜑))
32abbii 2803 . . 3 {𝑥 ∣ ∃𝑦(𝑥𝐴𝜑)} = {𝑥 ∣ (𝑥𝐴 ∧ ∃𝑦𝜑)}
4 ssab2 4019 . . 3 {𝑥 ∣ (𝑥𝐴 ∧ ∃𝑦𝜑)} ⊆ 𝐴
53, 4eqsstri 3968 . 2 {𝑥 ∣ ∃𝑦(𝑥𝐴𝜑)} ⊆ 𝐴
61, 5eqsstri 3968 1 dom {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} ⊆ 𝐴
Colors of variables: wff setvar class
Syntax hints:  wa 395  wex 1781  wcel 2114  {cab 2714  wss 3889  {copab 5147  dom cdm 5631
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-br 5086  df-opab 5148  df-dm 5641
This theorem is referenced by:  fvopab4ndm  6978  opabex  7175  pwfir  9227  perpln1  28778  dmadjss  31958  abrexdomjm  32577  fineqvnttrclse  35268  abrexdom  38051  modelaxreplem2  45406
  Copyright terms: Public domain W3C validator