Theorem maxabslemlub 11391

Description: Lemma for maxabs 11393. A least upper bound for { A , B }. (Contributed by Jim Kingdon, 20-Dec-2021.)

Hypotheses

Ref	Expression
maxabslemlub.a	|- ( ph -> A e. RR )
maxabslemlub.b	|- ( ph -> B e. RR )
maxabslemlub.c	|- ( ph -> C e. RR )
maxabslemlub.clt	|- ( ph -> C < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) )

Assertion

Ref	Expression
maxabslemlub	|- ( ph -> ( C < A \/ C < B ) )

Proof of Theorem maxabslemlub

Step	Hyp	Ref	Expression
1		maxabslemlub.clt	. . 3 |- ( ph -> C < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) )
2		maxabslemlub.c	. . . 4 |- ( ph -> C e. RR )
3		maxabslemlub.a	. . . . . . 7 |- ( ph -> A e. RR )
4		maxabslemlub.b	. . . . . . 7 |- ( ph -> B e. RR )
5	3, 4	readdcld 8075	. . . . . 6 |- ( ph -> ( A + B ) e. RR )
6	3	recnd 8074	. . . . . . . 8 |- ( ph -> A e. CC )
7	4	recnd 8074	. . . . . . . 8 |- ( ph -> B e. CC )
8	6, 7	subcld 8356	. . . . . . 7 |- ( ph -> ( A - B ) e. CC )
9	8	abscld 11365	. . . . . 6 |- ( ph -> ( abs ` ( A - B ) ) e. RR )
10	5, 9	readdcld 8075	. . . . 5 |- ( ph -> ( ( A + B ) + ( abs ` ( A - B ) ) ) e. RR )
11	10	rehalfcld 9257	. . . 4 |- ( ph -> ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) e. RR )
12		axltwlin 8113	. . . 4 |- ( ( C e. RR /\ ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) e. RR /\ A e. RR ) -> ( C < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) -> ( C < A \/ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) ) )
13	2, 11, 3, 12	syl3anc 1249	. . 3 |- ( ph -> ( C < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) -> ( C < A \/ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) ) )
14	1, 13	mpd 13	. 2 |- ( ph -> ( C < A \/ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) )
15	1	adantr 276	. . . . 5 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> C < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) )
16	3	adantr 276	. . . . . 6 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> A e. RR )
17	4	adantr 276	. . . . . 6 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> B e. RR )
18	16, 17	resubcld 8426	. . . . . . . 8 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( A - B ) e. RR )
19		2re 9079	. . . . . . . . . . . . . 14 |- 2 e. RR
20	19	a1i 9	. . . . . . . . . . . . 13 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> 2 e. RR )
21	20, 16	remulcld 8076	. . . . . . . . . . . 12 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( 2 x. A ) e. RR )
22	21	recnd 8074	. . . . . . . . . . 11 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( 2 x. A ) e. CC )
23	6	adantr 276	. . . . . . . . . . 11 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> A e. CC )
24	7	adantr 276	. . . . . . . . . . 11 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> B e. CC )
25	22, 23, 24	subsub4d 8387	. . . . . . . . . 10 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( ( 2 x. A ) - A ) - B ) = ( ( 2 x. A ) - ( A + B ) ) )
26		2cnd 9082	. . . . . . . . . . . . . 14 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> 2 e. CC )
27	26, 23	mulsubfacd 8464	. . . . . . . . . . . . 13 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( 2 x. A ) - A ) = ( ( 2 - 1 ) x. A ) )
28		2m1e1 9127	. . . . . . . . . . . . . 14 |- ( 2 - 1 ) = 1
29	28	oveq1i 5935	. . . . . . . . . . . . 13 |- ( ( 2 - 1 ) x. A ) = ( 1 x. A )
30	27, 29	eqtrdi 2245	. . . . . . . . . . . 12 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( 2 x. A ) - A ) = ( 1 x. A ) )
31	23	mulid2d 8064	. . . . . . . . . . . 12 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( 1 x. A ) = A )
32	30, 31	eqtrd 2229	. . . . . . . . . . 11 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( 2 x. A ) - A ) = A )
33	32	oveq1d 5940	. . . . . . . . . 10 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( ( 2 x. A ) - A ) - B ) = ( A - B ) )
34	25, 33	eqtr3d 2231	. . . . . . . . 9 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( 2 x. A ) - ( A + B ) ) = ( A - B ) )
35		simpr 110	. . . . . . . . . . 11 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) )
36	10	adantr 276	. . . . . . . . . . . 12 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( A + B ) + ( abs ` ( A - B ) ) ) e. RR )
37		2rp 9752	. . . . . . . . . . . . 13 |- 2 e. RR+
38	37	a1i 9	. . . . . . . . . . . 12 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> 2 e. RR+ )
39	16, 36, 38	ltmuldiv2d 9839	. . . . . . . . . . 11 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( 2 x. A ) < ( ( A + B ) + ( abs ` ( A - B ) ) ) <-> A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) )
40	35, 39	mpbird 167	. . . . . . . . . 10 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( 2 x. A ) < ( ( A + B ) + ( abs ` ( A - B ) ) ) )
41	5	adantr 276	. . . . . . . . . . 11 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( A + B ) e. RR )
42	9	adantr 276	. . . . . . . . . . 11 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( abs ` ( A - B ) ) e. RR )
43	21, 41, 42	ltsubadd2d 8589	. . . . . . . . . 10 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( ( 2 x. A ) - ( A + B ) ) < ( abs ` ( A - B ) ) <-> ( 2 x. A ) < ( ( A + B ) + ( abs ` ( A - B ) ) ) ) )
44	40, 43	mpbird 167	. . . . . . . . 9 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( 2 x. A ) - ( A + B ) ) < ( abs ` ( A - B ) ) )
45	34, 44	eqbrtrrd 4058	. . . . . . . 8 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( A - B ) < ( abs ` ( A - B ) ) )
46		ltabs 11271	. . . . . . . 8 |- ( ( ( A - B ) e. RR /\ ( A - B ) < ( abs ` ( A - B ) ) ) -> ( A - B ) < 0 )
47	18, 45, 46	syl2anc 411	. . . . . . 7 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( A - B ) < 0 )
48	16, 17	sublt0d 8616	. . . . . . 7 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( A - B ) < 0 <-> A < B ) )
49	47, 48	mpbid 147	. . . . . 6 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> A < B )
50	16, 17, 49	maxabslemab 11390	. . . . 5 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) = B )
51	15, 50	breqtrd 4060	. . . 4 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> C < B )
52	51	ex 115	. . 3 |- ( ph -> ( A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) -> C < B ) )
53	52	orim2d 789	. 2 |- ( ph -> ( ( C < A \/ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( C < A \/ C < B ) ) )
54	14, 53	mpd 13	1 |- ( ph -> ( C < A \/ C < B ) )

Syntax hints:   -> wi 4   /\ wa 104   \/ wo 709   e. wcel 2167   class class class wbr 4034   ` cfv 5259  (class class class)co 5925   CCcc 7896   RRcr 7897   0cc0 7898   1c1 7899   + caddc 7901   x. cmul 7903   < clt 8080   - cmin 8216   / cdiv 8718   2c2 9060   RR+crp 9747   abscabs 11181

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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625  ax-cnex 7989  ax-resscn 7990  ax-1cn 7991  ax-1re 7992  ax-icn 7993  ax-addcl 7994  ax-addrcl 7995  ax-mulcl 7996  ax-mulrcl 7997  ax-addcom 7998  ax-mulcom 7999  ax-addass 8000  ax-mulass 8001  ax-distr 8002  ax-i2m1 8003  ax-0lt1 8004  ax-1rid 8005  ax-0id 8006  ax-rnegex 8007  ax-precex 8008  ax-cnre 8009  ax-pre-ltirr 8010  ax-pre-ltwlin 8011  ax-pre-lttrn 8012  ax-pre-apti 8013  ax-pre-ltadd 8014  ax-pre-mulgt0 8015  ax-pre-mulext 8016  ax-arch 8017  ax-caucvg 8018

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-if 3563  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-po 4332  df-iso 4333  df-iord 4402  df-on 4404  df-ilim 4405  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-frec 6458  df-pnf 8082  df-mnf 8083  df-xr 8084  df-ltxr 8085  df-le 8086  df-sub 8218  df-neg 8219  df-reap 8621  df-ap 8628  df-div 8719  df-inn 9010  df-2 9068  df-3 9069  df-4 9070  df-n0 9269  df-z 9346  df-uz 9621  df-rp 9748  df-seqfrec 10559  df-exp 10650  df-cj 11026  df-re 11027  df-im 11028  df-rsqrt 11182  df-abs 11183

This theorem is referenced by:  maxabslemval  11392  maxleastlt  11399