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

Theorem xpdjuen 7574
Description: Cardinal multiplication distributes over cardinal addition. Theorem 6I(3) of [Enderton] p. 142. (Contributed by NM, 26-Sep-2004.) (Revised by Mario Carneiro, 29-Apr-2015.)
Assertion
Ref Expression
xpdjuen  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  ( A  X.  ( B C ) )  ~~  ( ( A  X.  B ) ( A  X.  C ) ) )

Proof of Theorem xpdjuen
StepHypRef Expression
1 enrefg 7050 . . . . . 6  |-  ( A  e.  V  ->  A  ~~  A )
213ad2ant1 1049 . . . . 5  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  A  ~~  A )
3 0ex 4260 . . . . . . 7  |-  (/)  e.  _V
4 simp2 1029 . . . . . . 7  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  B  e.  W )
5 xpsnen2g 7127 . . . . . . 7  |-  ( (
(/)  e.  _V  /\  B  e.  W )  ->  ( { (/) }  X.  B
)  ~~  B )
63, 4, 5sylancr 418 . . . . . 6  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  ( { (/) }  X.  B )  ~~  B
)
76ensymd 7070 . . . . 5  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  B  ~~  ( {
(/) }  X.  B
) )
8 xpen 7145 . . . . 5  |-  ( ( A  ~~  A  /\  B  ~~  ( { (/) }  X.  B ) )  ->  ( A  X.  B )  ~~  ( A  X.  ( { (/) }  X.  B ) ) )
92, 7, 8syl2anc 415 . . . 4  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  ( A  X.  B
)  ~~  ( A  X.  ( { (/) }  X.  B ) ) )
10 1on 6694 . . . . . . 7  |-  1o  e.  On
11 simp3 1030 . . . . . . 7  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  C  e.  X )
12 xpsnen2g 7127 . . . . . . 7  |-  ( ( 1o  e.  On  /\  C  e.  X )  ->  ( { 1o }  X.  C )  ~~  C
)
1310, 11, 12sylancr 418 . . . . . 6  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  ( { 1o }  X.  C )  ~~  C
)
1413ensymd 7070 . . . . 5  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  C  ~~  ( { 1o }  X.  C
) )
15 xpen 7145 . . . . 5  |-  ( ( A  ~~  A  /\  C  ~~  ( { 1o }  X.  C ) )  ->  ( A  X.  C )  ~~  ( A  X.  ( { 1o }  X.  C ) ) )
162, 14, 15syl2anc 415 . . . 4  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  ( A  X.  C
)  ~~  ( A  X.  ( { 1o }  X.  C ) ) )
17 xp01disjl 6707 . . . . . . 7  |-  ( ( { (/) }  X.  B
)  i^i  ( { 1o }  X.  C ) )  =  (/)
1817xpeq2i 4795 . . . . . 6  |-  ( A  X.  ( ( {
(/) }  X.  B
)  i^i  ( { 1o }  X.  C ) ) )  =  ( A  X.  (/) )
19 xpindi 4915 . . . . . 6  |-  ( A  X.  ( ( {
(/) }  X.  B
)  i^i  ( { 1o }  X.  C ) ) )  =  ( ( A  X.  ( { (/) }  X.  B
) )  i^i  ( A  X.  ( { 1o }  X.  C ) ) )
20 xp0 5207 . . . . . 6  |-  ( A  X.  (/) )  =  (/)
2118, 19, 203eqtr3i 2267 . . . . 5  |-  ( ( A  X.  ( {
(/) }  X.  B
) )  i^i  ( A  X.  ( { 1o }  X.  C ) ) )  =  (/)
2221a1i 9 . . . 4  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  ( ( A  X.  ( { (/) }  X.  B
) )  i^i  ( A  X.  ( { 1o }  X.  C ) ) )  =  (/) )
23 djuenun 7568 . . . 4  |-  ( ( ( A  X.  B
)  ~~  ( A  X.  ( { (/) }  X.  B ) )  /\  ( A  X.  C
)  ~~  ( A  X.  ( { 1o }  X.  C ) )  /\  ( ( A  X.  ( { (/) }  X.  B
) )  i^i  ( A  X.  ( { 1o }  X.  C ) ) )  =  (/) )  -> 
( ( A  X.  B ) ( A  X.  C ) )  ~~  ( ( A  X.  ( { (/) }  X.  B
) )  u.  ( A  X.  ( { 1o }  X.  C ) ) ) )
249, 16, 22, 23syl3anc 1278 . . 3  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  ( ( A  X.  B ) ( A  X.  C ) )  ~~  ( ( A  X.  ( { (/) }  X.  B
) )  u.  ( A  X.  ( { 1o }  X.  C ) ) ) )
25 df-dju 7378 . . . . 5  |-  ( B C )  =  ( ( { (/) }  X.  B )  u.  ( { 1o }  X.  C
) )
2625xpeq2i 4795 . . . 4  |-  ( A  X.  ( B C ) )  =  ( A  X.  ( ( {
(/) }  X.  B
)  u.  ( { 1o }  X.  C
) ) )
27 xpundi 4831 . . . 4  |-  ( A  X.  ( ( {
(/) }  X.  B
)  u.  ( { 1o }  X.  C
) ) )  =  ( ( A  X.  ( { (/) }  X.  B
) )  u.  ( A  X.  ( { 1o }  X.  C ) ) )
2826, 27eqtri 2259 . . 3  |-  ( A  X.  ( B C ) )  =  ( ( A  X.  ( {
(/) }  X.  B
) )  u.  ( A  X.  ( { 1o }  X.  C ) ) )
2924, 28breqtrrdi 4172 . 2  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  ( ( A  X.  B ) ( A  X.  C ) )  ~~  ( A  X.  ( B C ) ) )
3029ensymd 7070 1  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  ( A  X.  ( B C ) )  ~~  ( ( A  X.  B ) ( A  X.  C ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ w3a 1009    = wceq 1402    e. wcel 2209   _Vcvv 2821    u. cun 3218    i^i cin 3219   (/)c0 3520   {csn 3709   class class class wbr 4130   Oncon0 4508    X. cxp 4772   1oc1o 6680    ~~ cen 7020   ⊔ cdju 7377
This proof depends on 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-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof 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-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-1o 6687  df-er 6807  df-en 7023  df-dju 7378  df-inl 7387  df-inr 7388
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator