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

Theorem 0xp 4707
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 4644 . . 3  |-  ( z  e.  ( (/)  X.  A
)  <->  E. x E. y
( z  =  <. x ,  y >.  /\  (
x  e.  (/)  /\  y  e.  A ) ) )
2 noel 3427 . . . . . . 7  |-  -.  x  e.  (/)
3 simprl 529 . . . . . . 7  |-  ( ( z  =  <. x ,  y >.  /\  (
x  e.  (/)  /\  y  e.  A ) )  ->  x  e.  (/) )
42, 3mto 662 . . . . . 6  |-  -.  (
z  =  <. x ,  y >.  /\  (
x  e.  (/)  /\  y  e.  A ) )
54nex 1500 . . . . 5  |-  -.  E. y ( z  = 
<. x ,  y >.  /\  ( x  e.  (/)  /\  y  e.  A ) )
65nex 1500 . . . 4  |-  -.  E. x E. y ( z  =  <. x ,  y
>.  /\  ( x  e.  (/)  /\  y  e.  A
) )
7 noel 3427 . . . 4  |-  -.  z  e.  (/)
86, 72false 701 . . 3  |-  ( E. x E. y ( z  =  <. x ,  y >.  /\  (
x  e.  (/)  /\  y  e.  A ) )  <->  z  e.  (/) )
91, 8bitri 184 . 2  |-  ( z  e.  ( (/)  X.  A
)  <->  z  e.  (/) )
109eqriv 2174 1  |-  ( (/)  X.  A )  =  (/)
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1353   E.wex 1492    e. wcel 2148   (/)c0 3423   <.cop 3596    X. cxp 4625
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4122  ax-pow 4175  ax-pr 4210
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2740  df-dif 3132  df-un 3134  df-in 3136  df-ss 3143  df-nul 3424  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-opab 4066  df-xp 4633
This theorem is referenced by:  res0  4912  xp0  5049  xpeq0r  5052  xpdisj1  5054  xpima1  5076  xpfi  6929  exmidfodomrlemim  7200  hashxp  10806
  Copyright terms: Public domain W3C validator