Theorem xp1d2m1eqxm1d2 9375

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.)

Assertion

Ref	Expression
xp1d2m1eqxm1d2	|- ( X e. CC -> ( ( ( X + 1 ) / 2 ) - 1 ) = ( ( X - 1 ) / 2 ) )

Proof of Theorem xp1d2m1eqxm1d2

Step	Hyp	Ref	Expression
1		peano2cn 8292	. . . 4 |- ( X e. CC -> ( X + 1 ) e. CC )
2	1	halfcld 9367	. . 3 |- ( X e. CC -> ( ( X + 1 ) / 2 ) e. CC )
3		peano2cnm 8423	. . 3 |- ( ( ( X + 1 ) / 2 ) e. CC -> ( ( ( X + 1 ) / 2 ) - 1 ) e. CC )
4	2, 3	syl 14	. 2 |- ( X e. CC -> ( ( ( X + 1 ) / 2 ) - 1 ) e. CC )
5		peano2cnm 8423	. . 3 |- ( X e. CC -> ( X - 1 ) e. CC )
6	5	halfcld 9367	. 2 |- ( X e. CC -> ( ( X - 1 ) / 2 ) e. CC )
7		2cnd 9194	. 2 |- ( X e. CC -> 2 e. CC )
8		2ap0 9214	. . 3 |- 2 # 0
9	8	a1i 9	. 2 |- ( X e. CC -> 2 # 0 )
10		1cnd 8173	. . . 4 |- ( X e. CC -> 1 e. CC )
11	2, 10, 7	subdird 8572	. . 3 |- ( X e. CC -> ( ( ( ( X + 1 ) / 2 ) - 1 ) x. 2 ) = ( ( ( ( X + 1 ) / 2 ) x. 2 ) - ( 1 x. 2 ) ) )
12	1, 7, 9	divcanap1d 8949	. . . 4 |- ( X e. CC -> ( ( ( X + 1 ) / 2 ) x. 2 ) = ( X + 1 ) )
13	7	mulid2d 8176	. . . 4 |- ( X e. CC -> ( 1 x. 2 ) = 2 )
14	12, 13	oveq12d 6025	. . 3 |- ( X e. CC -> ( ( ( ( X + 1 ) / 2 ) x. 2 ) - ( 1 x. 2 ) ) = ( ( X + 1 ) - 2 ) )
15	5, 7, 9	divcanap1d 8949	. . . 4 |- ( X e. CC -> ( ( ( X - 1 ) / 2 ) x. 2 ) = ( X - 1 ) )
16		2m1e1 9239	. . . . . 6 |- ( 2 - 1 ) = 1
17	16	a1i 9	. . . . 5 |- ( X e. CC -> ( 2 - 1 ) = 1 )
18	17	oveq2d 6023	. . . 4 |- ( X e. CC -> ( X - ( 2 - 1 ) ) = ( X - 1 ) )
19		id 19	. . . . 5 |- ( X e. CC -> X e. CC )
20	19, 7, 10	subsub3d 8498	. . . 4 |- ( X e. CC -> ( X - ( 2 - 1 ) ) = ( ( X + 1 ) - 2 ) )
21	15, 18, 20	3eqtr2rd 2269	. . 3 |- ( X e. CC -> ( ( X + 1 ) - 2 ) = ( ( ( X - 1 ) / 2 ) x. 2 ) )
22	11, 14, 21	3eqtrd 2266	. 2 |- ( X e. CC -> ( ( ( ( X + 1 ) / 2 ) - 1 ) x. 2 ) = ( ( ( X - 1 ) / 2 ) x. 2 ) )
23	4, 6, 7, 9, 22	mulcanap2ad 8822	1 |- ( X e. CC -> ( ( ( X + 1 ) / 2 ) - 1 ) = ( ( X - 1 ) / 2 ) )

Syntax hints:   -> wi 4   = wceq 1395   e. wcel 2200   class class class wbr 4083  (class class class)co 6007   CCcc 8008   0cc0 8010   1c1 8011   + caddc 8013   x. cmul 8015   - cmin 8328   # cap 8739   / cdiv 8830   2c2 9172

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-mulrcl 8109  ax-addcom 8110  ax-mulcom 8111  ax-addass 8112  ax-mulass 8113  ax-distr 8114  ax-i2m1 8115  ax-0lt1 8116  ax-1rid 8117  ax-0id 8118  ax-rnegex 8119  ax-precex 8120  ax-cnre 8121  ax-pre-ltirr 8122  ax-pre-ltwlin 8123  ax-pre-lttrn 8124  ax-pre-apti 8125  ax-pre-ltadd 8126  ax-pre-mulgt0 8127  ax-pre-mulext 8128

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-id 4384  df-po 4387  df-iso 4388  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-iota 5278  df-fun 5320  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-pnf 8194  df-mnf 8195  df-xr 8196  df-ltxr 8197  df-le 8198  df-sub 8330  df-neg 8331  df-reap 8733  df-ap 8740  df-div 8831  df-2 9180

This theorem is referenced by:  zob  12417  nno  12432  nn0ob  12434