Theorem opabresex2 7466

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 6894	. 2 ⊢ (𝑊‘𝐺) ∈ V
2		elopabran 5545	. . 3 ⊢ (𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝑊‘𝐺)𝑦 ∧ 𝜃)} → 𝑧 ∈ (𝑊‘𝐺))
3	2	ssriv 3940	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝑊‘𝐺)𝑦 ∧ 𝜃)} ⊆ (𝑊‘𝐺)
4	1, 3	ssexi 5292	1 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝑊‘𝐺)𝑦 ∧ 𝜃)} ∈ V

This proof depends on syntax axioms:   ∧ wa 400   ∈ wcel 2142  Vcvv 3454   class class class wbr 5108  {copab 5172  ‘cfv 6536

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-nul 5268

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-sn 4589  df-pr 4591  df-uni 4872  df-br 5109  df-opab 5173  df-iota 6492  df-fv 6544

This theorem is used by:  fvmptopab  7467  mptmpoopabbrd  8076