Theorem iineq0 49657

Description: An indexed intersection is empty if one of the intersected classes is empty. (Contributed by Zhi Wang, 30-Oct-2025.)

Assertion

Ref	Expression
iineq0	⊢ (∃𝑥 ∈ 𝐴 𝐵 = ∅ → ∩ 𝑥 ∈ 𝐴 𝐵 = ∅)

Proof of Theorem iineq0

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nel02 4292	. . . . 5 ⊢ (𝐵 = ∅ → ¬ 𝑦 ∈ 𝐵)
2	1	reximi 3105	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝐵 = ∅ → ∃𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐵)
3		rexnal 3119	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐵 ↔ ¬ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)
4	2, 3	sylib 221	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝐵 = ∅ → ¬ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)
5		eliin 4963	. . . 4 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵))
6	5	elv 3462	. . 3 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)
7	4, 6	sylnibr 332	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝐵 = ∅ → ¬ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵)
8	7	eq0rdv 4372	1 ⊢ (∃𝑥 ∈ 𝐴 𝐵 = ∅ → ∩ 𝑥 ∈ 𝐴 𝐵 = ∅)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ∃wrex 3091  Vcvv 3457  ∅c0 4286  ∩ 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-fal 1583  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-dif 3909  df-nul 4287  df-iin 4961

This theorem is used by: (None)