Theorem ab2rexex 7980

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 7963. (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 7963	. 2 ⊢ {𝑧 ∣ ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} ∈ V
4	1, 3	abrexex2 7970	1 ⊢ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} ∈ V

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2145  {cab 2740  ∃wrex 3088  Vcvv 3453

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-un 7740

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 2100  df-mo 2566  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-v 3455  df-ss 3919  df-uni 4871  df-iun 4956

This theorem is used by:  plyval  26425  precsexlem4  28483  precsexlem5  28484  onmulscl  28551  z12sex  28747  pstmfval  34414  pstmxmet  34415