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

Theorem xp0r 4958
 Description: The cross product with the empty set is empty. Part of Theorem 3.13(ii) of [Monk1] p. 37. (Contributed by NM, 4-Jul-1994.)
Assertion
Ref Expression
xp0r

Proof of Theorem xp0r
Dummy variables are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elxp 4897 . . 3
2 noel 3634 . . . . . . 7
3 simprl 734 . . . . . . 7
42, 3mto 170 . . . . . 6
54nex 1565 . . . . 5
65nex 1565 . . . 4
7 noel 3634 . . . 4
86, 72false 341 . . 3
91, 8bitri 242 . 2
109eqriv 2435 1
 Colors of variables: wff set class Syntax hints:   wa 360  wex 1551   wceq 1653   wcel 1726  c0 3630  cop 3819   cxp 4878 This theorem is referenced by:  dmxpid  5091  res0  5152  xp0  5293  xpnz  5294  xpdisj1  5296  xpcan2  5308  xpima  5315  unixp  5404  unixpid  5406  xpcoid  5417  difxp2  6384  fodomr  7260  xpfi  7380  cdaassen  8064  iundom2g  8417  alephadd  8454  hashxplem  11698  ramcl  13399  txindislem  17667  txhaus  17681  tmdgsum  18127  ust0  18251  sibf0  24651  0mbf  26254 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419  ax-sep 4332  ax-nul 4340  ax-pr 4405 This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-v 2960  df-dif 3325  df-un 3327  df-in 3329  df-ss 3336  df-nul 3631  df-if 3742  df-sn 3822  df-pr 3823  df-op 3825  df-opab 4269  df-xp 4886
 Copyright terms: Public domain W3C validator