Theorem iinssiin 42567

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

Hypotheses

Ref	Expression
iinssiin.1	⊢ Ⅎ𝑥𝜑
iinssiin.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ 𝐶)

Assertion

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

Proof of Theorem iinssiin

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		iinssiin.1	. . . . 5 ⊢ Ⅎ𝑥𝜑
2		nfii1 4956	. . . . . 6 ⊢ Ⅎ𝑥∩ 𝑥 ∈ 𝐴 𝐵
3	2	nfcri 2893	. . . . 5 ⊢ Ⅎ𝑥 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵
4	1, 3	nfan 1903	. . . 4 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵)
5		iinssiin.2	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ 𝐶)
6	5	adantlr 711	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵) ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ 𝐶)
7		eliinid 42550	. . . . . . 7 ⊢ ((𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ 𝐵)
8	7	adantll 710	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵) ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ 𝐵)
9	6, 8	sseldd 3918	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵) ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ 𝐶)
10	9	ex 412	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵) → (𝑥 ∈ 𝐴 → 𝑦 ∈ 𝐶))
11	4, 10	ralrimi 3139	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵) → ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)
12		eliin 4926	. . . 4 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶))
13	12	elv 3428	. . 3 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)
14	11, 13	sylibr 233	. 2 ⊢ ((𝜑 ∧ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵) → 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶)
15	14	ssd 42519	1 ⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ ∩ 𝑥 ∈ 𝐴 𝐶)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395  Ⅎwnf 1787   ∈ wcel 2108  ∀wral 3063  Vcvv 3422   ⊆ wss 3883  ∩ ciin 4922

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-tru 1542  df-ex 1784  df-nf 1788  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-v 3424  df-in 3890  df-ss 3900  df-iin 4924

This theorem is referenced by: (None)