Theorem ssintrab 4931

Description: Subclass of the intersection of a restricted class abstraction. (Contributed by NM, 30-Jan-2015.)

Assertion

Ref	Expression
ssintrab	⊢ (𝐴 ⊆ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ ∀𝑥 ∈ 𝐵 (𝜑 → 𝐴 ⊆ 𝑥))

Distinct variable group:   𝑥,𝐴

Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥)

Proof of Theorem ssintrab

Step	Hyp	Ref	Expression
1		df-rab 3413	. . . 4 ⊢ {𝑥 ∈ 𝐵 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)}
2	1	inteqi 4911	. . 3 ⊢ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} = ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)}
3	2	sseq2i 3960	. 2 ⊢ (𝐴 ⊆ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ 𝐴 ⊆ ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)})
4		impexp 456	. . . 4 ⊢ (((𝑥 ∈ 𝐵 ∧ 𝜑) → 𝐴 ⊆ 𝑥) ↔ (𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ⊆ 𝑥)))
5	4	albii 1852	. . 3 ⊢ (∀𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) → 𝐴 ⊆ 𝑥) ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ⊆ 𝑥)))
6		ssintab 4925	. . 3 ⊢ (𝐴 ⊆ ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} ↔ ∀𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) → 𝐴 ⊆ 𝑥))
7		df-ral 3077	. . 3 ⊢ (∀𝑥 ∈ 𝐵 (𝜑 → 𝐴 ⊆ 𝑥) ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ⊆ 𝑥)))
8	5, 6, 7	3bitr4i 306	. 2 ⊢ (𝐴 ⊆ ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} ↔ ∀𝑥 ∈ 𝐵 (𝜑 → 𝐴 ⊆ 𝑥))
9	3, 8	bitri 278	1 ⊢ (𝐴 ⊆ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ ∀𝑥 ∈ 𝐵 (𝜑 → 𝐴 ⊆ 𝑥))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   ∈ wcel 2145  {cab 2738  ∀wral 3076  {crab 3412   ⊆ wss 3899  ∩ cint 4907

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732

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 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3916  df-int 4908

This theorem is used by:  knatar  7360  harval2  10002  pwfseqlem3  10669  elrgspnlem4  33685  ldgenpisyslem3  34676  topjoin  36984