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

Theorem mulcomprg 7647
Description: Multiplication of positive reals is commutative. Proposition 9-3.7(ii) of [Gleason] p. 124. (Contributed by Jim Kingdon, 11-Dec-2019.)
Assertion
Ref Expression
mulcomprg  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  .P.  B
)  =  ( B  .P.  A ) )

Proof of Theorem mulcomprg
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prop 7542 . . . . . . . . 9  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
2 elprnql 7548 . . . . . . . . 9  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  z  e.  ( 1st `  B ) )  -> 
z  e.  Q. )
31, 2sylan 283 . . . . . . . 8  |-  ( ( B  e.  P.  /\  z  e.  ( 1st `  B ) )  -> 
z  e.  Q. )
4 prop 7542 . . . . . . . . . . . . 13  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
5 elprnql 7548 . . . . . . . . . . . . 13  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  y  e.  ( 1st `  A ) )  -> 
y  e.  Q. )
64, 5sylan 283 . . . . . . . . . . . 12  |-  ( ( A  e.  P.  /\  y  e.  ( 1st `  A ) )  -> 
y  e.  Q. )
7 mulcomnqg 7450 . . . . . . . . . . . . 13  |-  ( ( z  e.  Q.  /\  y  e.  Q. )  ->  ( z  .Q  y
)  =  ( y  .Q  z ) )
87eqeq2d 2208 . . . . . . . . . . . 12  |-  ( ( z  e.  Q.  /\  y  e.  Q. )  ->  ( x  =  ( z  .Q  y )  <-> 
x  =  ( y  .Q  z ) ) )
96, 8sylan2 286 . . . . . . . . . . 11  |-  ( ( z  e.  Q.  /\  ( A  e.  P.  /\  y  e.  ( 1st `  A ) ) )  ->  ( x  =  ( z  .Q  y
)  <->  x  =  (
y  .Q  z ) ) )
109anassrs 400 . . . . . . . . . 10  |-  ( ( ( z  e.  Q.  /\  A  e.  P. )  /\  y  e.  ( 1st `  A ) )  ->  ( x  =  ( z  .Q  y
)  <->  x  =  (
y  .Q  z ) ) )
1110rexbidva 2494 . . . . . . . . 9  |-  ( ( z  e.  Q.  /\  A  e.  P. )  ->  ( E. y  e.  ( 1st `  A
) x  =  ( z  .Q  y )  <->  E. y  e.  ( 1st `  A ) x  =  ( y  .Q  z ) ) )
1211ancoms 268 . . . . . . . 8  |-  ( ( A  e.  P.  /\  z  e.  Q. )  ->  ( E. y  e.  ( 1st `  A
) x  =  ( z  .Q  y )  <->  E. y  e.  ( 1st `  A ) x  =  ( y  .Q  z ) ) )
133, 12sylan2 286 . . . . . . 7  |-  ( ( A  e.  P.  /\  ( B  e.  P.  /\  z  e.  ( 1st `  B ) ) )  ->  ( E. y  e.  ( 1st `  A
) x  =  ( z  .Q  y )  <->  E. y  e.  ( 1st `  A ) x  =  ( y  .Q  z ) ) )
1413anassrs 400 . . . . . 6  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  z  e.  ( 1st `  B ) )  ->  ( E. y  e.  ( 1st `  A
) x  =  ( z  .Q  y )  <->  E. y  e.  ( 1st `  A ) x  =  ( y  .Q  z ) ) )
1514rexbidva 2494 . . . . 5  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( E. z  e.  ( 1st `  B
) E. y  e.  ( 1st `  A
) x  =  ( z  .Q  y )  <->  E. z  e.  ( 1st `  B ) E. y  e.  ( 1st `  A ) x  =  ( y  .Q  z
) ) )
16 rexcom 2661 . . . . 5  |-  ( E. z  e.  ( 1st `  B ) E. y  e.  ( 1st `  A
) x  =  ( y  .Q  z )  <->  E. y  e.  ( 1st `  A ) E. z  e.  ( 1st `  B ) x  =  ( y  .Q  z
) )
1715, 16bitrdi 196 . . . 4  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( E. z  e.  ( 1st `  B
) E. y  e.  ( 1st `  A
) x  =  ( z  .Q  y )  <->  E. y  e.  ( 1st `  A ) E. z  e.  ( 1st `  B ) x  =  ( y  .Q  z
) ) )
1817rabbidv 2752 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  { x  e.  Q.  |  E. z  e.  ( 1st `  B ) E. y  e.  ( 1st `  A ) x  =  ( z  .Q  y ) }  =  { x  e. 
Q.  |  E. y  e.  ( 1st `  A
) E. z  e.  ( 1st `  B
) x  =  ( y  .Q  z ) } )
19 elprnqu 7549 . . . . . . . . 9  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  z  e.  ( 2nd `  B ) )  -> 
z  e.  Q. )
201, 19sylan 283 . . . . . . . 8  |-  ( ( B  e.  P.  /\  z  e.  ( 2nd `  B ) )  -> 
z  e.  Q. )
21 elprnqu 7549 . . . . . . . . . . . . 13  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  y  e.  ( 2nd `  A ) )  -> 
y  e.  Q. )
224, 21sylan 283 . . . . . . . . . . . 12  |-  ( ( A  e.  P.  /\  y  e.  ( 2nd `  A ) )  -> 
y  e.  Q. )
2322, 8sylan2 286 . . . . . . . . . . 11  |-  ( ( z  e.  Q.  /\  ( A  e.  P.  /\  y  e.  ( 2nd `  A ) ) )  ->  ( x  =  ( z  .Q  y
)  <->  x  =  (
y  .Q  z ) ) )
2423anassrs 400 . . . . . . . . . 10  |-  ( ( ( z  e.  Q.  /\  A  e.  P. )  /\  y  e.  ( 2nd `  A ) )  ->  ( x  =  ( z  .Q  y
)  <->  x  =  (
y  .Q  z ) ) )
2524rexbidva 2494 . . . . . . . . 9  |-  ( ( z  e.  Q.  /\  A  e.  P. )  ->  ( E. y  e.  ( 2nd `  A
) x  =  ( z  .Q  y )  <->  E. y  e.  ( 2nd `  A ) x  =  ( y  .Q  z ) ) )
2625ancoms 268 . . . . . . . 8  |-  ( ( A  e.  P.  /\  z  e.  Q. )  ->  ( E. y  e.  ( 2nd `  A
) x  =  ( z  .Q  y )  <->  E. y  e.  ( 2nd `  A ) x  =  ( y  .Q  z ) ) )
2720, 26sylan2 286 . . . . . . 7  |-  ( ( A  e.  P.  /\  ( B  e.  P.  /\  z  e.  ( 2nd `  B ) ) )  ->  ( E. y  e.  ( 2nd `  A
) x  =  ( z  .Q  y )  <->  E. y  e.  ( 2nd `  A ) x  =  ( y  .Q  z ) ) )
2827anassrs 400 . . . . . 6  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  z  e.  ( 2nd `  B ) )  ->  ( E. y  e.  ( 2nd `  A
) x  =  ( z  .Q  y )  <->  E. y  e.  ( 2nd `  A ) x  =  ( y  .Q  z ) ) )
2928rexbidva 2494 . . . . 5  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( E. z  e.  ( 2nd `  B
) E. y  e.  ( 2nd `  A
) x  =  ( z  .Q  y )  <->  E. z  e.  ( 2nd `  B ) E. y  e.  ( 2nd `  A ) x  =  ( y  .Q  z
) ) )
30 rexcom 2661 . . . . 5  |-  ( E. z  e.  ( 2nd `  B ) E. y  e.  ( 2nd `  A
) x  =  ( y  .Q  z )  <->  E. y  e.  ( 2nd `  A ) E. z  e.  ( 2nd `  B ) x  =  ( y  .Q  z
) )
3129, 30bitrdi 196 . . . 4  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( E. z  e.  ( 2nd `  B
) E. y  e.  ( 2nd `  A
) x  =  ( z  .Q  y )  <->  E. y  e.  ( 2nd `  A ) E. z  e.  ( 2nd `  B ) x  =  ( y  .Q  z
) ) )
3231rabbidv 2752 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  { x  e.  Q.  |  E. z  e.  ( 2nd `  B ) E. y  e.  ( 2nd `  A ) x  =  ( z  .Q  y ) }  =  { x  e. 
Q.  |  E. y  e.  ( 2nd `  A
) E. z  e.  ( 2nd `  B
) x  =  ( y  .Q  z ) } )
3318, 32opeq12d 3816 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  -> 
<. { x  e.  Q.  |  E. z  e.  ( 1st `  B ) E. y  e.  ( 1st `  A ) x  =  ( z  .Q  y ) } ,  { x  e. 
Q.  |  E. z  e.  ( 2nd `  B
) E. y  e.  ( 2nd `  A
) x  =  ( z  .Q  y ) } >.  =  <. { x  e.  Q.  |  E. y  e.  ( 1st `  A ) E. z  e.  ( 1st `  B ) x  =  ( y  .Q  z
) } ,  {
x  e.  Q.  |  E. y  e.  ( 2nd `  A ) E. z  e.  ( 2nd `  B ) x  =  ( y  .Q  z
) } >. )
34 mpvlu 7606 . . 3  |-  ( ( B  e.  P.  /\  A  e.  P. )  ->  ( B  .P.  A
)  =  <. { x  e.  Q.  |  E. z  e.  ( 1st `  B
) E. y  e.  ( 1st `  A
) x  =  ( z  .Q  y ) } ,  { x  e.  Q.  |  E. z  e.  ( 2nd `  B
) E. y  e.  ( 2nd `  A
) x  =  ( z  .Q  y ) } >. )
3534ancoms 268 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( B  .P.  A
)  =  <. { x  e.  Q.  |  E. z  e.  ( 1st `  B
) E. y  e.  ( 1st `  A
) x  =  ( z  .Q  y ) } ,  { x  e.  Q.  |  E. z  e.  ( 2nd `  B
) E. y  e.  ( 2nd `  A
) x  =  ( z  .Q  y ) } >. )
36 mpvlu 7606 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  .P.  B
)  =  <. { x  e.  Q.  |  E. y  e.  ( 1st `  A
) E. z  e.  ( 1st `  B
) x  =  ( y  .Q  z ) } ,  { x  e.  Q.  |  E. y  e.  ( 2nd `  A
) E. z  e.  ( 2nd `  B
) x  =  ( y  .Q  z ) } >. )
3733, 35, 363eqtr4rd 2240 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 1364    e. wcel 2167   E.wrex 2476   {crab 2479   <.cop 3625   ` cfv 5258  (class class class)co 5922   1stc1st 6196   2ndc2nd 6197   Q.cnq 7347    .Q cmq 7350   P.cnp 7358    .P. cmp 7361
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-iinf 4624
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-tr 4132  df-id 4328  df-iord 4401  df-on 4403  df-suc 4406  df-iom 4627  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-recs 6363  df-irdg 6428  df-oadd 6478  df-omul 6479  df-er 6592  df-ec 6594  df-qs 6598  df-ni 7371  df-mi 7373  df-mpq 7412  df-enq 7414  df-nqqs 7415  df-mqqs 7417  df-inp 7533  df-imp 7536
This theorem is referenced by:  ltmprr  7709  mulcmpblnrlemg  7807  mulcomsrg  7824  mulasssrg  7825  m1m1sr  7828  recexgt0sr  7840  mulgt0sr  7845  mulextsr1lem  7847  recidpirqlemcalc  7924
  Copyright terms: Public domain W3C validator