Theorem abexd 5296

Description: Conditions for a class abstraction to be a set, deduction form. (Contributed by AV, 19-Apr-2025.)

Hypotheses

Ref	Expression
abexd.1	⊢ ((𝜑 ∧ 𝜓) → 𝑥 ∈ 𝐴)
abexd.2	⊢ (𝜑 → 𝐴 ∈ 𝑉)

Assertion

Ref	Expression
abexd	⊢ (𝜑 → {𝑥 ∣ 𝜓} ∈ V)

Distinct variable groups:   𝑥,𝐴   𝜑,𝑥

Allowed substitution hints:   𝜓(𝑥)   𝑉(𝑥)

Proof of Theorem abexd

Step	Hyp	Ref	Expression
1		abexd.2	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
2		abexd.1	. . . 4 ⊢ ((𝜑 ∧ 𝜓) → 𝑥 ∈ 𝐴)
3	2	ex 417	. . 3 ⊢ (𝜑 → (𝜓 → 𝑥 ∈ 𝐴))
4	3	abssdv 4029	. 2 ⊢ (𝜑 → {𝑥 ∣ 𝜓} ⊆ 𝐴)
5	1, 4	ssexd 5295	1 ⊢ (𝜑 → {𝑥 ∣ 𝜓} ∈ V)

Syntax hints:   → wi 4   ∧ wa 400   ∈ wcel 2149  {cab 2747  Vcvv 3463

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261

This theorem depends on definitions:  df-bi 210  df-an 401  df-3an 1103  df-tru 1570  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-rab 3424  df-v 3465  df-in 3920  df-ss 3930

This theorem is referenced by:  upfval2  49839