Theorem iinssd 45907

Description: Subset implication for an indexed intersection. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
iinssd.1	⊢ (𝜑 → 𝑋 ∈ 𝐴)
iinssd.2	⊢ (𝑥 = 𝑋 → 𝐵 = 𝐷)
iinssd.3	⊢ (𝜑 → 𝐷 ⊆ 𝐶)

Assertion

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

Distinct variable groups:   𝑥,𝐴   𝑥,𝐶   𝑥,𝐷   𝑥,𝑋

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

Proof of Theorem iinssd

Step	Hyp	Ref	Expression
1		iinssd.1	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
2		iinssd.3	. . 3 ⊢ (𝜑 → 𝐷 ⊆ 𝐶)
3		iinssd.2	. . . . 5 ⊢ (𝑥 = 𝑋 → 𝐵 = 𝐷)
4	3	sseq1d 3969	. . . 4 ⊢ (𝑥 = 𝑋 → (𝐵 ⊆ 𝐶 ↔ 𝐷 ⊆ 𝐶))
5	4	rspcev 3583	. . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐷 ⊆ 𝐶) → ∃𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
6	1, 2, 5	syl2anc 596	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
7		iinss 5023	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
8	6, 7	syl 18	1 ⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146  ∃wrex 3091   ⊆ 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-rex 3092  df-v 3459  df-ss 3923  df-iin 4961

This theorem is used by:  smfsuplem3  47585  smflimsuplem1  47592