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

Theorem mulcomprg 7800
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 7695 . . . . . . . . 9  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
2 elprnql 7701 . . . . . . . . 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 7695 . . . . . . . . . . . . 13  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
5 elprnql 7701 . . . . . . . . . . . . 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 7603 . . . . . . . . . . . . 13  |-  ( ( z  e.  Q.  /\  y  e.  Q. )  ->  ( z  .Q  y
)  =  ( y  .Q  z ) )
87eqeq2d 2243 . . . . . . . . . . . 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 2529 . . . . . . . . 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 2529 . . . . 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 2697 . . . . 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 2791 . . 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 7702 . . . . . . . . 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 7702 . . . . . . . . . . . . 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 2529 . . . . . . . . 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 2529 . . . . 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 2697 . . . . 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 2791 . . 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 3870 . 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 7759 . . 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 7759 . 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 2275 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 1397    e. wcel 2202   E.wrex 2511   {crab 2514   <.cop 3672   ` cfv 5326  (class class class)co 6018   1stc1st 6301   2ndc2nd 6302   Q.cnq 7500    .Q cmq 7503   P.cnp 7511    .P. cmp 7514
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  ax-setind 4635  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  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-iom 4689  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-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-recs 6471  df-irdg 6536  df-oadd 6586  df-omul 6587  df-er 6702  df-ec 6704  df-qs 6708  df-ni 7524  df-mi 7526  df-mpq 7565  df-enq 7567  df-nqqs 7568  df-mqqs 7570  df-inp 7686  df-imp 7689
This theorem is referenced by:  ltmprr  7862  mulcmpblnrlemg  7960  mulcomsrg  7977  mulasssrg  7978  m1m1sr  7981  recexgt0sr  7993  mulgt0sr  7998  mulextsr1lem  8000  recidpirqlemcalc  8077
  Copyright terms: Public domain W3C validator