Theorem iin0 5324

Description: An indexed intersection of the empty set, with a nonempty index set, is empty. (Contributed by NM, 20-Oct-2005.)

Assertion

Ref	Expression
iin0	⊢ (𝐴 ≠ ∅ ↔ ∩ 𝑥 ∈ 𝐴 ∅ = ∅)

Distinct variable group:   𝑥,𝐴

Proof of Theorem iin0

Step	Hyp	Ref	Expression
1		iinconst 4962	. 2 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 ∅ = ∅)
2		0ex 5261	. . . . . 6 ⊢ ∅ ∈ V
3	2	n0ii 4289	. . . . 5 ⊢ ¬ V = ∅
4		0iin 5022	. . . . . 6 ⊢ ∩ 𝑥 ∈ ∅ ∅ = V
5	4	eqeq1i 2766	. . . . 5 ⊢ (∩ 𝑥 ∈ ∅ ∅ = ∅ ↔ V = ∅)
6	3, 5	mtbir 326	. . . 4 ⊢ ¬ ∩ 𝑥 ∈ ∅ ∅ = ∅
7		iineq1 4969	. . . . 5 ⊢ (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 ∅ = ∩ 𝑥 ∈ ∅ ∅)
8	7	eqeq1d 2763	. . . 4 ⊢ (𝐴 = ∅ → (∩ 𝑥 ∈ 𝐴 ∅ = ∅ ↔ ∩ 𝑥 ∈ ∅ ∅ = ∅))
9	6, 8	mtbiri 330	. . 3 ⊢ (𝐴 = ∅ → ¬ ∩ 𝑥 ∈ 𝐴 ∅ = ∅)
10	9	necon2ai 2985	. 2 ⊢ (∩ 𝑥 ∈ 𝐴 ∅ = ∅ → 𝐴 ≠ ∅)
11	1, 10	impbii 212	1 ⊢ (𝐴 ≠ ∅ ↔ ∩ 𝑥 ∈ 𝐴 ∅ = ∅)

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   ≠ wne 2956  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-ext 2733  ax-nul 5260

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 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-v 3453  df-dif 3902  df-nul 4280  df-iin 4954

This theorem is used by: (None)