Theorem rabssdv 4025

Description: Subclass of a restricted class abstraction (deduction form). (Contributed by NM, 2-Feb-2015.)

Hypothesis

Ref	Expression
rabssdv.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝜓) → 𝑥 ∈ 𝐵)

Assertion

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

Distinct variable groups:   𝑥,𝐵   𝜑,𝑥

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

Proof of Theorem rabssdv

Step	Hyp	Ref	Expression
1		rabssdv.1	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝜓) → 𝑥 ∈ 𝐵)
2	1	3exp 1120	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → (𝜓 → 𝑥 ∈ 𝐵)))
3	2	ralrimiv 3126	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝜓 → 𝑥 ∈ 𝐵))
4		rabss 4021	. 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜓} ⊆ 𝐵 ↔ ∀𝑥 ∈ 𝐴 (𝜓 → 𝑥 ∈ 𝐵))
5	3, 4	sylibr 234	1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} ⊆ 𝐵)

Syntax hints:   → wi 4   ∧ w3a 1087   ∈ wcel 2114  ∀wral 3050  {crab 3398   ⊆ wss 3900

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ral 3051  df-rab 3399  df-ss 3917

This theorem is referenced by:  suppss2  8142  oemapvali  9595  cantnflem1  9600  harval2  9911  zsupss  12852  ramub1lem1  16956  symggen  19401  efgsfo  19670  ablfacrp  19999  ablfac1eu  20006  pgpfac1lem5  20012  ablfaclem3  20020  nrmr0reg  23695  ptcmplem3  24000  abelthlem2  26400  lgamgulmlem1  26997  sltonold  28240  onsfi  28334  rspectopn  34003  fineqvnttrclselem1  35256  neibastop2lem  36533  topmeet  36537  weiunse  36641  cntotbnd  37966  mapdrvallem2  41940  aks6d1c6lem3  42461  onintunirab  43506  nadd2rabex  43665  k0004ss1  44429  liminfvalxr  46064