| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > redivdird | Structured version Visualization version GIF version | ||
| Description: Distribution of division over addition. (Contributed by SN, 9-Apr-2026.) |
| Ref | Expression |
|---|---|
| rediv23d.a | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| rediv23d.b | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
| rediv23d.c | ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| rediv23d.z | ⊢ (𝜑 → 𝐶 ≠ 0) |
| Ref | Expression |
|---|---|
| redivdird | ⊢ (𝜑 → ((𝐴 + 𝐵) /ℝ 𝐶) = ((𝐴 /ℝ 𝐶) + (𝐵 /ℝ 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rediv23d.c | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
| 2 | 1 | recnd 11205 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 3 | rediv23d.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 4 | rediv23d.z | . . . . . 6 ⊢ (𝜑 → 𝐶 ≠ 0) | |
| 5 | 3, 1, 4 | sn-redivcld 43006 | . . . . 5 ⊢ (𝜑 → (𝐴 /ℝ 𝐶) ∈ ℝ) |
| 6 | 5 | recnd 11205 | . . . 4 ⊢ (𝜑 → (𝐴 /ℝ 𝐶) ∈ ℂ) |
| 7 | rediv23d.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 8 | 7, 1, 4 | sn-redivcld 43006 | . . . . 5 ⊢ (𝜑 → (𝐵 /ℝ 𝐶) ∈ ℝ) |
| 9 | 8 | recnd 11205 | . . . 4 ⊢ (𝜑 → (𝐵 /ℝ 𝐶) ∈ ℂ) |
| 10 | 2, 6, 9 | adddid 11201 | . . 3 ⊢ (𝜑 → (𝐶 · ((𝐴 /ℝ 𝐶) + (𝐵 /ℝ 𝐶))) = ((𝐶 · (𝐴 /ℝ 𝐶)) + (𝐶 · (𝐵 /ℝ 𝐶)))) |
| 11 | 3, 1, 4 | redivcan2d 43009 | . . . 4 ⊢ (𝜑 → (𝐶 · (𝐴 /ℝ 𝐶)) = 𝐴) |
| 12 | 7, 1, 4 | redivcan2d 43009 | . . . 4 ⊢ (𝜑 → (𝐶 · (𝐵 /ℝ 𝐶)) = 𝐵) |
| 13 | 11, 12 | oveq12d 7408 | . . 3 ⊢ (𝜑 → ((𝐶 · (𝐴 /ℝ 𝐶)) + (𝐶 · (𝐵 /ℝ 𝐶))) = (𝐴 + 𝐵)) |
| 14 | 10, 13 | eqtrd 2796 | . 2 ⊢ (𝜑 → (𝐶 · ((𝐴 /ℝ 𝐶) + (𝐵 /ℝ 𝐶))) = (𝐴 + 𝐵)) |
| 15 | 3, 7 | readdcld 11206 | . . 3 ⊢ (𝜑 → (𝐴 + 𝐵) ∈ ℝ) |
| 16 | 5, 8 | readdcld 11206 | . . 3 ⊢ (𝜑 → ((𝐴 /ℝ 𝐶) + (𝐵 /ℝ 𝐶)) ∈ ℝ) |
| 17 | 15, 16, 1, 4 | redivmuld 43007 | . 2 ⊢ (𝜑 → (((𝐴 + 𝐵) /ℝ 𝐶) = ((𝐴 /ℝ 𝐶) + (𝐵 /ℝ 𝐶)) ↔ (𝐶 · ((𝐴 /ℝ 𝐶) + (𝐵 /ℝ 𝐶))) = (𝐴 + 𝐵))) |
| 18 | 14, 17 | mpbird 259 | 1 ⊢ (𝜑 → ((𝐴 + 𝐵) /ℝ 𝐶) = ((𝐴 /ℝ 𝐶) + (𝐵 /ℝ 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 (class class class)co 7390 ℝcr 11067 0cc0 11068 + caddc 11071 · cmul 11073 /ℝ crediv 43002 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7712 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5540 df-po 5553 df-so 5554 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-er 8671 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11213 df-mnf 11214 df-ltxr 11216 df-2 12275 df-3 12276 df-resub 42928 df-rediv 43003 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |