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

Theorem distrprg 7808
Description: Multiplication of positive reals is distributive. Proposition 9-3.7(iii) of [Gleason] p. 124. (Contributed by Jim Kingdon, 12-Dec-2019.)
Assertion
Ref Expression
distrprg  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( A  .P.  ( B  +P.  C ) )  =  ( ( A  .P.  B
)  +P.  ( A  .P.  C ) ) )

Proof of Theorem distrprg
StepHypRef Expression
1 distrlem1prl 7802 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( 1st `  ( A  .P.  ( B  +P.  C ) ) )  C_  ( 1st `  ( ( A  .P.  B )  +P.  ( A  .P.  C
) ) ) )
2 distrlem5prl 7806 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( 1st `  ( ( A  .P.  B )  +P.  ( A  .P.  C
) ) )  C_  ( 1st `  ( A  .P.  ( B  +P.  C ) ) ) )
31, 2eqssd 3244 . 2  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( 1st `  ( A  .P.  ( B  +P.  C ) ) )  =  ( 1st `  ( ( A  .P.  B )  +P.  ( A  .P.  C ) ) ) )
4 distrlem1pru 7803 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( 2nd `  ( A  .P.  ( B  +P.  C ) ) )  C_  ( 2nd `  ( ( A  .P.  B )  +P.  ( A  .P.  C
) ) ) )
5 distrlem5pru 7807 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( 2nd `  ( ( A  .P.  B )  +P.  ( A  .P.  C
) ) )  C_  ( 2nd `  ( A  .P.  ( B  +P.  C ) ) ) )
64, 5eqssd 3244 . 2  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( 2nd `  ( A  .P.  ( B  +P.  C ) ) )  =  ( 2nd `  ( ( A  .P.  B )  +P.  ( A  .P.  C ) ) ) )
7 simp1 1023 . . . 4  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  A  e.  P. )
8 simp2 1024 . . . . 5  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  B  e.  P. )
9 simp3 1025 . . . . 5  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  C  e.  P. )
10 addclpr 7757 . . . . 5  |-  ( ( B  e.  P.  /\  C  e.  P. )  ->  ( B  +P.  C
)  e.  P. )
118, 9, 10syl2anc 411 . . . 4  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( B  +P.  C )  e. 
P. )
12 mulclpr 7792 . . . 4  |-  ( ( A  e.  P.  /\  ( B  +P.  C )  e.  P. )  -> 
( A  .P.  ( B  +P.  C ) )  e.  P. )
137, 11, 12syl2anc 411 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( A  .P.  ( B  +P.  C ) )  e.  P. )
14 mulclpr 7792 . . . . 5  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  .P.  B
)  e.  P. )
157, 8, 14syl2anc 411 . . . 4  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( A  .P.  B )  e. 
P. )
16 mulclpr 7792 . . . . 5  |-  ( ( A  e.  P.  /\  C  e.  P. )  ->  ( A  .P.  C
)  e.  P. )
177, 9, 16syl2anc 411 . . . 4  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( A  .P.  C )  e. 
P. )
18 addclpr 7757 . . . 4  |-  ( ( ( A  .P.  B
)  e.  P.  /\  ( A  .P.  C )  e.  P. )  -> 
( ( A  .P.  B )  +P.  ( A  .P.  C ) )  e.  P. )
1915, 17, 18syl2anc 411 . . 3  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  (
( A  .P.  B
)  +P.  ( A  .P.  C ) )  e. 
P. )
20 preqlu 7692 . . 3  |-  ( ( ( A  .P.  ( B  +P.  C ) )  e.  P.  /\  (
( A  .P.  B
)  +P.  ( A  .P.  C ) )  e. 
P. )  ->  (
( A  .P.  ( B  +P.  C ) )  =  ( ( A  .P.  B )  +P.  ( A  .P.  C
) )  <->  ( ( 1st `  ( A  .P.  ( B  +P.  C ) ) )  =  ( 1st `  ( ( A  .P.  B )  +P.  ( A  .P.  C ) ) )  /\  ( 2nd `  ( A  .P.  ( B  +P.  C ) ) )  =  ( 2nd `  (
( A  .P.  B
)  +P.  ( A  .P.  C ) ) ) ) ) )
2113, 19, 20syl2anc 411 . 2  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  (
( A  .P.  ( B  +P.  C ) )  =  ( ( A  .P.  B )  +P.  ( A  .P.  C
) )  <->  ( ( 1st `  ( A  .P.  ( B  +P.  C ) ) )  =  ( 1st `  ( ( A  .P.  B )  +P.  ( A  .P.  C ) ) )  /\  ( 2nd `  ( A  .P.  ( B  +P.  C ) ) )  =  ( 2nd `  (
( A  .P.  B
)  +P.  ( A  .P.  C ) ) ) ) ) )
223, 6, 21mpbir2and 952 1  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( A  .P.  ( B  +P.  C ) )  =  ( ( A  .P.  B
)  +P.  ( A  .P.  C ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1004    = wceq 1397    e. wcel 2202   ` cfv 5326  (class class class)co 6018   1stc1st 6301   2ndc2nd 6302   P.cnp 7511    +P. cpp 7513    .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-eprel 4386  df-id 4390  df-po 4393  df-iso 4394  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-1o 6582  df-2o 6583  df-oadd 6586  df-omul 6587  df-er 6702  df-ec 6704  df-qs 6708  df-ni 7524  df-pli 7525  df-mi 7526  df-lti 7527  df-plpq 7564  df-mpq 7565  df-enq 7567  df-nqqs 7568  df-plqqs 7569  df-mqqs 7570  df-1nqqs 7571  df-rq 7572  df-ltnqqs 7573  df-enq0 7644  df-nq0 7645  df-0nq0 7646  df-plq0 7647  df-mq0 7648  df-inp 7686  df-iplp 7688  df-imp 7689
This theorem is referenced by:  ltmprr  7862  mulcmpblnrlemg  7960  mulasssrg  7978  distrsrg  7979  m1m1sr  7981  1idsr  7988  recexgt0sr  7993  mulgt0sr  7998  mulextsr1lem  8000  recidpirqlemcalc  8077
  Copyright terms: Public domain W3C validator