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

Theorem djucomen 7431
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 6590 . . . 4  |-  1o  e.  _V
2 xpsnen2g 7013 . . . 4  |-  ( ( 1o  e.  _V  /\  A  e.  V )  ->  ( { 1o }  X.  A )  ~~  A
)
31, 2mpan 424 . . 3  |-  ( A  e.  V  ->  ( { 1o }  X.  A
)  ~~  A )
4 0ex 4216 . . . 4  |-  (/)  e.  _V
5 xpsnen2g 7013 . . . 4  |-  ( (
(/)  e.  _V  /\  B  e.  W )  ->  ( { (/) }  X.  B
)  ~~  B )
64, 5mpan 424 . . 3  |-  ( B  e.  W  ->  ( { (/) }  X.  B
)  ~~  B )
7 ensym 6955 . . . 4  |-  ( ( { 1o }  X.  A )  ~~  A  ->  A  ~~  ( { 1o }  X.  A
) )
8 ensym 6955 . . . 4  |-  ( ( { (/) }  X.  B
)  ~~  B  ->  B 
~~  ( { (/) }  X.  B ) )
9 incom 3399 . . . . . 6  |-  ( ( { 1o }  X.  A )  i^i  ( { (/) }  X.  B
) )  =  ( ( { (/) }  X.  B )  i^i  ( { 1o }  X.  A
) )
10 xp01disjl 6602 . . . . . 6  |-  ( ( { (/) }  X.  B
)  i^i  ( { 1o }  X.  A ) )  =  (/)
119, 10eqtri 2252 . . . . 5  |-  ( ( { 1o }  X.  A )  i^i  ( { (/) }  X.  B
) )  =  (/)
12 djuenun 7427 . . . . 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 1362 . . . 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 7237 . . 3  |-  ( B A )  =  ( ( { (/) }  X.  B )  u.  ( { 1o }  X.  A
) )
1716equncomi 3353 . 2  |-  ( B A )  =  ( ( { 1o }  X.  A )  u.  ( { (/) }  X.  B
) )
1815, 17breqtrrdi 4130 1  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A B )  ~~  ( B A )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1397    e. wcel 2202   _Vcvv 2802    u. cun 3198    i^i cin 3199   (/)c0 3494   {csn 3669   class class class wbr 4088    X. cxp 4723   1oc1o 6575    ~~ cen 6907   ⊔ cdju 7236
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-1st 6303  df-2nd 6304  df-1o 6582  df-er 6702  df-en 6910  df-dju 7237  df-inl 7246  df-inr 7247
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator