Theorem 0nelelxp 4798

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.

Step	Hyp	Ref	Expression
1		elxp 4786	. 2 |- ( C e. ( A X. B ) <-> E. x E. y ( C = <. x , y >. /\ ( x e. A /\ y e. B ) ) )
2		0nelop 4383	. . . 4 |- -. (/) e. <. x , y >.
3		simpl 109	. . . . 5 |- ( ( C = <. x , y >. /\ ( x e. A /\ y e. B ) ) -> C = <. x , y >. )
4	3	eleq2d 2308	. . . 4 |- ( ( C = <. x , y >. /\ ( x e. A /\ y e. B ) ) -> ( (/) e. C <-> (/) e. <. x , y >. ) )
5	2, 4	mtbiri 686	. . 3 |- ( ( C = <. x , y >. /\ ( x e. A /\ y e. B ) ) -> -. (/) e. C )
6	5	exlimivv 1952	. 2 |- ( E. x E. y ( C = <. x , y >. /\ ( x e. A /\ y e. B ) ) -> -. (/) e. C )
7	1, 6	sylbi 121	1 |- ( C e. ( A X. B ) -> -. (/) e. C )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   = wceq 1402   E.wex 1545   e. wcel 2209   (/)c0 3520   <.cop 3708   X. cxp 4767

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-opab 4188  df-xp 4775

This theorem is referenced by:  dmsn0el  5252