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

Theorem iin0 5260
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 4928 . 2 (𝐴 ≠ ∅ → 𝑥𝐴 ∅ = ∅)
2 0ex 5210 . . . . . 6 ∅ ∈ V
32n0ii 4301 . . . . 5 ¬ V = ∅
4 0iin 4986 . . . . . 6 𝑥 ∈ ∅ ∅ = V
54eqeq1i 2826 . . . . 5 ( 𝑥 ∈ ∅ ∅ = ∅ ↔ V = ∅)
63, 5mtbir 325 . . . 4 ¬ 𝑥 ∈ ∅ ∅ = ∅
7 iineq1 4935 . . . . 5 (𝐴 = ∅ → 𝑥𝐴 ∅ = 𝑥 ∈ ∅ ∅)
87eqeq1d 2823 . . . 4 (𝐴 = ∅ → ( 𝑥𝐴 ∅ = ∅ ↔ 𝑥 ∈ ∅ ∅ = ∅))
96, 8mtbiri 329 . . 3 (𝐴 = ∅ → ¬ 𝑥𝐴 ∅ = ∅)
109necon2ai 3045 . 2 ( 𝑥𝐴 ∅ = ∅ → 𝐴 ≠ ∅)
111, 10impbii 211 1 (𝐴 ≠ ∅ ↔ 𝑥𝐴 ∅ = ∅)
Colors of variables: wff setvar class
Syntax hints:  wb 208   = wceq 1533  wne 3016  Vcvv 3494  c0 4290   ciin 4919
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-nul 5209
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-v 3496  df-dif 3938  df-nul 4291  df-iin 4921
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator