Theorem ab2rexex 8023

Description: Existence of a class abstraction of existentially restricted sets. Variables 𝑥 and 𝑦 are normally free-variable parameters in the class expression substituted for 𝐶, which can be thought of as 𝐶(𝑥, 𝑦). See comments for abrexex 8006. (Contributed by NM, 20-Sep-2011.)

Hypotheses

Ref	Expression
ab2rexex.1	⊢ 𝐴 ∈ V
ab2rexex.2	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
ab2rexex	⊢ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} ∈ V

Distinct variable groups:   𝑥,𝑧,𝐴   𝑦,𝑧,𝐵   𝑧,𝐶

Allowed substitution hints:   𝐴(𝑦)   𝐵(𝑥)   𝐶(𝑥, 𝑦)

Proof of Theorem ab2rexex

Step	Hyp	Ref	Expression
1		ab2rexex.1	. 2 ⊢ 𝐴 ∈ V
2		ab2rexex.2	. . 3 ⊢ 𝐵 ∈ V
3	2	abrexex 8006	. 2 ⊢ {𝑧 ∣ ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} ∈ V
4	1, 3	abrexex2 8013	1 ⊢ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} ∈ V

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2147  {cab 2741  ∃wrex 3090  Vcvv 3454

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-un 7781

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-v 3456  df-ss 3901  df-uni 4871  df-iun 4956

This theorem is used by:  plyval  26555  precsexlem4  28642  precsexlem5  28643  onmulscl  28710  z12sex  28906  pstmfval  34632  pstmxmet  34633