MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  iin0 Structured version   Visualization version   GIF version

Theorem iin0 5307
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
StepHypRef Expression
1 iinconst 4957 . 2 (𝐴 ≠ ∅ → 𝑥𝐴 ∅ = ∅)
2 0ex 5252 . . . . . 6 ∅ ∈ V
32n0ii 4295 . . . . 5 ¬ V = ∅
4 0iin 5019 . . . . . 6 𝑥 ∈ ∅ ∅ = V
54eqeq1i 2741 . . . . 5 ( 𝑥 ∈ ∅ ∅ = ∅ ↔ V = ∅)
63, 5mtbir 323 . . . 4 ¬ 𝑥 ∈ ∅ ∅ = ∅
7 iineq1 4964 . . . . 5 (𝐴 = ∅ → 𝑥𝐴 ∅ = 𝑥 ∈ ∅ ∅)
87eqeq1d 2738 . . . 4 (𝐴 = ∅ → ( 𝑥𝐴 ∅ = ∅ ↔ 𝑥 ∈ ∅ ∅ = ∅))
96, 8mtbiri 327 . . 3 (𝐴 = ∅ → ¬ 𝑥𝐴 ∅ = ∅)
109necon2ai 2961 . 2 ( 𝑥𝐴 ∅ = ∅ → 𝐴 ≠ ∅)
111, 10impbii 209 1 (𝐴 ≠ ∅ ↔ 𝑥𝐴 ∅ = ∅)
Colors of variables: wff setvar class
Syntax hints:  wb 206   = wceq 1541  wne 2932  Vcvv 3440  c0 4285   ciin 4947
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-nul 5251
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3061  df-v 3442  df-dif 3904  df-nul 4286  df-iin 4949
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator