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

Theorem 0xp 4466
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
0xp  |-  ( (/)  X.  A )  =  (/)

Proof of Theorem 0xp
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elxp 4408 . . 3  |-  ( z  e.  ( (/)  X.  A
)  <->  E. x E. y
( z  =  <. x ,  y >.  /\  (
x  e.  (/)  /\  y  e.  A ) ) )
2 noel 3271 . . . . . . 7  |-  -.  x  e.  (/)
3 simprl 498 . . . . . . 7  |-  ( ( z  =  <. x ,  y >.  /\  (
x  e.  (/)  /\  y  e.  A ) )  ->  x  e.  (/) )
42, 3mto 621 . . . . . 6  |-  -.  (
z  =  <. x ,  y >.  /\  (
x  e.  (/)  /\  y  e.  A ) )
54nex 1430 . . . . 5  |-  -.  E. y ( z  = 
<. x ,  y >.  /\  ( x  e.  (/)  /\  y  e.  A ) )
65nex 1430 . . . 4  |-  -.  E. x E. y ( z  =  <. x ,  y
>.  /\  ( x  e.  (/)  /\  y  e.  A
) )
7 noel 3271 . . . 4  |-  -.  z  e.  (/)
86, 72false 650 . . 3  |-  ( E. x E. y ( z  =  <. x ,  y >.  /\  (
x  e.  (/)  /\  y  e.  A ) )  <->  z  e.  (/) )
91, 8bitri 182 . 2  |-  ( z  e.  ( (/)  X.  A
)  <->  z  e.  (/) )
109eqriv 2080 1  |-  ( (/)  X.  A )  =  (/)
Colors of variables: wff set class
Syntax hints:    /\ wa 102    = wceq 1285   E.wex 1422    e. wcel 1434   (/)c0 3267   <.cop 3419    X. cxp 4389
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-sep 3916  ax-pow 3968  ax-pr 3992
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-fal 1291  df-nf 1391  df-sb 1688  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-v 2612  df-dif 2984  df-un 2986  df-in 2988  df-ss 2995  df-nul 3268  df-pw 3402  df-sn 3422  df-pr 3423  df-op 3425  df-opab 3860  df-xp 4397
This theorem is referenced by:  res0  4664  xp0  4793  xpeq0r  4796  xpdisj1  4797  xpima1  4817  xpfi  6473  hashxp  9920
  Copyright terms: Public domain W3C validator