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

Theorem dmopabss 5867
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 5864 . 2 dom {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} = {𝑥 ∣ ∃𝑦(𝑥𝐴𝜑)}
2 19.42v 1960 . . . 4 (∃𝑦(𝑥𝐴𝜑) ↔ (𝑥𝐴 ∧ ∃𝑦𝜑))
32abbii 2807 . . 3 {𝑥 ∣ ∃𝑦(𝑥𝐴𝜑)} = {𝑥 ∣ (𝑥𝐴 ∧ ∃𝑦𝜑)}
4 ssab2 4017 . . 3 {𝑥 ∣ (𝑥𝐴 ∧ ∃𝑦𝜑)} ⊆ 𝐴
53, 4eqsstri 3968 . 2 {𝑥 ∣ ∃𝑦(𝑥𝐴𝜑)} ⊆ 𝐴
61, 5eqsstri 3968 1 dom {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} ⊆ 𝐴
Colors of variables: wff setvar class
Syntax hints:  wa 396  wex 1786  wcel 2119  {cab 2718  wss 3890  {copab 5141  dom cdm 5625
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-pr 5369
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-br 5080  df-opab 5142  df-dm 5635
This theorem is referenced by:  fvopab4ndm  6973  opabex  7171  pwfir  9224  perpln1  28803  dmadjss  31983  abrexdomjm  32602  fineqvnttrclse  35312  abrexdom  38104  modelaxreplem2  45430
  Copyright terms: Public domain W3C validator