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

Theorem 0nelelxp 4734
Description: A member of a cross product (ordered pair) doesn't contain the empty set. (Contributed by NM, 15-Dec-2008.)
Assertion
Ref Expression
0nelelxp  |-  ( C  e.  ( A  X.  B )  ->  -.  (/) 
e.  C )

Proof of Theorem 0nelelxp
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elxp 4722 . 2  |-  ( C  e.  ( A  X.  B )  <->  E. x E. y ( C  = 
<. x ,  y >.  /\  ( x  e.  A  /\  y  e.  B
) ) )
2 0nelop 4272 . . . 4  |-  -.  (/)  e.  <. x ,  y >.
3 simpl 443 . . . . 5  |-  ( ( C  =  <. x ,  y >.  /\  (
x  e.  A  /\  y  e.  B )
)  ->  C  =  <. x ,  y >.
)
43eleq2d 2363 . . . 4  |-  ( ( C  =  <. x ,  y >.  /\  (
x  e.  A  /\  y  e.  B )
)  ->  ( (/)  e.  C  <->  (/)  e.  <. x ,  y
>. ) )
52, 4mtbiri 294 . . 3  |-  ( ( C  =  <. x ,  y >.  /\  (
x  e.  A  /\  y  e.  B )
)  ->  -.  (/)  e.  C
)
65exlimivv 1625 . 2  |-  ( E. x E. y ( C  =  <. x ,  y >.  /\  (
x  e.  A  /\  y  e.  B )
)  ->  -.  (/)  e.  C
)
71, 6sylbi 187 1  |-  ( C  e.  ( A  X.  B )  ->  -.  (/) 
e.  C )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 358   E.wex 1531    = wceq 1632    e. wcel 1696   (/)c0 3468   <.cop 3656    X. cxp 4703
This theorem is referenced by:  onxpdisj  4785  dmsn0el  5158
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pr 4230
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-v 2803  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-op 3662  df-opab 4094  df-xp 4711
  Copyright terms: Public domain W3C validator