Theorem rabexgf 45764

Description: A version of rabexg 5308 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

Hypothesis

Ref	Expression
rabexgf.1	⊢ Ⅎ𝑥𝐴

Assertion

Ref	Expression
rabexgf	⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V)

Proof of Theorem rabexgf

Step	Hyp	Ref	Expression
1		df-rab 3417	. . 3 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
2		simpl 487	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝑥 ∈ 𝐴)
3	2	ss2abi 4020	. . . 4 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ⊆ {𝑥 ∣ 𝑥 ∈ 𝐴}
4		rabexgf.1	. . . . 5 ⊢ Ⅎ𝑥𝐴
5	4	abid2f 2955	. . . 4 ⊢ {𝑥 ∣ 𝑥 ∈ 𝐴} = 𝐴
6	3, 5	sseqtri 3985	. . 3 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ⊆ 𝐴
7	1, 6	eqsstri 3983	. 2 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴
8		ssexg 5290	. 2 ⊢ (({𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉) → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V)
9	7, 8	mpan 702	1 ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V)

Syntax hints:   → wi 4   ∧ wa 400   ∈ wcel 2143  {cab 2741  Ⅎwnfc 2910  {crab 3416  Vcvv 3455   ⊆ wss 3905

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-ex 1810  df-nf 1814  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-rab 3417  df-v 3457  df-in 3912  df-ss 3922

This theorem is referenced by:  rabexf  45872  stoweidlem27  46761  stoweidlem35  46769