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

Theorem xpeq0r 5089
Description: A cross product is empty if at least one member is empty. (Contributed by Jim Kingdon, 12-Dec-2018.)
Assertion
Ref Expression
xpeq0r  |-  ( ( A  =  (/)  \/  B  =  (/) )  ->  ( A  X.  B )  =  (/) )

Proof of Theorem xpeq0r
StepHypRef Expression
1 xpeq1 4674 . . 3  |-  ( A  =  (/)  ->  ( A  X.  B )  =  ( (/)  X.  B
) )
2 0xp 4740 . . 3  |-  ( (/)  X.  B )  =  (/)
31, 2eqtrdi 2242 . 2  |-  ( A  =  (/)  ->  ( A  X.  B )  =  (/) )
4 xpeq2 4675 . . 3  |-  ( B  =  (/)  ->  ( A  X.  B )  =  ( A  X.  (/) ) )
5 xp0 5086 . . 3  |-  ( A  X.  (/) )  =  (/)
64, 5eqtrdi 2242 . 2  |-  ( B  =  (/)  ->  ( A  X.  B )  =  (/) )
73, 6jaoi 717 1  |-  ( ( A  =  (/)  \/  B  =  (/) )  ->  ( A  X.  B )  =  (/) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ wo 709    = wceq 1364   (/)c0 3447    X. cxp 4658
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-br 4031  df-opab 4092  df-xp 4666  df-rel 4667  df-cnv 4668
This theorem is referenced by:  sqxpeq0  5090
  Copyright terms: Public domain W3C validator