Theorem iinssd 43806

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 4013	. . . 4 ⊢ (𝑥 = 𝑋 → (𝐵 ⊆ 𝐶 ↔ 𝐷 ⊆ 𝐶))
5	4	rspcev 3613	. . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐷 ⊆ 𝐶) → ∃𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
6	1, 2, 5	syl2anc 585	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
7		iinss 5059	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
8	6, 7	syl 17	1 ⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2107  ∃wrex 3071   ⊆ wss 3948  ∩ ciin 4998

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704

This theorem depends on definitions:  df-bi 206  df-an 398  df-tru 1545  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ral 3063  df-rex 3072  df-v 3477  df-in 3955  df-ss 3965  df-iin 5000

This theorem is referenced by:  smfsuplem3  45516  smflimsuplem1  45523