Theorem dmopabss 5258

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

Step	Hyp	Ref	Expression
1		dmopab 5257	. 2 ⊢ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)}
2		19.42v 1905	. . . 4 ⊢ (∃𝑦(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦𝜑))
3	2	abbii 2726	. . 3 ⊢ {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦𝜑)}
4		ssab2 3649	. . 3 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦𝜑)} ⊆ 𝐴
5	3, 4	eqsstri 3598	. 2 ⊢ {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)} ⊆ 𝐴
6	1, 5	eqsstri 3598	1 ⊢ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ⊆ 𝐴

Syntax hints:   ∧ wa 383  ∃wex 1695   ∈ wcel 1977  {cab 2596   ⊆ wss 3540  {copab 4642  dom cdm 5038

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-br 4584  df-opab 4644  df-dm 5048

This theorem is referenced by:  fvopab4ndm  6215  opabex  6388  perpln1  25405  clwwlknprop  26300  dmadjss  28130  abrexdomjm  28729  abrexdom  32695