Theorem opabresex2 7452

Description: Restrictions of a collection of ordered pairs of related elements are sets. (Contributed by Alexander van der Vekens, 1-Nov-2017.) (Revised by AV, 15-Jan-2021.) Add disjoint variable conditions betweem 𝑊, 𝐺 and 𝑥, 𝑦 to remove hypotheses. (Revised by SN, 13-Dec-2024.)

Assertion

Ref	Expression
opabresex2	⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝑊‘𝐺)𝑦 ∧ 𝜃)} ∈ V

Distinct variable groups:   𝑥,𝑊   𝑦,𝑊   𝑥,𝐺   𝑦,𝐺

Allowed substitution hints:   𝜃(𝑥,𝑦)

Proof of Theorem opabresex2

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fvex 6882	. 2 ⊢ (𝑊‘𝐺) ∈ V
2		elopabran 5534	. . 3 ⊢ (𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝑊‘𝐺)𝑦 ∧ 𝜃)} → 𝑧 ∈ (𝑊‘𝐺))
3	2	ssriv 3942	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝑊‘𝐺)𝑦 ∧ 𝜃)} ⊆ (𝑊‘𝐺)
4	1, 3	ssexi 5280	1 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝑊‘𝐺)𝑦 ∧ 𝜃)} ∈ V

Syntax hints:   ∧ wa 399   ∈ wcel 2144  Vcvv 3456   class class class wbr 5102  {copab 5164  ‘cfv 6523

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-ext 2736  ax-sep 5248  ax-nul 5258

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-ne 2960  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-sn 4585  df-pr 4587  df-uni 4868  df-br 5103  df-opab 5165  df-iota 6479  df-fv 6531

This theorem is referenced by:  fvmptopab  7453  mptmpoopabbrd  8064