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

Theorem xp0 5202
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 4850 . . 3  |-  ( (/)  X.  A )  =  (/)
21cnveqi 4950 . 2  |-  `' (
(/)  X.  A )  =  `' (/)
3 cnvxp 5201 . 2  |-  `' (
(/)  X.  A )  =  ( A  X.  (/) )
4 cnv0 5186 . 2  |-  `' (/)  =  (/)
52, 3, 43eqtr3i 2267 1  |-  ( A  X.  (/) )  =  (/)
Colors of variables: wff set class
Syntax hints:    = wceq 1402   (/)c0 3520    X. cxp 4767   `'ccnv 4768
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-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  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-br 4126  df-opab 4188  df-xp 4775  df-rel 4776  df-cnv 4777
This theorem is referenced by:  xpeq0r  5205  xpdisj2  5208  djuassen  7563  xpdjuen  7564  0met  15408
  Copyright terms: Public domain W3C validator