MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  0elixp Unicode version

Theorem 0elixp 7030
Description: Membership of the empty set in an infinite Cartesian product. (Contributed by Steve Rodriguez, 29-Sep-2006.)
Assertion
Ref Expression
0elixp  |-  (/)  e.  X_ x  e.  (/)  A

Proof of Theorem 0elixp
StepHypRef Expression
1 0ex 4281 . . 3  |-  (/)  e.  _V
21snid 3785 . 2  |-  (/)  e.  { (/)
}
3 ixp0x 7027 . 2  |-  X_ x  e.  (/)  A  =  { (/)
}
42, 3eleqtrri 2461 1  |-  (/)  e.  X_ x  e.  (/)  A
Colors of variables: wff set class
Syntax hints:    e. wcel 1717   (/)c0 3572   {csn 3758   X_cixp 7000
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2369  ax-sep 4272  ax-nul 4280  ax-pr 4345
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2243  df-mo 2244  df-clab 2375  df-cleq 2381  df-clel 2384  df-nfc 2513  df-ne 2553  df-ral 2655  df-rex 2656  df-rab 2659  df-v 2902  df-dif 3267  df-un 3269  df-in 3271  df-ss 3278  df-nul 3573  df-if 3684  df-sn 3764  df-pr 3765  df-op 3767  df-br 4155  df-opab 4209  df-id 4440  df-xp 4825  df-rel 4826  df-cnv 4827  df-co 4828  df-dm 4829  df-fun 5397  df-fn 5398  df-ixp 7001
  Copyright terms: Public domain W3C validator