Theorem minclpr 11877

Description: The minimum of two real numbers is one of those numbers if and only if dichotomy ( A <_ B \/ B <_ A) holds. For example, this can be combined with zletric 9584 if one is dealing with integers, but real number dichotomy in general does not follow from our axioms. (Contributed by Jim Kingdon, 23-May-2023.)

Assertion

Ref	Expression
minclpr	|- ( ( A e. RR /\ B e. RR ) -> (inf ( { A , B } , RR , < ) e. { A , B } <-> ( A <_ B \/ B <_ A ) ) )

Proof of Theorem minclpr

Step	Hyp	Ref	Expression
1		renegcl 8499	. . . . 5 |- ( A e. RR -> -u A e. RR )
2		renegcl 8499	. . . . 5 |- ( B e. RR -> -u B e. RR )
3		maxcl 11850	. . . . 5 |- ( ( -u A e. RR /\ -u B e. RR ) -> sup ( { -u A , -u B } , RR , < ) e. RR )
4	1, 2, 3	syl2an 289	. . . 4 |- ( ( A e. RR /\ B e. RR ) -> sup ( { -u A , -u B } , RR , < ) e. RR )
5		elprg 3693	. . . 4 |- ( sup ( { -u A , -u B } , RR , < ) e. RR -> ( sup ( { -u A , -u B } , RR , < ) e. { -u A , -u B } <-> ( sup ( { -u A , -u B } , RR , < ) = -u A \/ sup ( { -u A , -u B } , RR , < ) = -u B ) ) )
6	4, 5	syl 14	. . 3 |- ( ( A e. RR /\ B e. RR ) -> ( sup ( { -u A , -u B } , RR , < ) e. { -u A , -u B } <-> ( sup ( { -u A , -u B } , RR , < ) = -u A \/ sup ( { -u A , -u B } , RR , < ) = -u B ) ) )
7		maxclpr 11862	. . . 4 |- ( ( -u A e. RR /\ -u B e. RR ) -> ( sup ( { -u A , -u B } , RR , < ) e. { -u A , -u B } <-> ( -u A <_ -u B \/ -u B <_ -u A ) ) )
8	1, 2, 7	syl2an 289	. . 3 |- ( ( A e. RR /\ B e. RR ) -> ( sup ( { -u A , -u B } , RR , < ) e. { -u A , -u B } <-> ( -u A <_ -u B \/ -u B <_ -u A ) ) )
9	4	recnd 8267	. . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> sup ( { -u A , -u B } , RR , < ) e. CC )
10	1	adantr 276	. . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> -u A e. RR )
11	10	recnd 8267	. . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> -u A e. CC )
12	9, 11	neg11ad 8545	. . . . 5 |- ( ( A e. RR /\ B e. RR ) -> ( -u sup ( { -u A , -u B } , RR , < ) = -u -u A <-> sup ( { -u A , -u B } , RR , < ) = -u A ) )
13		minmax 11870	. . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> inf ( { A , B } , RR , < ) = -u sup ( { -u A , -u B } , RR , < ) )
14	13	eqcomd 2237	. . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> -u sup ( { -u A , -u B } , RR , < ) = inf ( { A , B } , RR , < ) )
15		recn 8225	. . . . . . . 8 |- ( A e. RR -> A e. CC )
16	15	adantr 276	. . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> A e. CC )
17	16	negnegd 8540	. . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> -u -u A = A )
18	14, 17	eqeq12d 2246	. . . . 5 |- ( ( A e. RR /\ B e. RR ) -> ( -u sup ( { -u A , -u B } , RR , < ) = -u -u A <-> inf ( { A , B } , RR , < ) = A ) )
19	12, 18	bitr3d 190	. . . 4 |- ( ( A e. RR /\ B e. RR ) -> ( sup ( { -u A , -u B } , RR , < ) = -u A <-> inf ( { A , B } , RR , < ) = A ) )
20	2	adantl 277	. . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> -u B e. RR )
21	20	recnd 8267	. . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> -u B e. CC )
22	9, 21	neg11ad 8545	. . . . 5 |- ( ( A e. RR /\ B e. RR ) -> ( -u sup ( { -u A , -u B } , RR , < ) = -u -u B <-> sup ( { -u A , -u B } , RR , < ) = -u B ) )
23		recn 8225	. . . . . . . 8 |- ( B e. RR -> B e. CC )
24	23	adantl 277	. . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> B e. CC )
25	24	negnegd 8540	. . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> -u -u B = B )
26	14, 25	eqeq12d 2246	. . . . 5 |- ( ( A e. RR /\ B e. RR ) -> ( -u sup ( { -u A , -u B } , RR , < ) = -u -u B <-> inf ( { A , B } , RR , < ) = B ) )
27	22, 26	bitr3d 190	. . . 4 |- ( ( A e. RR /\ B e. RR ) -> ( sup ( { -u A , -u B } , RR , < ) = -u B <-> inf ( { A , B } , RR , < ) = B ) )
28	19, 27	orbi12d 801	. . 3 |- ( ( A e. RR /\ B e. RR ) -> ( ( sup ( { -u A , -u B } , RR , < ) = -u A \/ sup ( { -u A , -u B } , RR , < ) = -u B ) <-> (inf ( { A , B } , RR , < ) = A \/ inf ( { A , B } , RR , < ) = B ) ) )
29	6, 8, 28	3bitr3rd 219	. 2 |- ( ( A e. RR /\ B e. RR ) -> ( (inf ( { A , B } , RR , < ) = A \/ inf ( { A , B } , RR , < ) = B ) <-> ( -u A <_ -u B \/ -u B <_ -u A ) ) )
30		mincl 11871	. . 3 |- ( ( A e. RR /\ B e. RR ) -> inf ( { A , B } , RR , < ) e. RR )
31		elprg 3693	. . 3 |- (inf ( { A , B } , RR , < ) e. RR -> (inf ( { A , B } , RR , < ) e. { A , B } <-> (inf ( { A , B } , RR , < ) = A \/ inf ( { A , B } , RR , < ) = B ) ) )
32	30, 31	syl 14	. 2 |- ( ( A e. RR /\ B e. RR ) -> (inf ( { A , B } , RR , < ) e. { A , B } <-> (inf ( { A , B } , RR , < ) = A \/ inf ( { A , B } , RR , < ) = B ) ) )
33		orcom 736	. . 3 |- ( ( B <_ A \/ A <_ B ) <-> ( A <_ B \/ B <_ A ) )
34		simpr 110	. . . . 5 |- ( ( A e. RR /\ B e. RR ) -> B e. RR )
35		simpl 109	. . . . 5 |- ( ( A e. RR /\ B e. RR ) -> A e. RR )
36	34, 35	lenegd 8763	. . . 4 |- ( ( A e. RR /\ B e. RR ) -> ( B <_ A <-> -u A <_ -u B ) )
37		leneg 8704	. . . 4 |- ( ( A e. RR /\ B e. RR ) -> ( A <_ B <-> -u B <_ -u A ) )
38	36, 37	orbi12d 801	. . 3 |- ( ( A e. RR /\ B e. RR ) -> ( ( B <_ A \/ A <_ B ) <-> ( -u A <_ -u B \/ -u B <_ -u A ) ) )
39	33, 38	bitr3id 194	. 2 |- ( ( A e. RR /\ B e. RR ) -> ( ( A <_ B \/ B <_ A ) <-> ( -u A <_ -u B \/ -u B <_ -u A ) ) )
40	29, 32, 39	3bitr4d 220	1 |- ( ( A e. RR /\ B e. RR ) -> (inf ( { A , B } , RR , < ) e. { A , B } <-> ( A <_ B \/ B <_ A ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 716   = wceq 1398   e. wcel 2202   {cpr 3674   class class class wbr 4093   supcsup 7241  infcinf 7242   CCcc 8090   RRcr 8091   < clt 8273   <_ cle 8274   -ucneg 8410

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-mulrcl 8191  ax-addcom 8192  ax-mulcom 8193  ax-addass 8194  ax-mulass 8195  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-1rid 8199  ax-0id 8200  ax-rnegex 8201  ax-precex 8202  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-apti 8207  ax-pre-ltadd 8208  ax-pre-mulgt0 8209  ax-pre-mulext 8210  ax-arch 8211  ax-caucvg 8212

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-isom 5342  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-sup 7243  df-inf 7244  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-reap 8814  df-ap 8821  df-div 8912  df-inn 9203  df-2 9261  df-3 9262  df-4 9263  df-n0 9462  df-z 9541  df-uz 9817  df-rp 9950  df-seqfrec 10773  df-exp 10864  df-cj 11482  df-re 11483  df-im 11484  df-rsqrt 11638  df-abs 11639

This theorem is referenced by:  qtopbas  15333