Theorem minclpr 11200

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 9256 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 8180	. . . . 5 |- ( A e. RR -> -u A e. RR )
2		renegcl 8180	. . . . 5 |- ( B e. RR -> -u B e. RR )
3		maxcl 11174	. . . . 5 |- ( ( -u A e. RR /\ -u B e. RR ) -> sup ( { -u A , -u B } , RR , < ) e. RR )
4	1, 2, 3	syl2an 287	. . . 4 |- ( ( A e. RR /\ B e. RR ) -> sup ( { -u A , -u B } , RR , < ) e. RR )
5		elprg 3603	. . . 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 11186	. . . 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 287	. . 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 7948	. . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> sup ( { -u A , -u B } , RR , < ) e. CC )
10	1	adantr 274	. . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> -u A e. RR )
11	10	recnd 7948	. . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> -u A e. CC )
12	9, 11	neg11ad 8226	. . . . 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 11193	. . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> inf ( { A , B } , RR , < ) = -u sup ( { -u A , -u B } , RR , < ) )
14	13	eqcomd 2176	. . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> -u sup ( { -u A , -u B } , RR , < ) = inf ( { A , B } , RR , < ) )
15		recn 7907	. . . . . . . 8 |- ( A e. RR -> A e. CC )
16	15	adantr 274	. . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> A e. CC )
17	16	negnegd 8221	. . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> -u -u A = A )
18	14, 17	eqeq12d 2185	. . . . 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 189	. . . 4 |- ( ( A e. RR /\ B e. RR ) -> ( sup ( { -u A , -u B } , RR , < ) = -u A <-> inf ( { A , B } , RR , < ) = A ) )
20	2	adantl 275	. . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> -u B e. RR )
21	20	recnd 7948	. . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> -u B e. CC )
22	9, 21	neg11ad 8226	. . . . 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 7907	. . . . . . . 8 |- ( B e. RR -> B e. CC )
24	23	adantl 275	. . . . . . 7 |- ( ( A e. RR /\ B e. RR ) -> B e. CC )
25	24	negnegd 8221	. . . . . 6 |- ( ( A e. RR /\ B e. RR ) -> -u -u B = B )
26	14, 25	eqeq12d 2185	. . . . 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 189	. . . 4 |- ( ( A e. RR /\ B e. RR ) -> ( sup ( { -u A , -u B } , RR , < ) = -u B <-> inf ( { A , B } , RR , < ) = B ) )
28	19, 27	orbi12d 788	. . 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 218	. 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 11194	. . 3 |- ( ( A e. RR /\ B e. RR ) -> inf ( { A , B } , RR , < ) e. RR )
31		elprg 3603	. . 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 723	. . 3 |- ( ( B <_ A \/ A <_ B ) <-> ( A <_ B \/ B <_ A ) )
34		simpr 109	. . . . 5 |- ( ( A e. RR /\ B e. RR ) -> B e. RR )
35		simpl 108	. . . . 5 |- ( ( A e. RR /\ B e. RR ) -> A e. RR )
36	34, 35	lenegd 8443	. . . 4 |- ( ( A e. RR /\ B e. RR ) -> ( B <_ A <-> -u A <_ -u B ) )
37		leneg 8384	. . . 4 |- ( ( A e. RR /\ B e. RR ) -> ( A <_ B <-> -u B <_ -u A ) )
38	36, 37	orbi12d 788	. . 3 |- ( ( A e. RR /\ B e. RR ) -> ( ( B <_ A \/ A <_ B ) <-> ( -u A <_ -u B \/ -u B <_ -u A ) ) )
39	33, 38	bitr3id 193	. 2 |- ( ( A e. RR /\ B e. RR ) -> ( ( A <_ B \/ B <_ A ) <-> ( -u A <_ -u B \/ -u B <_ -u A ) ) )
40	29, 32, 39	3bitr4d 219	1 |- ( ( A e. RR /\ B e. RR ) -> (inf ( { A , B } , RR , < ) e. { A , B } <-> ( A <_ B \/ B <_ A ) ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   \/ wo 703   = wceq 1348   e. wcel 2141   {cpr 3584   class class class wbr 3989   supcsup 6959  infcinf 6960   CCcc 7772   RRcr 7773   < clt 7954   <_ cle 7955   -ucneg 8091

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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-iinf 4572  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-mulrcl 7873  ax-addcom 7874  ax-mulcom 7875  ax-addass 7876  ax-mulass 7877  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-1rid 7881  ax-0id 7882  ax-rnegex 7883  ax-precex 7884  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-apti 7889  ax-pre-ltadd 7890  ax-pre-mulgt0 7891  ax-pre-mulext 7892  ax-arch 7893  ax-caucvg 7894

This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rmo 2456  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-if 3527  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-po 4281  df-iso 4282  df-iord 4351  df-on 4353  df-ilim 4354  df-suc 4356  df-iom 4575  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-isom 5207  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-recs 6284  df-frec 6370  df-sup 6961  df-inf 6962  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093  df-reap 8494  df-ap 8501  df-div 8590  df-inn 8879  df-2 8937  df-3 8938  df-4 8939  df-n0 9136  df-z 9213  df-uz 9488  df-rp 9611  df-seqfrec 10402  df-exp 10476  df-cj 10806  df-re 10807  df-im 10808  df-rsqrt 10962  df-abs 10963

This theorem is referenced by:  qtopbas  13316