Theorem infxrnegsupex 12029

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

Hypotheses

Ref	Expression
infxrnegsupex.ex	⊢ (𝜑 → ∃𝑥 ∈ ℝ* (∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦)))
infxrnegsupex.ss	⊢ (𝜑 → 𝐴 ⊆ ℝ*)

Assertion

Ref	Expression
infxrnegsupex	⊢ (𝜑 → inf(𝐴, ℝ*, < ) = -𝑒sup({𝑧 ∈ ℝ* ∣ -𝑒𝑧 ∈ 𝐴}, ℝ*, < ))

Distinct variable groups:   𝑥,𝐴,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧

Proof of Theorem infxrnegsupex

Dummy variables 𝑓 𝑔 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		xrlttri3 10199	. . . . 5 ⊢ ((𝑓 ∈ ℝ* ∧ 𝑔 ∈ ℝ*) → (𝑓 = 𝑔 ↔ (¬ 𝑓 < 𝑔 ∧ ¬ 𝑔 < 𝑓)))
2	1	adantl 277	. . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ ℝ* ∧ 𝑔 ∈ ℝ*)) → (𝑓 = 𝑔 ↔ (¬ 𝑓 < 𝑔 ∧ ¬ 𝑔 < 𝑓)))
3		infxrnegsupex.ex	. . . 4 ⊢ (𝜑 → ∃𝑥 ∈ ℝ* (∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦)))
4	2, 3	infclti 7363	. . 3 ⊢ (𝜑 → inf(𝐴, ℝ*, < ) ∈ ℝ*)
5		xnegneg 10235	. . 3 ⊢ (inf(𝐴, ℝ*, < ) ∈ ℝ* → -𝑒-𝑒inf(𝐴, ℝ*, < ) = inf(𝐴, ℝ*, < ))
6	4, 5	syl 14	. 2 ⊢ (𝜑 → -𝑒-𝑒inf(𝐴, ℝ*, < ) = inf(𝐴, ℝ*, < ))
7		xnegeq 10229	. . . . . . . . 9 ⊢ (𝑤 = 𝑧 → -𝑒𝑤 = -𝑒𝑧)
8	7	cbvmptv 4227	. . . . . . . 8 ⊢ (𝑤 ∈ ℝ* ↦ -𝑒𝑤) = (𝑧 ∈ ℝ* ↦ -𝑒𝑧)
9	8	mptpreima 5281	. . . . . . 7 ⊢ (◡(𝑤 ∈ ℝ* ↦ -𝑒𝑤) “ 𝐴) = {𝑧 ∈ ℝ* ∣ -𝑒𝑧 ∈ 𝐴}
10		eqid 2238	. . . . . . . . . 10 ⊢ (𝑤 ∈ ℝ* ↦ -𝑒𝑤) = (𝑤 ∈ ℝ* ↦ -𝑒𝑤)
11	10	xrnegiso 12028	. . . . . . . . 9 ⊢ ((𝑤 ∈ ℝ* ↦ -𝑒𝑤) Isom < , ◡ < (ℝ*, ℝ*) ∧ ◡(𝑤 ∈ ℝ* ↦ -𝑒𝑤) = (𝑤 ∈ ℝ* ↦ -𝑒𝑤))
12	11	simpri 113	. . . . . . . 8 ⊢ ◡(𝑤 ∈ ℝ* ↦ -𝑒𝑤) = (𝑤 ∈ ℝ* ↦ -𝑒𝑤)
13	12	imaeq1i 5123	. . . . . . 7 ⊢ (◡(𝑤 ∈ ℝ* ↦ -𝑒𝑤) “ 𝐴) = ((𝑤 ∈ ℝ* ↦ -𝑒𝑤) “ 𝐴)
14	9, 13	eqtr3i 2261	. . . . . 6 ⊢ {𝑧 ∈ ℝ* ∣ -𝑒𝑧 ∈ 𝐴} = ((𝑤 ∈ ℝ* ↦ -𝑒𝑤) “ 𝐴)
15	14	supeq1i 7328	. . . . 5 ⊢ sup({𝑧 ∈ ℝ* ∣ -𝑒𝑧 ∈ 𝐴}, ℝ*, < ) = sup(((𝑤 ∈ ℝ* ↦ -𝑒𝑤) “ 𝐴), ℝ*, < )
16	11	simpli 111	. . . . . . . . 9 ⊢ (𝑤 ∈ ℝ* ↦ -𝑒𝑤) Isom < , ◡ < (ℝ*, ℝ*)
17		isocnv 6017	. . . . . . . . 9 ⊢ ((𝑤 ∈ ℝ* ↦ -𝑒𝑤) Isom < , ◡ < (ℝ*, ℝ*) → ◡(𝑤 ∈ ℝ* ↦ -𝑒𝑤) Isom ◡ < , < (ℝ*, ℝ*))
18	16, 17	ax-mp 5	. . . . . . . 8 ⊢ ◡(𝑤 ∈ ℝ* ↦ -𝑒𝑤) Isom ◡ < , < (ℝ*, ℝ*)
19		isoeq1 6007	. . . . . . . . 9 ⊢ (◡(𝑤 ∈ ℝ* ↦ -𝑒𝑤) = (𝑤 ∈ ℝ* ↦ -𝑒𝑤) → (◡(𝑤 ∈ ℝ* ↦ -𝑒𝑤) Isom ◡ < , < (ℝ*, ℝ*) ↔ (𝑤 ∈ ℝ* ↦ -𝑒𝑤) Isom ◡ < , < (ℝ*, ℝ*)))
20	12, 19	ax-mp 5	. . . . . . . 8 ⊢ (◡(𝑤 ∈ ℝ* ↦ -𝑒𝑤) Isom ◡ < , < (ℝ*, ℝ*) ↔ (𝑤 ∈ ℝ* ↦ -𝑒𝑤) Isom ◡ < , < (ℝ*, ℝ*))
21	18, 20	mpbi 145	. . . . . . 7 ⊢ (𝑤 ∈ ℝ* ↦ -𝑒𝑤) Isom ◡ < , < (ℝ*, ℝ*)
22	21	a1i 9	. . . . . 6 ⊢ (𝜑 → (𝑤 ∈ ℝ* ↦ -𝑒𝑤) Isom ◡ < , < (ℝ*, ℝ*))
23		infxrnegsupex.ss	. . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ ℝ*)
24	3	cnvinfex 7358	. . . . . 6 ⊢ (𝜑 → ∃𝑥 ∈ ℝ* (∀𝑦 ∈ 𝐴 ¬ 𝑥◡ < 𝑦 ∧ ∀𝑦 ∈ ℝ* (𝑦◡ < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦◡ < 𝑧)))
25	2	cnvti 7359	. . . . . 6 ⊢ ((𝜑 ∧ (𝑓 ∈ ℝ* ∧ 𝑔 ∈ ℝ*)) → (𝑓 = 𝑔 ↔ (¬ 𝑓◡ < 𝑔 ∧ ¬ 𝑔◡ < 𝑓)))
26	22, 23, 24, 25	supisoti 7350	. . . . 5 ⊢ (𝜑 → sup(((𝑤 ∈ ℝ* ↦ -𝑒𝑤) “ 𝐴), ℝ*, < ) = ((𝑤 ∈ ℝ* ↦ -𝑒𝑤)‘sup(𝐴, ℝ*, ◡ < )))
27	15, 26	eqtrid 2283	. . . 4 ⊢ (𝜑 → sup({𝑧 ∈ ℝ* ∣ -𝑒𝑧 ∈ 𝐴}, ℝ*, < ) = ((𝑤 ∈ ℝ* ↦ -𝑒𝑤)‘sup(𝐴, ℝ*, ◡ < )))
28		df-inf 7325	. . . . . . 7 ⊢ inf(𝐴, ℝ*, < ) = sup(𝐴, ℝ*, ◡ < )
29	28	eqcomi 2242	. . . . . 6 ⊢ sup(𝐴, ℝ*, ◡ < ) = inf(𝐴, ℝ*, < )
30	29	fveq2i 5698	. . . . 5 ⊢ ((𝑤 ∈ ℝ* ↦ -𝑒𝑤)‘sup(𝐴, ℝ*, ◡ < )) = ((𝑤 ∈ ℝ* ↦ -𝑒𝑤)‘inf(𝐴, ℝ*, < ))
31		eqidd 2239	. . . . . 6 ⊢ (𝜑 → (𝑤 ∈ ℝ* ↦ -𝑒𝑤) = (𝑤 ∈ ℝ* ↦ -𝑒𝑤))
32		xnegeq 10229	. . . . . . 7 ⊢ (𝑤 = inf(𝐴, ℝ*, < ) → -𝑒𝑤 = -𝑒inf(𝐴, ℝ*, < ))
33	32	adantl 277	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 = inf(𝐴, ℝ*, < )) → -𝑒𝑤 = -𝑒inf(𝐴, ℝ*, < ))
34	4	xnegcld 10257	. . . . . 6 ⊢ (𝜑 → -𝑒inf(𝐴, ℝ*, < ) ∈ ℝ*)
35	31, 33, 4, 34	fvmptd 5786	. . . . 5 ⊢ (𝜑 → ((𝑤 ∈ ℝ* ↦ -𝑒𝑤)‘inf(𝐴, ℝ*, < )) = -𝑒inf(𝐴, ℝ*, < ))
36	30, 35	eqtrid 2283	. . . 4 ⊢ (𝜑 → ((𝑤 ∈ ℝ* ↦ -𝑒𝑤)‘sup(𝐴, ℝ*, ◡ < )) = -𝑒inf(𝐴, ℝ*, < ))
37	27, 36	eqtr2d 2272	. . 3 ⊢ (𝜑 → -𝑒inf(𝐴, ℝ*, < ) = sup({𝑧 ∈ ℝ* ∣ -𝑒𝑧 ∈ 𝐴}, ℝ*, < ))
38		xnegeq 10229	. . 3 ⊢ (-𝑒inf(𝐴, ℝ*, < ) = sup({𝑧 ∈ ℝ* ∣ -𝑒𝑧 ∈ 𝐴}, ℝ*, < ) → -𝑒-𝑒inf(𝐴, ℝ*, < ) = -𝑒sup({𝑧 ∈ ℝ* ∣ -𝑒𝑧 ∈ 𝐴}, ℝ*, < ))
39	37, 38	syl 14	. 2 ⊢ (𝜑 → -𝑒-𝑒inf(𝐴, ℝ*, < ) = -𝑒sup({𝑧 ∈ ℝ* ∣ -𝑒𝑧 ∈ 𝐴}, ℝ*, < ))
40	6, 39	eqtr3d 2273	1 ⊢ (𝜑 → inf(𝐴, ℝ*, < ) = -𝑒sup({𝑧 ∈ ℝ* ∣ -𝑒𝑧 ∈ 𝐴}, ℝ*, < ))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  {crab 2532   ⊆ wss 3220   class class class wbr 4130   ↦ cmpt 4192  ^◡ccnv 4773   “ cima 4777  ‘cfv 5377   Isom wiso 5378  supcsup 7322  infcinf 7323  ℝ^*cxr 8359   < clt 8360  -_𝑒cxne 10171

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-apti 8294  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-isom 5386  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-sup 7324  df-inf 7325  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-sub 8499  df-neg 8500  df-xneg 10174

This theorem is used by:  xrminmax  12031