| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > xrge0adddi | Structured version Visualization version GIF version | ||
| Description: Left-distributivity of extended nonnegative real multiplication over addition. (Contributed by Thierry Arnoux, 6-Sep-2018.) |
| Ref | Expression |
|---|---|
| xrge0adddi | ⊢ ((𝐴 ∈ (0[,]+∞) ∧ 𝐵 ∈ (0[,]+∞) ∧ 𝐶 ∈ (0[,]+∞)) → (𝐶 ·e (𝐴 +𝑒 𝐵)) = ((𝐶 ·e 𝐴) +𝑒 (𝐶 ·e 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xrge0adddir 32962 | . 2 ⊢ ((𝐴 ∈ (0[,]+∞) ∧ 𝐵 ∈ (0[,]+∞) ∧ 𝐶 ∈ (0[,]+∞)) → ((𝐴 +𝑒 𝐵) ·e 𝐶) = ((𝐴 ·e 𝐶) +𝑒 (𝐵 ·e 𝐶))) | |
| 2 | iccssxr 13452 | . . . . 5 ⊢ (0[,]+∞) ⊆ ℝ* | |
| 3 | simp1 1136 | . . . . 5 ⊢ ((𝐴 ∈ (0[,]+∞) ∧ 𝐵 ∈ (0[,]+∞) ∧ 𝐶 ∈ (0[,]+∞)) → 𝐴 ∈ (0[,]+∞)) | |
| 4 | 2, 3 | sselid 3961 | . . . 4 ⊢ ((𝐴 ∈ (0[,]+∞) ∧ 𝐵 ∈ (0[,]+∞) ∧ 𝐶 ∈ (0[,]+∞)) → 𝐴 ∈ ℝ*) |
| 5 | simp2 1137 | . . . . 5 ⊢ ((𝐴 ∈ (0[,]+∞) ∧ 𝐵 ∈ (0[,]+∞) ∧ 𝐶 ∈ (0[,]+∞)) → 𝐵 ∈ (0[,]+∞)) | |
| 6 | 2, 5 | sselid 3961 | . . . 4 ⊢ ((𝐴 ∈ (0[,]+∞) ∧ 𝐵 ∈ (0[,]+∞) ∧ 𝐶 ∈ (0[,]+∞)) → 𝐵 ∈ ℝ*) |
| 7 | 4, 6 | xaddcld 13325 | . . 3 ⊢ ((𝐴 ∈ (0[,]+∞) ∧ 𝐵 ∈ (0[,]+∞) ∧ 𝐶 ∈ (0[,]+∞)) → (𝐴 +𝑒 𝐵) ∈ ℝ*) |
| 8 | simp3 1138 | . . . 4 ⊢ ((𝐴 ∈ (0[,]+∞) ∧ 𝐵 ∈ (0[,]+∞) ∧ 𝐶 ∈ (0[,]+∞)) → 𝐶 ∈ (0[,]+∞)) | |
| 9 | 2, 8 | sselid 3961 | . . 3 ⊢ ((𝐴 ∈ (0[,]+∞) ∧ 𝐵 ∈ (0[,]+∞) ∧ 𝐶 ∈ (0[,]+∞)) → 𝐶 ∈ ℝ*) |
| 10 | xmulcom 13290 | . . 3 ⊢ (((𝐴 +𝑒 𝐵) ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → ((𝐴 +𝑒 𝐵) ·e 𝐶) = (𝐶 ·e (𝐴 +𝑒 𝐵))) | |
| 11 | 7, 9, 10 | syl2anc 584 | . 2 ⊢ ((𝐴 ∈ (0[,]+∞) ∧ 𝐵 ∈ (0[,]+∞) ∧ 𝐶 ∈ (0[,]+∞)) → ((𝐴 +𝑒 𝐵) ·e 𝐶) = (𝐶 ·e (𝐴 +𝑒 𝐵))) |
| 12 | xmulcom 13290 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → (𝐴 ·e 𝐶) = (𝐶 ·e 𝐴)) | |
| 13 | 4, 9, 12 | syl2anc 584 | . . 3 ⊢ ((𝐴 ∈ (0[,]+∞) ∧ 𝐵 ∈ (0[,]+∞) ∧ 𝐶 ∈ (0[,]+∞)) → (𝐴 ·e 𝐶) = (𝐶 ·e 𝐴)) |
| 14 | xmulcom 13290 | . . . 4 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → (𝐵 ·e 𝐶) = (𝐶 ·e 𝐵)) | |
| 15 | 6, 9, 14 | syl2anc 584 | . . 3 ⊢ ((𝐴 ∈ (0[,]+∞) ∧ 𝐵 ∈ (0[,]+∞) ∧ 𝐶 ∈ (0[,]+∞)) → (𝐵 ·e 𝐶) = (𝐶 ·e 𝐵)) |
| 16 | 13, 15 | oveq12d 7431 | . 2 ⊢ ((𝐴 ∈ (0[,]+∞) ∧ 𝐵 ∈ (0[,]+∞) ∧ 𝐶 ∈ (0[,]+∞)) → ((𝐴 ·e 𝐶) +𝑒 (𝐵 ·e 𝐶)) = ((𝐶 ·e 𝐴) +𝑒 (𝐶 ·e 𝐵))) |
| 17 | 1, 11, 16 | 3eqtr3d 2777 | 1 ⊢ ((𝐴 ∈ (0[,]+∞) ∧ 𝐵 ∈ (0[,]+∞) ∧ 𝐶 ∈ (0[,]+∞)) → (𝐶 ·e (𝐴 +𝑒 𝐵)) = ((𝐶 ·e 𝐴) +𝑒 (𝐶 ·e 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1539 ∈ wcel 2107 (class class class)co 7413 0cc0 11137 +∞cpnf 11274 ℝ*cxr 11276 +𝑒 cxad 13134 ·e cxmu 13135 [,]cicc 13372 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-sep 5276 ax-nul 5286 ax-pow 5345 ax-pr 5412 ax-un 7737 ax-cnex 11193 ax-resscn 11194 ax-1cn 11195 ax-icn 11196 ax-addcl 11197 ax-addrcl 11198 ax-mulcl 11199 ax-mulrcl 11200 ax-mulcom 11201 ax-addass 11202 ax-mulass 11203 ax-distr 11204 ax-i2m1 11205 ax-1ne0 11206 ax-1rid 11207 ax-rnegex 11208 ax-rrecex 11209 ax-cnre 11210 ax-pre-lttri 11211 ax-pre-lttrn 11212 ax-pre-ltadd 11213 ax-pre-mulgt0 11214 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-reu 3364 df-rab 3420 df-v 3465 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4888 df-iun 4973 df-br 5124 df-opab 5186 df-mpt 5206 df-id 5558 df-po 5572 df-so 5573 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-iota 6494 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-1st 7996 df-2nd 7997 df-er 8727 df-en 8968 df-dom 8969 df-sdom 8970 df-pnf 11279 df-mnf 11280 df-xr 11281 df-ltxr 11282 df-le 11283 df-sub 11476 df-neg 11477 df-xneg 13136 df-xadd 13137 df-xmul 13138 df-ico 13375 df-icc 13376 |
| This theorem is referenced by: xrge0slmod 33311 |
| Copyright terms: Public domain | W3C validator |