Theorem infxrnegsupex 11032

Description: The infimum of a set of extended reals A is the negative of the supremum of the negatives of its elements. (Contributed by Jim Kingdon, 2-May-2023.)

Hypotheses

Ref	Expression
infxrnegsupex.ex	|- ( ph -> E. x e. RR* ( A. y e. A -. y < x /\ A. y e. RR* ( x < y -> E. z e. A z < y ) ) )
infxrnegsupex.ss	|- ( ph -> A C_ RR* )

Assertion

Ref	Expression
infxrnegsupex	|- ( ph -> inf ( A , RR* , < ) = -e sup ( { z e. RR* | -e z e. A } , RR* , < ) )

Distinct variable groups:   x, A, y, z   ph, x, y, z

Proof of Theorem infxrnegsupex

Dummy variables f g w are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		xrlttri3 9583	. . . . 5 |- ( ( f e. RR* /\ g e. RR* ) -> ( f = g <-> ( -. f < g /\ -. g < f ) ) )
2	1	adantl 275	. . . 4 |- ( ( ph /\ ( f e. RR* /\ g e. RR* ) ) -> ( f = g <-> ( -. f < g /\ -. g < f ) ) )
3		infxrnegsupex.ex	. . . 4 |- ( ph -> E. x e. RR* ( A. y e. A -. y < x /\ A. y e. RR* ( x < y -> E. z e. A z < y ) ) )
4	2, 3	infclti 6910	. . 3 |- ( ph -> inf ( A , RR* , < ) e. RR* )
5		xnegneg 9616	. . 3 |- (inf ( A , RR* , < ) e. RR* -> -e -einf ( A , RR* , < ) = inf ( A , RR* , < ) )
6	4, 5	syl 14	. 2 |- ( ph -> -e -einf ( A , RR* , < ) = inf ( A , RR* , < ) )
7		xnegeq 9610	. . . . . . . . 9 |- ( w = z -> -e w = -e z )
8	7	cbvmptv 4024	. . . . . . . 8 |- ( w e. RR* |-> -e w ) = ( z e. RR* |-> -e z )
9	8	mptpreima 5032	. . . . . . 7 |- ( `' ( w e. RR* |-> -e w ) " A ) = { z e. RR* | -e z e. A }
10		eqid 2139	. . . . . . . . . 10 |- ( w e. RR* |-> -e w ) = ( w e. RR* |-> -e w )
11	10	xrnegiso 11031	. . . . . . . . 9 |- ( ( w e. RR* |-> -e w ) Isom < , `' < ( RR* , RR* ) /\ `' ( w e. RR* |-> -e w ) = ( w e. RR* |-> -e w ) )
12	11	simpri 112	. . . . . . . 8 |- `' ( w e. RR* |-> -e w ) = ( w e. RR* |-> -e w )
13	12	imaeq1i 4878	. . . . . . 7 |- ( `' ( w e. RR* |-> -e w ) " A ) = ( ( w e. RR* |-> -e w ) " A )
14	9, 13	eqtr3i 2162	. . . . . 6 |- { z e. RR* | -e z e. A } = ( ( w e. RR* |-> -e w ) " A )
15	14	supeq1i 6875	. . . . 5 |- sup ( { z e. RR* | -e z e. A } , RR* , < ) = sup ( ( ( w e. RR* |-> -e w ) " A ) , RR* , < )
16	11	simpli 110	. . . . . . . . 9 |- ( w e. RR* |-> -e w ) Isom < , `' < ( RR* , RR* )
17		isocnv 5712	. . . . . . . . 9 |- ( ( w e. RR* |-> -e w ) Isom < , `' < ( RR* , RR* ) -> `' ( w e. RR* |-> -e w ) Isom `' < , < ( RR* , RR* ) )
18	16, 17	ax-mp 5	. . . . . . . 8 |- `' ( w e. RR* |-> -e w ) Isom `' < , < ( RR* , RR* )
19		isoeq1 5702	. . . . . . . . 9 |- ( `' ( w e. RR* |-> -e w ) = ( w e. RR* |-> -e w ) -> ( `' ( w e. RR* |-> -e w ) Isom `' < , < ( RR* , RR* ) <-> ( w e. RR* |-> -e w ) Isom `' < , < ( RR* , RR* ) ) )
20	12, 19	ax-mp 5	. . . . . . . 8 |- ( `' ( w e. RR* |-> -e w ) Isom `' < , < ( RR* , RR* ) <-> ( w e. RR* |-> -e w ) Isom `' < , < ( RR* , RR* ) )
21	18, 20	mpbi 144	. . . . . . 7 |- ( w e. RR* |-> -e w ) Isom `' < , < ( RR* , RR* )
22	21	a1i 9	. . . . . 6 |- ( ph -> ( w e. RR* |-> -e w ) Isom `' < , < ( RR* , RR* ) )
23		infxrnegsupex.ss	. . . . . 6 |- ( ph -> A C_ RR* )
24	3	cnvinfex 6905	. . . . . 6 |- ( ph -> E. x e. RR* ( A. y e. A -. x `' < y /\ A. y e. RR* ( y `' < x -> E. z e. A y `' < z ) ) )
25	2	cnvti 6906	. . . . . 6 |- ( ( ph /\ ( f e. RR* /\ g e. RR* ) ) -> ( f = g <-> ( -. f `' < g /\ -. g `' < f ) ) )
26	22, 23, 24, 25	supisoti 6897	. . . . 5 |- ( ph -> sup ( ( ( w e. RR* |-> -e w ) " A ) , RR* , < ) = ( ( w e. RR* |-> -e w ) ` sup ( A , RR* , `' < ) ) )
27	15, 26	syl5eq 2184	. . . 4 |- ( ph -> sup ( { z e. RR* | -e z e. A } , RR* , < ) = ( ( w e. RR* |-> -e w ) ` sup ( A , RR* , `' < ) ) )
28		df-inf 6872	. . . . . . 7 |- inf ( A , RR* , < ) = sup ( A , RR* , `' < )
29	28	eqcomi 2143	. . . . . 6 |- sup ( A , RR* , `' < ) = inf ( A , RR* , < )
30	29	fveq2i 5424	. . . . 5 |- ( ( w e. RR* |-> -e w ) ` sup ( A , RR* , `' < ) ) = ( ( w e. RR* |-> -e w ) ` inf ( A , RR* , < ) )
31		eqidd 2140	. . . . . 6 |- ( ph -> ( w e. RR* |-> -e w ) = ( w e. RR* |-> -e w ) )
32		xnegeq 9610	. . . . . . 7 |- ( w = inf ( A , RR* , < ) -> -e w = -einf ( A , RR* , < ) )
33	32	adantl 275	. . . . . 6 |- ( ( ph /\ w = inf ( A , RR* , < ) ) -> -e w = -einf ( A , RR* , < ) )
34	4	xnegcld 9638	. . . . . 6 |- ( ph -> -einf ( A , RR* , < ) e. RR* )
35	31, 33, 4, 34	fvmptd 5502	. . . . 5 |- ( ph -> ( ( w e. RR* |-> -e w ) ` inf ( A , RR* , < ) ) = -einf ( A , RR* , < ) )
36	30, 35	syl5eq 2184	. . . 4 |- ( ph -> ( ( w e. RR* |-> -e w ) ` sup ( A , RR* , `' < ) ) = -einf ( A , RR* , < ) )
37	27, 36	eqtr2d 2173	. . 3 |- ( ph -> -einf ( A , RR* , < ) = sup ( { z e. RR* | -e z e. A } , RR* , < ) )
38		xnegeq 9610	. . 3 |- ( -einf ( A , RR* , < ) = sup ( { z e. RR* | -e z e. A } , RR* , < ) -> -e -einf ( A , RR* , < ) = -e sup ( { z e. RR* | -e z e. A } , RR* , < ) )
39	37, 38	syl 14	. 2 |- ( ph -> -e -einf ( A , RR* , < ) = -e sup ( { z e. RR* | -e z e. A } , RR* , < ) )
40	6, 39	eqtr3d 2174	1 |- ( ph -> inf ( A , RR* , < ) = -e sup ( { z e. RR* | -e z e. A } , RR* , < ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 103   <-> wb 104   = wceq 1331   e. wcel 1480   A.wral 2416   E.wrex 2417   {crab 2420   C_ wss 3071   class class class wbr 3929   |-> cmpt 3989   `'ccnv 4538   "cima 4542   ` cfv 5123   Isom wiso 5124   supcsup 6869  infcinf 6870   RR*cxr 7799   < clt 7800   -ecxne 9556

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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-cnex 7711  ax-resscn 7712  ax-1cn 7713  ax-1re 7714  ax-icn 7715  ax-addcl 7716  ax-addrcl 7717  ax-mulcl 7718  ax-addcom 7720  ax-addass 7722  ax-distr 7724  ax-i2m1 7725  ax-0id 7728  ax-rnegex 7729  ax-cnre 7731  ax-pre-ltirr 7732  ax-pre-apti 7735  ax-pre-ltadd 7736

This theorem depends on definitions:  df-bi 116  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-reu 2423  df-rmo 2424  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-if 3475  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-isom 5132  df-riota 5730  df-ov 5777  df-oprab 5778  df-mpo 5779  df-sup 6871  df-inf 6872  df-pnf 7802  df-mnf 7803  df-xr 7804  df-ltxr 7805  df-sub 7935  df-neg 7936  df-xneg 9559

This theorem is referenced by:  xrminmax  11034