Theorem opabresex0d 43504

Description: A collection of ordered pairs, the class of all possible second components being a set, with a restriction of a binary relation is a set. (Contributed by Alexander van der Vekens, 1-Nov-2017.) (Revised by AV, 1-Jan-2021.)

Hypotheses

Ref	Expression
opabresex0d.x	⊢ ((𝜑 ∧ 𝑥𝑅𝑦) → 𝑥 ∈ 𝐶)
opabresex0d.t	⊢ ((𝜑 ∧ 𝑥𝑅𝑦) → 𝜃)
opabresex0d.y	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → {𝑦 ∣ 𝜃} ∈ 𝑉)
opabresex0d.c	⊢ (𝜑 → 𝐶 ∈ 𝑊)

Assertion

Ref	Expression
opabresex0d	⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦 ∧ 𝜓)} ∈ V)

Distinct variable groups:   𝑥,𝐶,𝑦   𝜑,𝑥,𝑦

Allowed substitution hints:   𝜓(𝑥,𝑦)   𝜃(𝑥,𝑦)   𝑅(𝑥,𝑦)   𝑉(𝑥,𝑦)   𝑊(𝑥,𝑦)

Proof of Theorem opabresex0d

Step	Hyp	Ref	Expression
1		opabresex0d.x	. . . . 5 ⊢ ((𝜑 ∧ 𝑥𝑅𝑦) → 𝑥 ∈ 𝐶)
2		opabresex0d.t	. . . . 5 ⊢ ((𝜑 ∧ 𝑥𝑅𝑦) → 𝜃)
3	1, 2	jca 514	. . . 4 ⊢ ((𝜑 ∧ 𝑥𝑅𝑦) → (𝑥 ∈ 𝐶 ∧ 𝜃))
4	3	ex 415	. . 3 ⊢ (𝜑 → (𝑥𝑅𝑦 → (𝑥 ∈ 𝐶 ∧ 𝜃)))
5	4	alrimivv 1929	. 2 ⊢ (𝜑 → ∀𝑥∀𝑦(𝑥𝑅𝑦 → (𝑥 ∈ 𝐶 ∧ 𝜃)))
6		opabresex0d.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑊)
7	6	elexd 3514	. . 3 ⊢ (𝜑 → 𝐶 ∈ V)
8		opabresex0d.y	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → {𝑦 ∣ 𝜃} ∈ 𝑉)
9	8	elexd 3514	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → {𝑦 ∣ 𝜃} ∈ V)
10	7, 9	opabex3d 7666	. 2 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜃)} ∈ V)
11		opabbrex 7207	. 2 ⊢ ((∀𝑥∀𝑦(𝑥𝑅𝑦 → (𝑥 ∈ 𝐶 ∧ 𝜃)) ∧ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜃)} ∈ V) → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦 ∧ 𝜓)} ∈ V)
12	5, 10, 11	syl2anc 586	1 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦 ∧ 𝜓)} ∈ V)

Syntax hints:   → wi 4   ∧ wa 398  ∀wal 1535   ∈ wcel 2114  {cab 2799  Vcvv 3494   class class class wbr 5066  {copab 5128

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363

This theorem is referenced by:  opabbrfex0d  43505  opabresexd  43506