Theorem iinssd 46419

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 3944	. . . 4 ⊢ (𝑥 = 𝑋 → (𝐵 ⊆ 𝐶 ↔ 𝐷 ⊆ 𝐶))
5	4	rspcev 3580	. . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐷 ⊆ 𝐶) → ∃𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
6	1, 2, 5	syl2anc 596	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
7		iinss 5020	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
8	6, 7	syl 18	1 ⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   ⊆ wss 3900  ∩ ciin 4957

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-v 3456  df-ss 3901  df-iin 4959

This theorem is used by:  smfsuplem3  48096  smflimsuplem1  48103