Theorem xp1d2m1eqxm1d2 9537

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 8451	. . . 4 |- ( X e. CC -> ( X + 1 ) e. CC )
2	1	halfcld 9529	. . 3 |- ( X e. CC -> ( ( X + 1 ) / 2 ) e. CC )
3		peano2cnm 8582	. . 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 8582	. . 3 |- ( X e. CC -> ( X - 1 ) e. CC )
6	5	halfcld 9529	. 2 |- ( X e. CC -> ( ( X - 1 ) / 2 ) e. CC )
7		2cnd 9356	. 2 |- ( X e. CC -> 2 e. CC )
8		2ap0 9376	. . 3 |- 2 # 0
9	8	a1i 9	. 2 |- ( X e. CC -> 2 # 0 )
10		1cnd 8332	. . . 4 |- ( X e. CC -> 1 e. CC )
11	2, 10, 7	subdird 8732	. . 3 |- ( X e. CC -> ( ( ( ( X + 1 ) / 2 ) - 1 ) x. 2 ) = ( ( ( ( X + 1 ) / 2 ) x. 2 ) - ( 1 x. 2 ) ) )
12	1, 7, 9	divcanap1d 9111	. . . 4 |- ( X e. CC -> ( ( ( X + 1 ) / 2 ) x. 2 ) = ( X + 1 ) )
13	7	mullidd 8334	. . . 4 |- ( X e. CC -> ( 1 x. 2 ) = 2 )
14	12, 13	oveq12d 6093	. . 3 |- ( X e. CC -> ( ( ( ( X + 1 ) / 2 ) x. 2 ) - ( 1 x. 2 ) ) = ( ( X + 1 ) - 2 ) )
15	5, 7, 9	divcanap1d 9111	. . . 4 |- ( X e. CC -> ( ( ( X - 1 ) / 2 ) x. 2 ) = ( X - 1 ) )
16		2m1e1 9401	. . . . . 6 |- ( 2 - 1 ) = 1
17	16	a1i 9	. . . . 5 |- ( X e. CC -> ( 2 - 1 ) = 1 )
18	17	oveq2d 6091	. . . 4 |- ( X e. CC -> ( X - ( 2 - 1 ) ) = ( X - 1 ) )
19		id 19	. . . . 5 |- ( X e. CC -> X e. CC )
20	19, 7, 10	subsub3d 8657	. . . 4 |- ( X e. CC -> ( X - ( 2 - 1 ) ) = ( ( X + 1 ) - 2 ) )
21	15, 18, 20	3eqtr2rd 2278	. . 3 |- ( X e. CC -> ( ( X + 1 ) - 2 ) = ( ( ( X - 1 ) / 2 ) x. 2 ) )
22	11, 14, 21	3eqtrd 2275	. 2 |- ( X e. CC -> ( ( ( ( X + 1 ) / 2 ) - 1 ) x. 2 ) = ( ( ( X - 1 ) / 2 ) x. 2 ) )
23	4, 6, 7, 9, 22	mulcanap2ad 8982	1 |- ( X e. CC -> ( ( ( X + 1 ) / 2 ) - 1 ) = ( ( X - 1 ) / 2 ) )

Syntax hints:   -> wi 4   = wceq 1402   e. wcel 2209   class class class wbr 4125  (class class class)co 6075   CCcc 8167   0cc0 8169   1c1 8170   + caddc 8172   x. cmul 8174   - cmin 8487   # cap 8899   / cdiv 8992   2c2 9334

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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286  ax-pre-mulext 8287

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-po 4436  df-iso 4437  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900  df-div 8993  df-2 9342

This theorem is referenced by:  zob  12636  nno  12651  nn0ob  12653