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

Theorem addcomprg 7791
Description: Addition of positive reals is commutative. Proposition 9-3.5(ii) of [Gleason] p. 123. (Contributed by Jim Kingdon, 11-Dec-2019.)
Assertion
Ref Expression
addcomprg  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  +P.  B
)  =  ( B  +P.  A ) )

Proof of Theorem addcomprg
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prop 7688 . . . . . . . . 9  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
2 elprnql 7694 . . . . . . . . 9  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  y  e.  ( 1st `  B ) )  -> 
y  e.  Q. )
31, 2sylan 283 . . . . . . . 8  |-  ( ( B  e.  P.  /\  y  e.  ( 1st `  B ) )  -> 
y  e.  Q. )
4 prop 7688 . . . . . . . . . . . . 13  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
5 elprnql 7694 . . . . . . . . . . . . 13  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  z  e.  ( 1st `  A ) )  -> 
z  e.  Q. )
64, 5sylan 283 . . . . . . . . . . . 12  |-  ( ( A  e.  P.  /\  z  e.  ( 1st `  A ) )  -> 
z  e.  Q. )
7 addcomnqg 7594 . . . . . . . . . . . . 13  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y  +Q  z
)  =  ( z  +Q  y ) )
87eqeq2d 2241 . . . . . . . . . . . 12  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( x  =  ( y  +Q  z )  <-> 
x  =  ( z  +Q  y ) ) )
96, 8sylan2 286 . . . . . . . . . . 11  |-  ( ( y  e.  Q.  /\  ( A  e.  P.  /\  z  e.  ( 1st `  A ) ) )  ->  ( x  =  ( y  +Q  z
)  <->  x  =  (
z  +Q  y ) ) )
109anassrs 400 . . . . . . . . . 10  |-  ( ( ( y  e.  Q.  /\  A  e.  P. )  /\  z  e.  ( 1st `  A ) )  ->  ( x  =  ( y  +Q  z
)  <->  x  =  (
z  +Q  y ) ) )
1110rexbidva 2527 . . . . . . . . 9  |-  ( ( y  e.  Q.  /\  A  e.  P. )  ->  ( E. z  e.  ( 1st `  A
) x  =  ( y  +Q  z )  <->  E. z  e.  ( 1st `  A ) x  =  ( z  +Q  y ) ) )
1211ancoms 268 . . . . . . . 8  |-  ( ( A  e.  P.  /\  y  e.  Q. )  ->  ( E. z  e.  ( 1st `  A
) x  =  ( y  +Q  z )  <->  E. z  e.  ( 1st `  A ) x  =  ( z  +Q  y ) ) )
133, 12sylan2 286 . . . . . . 7  |-  ( ( A  e.  P.  /\  ( B  e.  P.  /\  y  e.  ( 1st `  B ) ) )  ->  ( E. z  e.  ( 1st `  A
) x  =  ( y  +Q  z )  <->  E. z  e.  ( 1st `  A ) x  =  ( z  +Q  y ) ) )
1413anassrs 400 . . . . . 6  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  y  e.  ( 1st `  B ) )  ->  ( E. z  e.  ( 1st `  A
) x  =  ( y  +Q  z )  <->  E. z  e.  ( 1st `  A ) x  =  ( z  +Q  y ) ) )
1514rexbidva 2527 . . . . 5  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( E. y  e.  ( 1st `  B
) E. z  e.  ( 1st `  A
) x  =  ( y  +Q  z )  <->  E. y  e.  ( 1st `  B ) E. z  e.  ( 1st `  A ) x  =  ( z  +Q  y
) ) )
16 rexcom 2695 . . . . 5  |-  ( E. y  e.  ( 1st `  B ) E. z  e.  ( 1st `  A
) x  =  ( z  +Q  y )  <->  E. z  e.  ( 1st `  A ) E. y  e.  ( 1st `  B ) x  =  ( z  +Q  y
) )
1715, 16bitrdi 196 . . . 4  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( E. y  e.  ( 1st `  B
) E. z  e.  ( 1st `  A
) x  =  ( y  +Q  z )  <->  E. z  e.  ( 1st `  A ) E. y  e.  ( 1st `  B ) x  =  ( z  +Q  y
) ) )
1817rabbidv 2789 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  { x  e.  Q.  |  E. y  e.  ( 1st `  B ) E. z  e.  ( 1st `  A ) x  =  ( y  +Q  z ) }  =  { x  e. 
Q.  |  E. z  e.  ( 1st `  A
) E. y  e.  ( 1st `  B
) x  =  ( z  +Q  y ) } )
19 elprnqu 7695 . . . . . . . . 9  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  y  e.  ( 2nd `  B ) )  -> 
y  e.  Q. )
201, 19sylan 283 . . . . . . . 8  |-  ( ( B  e.  P.  /\  y  e.  ( 2nd `  B ) )  -> 
y  e.  Q. )
21 elprnqu 7695 . . . . . . . . . . . . 13  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  z  e.  ( 2nd `  A ) )  -> 
z  e.  Q. )
224, 21sylan 283 . . . . . . . . . . . 12  |-  ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  -> 
z  e.  Q. )
2322, 8sylan2 286 . . . . . . . . . . 11  |-  ( ( y  e.  Q.  /\  ( A  e.  P.  /\  z  e.  ( 2nd `  A ) ) )  ->  ( x  =  ( y  +Q  z
)  <->  x  =  (
z  +Q  y ) ) )
2423anassrs 400 . . . . . . . . . 10  |-  ( ( ( y  e.  Q.  /\  A  e.  P. )  /\  z  e.  ( 2nd `  A ) )  ->  ( x  =  ( y  +Q  z
)  <->  x  =  (
z  +Q  y ) ) )
2524rexbidva 2527 . . . . . . . . 9  |-  ( ( y  e.  Q.  /\  A  e.  P. )  ->  ( E. z  e.  ( 2nd `  A
) x  =  ( y  +Q  z )  <->  E. z  e.  ( 2nd `  A ) x  =  ( z  +Q  y ) ) )
2625ancoms 268 . . . . . . . 8  |-  ( ( A  e.  P.  /\  y  e.  Q. )  ->  ( E. z  e.  ( 2nd `  A
) x  =  ( y  +Q  z )  <->  E. z  e.  ( 2nd `  A ) x  =  ( z  +Q  y ) ) )
2720, 26sylan2 286 . . . . . . 7  |-  ( ( A  e.  P.  /\  ( B  e.  P.  /\  y  e.  ( 2nd `  B ) ) )  ->  ( E. z  e.  ( 2nd `  A
) x  =  ( y  +Q  z )  <->  E. z  e.  ( 2nd `  A ) x  =  ( z  +Q  y ) ) )
2827anassrs 400 . . . . . 6  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  y  e.  ( 2nd `  B ) )  ->  ( E. z  e.  ( 2nd `  A
) x  =  ( y  +Q  z )  <->  E. z  e.  ( 2nd `  A ) x  =  ( z  +Q  y ) ) )
2928rexbidva 2527 . . . . 5  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( E. y  e.  ( 2nd `  B
) E. z  e.  ( 2nd `  A
) x  =  ( y  +Q  z )  <->  E. y  e.  ( 2nd `  B ) E. z  e.  ( 2nd `  A ) x  =  ( z  +Q  y
) ) )
30 rexcom 2695 . . . . 5  |-  ( E. y  e.  ( 2nd `  B ) E. z  e.  ( 2nd `  A
) x  =  ( z  +Q  y )  <->  E. z  e.  ( 2nd `  A ) E. y  e.  ( 2nd `  B ) x  =  ( z  +Q  y
) )
3129, 30bitrdi 196 . . . 4  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( E. y  e.  ( 2nd `  B
) E. z  e.  ( 2nd `  A
) x  =  ( y  +Q  z )  <->  E. z  e.  ( 2nd `  A ) E. y  e.  ( 2nd `  B ) x  =  ( z  +Q  y
) ) )
3231rabbidv 2789 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  { x  e.  Q.  |  E. y  e.  ( 2nd `  B ) E. z  e.  ( 2nd `  A ) x  =  ( y  +Q  z ) }  =  { x  e. 
Q.  |  E. z  e.  ( 2nd `  A
) E. y  e.  ( 2nd `  B
) x  =  ( z  +Q  y ) } )
3318, 32opeq12d 3868 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  -> 
<. { x  e.  Q.  |  E. y  e.  ( 1st `  B ) E. z  e.  ( 1st `  A ) x  =  ( y  +Q  z ) } ,  { x  e. 
Q.  |  E. y  e.  ( 2nd `  B
) E. z  e.  ( 2nd `  A
) x  =  ( y  +Q  z ) } >.  =  <. { x  e.  Q.  |  E. z  e.  ( 1st `  A ) E. y  e.  ( 1st `  B ) x  =  ( z  +Q  y
) } ,  {
x  e.  Q.  |  E. z  e.  ( 2nd `  A ) E. y  e.  ( 2nd `  B ) x  =  ( z  +Q  y
) } >. )
34 plpvlu 7751 . . 3  |-  ( ( B  e.  P.  /\  A  e.  P. )  ->  ( B  +P.  A
)  =  <. { x  e.  Q.  |  E. y  e.  ( 1st `  B
) E. z  e.  ( 1st `  A
) x  =  ( y  +Q  z ) } ,  { x  e.  Q.  |  E. y  e.  ( 2nd `  B
) E. z  e.  ( 2nd `  A
) x  =  ( y  +Q  z ) } >. )
3534ancoms 268 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( B  +P.  A
)  =  <. { x  e.  Q.  |  E. y  e.  ( 1st `  B
) E. z  e.  ( 1st `  A
) x  =  ( y  +Q  z ) } ,  { x  e.  Q.  |  E. y  e.  ( 2nd `  B
) E. z  e.  ( 2nd `  A
) x  =  ( y  +Q  z ) } >. )
36 plpvlu 7751 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  +P.  B
)  =  <. { x  e.  Q.  |  E. z  e.  ( 1st `  A
) E. y  e.  ( 1st `  B
) x  =  ( z  +Q  y ) } ,  { x  e.  Q.  |  E. z  e.  ( 2nd `  A
) E. y  e.  ( 2nd `  B
) x  =  ( z  +Q  y ) } >. )
3733, 35, 363eqtr4rd 2273 1  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  +P.  B
)  =  ( B  +P.  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1395    e. wcel 2200   E.wrex 2509   {crab 2512   <.cop 3670   ` cfv 5324  (class class class)co 6013   1stc1st 6296   2ndc2nd 6297   Q.cnq 7493    +Q cplq 7495   P.cnp 7504    +P. cpp 7506
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-irdg 6531  df-oadd 6581  df-omul 6582  df-er 6697  df-ec 6699  df-qs 6703  df-ni 7517  df-pli 7518  df-mi 7519  df-plpq 7557  df-enq 7560  df-nqqs 7561  df-plqqs 7562  df-inp 7679  df-iplp 7681
This theorem is referenced by:  prplnqu  7833  addextpr  7834  caucvgprlemcanl  7857  caucvgprprlemnkltj  7902  caucvgprprlemnbj  7906  caucvgprprlemmu  7908  caucvgprprlemloc  7916  caucvgprprlemexbt  7919  caucvgprprlemexb  7920  caucvgprprlemaddq  7921  enrer  7948  addcmpblnr  7952  mulcmpblnrlemg  7953  ltsrprg  7960  addcomsrg  7968  mulcomsrg  7970  mulasssrg  7971  distrsrg  7972  lttrsr  7975  ltposr  7976  ltsosr  7977  0lt1sr  7978  0idsr  7980  1idsr  7981  ltasrg  7983  recexgt0sr  7986  mulgt0sr  7991  aptisr  7992  mulextsr1lem  7993  archsr  7995  srpospr  7996  prsrpos  7998  prsradd  7999  prsrlt  8000  ltpsrprg  8016  map2psrprg  8018  pitonnlem1p1  8059  pitoregt0  8062  recidpirqlemcalc  8070
  Copyright terms: Public domain W3C validator