Theorem iinexd 46091

Description: The existence of an indexed union. 𝑥 is normally a free-variable parameter in 𝐵, which should be read 𝐵(𝑥). (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
iinexd.1	⊢ (𝜑 → 𝐴 ≠ ∅)
iinexd.2	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶)

Assertion

Ref	Expression
iinexd	⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ V)

Distinct variable group:   𝑥,𝐴

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

Proof of Theorem iinexd

Step	Hyp	Ref	Expression
1		iinexd.1	. 2 ⊢ (𝜑 → 𝐴 ≠ ∅)
2		iinexd.2	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶)
3		iinexg 5309	. 2 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ V)
4	1, 2, 3	syl2anc 596	1 ⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ V)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2145   ≠ wne 2956  ∀wral 3077  Vcvv 3451  ∅c0 4279  ∩ ciin 4952

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-in 3906  df-ss 3916  df-nul 4280  df-int 4908  df-iin 4954

This theorem is used by:  smfsuplem1  47765  smfinflem  47771  smflimsuplem1  47774  smflimsuplem2  47775  smflimsuplem3  47776  smflimsuplem4  47777  smflimsuplem5  47778  smflimsuplem7  47780