Theorem maxabslemlub 11149

Description: Lemma for maxabs 11151. 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 7928	. . . . . 6 |- ( ph -> ( A + B ) e. RR )
6	3	recnd 7927	. . . . . . . 8 |- ( ph -> A e. CC )
7	4	recnd 7927	. . . . . . . 8 |- ( ph -> B e. CC )
8	6, 7	subcld 8209	. . . . . . 7 |- ( ph -> ( A - B ) e. CC )
9	8	abscld 11123	. . . . . 6 |- ( ph -> ( abs ` ( A - B ) ) e. RR )
10	5, 9	readdcld 7928	. . . . 5 |- ( ph -> ( ( A + B ) + ( abs ` ( A - B ) ) ) e. RR )
11	10	rehalfcld 9103	. . . 4 |- ( ph -> ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) e. RR )
12		axltwlin 7966	. . . 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 1228	. . 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 274	. . . . 5 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> C < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) )
16	3	adantr 274	. . . . . 6 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> A e. RR )
17	4	adantr 274	. . . . . 6 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> B e. RR )
18	16, 17	resubcld 8279	. . . . . . . 8 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( A - B ) e. RR )
19		2re 8927	. . . . . . . . . . . . . 14 |- 2 e. RR
20	19	a1i 9	. . . . . . . . . . . . 13 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> 2 e. RR )
21	20, 16	remulcld 7929	. . . . . . . . . . . 12 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( 2 x. A ) e. RR )
22	21	recnd 7927	. . . . . . . . . . 11 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( 2 x. A ) e. CC )
23	6	adantr 274	. . . . . . . . . . 11 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> A e. CC )
24	7	adantr 274	. . . . . . . . . . 11 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> B e. CC )
25	22, 23, 24	subsub4d 8240	. . . . . . . . . 10 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( ( 2 x. A ) - A ) - B ) = ( ( 2 x. A ) - ( A + B ) ) )
26		2cnd 8930	. . . . . . . . . . . . . 14 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> 2 e. CC )
27	26, 23	mulsubfacd 8316	. . . . . . . . . . . . 13 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( 2 x. A ) - A ) = ( ( 2 - 1 ) x. A ) )
28		2m1e1 8975	. . . . . . . . . . . . . 14 |- ( 2 - 1 ) = 1
29	28	oveq1i 5852	. . . . . . . . . . . . 13 |- ( ( 2 - 1 ) x. A ) = ( 1 x. A )
30	27, 29	eqtrdi 2215	. . . . . . . . . . . 12 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( 2 x. A ) - A ) = ( 1 x. A ) )
31	23	mulid2d 7917	. . . . . . . . . . . 12 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( 1 x. A ) = A )
32	30, 31	eqtrd 2198	. . . . . . . . . . 11 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( 2 x. A ) - A ) = A )
33	32	oveq1d 5857	. . . . . . . . . 10 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( ( 2 x. A ) - A ) - B ) = ( A - B ) )
34	25, 33	eqtr3d 2200	. . . . . . . . 9 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( 2 x. A ) - ( A + B ) ) = ( A - B ) )
35		simpr 109	. . . . . . . . . . 11 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) )
36	10	adantr 274	. . . . . . . . . . . 12 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( A + B ) + ( abs ` ( A - B ) ) ) e. RR )
37		2rp 9594	. . . . . . . . . . . . 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 9681	. . . . . . . . . . 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 166	. . . . . . . . . 10 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( 2 x. A ) < ( ( A + B ) + ( abs ` ( A - B ) ) ) )
41	5	adantr 274	. . . . . . . . . . 11 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( A + B ) e. RR )
42	9	adantr 274	. . . . . . . . . . 11 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( abs ` ( A - B ) ) e. RR )
43	21, 41, 42	ltsubadd2d 8441	. . . . . . . . . 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 166	. . . . . . . . 9 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( 2 x. A ) - ( A + B ) ) < ( abs ` ( A - B ) ) )
45	34, 44	eqbrtrrd 4006	. . . . . . . 8 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( A - B ) < ( abs ` ( A - B ) ) )
46		ltabs 11029	. . . . . . . 8 |- ( ( ( A - B ) e. RR /\ ( A - B ) < ( abs ` ( A - B ) ) ) -> ( A - B ) < 0 )
47	18, 45, 46	syl2anc 409	. . . . . . 7 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( A - B ) < 0 )
48	16, 17	sublt0d 8468	. . . . . . 7 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( A - B ) < 0 <-> A < B ) )
49	47, 48	mpbid 146	. . . . . 6 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> A < B )
50	16, 17, 49	maxabslemab 11148	. . . . 5 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) = B )
51	15, 50	breqtrd 4008	. . . 4 |- ( ( ph /\ A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) ) -> C < B )
52	51	ex 114	. . 3 |- ( ph -> ( A < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) -> C < B ) )
53	52	orim2d 778	. 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 103   \/ wo 698   e. wcel 2136   class class class wbr 3982   ` cfv 5188  (class class class)co 5842   CCcc 7751   RRcr 7752   0cc0 7753   1c1 7754   + caddc 7756   x. cmul 7758   < clt 7933   - cmin 8069   / cdiv 8568   2c2 8908   RR+crp 9589   abscabs 10939

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565  ax-cnex 7844  ax-resscn 7845  ax-1cn 7846  ax-1re 7847  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-mulrcl 7852  ax-addcom 7853  ax-mulcom 7854  ax-addass 7855  ax-mulass 7856  ax-distr 7857  ax-i2m1 7858  ax-0lt1 7859  ax-1rid 7860  ax-0id 7861  ax-rnegex 7862  ax-precex 7863  ax-cnre 7864  ax-pre-ltirr 7865  ax-pre-ltwlin 7866  ax-pre-lttrn 7867  ax-pre-apti 7868  ax-pre-ltadd 7869  ax-pre-mulgt0 7870  ax-pre-mulext 7871  ax-arch 7872  ax-caucvg 7873

This theorem depends on definitions:  df-bi 116  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-reu 2451  df-rmo 2452  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-if 3521  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-id 4271  df-po 4274  df-iso 4275  df-iord 4344  df-on 4346  df-ilim 4347  df-suc 4349  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-riota 5798  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-recs 6273  df-frec 6359  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939  df-sub 8071  df-neg 8072  df-reap 8473  df-ap 8480  df-div 8569  df-inn 8858  df-2 8916  df-3 8917  df-4 8918  df-n0 9115  df-z 9192  df-uz 9467  df-rp 9590  df-seqfrec 10381  df-exp 10455  df-cj 10784  df-re 10785  df-im 10786  df-rsqrt 10940  df-abs 10941

This theorem is referenced by:  maxabslemval  11150  maxleastlt  11157