Theorem ssrabdv 4001

Description: Subclass of a restricted class abstraction (deduction form). (Contributed by NM, 31-Aug-2006.)

Hypotheses

Ref	Expression
ssrabdv.1	⊢ (𝜑 → 𝐵 ⊆ 𝐴)
ssrabdv.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝜓)

Assertion

Ref	Expression
ssrabdv	⊢ (𝜑 → 𝐵 ⊆ {𝑥 ∈ 𝐴 ∣ 𝜓})

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜑,𝑥

Allowed substitution hint:   𝜓(𝑥)

Proof of Theorem ssrabdv

Step	Hyp	Ref	Expression
1		ssrabdv.1	. 2 ⊢ (𝜑 → 𝐵 ⊆ 𝐴)
2		ssrabdv.2	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝜓)
3	2	ralrimiva 3149	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 𝜓)
4		ssrab 4000	. 2 ⊢ (𝐵 ⊆ {𝑥 ∈ 𝐴 ∣ 𝜓} ↔ (𝐵 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐵 𝜓))
5	1, 3, 4	sylanbrc 586	1 ⊢ (𝜑 → 𝐵 ⊆ {𝑥 ∈ 𝐴 ∣ 𝜓})

Syntax hints:   → wi 4   ∧ wa 399   ∈ wcel 2111  ∀wral 3106  {crab 3110   ⊆ wss 3881

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rab 3115  df-v 3443  df-in 3888  df-ss 3898

This theorem is referenced by:  mndind  17984  symggen  18590  ablfac1eu  19188  lspsolvlem  19907  prdsxmslem2  23136  ovolicc2lem4  24124  abelth2  25037  perfectlem2  25814  umgrres1lem  27100  upgrres1  27103  cvmlift2lem11  32673  bj-rabtrAUTO  34374  mapdrvallem3  38942  idomsubgmo  40142  k0004ss2  40855  liminfvalxr  42425  smflimlem4  43407  perfectALTVlem2  44240