![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > xp1d2m1eqxm1d2 | 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 8154 | . . . 4 ⊢ (𝑋 ∈ ℂ → (𝑋 + 1) ∈ ℂ) | |
2 | 1 | halfcld 9227 | . . 3 ⊢ (𝑋 ∈ ℂ → ((𝑋 + 1) / 2) ∈ ℂ) |
3 | peano2cnm 8285 | . . 3 ⊢ (((𝑋 + 1) / 2) ∈ ℂ → (((𝑋 + 1) / 2) − 1) ∈ ℂ) | |
4 | 2, 3 | syl 14 | . 2 ⊢ (𝑋 ∈ ℂ → (((𝑋 + 1) / 2) − 1) ∈ ℂ) |
5 | peano2cnm 8285 | . . 3 ⊢ (𝑋 ∈ ℂ → (𝑋 − 1) ∈ ℂ) | |
6 | 5 | halfcld 9227 | . 2 ⊢ (𝑋 ∈ ℂ → ((𝑋 − 1) / 2) ∈ ℂ) |
7 | 2cnd 9055 | . 2 ⊢ (𝑋 ∈ ℂ → 2 ∈ ℂ) | |
8 | 2ap0 9075 | . . 3 ⊢ 2 # 0 | |
9 | 8 | a1i 9 | . 2 ⊢ (𝑋 ∈ ℂ → 2 # 0) |
10 | 1cnd 8035 | . . . 4 ⊢ (𝑋 ∈ ℂ → 1 ∈ ℂ) | |
11 | 2, 10, 7 | subdird 8434 | . . 3 ⊢ (𝑋 ∈ ℂ → ((((𝑋 + 1) / 2) − 1) · 2) = ((((𝑋 + 1) / 2) · 2) − (1 · 2))) |
12 | 1, 7, 9 | divcanap1d 8810 | . . . 4 ⊢ (𝑋 ∈ ℂ → (((𝑋 + 1) / 2) · 2) = (𝑋 + 1)) |
13 | 7 | mulid2d 8038 | . . . 4 ⊢ (𝑋 ∈ ℂ → (1 · 2) = 2) |
14 | 12, 13 | oveq12d 5936 | . . 3 ⊢ (𝑋 ∈ ℂ → ((((𝑋 + 1) / 2) · 2) − (1 · 2)) = ((𝑋 + 1) − 2)) |
15 | 5, 7, 9 | divcanap1d 8810 | . . . 4 ⊢ (𝑋 ∈ ℂ → (((𝑋 − 1) / 2) · 2) = (𝑋 − 1)) |
16 | 2m1e1 9100 | . . . . . 6 ⊢ (2 − 1) = 1 | |
17 | 16 | a1i 9 | . . . . 5 ⊢ (𝑋 ∈ ℂ → (2 − 1) = 1) |
18 | 17 | oveq2d 5934 | . . . 4 ⊢ (𝑋 ∈ ℂ → (𝑋 − (2 − 1)) = (𝑋 − 1)) |
19 | id 19 | . . . . 5 ⊢ (𝑋 ∈ ℂ → 𝑋 ∈ ℂ) | |
20 | 19, 7, 10 | subsub3d 8360 | . . . 4 ⊢ (𝑋 ∈ ℂ → (𝑋 − (2 − 1)) = ((𝑋 + 1) − 2)) |
21 | 15, 18, 20 | 3eqtr2rd 2233 | . . 3 ⊢ (𝑋 ∈ ℂ → ((𝑋 + 1) − 2) = (((𝑋 − 1) / 2) · 2)) |
22 | 11, 14, 21 | 3eqtrd 2230 | . 2 ⊢ (𝑋 ∈ ℂ → ((((𝑋 + 1) / 2) − 1) · 2) = (((𝑋 − 1) / 2) · 2)) |
23 | 4, 6, 7, 9, 22 | mulcanap2ad 8683 | 1 ⊢ (𝑋 ∈ ℂ → (((𝑋 + 1) / 2) − 1) = ((𝑋 − 1) / 2)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1364 ∈ wcel 2164 class class class wbr 4029 (class class class)co 5918 ℂcc 7870 0cc0 7872 1c1 7873 + caddc 7875 · cmul 7877 − cmin 8190 # cap 8600 / cdiv 8691 2c2 9033 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-mulrcl 7971 ax-addcom 7972 ax-mulcom 7973 ax-addass 7974 ax-mulass 7975 ax-distr 7976 ax-i2m1 7977 ax-0lt1 7978 ax-1rid 7979 ax-0id 7980 ax-rnegex 7981 ax-precex 7982 ax-cnre 7983 ax-pre-ltirr 7984 ax-pre-ltwlin 7985 ax-pre-lttrn 7986 ax-pre-apti 7987 ax-pre-ltadd 7988 ax-pre-mulgt0 7989 ax-pre-mulext 7990 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2986 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-br 4030 df-opab 4091 df-id 4324 df-po 4327 df-iso 4328 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-iota 5215 df-fun 5256 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 df-sub 8192 df-neg 8193 df-reap 8594 df-ap 8601 df-div 8692 df-2 9041 |
This theorem is referenced by: zob 12032 nno 12047 nn0ob 12049 |
Copyright terms: Public domain | W3C validator |