Theorem ssrabdv 3236

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

Syntax hints:   → wi 4   ∧ wa 104   ∈ wcel 2148  ∀wral 2455  {crab 2459   ⊆ wss 3131

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rab 2464  df-in 3137  df-ss 3144

This theorem is referenced by: (None)