Theorem apdifflemr 17315

Description: Lemma for apdiff 17316. (Contributed by Jim Kingdon, 19-May-2024.)

Hypotheses

Ref	Expression
apdifflemr.a	|- ( ph -> A e. RR )
apdifflemr.s	|- ( ph -> S e. QQ )
apdifflemr.1	|- ( ph -> ( abs ` ( A - -u 1 ) ) # ( abs ` ( A - 1 ) ) )
apdifflemr.as	|- ( ( ph /\ S =/= 0 ) -> ( abs ` ( A - 0 ) ) # ( abs ` ( A - ( 2 x. S ) ) ) )

Assertion

Ref	Expression
apdifflemr	|- ( ph -> A # S )

Proof of Theorem apdifflemr

Step	Hyp	Ref	Expression
1		2cnd 9387	. . . . 5 |- ( ph -> 2 e. CC )
2		apdifflemr.a	. . . . . 6 |- ( ph -> A e. RR )
3	2	recnd 8361	. . . . 5 |- ( ph -> A e. CC )
4	3	2timesd 9560	. . . . . 6 |- ( ph -> ( 2 x. A ) = ( A + A ) )
5		apdifflemr.1	. . . . . . . . . . . 12 |- ( ph -> ( abs ` ( A - -u 1 ) ) # ( abs ` ( A - 1 ) ) )
6		1cnd 8349	. . . . . . . . . . . . . 14 |- ( ph -> 1 e. CC )
7	3, 6	subnegd 8652	. . . . . . . . . . . . . 14 |- ( ph -> ( A - -u 1 ) = ( A + 1 ) )
8	3, 6, 7	comraddd 8491	. . . . . . . . . . . . 13 |- ( ph -> ( A - -u 1 ) = ( 1 + A ) )
9	8	fveq2d 5702	. . . . . . . . . . . 12 |- ( ph -> ( abs ` ( A - -u 1 ) ) = ( abs ` ( 1 + A ) ) )
10	3, 6	abssubd 11983	. . . . . . . . . . . 12 |- ( ph -> ( abs ` ( A - 1 ) ) = ( abs ` ( 1 - A ) ) )
11	5, 9, 10	3brtr3d 4162	. . . . . . . . . . 11 |- ( ph -> ( abs ` ( 1 + A ) ) # ( abs ` ( 1 - A ) ) )
12	6, 3	addcld 8352	. . . . . . . . . . . 12 |- ( ph -> ( 1 + A ) e. CC )
13	6, 3	subcld 8645	. . . . . . . . . . . 12 |- ( ph -> ( 1 - A ) e. CC )
14		absext 11852	. . . . . . . . . . . 12 |- ( ( ( 1 + A ) e. CC /\ ( 1 - A ) e. CC ) -> ( ( abs ` ( 1 + A ) ) # ( abs ` ( 1 - A ) ) -> ( 1 + A ) # ( 1 - A ) ) )
15	12, 13, 14	syl2anc 415	. . . . . . . . . . 11 |- ( ph -> ( ( abs ` ( 1 + A ) ) # ( abs ` ( 1 - A ) ) -> ( 1 + A ) # ( 1 - A ) ) )
16	11, 15	mpd 13	. . . . . . . . . 10 |- ( ph -> ( 1 + A ) # ( 1 - A ) )
17	6, 3	negsubd 8651	. . . . . . . . . 10 |- ( ph -> ( 1 + -u A ) = ( 1 - A ) )
18	16, 17	breqtrrd 4159	. . . . . . . . 9 |- ( ph -> ( 1 + A ) # ( 1 + -u A ) )
19	3	negcld 8632	. . . . . . . . . 10 |- ( ph -> -u A e. CC )
20		apadd2 8946	. . . . . . . . . 10 |- ( ( A e. CC /\ -u A e. CC /\ 1 e. CC ) -> ( A # -u A <-> ( 1 + A ) # ( 1 + -u A ) ) )
21	3, 19, 6, 20	syl3anc 1278	. . . . . . . . 9 |- ( ph -> ( A # -u A <-> ( 1 + A ) # ( 1 + -u A ) ) )
22	18, 21	mpbird 167	. . . . . . . 8 |- ( ph -> A # -u A )
23		apadd2 8946	. . . . . . . . 9 |- ( ( A e. CC /\ -u A e. CC /\ A e. CC ) -> ( A # -u A <-> ( A + A ) # ( A + -u A ) ) )
24	3, 19, 3, 23	syl3anc 1278	. . . . . . . 8 |- ( ph -> ( A # -u A <-> ( A + A ) # ( A + -u A ) ) )
25	22, 24	mpbid 147	. . . . . . 7 |- ( ph -> ( A + A ) # ( A + -u A ) )
26	3	negidd 8635	. . . . . . 7 |- ( ph -> ( A + -u A ) = 0 )
27	25, 26	breqtrd 4157	. . . . . 6 |- ( ph -> ( A + A ) # 0 )
28	4, 27	eqbrtrd 4153	. . . . 5 |- ( ph -> ( 2 x. A ) # 0 )
29	1, 3, 28	mulap0bbd 8997	. . . 4 |- ( ph -> A # 0 )
30	29	adantr 276	. . 3 |- ( ( ph /\ S = 0 ) -> A # 0 )
31		simpr 110	. . 3 |- ( ( ph /\ S = 0 ) -> S = 0 )
32	30, 31	breqtrrd 4159	. 2 |- ( ( ph /\ S = 0 ) -> A # S )
33	4	adantr 276	. . . 4 |- ( ( ph /\ S =/= 0 ) -> ( 2 x. A ) = ( A + A ) )
34		apdifflemr.as	. . . . . . . 8 |- ( ( ph /\ S =/= 0 ) -> ( abs ` ( A - 0 ) ) # ( abs ` ( A - ( 2 x. S ) ) ) )
35	3	subid1d 8634	. . . . . . . . . . 11 |- ( ph -> ( A - 0 ) = A )
36	35	fveq2d 5702	. . . . . . . . . 10 |- ( ph -> ( abs ` ( A - 0 ) ) = ( abs ` A ) )
37		2z 9684	. . . . . . . . . . . . . . 15 |- 2 e. ZZ
38		zq 10043	. . . . . . . . . . . . . . 15 |- ( 2 e. ZZ -> 2 e. QQ )
39	37, 38	ax-mp 5	. . . . . . . . . . . . . 14 |- 2 e. QQ
40	39	a1i 9	. . . . . . . . . . . . 13 |- ( ph -> 2 e. QQ )
41		apdifflemr.s	. . . . . . . . . . . . 13 |- ( ph -> S e. QQ )
42		qmulcl 10054	. . . . . . . . . . . . 13 |- ( ( 2 e. QQ /\ S e. QQ ) -> ( 2 x. S ) e. QQ )
43	40, 41, 42	syl2anc 415	. . . . . . . . . . . 12 |- ( ph -> ( 2 x. S ) e. QQ )
44		qcn 10051	. . . . . . . . . . . 12 |- ( ( 2 x. S ) e. QQ -> ( 2 x. S ) e. CC )
45	43, 44	syl 14	. . . . . . . . . . 11 |- ( ph -> ( 2 x. S ) e. CC )
46	3, 45	abssubd 11983	. . . . . . . . . 10 |- ( ph -> ( abs ` ( A - ( 2 x. S ) ) ) = ( abs ` ( ( 2 x. S ) - A ) ) )
47	36, 46	breq12d 4144	. . . . . . . . 9 |- ( ph -> ( ( abs ` ( A - 0 ) ) # ( abs ` ( A - ( 2 x. S ) ) ) <-> ( abs ` A ) # ( abs ` ( ( 2 x. S ) - A ) ) ) )
48	47	adantr 276	. . . . . . . 8 |- ( ( ph /\ S =/= 0 ) -> ( ( abs ` ( A - 0 ) ) # ( abs ` ( A - ( 2 x. S ) ) ) <-> ( abs ` A ) # ( abs ` ( ( 2 x. S ) - A ) ) ) )
49	34, 48	mpbid 147	. . . . . . 7 |- ( ( ph /\ S =/= 0 ) -> ( abs ` A ) # ( abs ` ( ( 2 x. S ) - A ) ) )
50	3	adantr 276	. . . . . . . 8 |- ( ( ph /\ S =/= 0 ) -> A e. CC )
51	45, 3	subcld 8645	. . . . . . . . 9 |- ( ph -> ( ( 2 x. S ) - A ) e. CC )
52	51	adantr 276	. . . . . . . 8 |- ( ( ph /\ S =/= 0 ) -> ( ( 2 x. S ) - A ) e. CC )
53		absext 11852	. . . . . . . 8 |- ( ( A e. CC /\ ( ( 2 x. S ) - A ) e. CC ) -> ( ( abs ` A ) # ( abs ` ( ( 2 x. S ) - A ) ) -> A # ( ( 2 x. S ) - A ) ) )
54	50, 52, 53	syl2anc 415	. . . . . . 7 |- ( ( ph /\ S =/= 0 ) -> ( ( abs ` A ) # ( abs ` ( ( 2 x. S ) - A ) ) -> A # ( ( 2 x. S ) - A ) ) )
55	49, 54	mpd 13	. . . . . 6 |- ( ( ph /\ S =/= 0 ) -> A # ( ( 2 x. S ) - A ) )
56		apadd2 8946	. . . . . . 7 |- ( ( A e. CC /\ ( ( 2 x. S ) - A ) e. CC /\ A e. CC ) -> ( A # ( ( 2 x. S ) - A ) <-> ( A + A ) # ( A + ( ( 2 x. S ) - A ) ) ) )
57	50, 52, 50, 56	syl3anc 1278	. . . . . 6 |- ( ( ph /\ S =/= 0 ) -> ( A # ( ( 2 x. S ) - A ) <-> ( A + A ) # ( A + ( ( 2 x. S ) - A ) ) ) )
58	55, 57	mpbid 147	. . . . 5 |- ( ( ph /\ S =/= 0 ) -> ( A + A ) # ( A + ( ( 2 x. S ) - A ) ) )
59	45	adantr 276	. . . . . 6 |- ( ( ph /\ S =/= 0 ) -> ( 2 x. S ) e. CC )
60	50, 59	pncan3d 8648	. . . . 5 |- ( ( ph /\ S =/= 0 ) -> ( A + ( ( 2 x. S ) - A ) ) = ( 2 x. S ) )
61	58, 60	breqtrd 4157	. . . 4 |- ( ( ph /\ S =/= 0 ) -> ( A + A ) # ( 2 x. S ) )
62	33, 61	eqbrtrd 4153	. . 3 |- ( ( ph /\ S =/= 0 ) -> ( 2 x. A ) # ( 2 x. S ) )
63		qcn 10051	. . . . . 6 |- ( S e. QQ -> S e. CC )
64	41, 63	syl 14	. . . . 5 |- ( ph -> S e. CC )
65	64	adantr 276	. . . 4 |- ( ( ph /\ S =/= 0 ) -> S e. CC )
66		2cnd 9387	. . . 4 |- ( ( ph /\ S =/= 0 ) -> 2 e. CC )
67		2ap0 9407	. . . . 5 |- 2 # 0
68	67	a1i 9	. . . 4 |- ( ( ph /\ S =/= 0 ) -> 2 # 0 )
69		apmul2 9128	. . . 4 |- ( ( A e. CC /\ S e. CC /\ ( 2 e. CC /\ 2 # 0 ) ) -> ( A # S <-> ( 2 x. A ) # ( 2 x. S ) ) )
70	50, 65, 66, 68, 69	syl112anc 1282	. . 3 |- ( ( ph /\ S =/= 0 ) -> ( A # S <-> ( 2 x. A ) # ( 2 x. S ) ) )
71	62, 70	mpbird 167	. 2 |- ( ( ph /\ S =/= 0 ) -> A # S )
72		0z 9667	. . . . . 6 |- 0 e. ZZ
73		zq 10043	. . . . . 6 |- ( 0 e. ZZ -> 0 e. QQ )
74	72, 73	ax-mp 5	. . . . 5 |- 0 e. QQ
75		qdceq 10697	. . . . 5 |- ( ( S e. QQ /\ 0 e. QQ ) -> DECID S = 0 )
76	41, 74, 75	sylancl 417	. . . 4 |- ( ph -> DECID S = 0 )
77		exmiddc 848	. . . 4 |- (DECID S = 0 -> ( S = 0 \/ -. S = 0 ) )
78	76, 77	syl 14	. . 3 |- ( ph -> ( S = 0 \/ -. S = 0 ) )
79		df-ne 2421	. . . 4 |- ( S =/= 0 <-> -. S = 0 )
80	79	orbi2i 774	. . 3 |- ( ( S = 0 \/ S =/= 0 ) <-> ( S = 0 \/ -. S = 0 ) )
81	78, 80	sylibr 134	. 2 |- ( ph -> ( S = 0 \/ S =/= 0 ) )
82	32, 71, 81	mpjaodan 810	1 |- ( ph -> A # S )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720  DECID wdc 846   = wceq 1402   e. wcel 2209   =/= wne 2420   class class class wbr 4131   ` cfv 5380  (class class class)co 6088   CCcc 8184   RRcr 8185   0cc0 8186   1c1 8187   + caddc 8189   x. cmul 8191   - cmin 8505   -ucneg 8506   # cap 8918   2c2 9365   ZZcz 9656   QQcq 10036   abscabs 11786

This proof depends on 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-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8277  ax-resscn 8278  ax-1cn 8279  ax-1re 8280  ax-icn 8281  ax-addcl 8282  ax-addrcl 8283  ax-mulcl 8284  ax-mulrcl 8285  ax-addcom 8286  ax-mulcom 8287  ax-addass 8288  ax-mulass 8289  ax-distr 8290  ax-i2m1 8291  ax-0lt1 8292  ax-1rid 8293  ax-0id 8294  ax-rnegex 8295  ax-precex 8296  ax-cnre 8297  ax-pre-ltirr 8298  ax-pre-ltwlin 8299  ax-pre-lttrn 8300  ax-pre-apti 8301  ax-pre-ltadd 8302  ax-pre-mulgt0 8303  ax-pre-mulext 8304  ax-arch 8305  ax-caucvg 8306

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  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-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-pnf 8369  df-mnf 8370  df-xr 8371  df-ltxr 8372  df-le 8373  df-sub 8507  df-neg 8508  df-reap 8912  df-ap 8919  df-div 9012  df-inn 9315  df-2 9373  df-3 9374  df-4 9375  df-n0 9576  df-z 9657  df-uz 9939  df-q 10037  df-rp 10073  df-seqfrec 10907  df-exp 10998  df-cj 11630  df-re 11631  df-im 11632  df-rsqrt 11787  df-abs 11788

This theorem is used by:  apdiff  17316