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 3158	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 𝜓)
4		ssrab 3999	. 2 ⊢ (𝐵 ⊆ {𝑥 ∈ 𝐴 ∣ 𝜓} ↔ (𝐵 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐵 𝜓))
5	1, 3, 4	sylanbrc 595	1 ⊢ (𝜑 → 𝐵 ⊆ {𝑥 ∈ 𝐴 ∣ 𝜓})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2147  ∀wral 3080  {crab 3416   ⊆ wss 3900

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rab 3417  df-ss 3901

This theorem is used by:  mndind  19074  symggen  19735  ablfac1eu  20340  lspsolvlem  21471  prdsxmslem2  24903  ovolicc2lem4  25896  abelth2  26826  perfectlem2  27614  umgrres1lem  29948  upgrres1  29951  nsgmgc  34067  nsgqusf1olem2  34069  nsgqusf1olem3  34070  cvmlift2lem11  36286  bj-rabtrAUTO  38060  mapdrvallem3  42969  idomsubgmo  44456  nadd2rabtr  44647  k0004ss2  45413  liminfvalxr  47066  smflimlem4  48057  perfectALTVlem2  49093