Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > distnq0r | GIF version |
Description: Multiplication of non-negative fractions is distributive. Version of distrnq0 6557 with the multiplications commuted. (Contributed by Jim Kingdon, 29-Nov-2019.) |
Ref | Expression |
---|---|
distnq0r | ⊢ ((𝐴 ∈ Q0 ∧ 𝐵 ∈ Q0 ∧ 𝐶 ∈ Q0) → ((𝐵 +Q0 𝐶) ·Q0 𝐴) = ((𝐵 ·Q0 𝐴) +Q0 (𝐶 ·Q0 𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | distrnq0 6557 | . 2 ⊢ ((𝐴 ∈ Q0 ∧ 𝐵 ∈ Q0 ∧ 𝐶 ∈ Q0) → (𝐴 ·Q0 (𝐵 +Q0 𝐶)) = ((𝐴 ·Q0 𝐵) +Q0 (𝐴 ·Q0 𝐶))) | |
2 | addclnq0 6549 | . . . 4 ⊢ ((𝐵 ∈ Q0 ∧ 𝐶 ∈ Q0) → (𝐵 +Q0 𝐶) ∈ Q0) | |
3 | mulcomnq0 6558 | . . . 4 ⊢ ((𝐴 ∈ Q0 ∧ (𝐵 +Q0 𝐶) ∈ Q0) → (𝐴 ·Q0 (𝐵 +Q0 𝐶)) = ((𝐵 +Q0 𝐶) ·Q0 𝐴)) | |
4 | 2, 3 | sylan2 270 | . . 3 ⊢ ((𝐴 ∈ Q0 ∧ (𝐵 ∈ Q0 ∧ 𝐶 ∈ Q0)) → (𝐴 ·Q0 (𝐵 +Q0 𝐶)) = ((𝐵 +Q0 𝐶) ·Q0 𝐴)) |
5 | 4 | 3impb 1100 | . 2 ⊢ ((𝐴 ∈ Q0 ∧ 𝐵 ∈ Q0 ∧ 𝐶 ∈ Q0) → (𝐴 ·Q0 (𝐵 +Q0 𝐶)) = ((𝐵 +Q0 𝐶) ·Q0 𝐴)) |
6 | mulcomnq0 6558 | . . . 4 ⊢ ((𝐴 ∈ Q0 ∧ 𝐵 ∈ Q0) → (𝐴 ·Q0 𝐵) = (𝐵 ·Q0 𝐴)) | |
7 | 6 | 3adant3 924 | . . 3 ⊢ ((𝐴 ∈ Q0 ∧ 𝐵 ∈ Q0 ∧ 𝐶 ∈ Q0) → (𝐴 ·Q0 𝐵) = (𝐵 ·Q0 𝐴)) |
8 | mulcomnq0 6558 | . . . 4 ⊢ ((𝐴 ∈ Q0 ∧ 𝐶 ∈ Q0) → (𝐴 ·Q0 𝐶) = (𝐶 ·Q0 𝐴)) | |
9 | 8 | 3adant2 923 | . . 3 ⊢ ((𝐴 ∈ Q0 ∧ 𝐵 ∈ Q0 ∧ 𝐶 ∈ Q0) → (𝐴 ·Q0 𝐶) = (𝐶 ·Q0 𝐴)) |
10 | 7, 9 | oveq12d 5530 | . 2 ⊢ ((𝐴 ∈ Q0 ∧ 𝐵 ∈ Q0 ∧ 𝐶 ∈ Q0) → ((𝐴 ·Q0 𝐵) +Q0 (𝐴 ·Q0 𝐶)) = ((𝐵 ·Q0 𝐴) +Q0 (𝐶 ·Q0 𝐴))) |
11 | 1, 5, 10 | 3eqtr3d 2080 | 1 ⊢ ((𝐴 ∈ Q0 ∧ 𝐵 ∈ Q0 ∧ 𝐶 ∈ Q0) → ((𝐵 +Q0 𝐶) ·Q0 𝐴) = ((𝐵 ·Q0 𝐴) +Q0 (𝐶 ·Q0 𝐴))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 ∧ w3a 885 = wceq 1243 ∈ wcel 1393 (class class class)co 5512 Q0cnq0 6385 +Q0 cplq0 6387 ·Q0 cmq0 6388 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-13 1404 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-coll 3872 ax-sep 3875 ax-nul 3883 ax-pow 3927 ax-pr 3944 ax-un 4170 ax-setind 4262 ax-iinf 4311 |
This theorem depends on definitions: df-bi 110 df-dc 743 df-3or 886 df-3an 887 df-tru 1246 df-fal 1249 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ne 2206 df-ral 2311 df-rex 2312 df-reu 2313 df-rab 2315 df-v 2559 df-sbc 2765 df-csb 2853 df-dif 2920 df-un 2922 df-in 2924 df-ss 2931 df-nul 3225 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-int 3616 df-iun 3659 df-br 3765 df-opab 3819 df-mpt 3820 df-tr 3855 df-id 4030 df-iord 4103 df-on 4105 df-suc 4108 df-iom 4314 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-rn 4356 df-res 4357 df-ima 4358 df-iota 4867 df-fun 4904 df-fn 4905 df-f 4906 df-f1 4907 df-fo 4908 df-f1o 4909 df-fv 4910 df-ov 5515 df-oprab 5516 df-mpt2 5517 df-1st 5767 df-2nd 5768 df-recs 5920 df-irdg 5957 df-oadd 6005 df-omul 6006 df-er 6106 df-ec 6108 df-qs 6112 df-ni 6402 df-mi 6404 df-enq0 6522 df-nq0 6523 df-plq0 6525 df-mq0 6526 |
This theorem is referenced by: prarloclemcalc 6600 |
Copyright terms: Public domain | W3C validator |