Theorem iinss1 4974

Description: Subclass theorem for indexed intersection. (Contributed by NM, 24-Jan-2012.)

Assertion

Ref	Expression
iinss1	⊢ (𝐴 ⊆ 𝐵 → ∩ 𝑥 ∈ 𝐵 𝐶 ⊆ ∩ 𝑥 ∈ 𝐴 𝐶)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem iinss1

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssralv 4007	. . 3 ⊢ (𝐴 ⊆ 𝐵 → (∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶 → ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶))
2		eliin 4963	. . . 4 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐵 𝐶 ↔ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶))
3	2	elv 3462	. . 3 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐵 𝐶 ↔ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶)
4		eliin 4963	. . . 4 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶))
5	4	elv 3462	. . 3 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)
6	1, 3, 5	3imtr4g 299	. 2 ⊢ (𝐴 ⊆ 𝐵 → (𝑦 ∈ ∩ 𝑥 ∈ 𝐵 𝐶 → 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶))
7	6	ssrdv 3944	1 ⊢ (𝐴 ⊆ 𝐵 → ∩ 𝑥 ∈ 𝐵 𝐶 ⊆ ∩ 𝑥 ∈ 𝐴 𝐶)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∈ wcel 2146  ∀wral 3081  Vcvv 3457   ⊆ wss 3906  ∩ ciin 4959

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 2148  ax-9 2156  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-v 3459  df-ss 3923  df-iin 4961

This theorem is used by:  polcon3N  40751  smflimsuplem5  47598  smflimsuplem7  47600