Theorem rnopabss 5936

Description: Upper bound for the range of a restricted class of ordered pairs. (Contributed by Eric Schmidt, 16-Sep-2025.)

Assertion

Ref	Expression
rnopabss	⊢ ran {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝜑)} ⊆ 𝐴

Distinct variable group:   𝑥,𝑦,𝐴

Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem rnopabss

Step	Hyp	Ref	Expression
1		rnopab 5935	. 2 ⊢ ran {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝜑)} = {𝑦 ∣ ∃𝑥(𝑦 ∈ 𝐴 ∧ 𝜑)}
2		19.42v 1985	. . . 4 ⊢ (∃𝑥(𝑦 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐴 ∧ ∃𝑥𝜑))
3	2	abbii 2827	. . 3 ⊢ {𝑦 ∣ ∃𝑥(𝑦 ∈ 𝐴 ∧ 𝜑)} = {𝑦 ∣ (𝑦 ∈ 𝐴 ∧ ∃𝑥𝜑)}
4		ssab2 4004	. . 3 ⊢ {𝑦 ∣ (𝑦 ∈ 𝐴 ∧ ∃𝑥𝜑)} ⊆ 𝐴
5	3, 4	eqsstri 3954	. 2 ⊢ {𝑦 ∣ ∃𝑥(𝑦 ∈ 𝐴 ∧ 𝜑)} ⊆ 𝐴
6	1, 5	eqsstri 3954	1 ⊢ ran {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝜑)} ⊆ 𝐴

This proof depends on syntax axioms:   ∧ wa 401  ∃wex 1811   ∈ wcel 2144  {cab 2738   ⊆ wss 3895  {copab 5166  ran crn 5651

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-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-opab 5167  df-cnv 5658  df-dm 5660  df-rn 5661

This theorem is used by:  cgrabasimass  29378  modelaxreplem2  45969