Theorem abexex 7298

Description: A condition where a class builder continues to exist after its wff is existentially quantified. (Contributed by NM, 4-Mar-2007.)

Hypotheses

Ref	Expression
abexex.1	⊢ 𝐴 ∈ V
abexex.2	⊢ (𝜑 → 𝑥 ∈ 𝐴)
abexex.3	⊢ {𝑦 ∣ 𝜑} ∈ V

Assertion

Ref	Expression
abexex	⊢ {𝑦 ∣ ∃𝑥𝜑} ∈ V

Distinct variable group:   𝑥,𝑦,𝐴

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem abexex

Step	Hyp	Ref	Expression
1		df-rex 3067	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
2		abexex.2	. . . . . 6 ⊢ (𝜑 → 𝑥 ∈ 𝐴)
3	2	pm4.71ri 550	. . . . 5 ⊢ (𝜑 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑))
4	3	exbii 1924	. . . 4 ⊢ (∃𝑥𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
5	1, 4	bitr4i 267	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥𝜑)
6	5	abbii 2888	. 2 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑} = {𝑦 ∣ ∃𝑥𝜑}
7		abexex.1	. . 3 ⊢ 𝐴 ∈ V
8		abexex.3	. . 3 ⊢ {𝑦 ∣ 𝜑} ∈ V
9	7, 8	abrexex2 7295	. 2 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑} ∈ V
10	6, 9	eqeltrri 2847	1 ⊢ {𝑦 ∣ ∃𝑥𝜑} ∈ V

Syntax hints:   → wi 4   ∧ wa 382  ∃wex 1852   ∈ wcel 2145  {cab 2757  ∃wrex 3062  Vcvv 3351

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-rep 4904  ax-sep 4915  ax-nul 4923  ax-pr 5034  ax-un 7096

This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-ral 3066  df-rex 3067  df-reu 3068  df-rab 3070  df-v 3353  df-sbc 3588  df-csb 3683  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4226  df-sn 4317  df-pr 4319  df-op 4323  df-uni 4575  df-iun 4656  df-br 4787  df-opab 4847  df-mpt 4864  df-id 5157  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-f1 6036  df-fo 6037  df-f1o 6038  df-fv 6039

This theorem is referenced by:  brdom7disj  9555  brdom6disj  9556