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

Theorem djucomen 7354
Description: Commutative law for cardinal addition. Exercise 4.56(c) of [Mendelson] p. 258. (Contributed by NM, 24-Sep-2004.) (Revised by Mario Carneiro, 29-Apr-2015.)
Assertion
Ref Expression
djucomen  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A B )  ~~  ( B A )
)

Proof of Theorem djucomen
StepHypRef Expression
1 1oex 6528 . . . 4  |-  1o  e.  _V
2 xpsnen2g 6944 . . . 4  |-  ( ( 1o  e.  _V  /\  A  e.  V )  ->  ( { 1o }  X.  A )  ~~  A
)
31, 2mpan 424 . . 3  |-  ( A  e.  V  ->  ( { 1o }  X.  A
)  ~~  A )
4 0ex 4182 . . . 4  |-  (/)  e.  _V
5 xpsnen2g 6944 . . . 4  |-  ( (
(/)  e.  _V  /\  B  e.  W )  ->  ( { (/) }  X.  B
)  ~~  B )
64, 5mpan 424 . . 3  |-  ( B  e.  W  ->  ( { (/) }  X.  B
)  ~~  B )
7 ensym 6891 . . . 4  |-  ( ( { 1o }  X.  A )  ~~  A  ->  A  ~~  ( { 1o }  X.  A
) )
8 ensym 6891 . . . 4  |-  ( ( { (/) }  X.  B
)  ~~  B  ->  B 
~~  ( { (/) }  X.  B ) )
9 incom 3369 . . . . . 6  |-  ( ( { 1o }  X.  A )  i^i  ( { (/) }  X.  B
) )  =  ( ( { (/) }  X.  B )  i^i  ( { 1o }  X.  A
) )
10 xp01disjl 6538 . . . . . 6  |-  ( ( { (/) }  X.  B
)  i^i  ( { 1o }  X.  A ) )  =  (/)
119, 10eqtri 2227 . . . . 5  |-  ( ( { 1o }  X.  A )  i^i  ( { (/) }  X.  B
) )  =  (/)
12 djuenun 7350 . . . . 5  |-  ( ( A  ~~  ( { 1o }  X.  A
)  /\  B  ~~  ( { (/) }  X.  B
)  /\  ( ( { 1o }  X.  A
)  i^i  ( { (/)
}  X.  B ) )  =  (/) )  -> 
( A B )  ~~  ( ( { 1o }  X.  A )  u.  ( { (/) }  X.  B ) ) )
1311, 12mp3an3 1339 . . . 4  |-  ( ( A  ~~  ( { 1o }  X.  A
)  /\  B  ~~  ( { (/) }  X.  B
) )  ->  ( A B )  ~~  (
( { 1o }  X.  A )  u.  ( { (/) }  X.  B
) ) )
147, 8, 13syl2an 289 . . 3  |-  ( ( ( { 1o }  X.  A )  ~~  A  /\  ( { (/) }  X.  B )  ~~  B
)  ->  ( A B )  ~~  ( ( { 1o }  X.  A )  u.  ( { (/) }  X.  B
) ) )
153, 6, 14syl2an 289 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A B )  ~~  ( ( { 1o }  X.  A )  u.  ( { (/) }  X.  B ) ) )
16 df-dju 7161 . . 3  |-  ( B A )  =  ( ( { (/) }  X.  B )  u.  ( { 1o }  X.  A
) )
1716equncomi 3323 . 2  |-  ( B A )  =  ( ( { 1o }  X.  A )  u.  ( { (/) }  X.  B
) )
1815, 17breqtrrdi 4096 1  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A B )  ~~  ( B A )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1373    e. wcel 2177   _Vcvv 2773    u. cun 3168    i^i cin 3169   (/)c0 3464   {csn 3638   class class class wbr 4054    X. cxp 4686   1oc1o 6513    ~~ cen 6843   ⊔ cdju 7160
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4170  ax-sep 4173  ax-nul 4181  ax-pow 4229  ax-pr 4264  ax-un 4493
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rex 2491  df-reu 2492  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-nul 3465  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3860  df-int 3895  df-iun 3938  df-br 4055  df-opab 4117  df-mpt 4118  df-tr 4154  df-id 4353  df-iord 4426  df-on 4428  df-suc 4431  df-xp 4694  df-rel 4695  df-cnv 4696  df-co 4697  df-dm 4698  df-rn 4699  df-res 4700  df-ima 4701  df-iota 5246  df-fun 5287  df-fn 5288  df-f 5289  df-f1 5290  df-fo 5291  df-f1o 5292  df-fv 5293  df-1st 6244  df-2nd 6245  df-1o 6520  df-er 6638  df-en 6846  df-dju 7161  df-inl 7170  df-inr 7171
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator