Theorem supminfrnmpt 44886

Description: The indexed supremum of a bounded-above set of reals is the negation of the indexed infimum of that set's image under negation. (Contributed by Glauco Siliprandi, 2-Jan-2022.)

Hypotheses

Ref	Expression
supminfrnmpt.x	⊢ Ⅎ𝑥𝜑
supminfrnmpt.a	⊢ (𝜑 → 𝐴 ≠ ∅)
supminfrnmpt.b	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ)
supminfrnmpt.y	⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦)

Assertion

Ref	Expression
supminfrnmpt	⊢ (𝜑 → sup(ran (𝑥 ∈ 𝐴 ↦ 𝐵), ℝ, < ) = -inf(ran (𝑥 ∈ 𝐴 ↦ -𝐵), ℝ, < ))

Distinct variable groups:   𝑥,𝐴,𝑦   𝑦,𝐵

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐵(𝑥)

Proof of Theorem supminfrnmpt

Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		supminfrnmpt.x	. . . 4 ⊢ Ⅎ𝑥𝜑
2		eqid 2725	. . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
3		supminfrnmpt.b	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ)
4	1, 2, 3	rnmptssd 44629	. . 3 ⊢ (𝜑 → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ ℝ)
5		supminfrnmpt.a	. . . 4 ⊢ (𝜑 → 𝐴 ≠ ∅)
6	1, 3, 2, 5	rnmptn0 6244	. . 3 ⊢ (𝜑 → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ≠ ∅)
7		supminfrnmpt.y	. . . 4 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑦)
8	1, 7	rnmptbdd 44680	. . 3 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦)
9		supminf 12944	. . 3 ⊢ ((ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ ℝ ∧ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑧 ≤ 𝑦) → sup(ran (𝑥 ∈ 𝐴 ↦ 𝐵), ℝ, < ) = -inf({𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}, ℝ, < ))
10	4, 6, 8, 9	syl3anc 1368	. 2 ⊢ (𝜑 → sup(ran (𝑥 ∈ 𝐴 ↦ 𝐵), ℝ, < ) = -inf({𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}, ℝ, < ))
11		eqid 2725	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 ↦ -𝐵) = (𝑥 ∈ 𝐴 ↦ -𝐵)
12		simpr 483	. . . . . . . . . . . 12 ⊢ ((𝑤 ∈ ℝ ∧ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
13		renegcl 11548	. . . . . . . . . . . . . 14 ⊢ (𝑤 ∈ ℝ → -𝑤 ∈ ℝ)
14	2	elrnmpt 5953	. . . . . . . . . . . . . 14 ⊢ (-𝑤 ∈ ℝ → (-𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ↔ ∃𝑥 ∈ 𝐴 -𝑤 = 𝐵))
15	13, 14	syl 17	. . . . . . . . . . . . 13 ⊢ (𝑤 ∈ ℝ → (-𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ↔ ∃𝑥 ∈ 𝐴 -𝑤 = 𝐵))
16	15	adantr 479	. . . . . . . . . . . 12 ⊢ ((𝑤 ∈ ℝ ∧ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → (-𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ↔ ∃𝑥 ∈ 𝐴 -𝑤 = 𝐵))
17	12, 16	mpbid 231	. . . . . . . . . . 11 ⊢ ((𝑤 ∈ ℝ ∧ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → ∃𝑥 ∈ 𝐴 -𝑤 = 𝐵)
18	17	adantll 712	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → ∃𝑥 ∈ 𝐴 -𝑤 = 𝐵)
19		nfv 1909	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥 𝑤 ∈ ℝ
20	1, 19	nfan 1894	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑤 ∈ ℝ)
21		negeq 11477	. . . . . . . . . . . . . . . . . . 19 ⊢ (-𝑤 = 𝐵 → --𝑤 = -𝐵)
22	21	eqcomd 2731	. . . . . . . . . . . . . . . . . 18 ⊢ (-𝑤 = 𝐵 → -𝐵 = --𝑤)
23	22	adantl 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑤 ∈ ℝ ∧ -𝑤 = 𝐵) → -𝐵 = --𝑤)
24		recn 11223	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑤 ∈ ℝ → 𝑤 ∈ ℂ)
25	24	negnegd 11587	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑤 ∈ ℝ → --𝑤 = 𝑤)
26	25	adantr 479	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑤 ∈ ℝ ∧ -𝑤 = 𝐵) → --𝑤 = 𝑤)
27	23, 26	eqtr2d 2766	. . . . . . . . . . . . . . . 16 ⊢ ((𝑤 ∈ ℝ ∧ -𝑤 = 𝐵) → 𝑤 = -𝐵)
28	27	ex 411	. . . . . . . . . . . . . . 15 ⊢ (𝑤 ∈ ℝ → (-𝑤 = 𝐵 → 𝑤 = -𝐵))
29	28	adantl 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ) → (-𝑤 = 𝐵 → 𝑤 = -𝐵))
30	29	adantr 479	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (-𝑤 = 𝐵 → 𝑤 = -𝐵))
31		negeq 11477	. . . . . . . . . . . . . . . . 17 ⊢ (𝑤 = -𝐵 → -𝑤 = --𝐵)
32	31	adantl 480	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑤 = -𝐵) → -𝑤 = --𝐵)
33	3	recnd 11267	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
34	33	negnegd 11587	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → --𝐵 = 𝐵)
35	34	adantr 479	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑤 = -𝐵) → --𝐵 = 𝐵)
36	32, 35	eqtrd 2765	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑤 = -𝐵) → -𝑤 = 𝐵)
37	36	ex 411	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑤 = -𝐵 → -𝑤 = 𝐵))
38	37	adantlr 713	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (𝑤 = -𝐵 → -𝑤 = 𝐵))
39	30, 38	impbid 211	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (-𝑤 = 𝐵 ↔ 𝑤 = -𝐵))
40	20, 39	rexbida 3260	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ) → (∃𝑥 ∈ 𝐴 -𝑤 = 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑤 = -𝐵))
41	40	adantr 479	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → (∃𝑥 ∈ 𝐴 -𝑤 = 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑤 = -𝐵))
42	18, 41	mpbid 231	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → ∃𝑥 ∈ 𝐴 𝑤 = -𝐵)
43		simplr 767	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → 𝑤 ∈ ℝ)
44	11, 42, 43	elrnmptd 5958	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → 𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ -𝐵))
45	44	ex 411	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ) → (-𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) → 𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ -𝐵)))
46	45	ralrimiva 3136	. . . . . 6 ⊢ (𝜑 → ∀𝑤 ∈ ℝ (-𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) → 𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ -𝐵)))
47		rabss 4062	. . . . . 6 ⊢ ({𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)} ⊆ ran (𝑥 ∈ 𝐴 ↦ -𝐵) ↔ ∀𝑤 ∈ ℝ (-𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) → 𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ -𝐵)))
48	46, 47	sylibr 233	. . . . 5 ⊢ (𝜑 → {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)} ⊆ ran (𝑥 ∈ 𝐴 ↦ -𝐵))
49		nfcv 2892	. . . . . . . 8 ⊢ Ⅎ𝑥-𝑤
50		nfmpt1 5252	. . . . . . . . 9 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵)
51	50	nfrn 5949	. . . . . . . 8 ⊢ Ⅎ𝑥ran (𝑥 ∈ 𝐴 ↦ 𝐵)
52	49, 51	nfel 2907	. . . . . . 7 ⊢ Ⅎ𝑥-𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)
53		nfcv 2892	. . . . . . 7 ⊢ Ⅎ𝑥ℝ
54	52, 53	nfrabw 3457	. . . . . 6 ⊢ Ⅎ𝑥{𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}
55	31	eleq1d 2810	. . . . . . 7 ⊢ (𝑤 = -𝐵 → (-𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ↔ --𝐵 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)))
56	3	renegcld 11666	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐵 ∈ ℝ)
57		simpr 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
58	2	elrnmpt1 5955	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ ℝ) → 𝐵 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
59	57, 3, 58	syl2anc 582	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
60	34, 59	eqeltrd 2825	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → --𝐵 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
61	55, 56, 60	elrabd 3678	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐵 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)})
62	1, 54, 11, 61	rnmptssdf 44689	. . . . 5 ⊢ (𝜑 → ran (𝑥 ∈ 𝐴 ↦ -𝐵) ⊆ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)})
63	48, 62	eqssd 3991	. . . 4 ⊢ (𝜑 → {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)} = ran (𝑥 ∈ 𝐴 ↦ -𝐵))
64	63	infeq1d 9495	. . 3 ⊢ (𝜑 → inf({𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}, ℝ, < ) = inf(ran (𝑥 ∈ 𝐴 ↦ -𝐵), ℝ, < ))
65	64	negeqd 11479	. 2 ⊢ (𝜑 → -inf({𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}, ℝ, < ) = -inf(ran (𝑥 ∈ 𝐴 ↦ -𝐵), ℝ, < ))
66	10, 65	eqtrd 2765	1 ⊢ (𝜑 → sup(ran (𝑥 ∈ 𝐴 ↦ 𝐵), ℝ, < ) = -inf(ran (𝑥 ∈ 𝐴 ↦ -𝐵), ℝ, < ))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   = wceq 1533  Ⅎwnf 1777   ∈ wcel 2098   ≠ wne 2930  ∀wral 3051  ∃wrex 3060  {crab 3419   ⊆ wss 3941  ∅c0 4319   class class class wbr 5144   ↦ cmpt 5227  ran crn 5674  supcsup 9458  infcinf 9459  ℝcr 11132   < clt 11273   ≤ cle 11274  -cneg 11470

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-sep 5295  ax-nul 5302  ax-pow 5360  ax-pr 5424  ax-un 7735  ax-resscn 11190  ax-1cn 11191  ax-icn 11192  ax-addcl 11193  ax-addrcl 11194  ax-mulcl 11195  ax-mulrcl 11196  ax-mulcom 11197  ax-addass 11198  ax-mulass 11199  ax-distr 11200  ax-i2m1 11201  ax-1ne0 11202  ax-1rid 11203  ax-rnegex 11204  ax-rrecex 11205  ax-cnre 11206  ax-pre-lttri 11207  ax-pre-lttrn 11208  ax-pre-ltadd 11209  ax-pre-mulgt0 11210  ax-pre-sup 11211

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2931  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3364  df-reu 3365  df-rab 3420  df-v 3465  df-sbc 3771  df-csb 3887  df-dif 3944  df-un 3946  df-in 3948  df-ss 3958  df-nul 4320  df-if 4526  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4905  df-br 5145  df-opab 5207  df-mpt 5228  df-id 5571  df-po 5585  df-so 5586  df-xp 5679  df-rel 5680  df-cnv 5681  df-co 5682  df-dm 5683  df-rn 5684  df-res 5685  df-ima 5686  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-isom 6552  df-riota 7369  df-ov 7416  df-oprab 7417  df-mpo 7418  df-er 8718  df-en 8958  df-dom 8959  df-sdom 8960  df-sup 9460  df-inf 9461  df-pnf 11275  df-mnf 11276  df-xr 11277  df-ltxr 11278  df-le 11279  df-sub 11471  df-neg 11472

This theorem is referenced by: (None)