![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > xp1d2m1eqxm1d2 | Structured version Visualization version GIF version |
Description: A complex number increased by 1, then divided by 2, then decreased by 1 equals the complex number decreased by 1 and then divided by 2. (Contributed by AV, 24-May-2020.) |
Ref | Expression |
---|---|
xp1d2m1eqxm1d2 | ⊢ (𝑋 ∈ ℂ → (((𝑋 + 1) / 2) − 1) = ((𝑋 − 1) / 2)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | peano2cn 10801 | . . . 4 ⊢ (𝑋 ∈ ℂ → (𝑋 + 1) ∈ ℂ) | |
2 | 1 | halfcld 11870 | . . 3 ⊢ (𝑋 ∈ ℂ → ((𝑋 + 1) / 2) ∈ ℂ) |
3 | peano2cnm 10941 | . . 3 ⊢ (((𝑋 + 1) / 2) ∈ ℂ → (((𝑋 + 1) / 2) − 1) ∈ ℂ) | |
4 | 2, 3 | syl 17 | . 2 ⊢ (𝑋 ∈ ℂ → (((𝑋 + 1) / 2) − 1) ∈ ℂ) |
5 | peano2cnm 10941 | . . 3 ⊢ (𝑋 ∈ ℂ → (𝑋 − 1) ∈ ℂ) | |
6 | 5 | halfcld 11870 | . 2 ⊢ (𝑋 ∈ ℂ → ((𝑋 − 1) / 2) ∈ ℂ) |
7 | 2cnd 11703 | . 2 ⊢ (𝑋 ∈ ℂ → 2 ∈ ℂ) | |
8 | 2ne0 11729 | . . 3 ⊢ 2 ≠ 0 | |
9 | 8 | a1i 11 | . 2 ⊢ (𝑋 ∈ ℂ → 2 ≠ 0) |
10 | 1cnd 10625 | . . . 4 ⊢ (𝑋 ∈ ℂ → 1 ∈ ℂ) | |
11 | 2, 10, 7 | subdird 11086 | . . 3 ⊢ (𝑋 ∈ ℂ → ((((𝑋 + 1) / 2) − 1) · 2) = ((((𝑋 + 1) / 2) · 2) − (1 · 2))) |
12 | 1, 7, 9 | divcan1d 11406 | . . . 4 ⊢ (𝑋 ∈ ℂ → (((𝑋 + 1) / 2) · 2) = (𝑋 + 1)) |
13 | 7 | mulid2d 10648 | . . . 4 ⊢ (𝑋 ∈ ℂ → (1 · 2) = 2) |
14 | 12, 13 | oveq12d 7153 | . . 3 ⊢ (𝑋 ∈ ℂ → ((((𝑋 + 1) / 2) · 2) − (1 · 2)) = ((𝑋 + 1) − 2)) |
15 | 5, 7, 9 | divcan1d 11406 | . . . 4 ⊢ (𝑋 ∈ ℂ → (((𝑋 − 1) / 2) · 2) = (𝑋 − 1)) |
16 | 2m1e1 11751 | . . . . . 6 ⊢ (2 − 1) = 1 | |
17 | 16 | a1i 11 | . . . . 5 ⊢ (𝑋 ∈ ℂ → (2 − 1) = 1) |
18 | 17 | oveq2d 7151 | . . . 4 ⊢ (𝑋 ∈ ℂ → (𝑋 − (2 − 1)) = (𝑋 − 1)) |
19 | id 22 | . . . . 5 ⊢ (𝑋 ∈ ℂ → 𝑋 ∈ ℂ) | |
20 | 19, 7, 10 | subsub3d 11016 | . . . 4 ⊢ (𝑋 ∈ ℂ → (𝑋 − (2 − 1)) = ((𝑋 + 1) − 2)) |
21 | 15, 18, 20 | 3eqtr2rd 2840 | . . 3 ⊢ (𝑋 ∈ ℂ → ((𝑋 + 1) − 2) = (((𝑋 − 1) / 2) · 2)) |
22 | 11, 14, 21 | 3eqtrd 2837 | . 2 ⊢ (𝑋 ∈ ℂ → ((((𝑋 + 1) / 2) − 1) · 2) = (((𝑋 − 1) / 2) · 2)) |
23 | 4, 6, 7, 9, 22 | mulcan2ad 11265 | 1 ⊢ (𝑋 ∈ ℂ → (((𝑋 + 1) / 2) − 1) = ((𝑋 − 1) / 2)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 (class class class)co 7135 ℂcc 10524 0cc0 10526 1c1 10527 + caddc 10529 · cmul 10531 − cmin 10859 / cdiv 11286 2c2 11680 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-po 5438 df-so 5439 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-2 11688 |
This theorem is referenced by: mod2eq1n2dvds 15688 zob 15700 nno 15723 nn0ob 15725 dignn0flhalflem1 45029 |
Copyright terms: Public domain | W3C validator |