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

Theorem iin0 5333
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 4967 . 2 (𝐴 ≠ ∅ → 𝑥𝐴 ∅ = ∅)
2 0ex 5270 . . . . . 6 ∅ ∈ V
32n0ii 4296 . . . . 5 ¬ V = ∅
4 0iin 5028 . . . . . 6 𝑥 ∈ ∅ ∅ = V
54eqeq1i 2768 . . . . 5 ( 𝑥 ∈ ∅ ∅ = ∅ ↔ V = ∅)
63, 5mtbir 326 . . . 4 ¬ 𝑥 ∈ ∅ ∅ = ∅
7 iineq1 4974 . . . . 5 (𝐴 = ∅ → 𝑥𝐴 ∅ = 𝑥 ∈ ∅ ∅)
87eqeq1d 2765 . . . 4 (𝐴 = ∅ → ( 𝑥𝐴 ∅ = ∅ ↔ 𝑥 ∈ ∅ ∅ = ∅))
96, 8mtbiri 330 . . 3 (𝐴 = ∅ → ¬ 𝑥𝐴 ∅ = ∅)
109necon2ai 2987 . 2 ( 𝑥𝐴 ∅ = ∅ → 𝐴 ≠ ∅)
111, 10impbii 212 1 (𝐴 ≠ ∅ ↔ 𝑥𝐴 ∅ = ∅)
Colors of variables: wff setvar class
Syntax hints:  wb 209   = wceq 1570  wne 2958  Vcvv 3455  c0 4286   ciin 4957
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-nul 5269
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-v 3457  df-dif 3908  df-nul 4287  df-iin 4959
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator