ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  xp0 Unicode version

Theorem xp0 4966
Description: The cross product with the empty set is empty. Part of Theorem 3.13(ii) of [Monk1] p. 37. (Contributed by NM, 12-Apr-2004.)
Assertion
Ref Expression
xp0  |-  ( A  X.  (/) )  =  (/)

Proof of Theorem xp0
StepHypRef Expression
1 0xp 4627 . . 3  |-  ( (/)  X.  A )  =  (/)
21cnveqi 4722 . 2  |-  `' (
(/)  X.  A )  =  `' (/)
3 cnvxp 4965 . 2  |-  `' (
(/)  X.  A )  =  ( A  X.  (/) )
4 cnv0 4950 . 2  |-  `' (/)  =  (/)
52, 3, 43eqtr3i 2169 1  |-  ( A  X.  (/) )  =  (/)
Colors of variables: wff set class
Syntax hints:    = wceq 1332   (/)c0 3368    X. cxp 4545   `'ccnv 4546
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-br 3938  df-opab 3998  df-xp 4553  df-rel 4554  df-cnv 4555
This theorem is referenced by:  xpeq0r  4969  xpdisj2  4972  djuassen  7090  xpdjuen  7091  0met  12592
  Copyright terms: Public domain W3C validator