Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  supminfxrrnmpt Structured version   Visualization version   GIF version

Theorem supminfxrrnmpt 40014
Description: The indexed supremum of a 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
supminfxrrnmpt.x 𝑥𝜑
supminfxrrnmpt.b ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ*)
Assertion
Ref Expression
supminfxrrnmpt (𝜑 → sup(ran (𝑥𝐴𝐵), ℝ*, < ) = -𝑒inf(ran (𝑥𝐴 ↦ -𝑒𝐵), ℝ*, < ))
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥)

Proof of Theorem supminfxrrnmpt
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 supminfxrrnmpt.x . . . 4 𝑥𝜑
2 eqid 2651 . . . 4 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
3 supminfxrrnmpt.b . . . 4 ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ*)
41, 2, 3rnmptssd 39699 . . 3 (𝜑 → ran (𝑥𝐴𝐵) ⊆ ℝ*)
54supminfxr2 40012 . 2 (𝜑 → sup(ran (𝑥𝐴𝐵), ℝ*, < ) = -𝑒inf({𝑦 ∈ ℝ* ∣ -𝑒𝑦 ∈ ran (𝑥𝐴𝐵)}, ℝ*, < ))
6 xnegex 12077 . . . . . . . . . . . 12 -𝑒𝑦 ∈ V
72elrnmpt 5404 . . . . . . . . . . . 12 (-𝑒𝑦 ∈ V → (-𝑒𝑦 ∈ ran (𝑥𝐴𝐵) ↔ ∃𝑥𝐴 -𝑒𝑦 = 𝐵))
86, 7ax-mp 5 . . . . . . . . . . 11 (-𝑒𝑦 ∈ ran (𝑥𝐴𝐵) ↔ ∃𝑥𝐴 -𝑒𝑦 = 𝐵)
98biimpi 206 . . . . . . . . . 10 (-𝑒𝑦 ∈ ran (𝑥𝐴𝐵) → ∃𝑥𝐴 -𝑒𝑦 = 𝐵)
10 eqid 2651 . . . . . . . . . . 11 (𝑥𝐴 ↦ -𝑒𝐵) = (𝑥𝐴 ↦ -𝑒𝐵)
11 xnegneg 12083 . . . . . . . . . . . . . . . . 17 (𝑦 ∈ ℝ* → -𝑒-𝑒𝑦 = 𝑦)
1211eqcomd 2657 . . . . . . . . . . . . . . . 16 (𝑦 ∈ ℝ*𝑦 = -𝑒-𝑒𝑦)
1312adantr 480 . . . . . . . . . . . . . . 15 ((𝑦 ∈ ℝ* ∧ -𝑒𝑦 = 𝐵) → 𝑦 = -𝑒-𝑒𝑦)
14 xnegeq 12076 . . . . . . . . . . . . . . . 16 (-𝑒𝑦 = 𝐵 → -𝑒-𝑒𝑦 = -𝑒𝐵)
1514adantl 481 . . . . . . . . . . . . . . 15 ((𝑦 ∈ ℝ* ∧ -𝑒𝑦 = 𝐵) → -𝑒-𝑒𝑦 = -𝑒𝐵)
1613, 15eqtrd 2685 . . . . . . . . . . . . . 14 ((𝑦 ∈ ℝ* ∧ -𝑒𝑦 = 𝐵) → 𝑦 = -𝑒𝐵)
1716ex 449 . . . . . . . . . . . . 13 (𝑦 ∈ ℝ* → (-𝑒𝑦 = 𝐵𝑦 = -𝑒𝐵))
1817reximdv 3045 . . . . . . . . . . . 12 (𝑦 ∈ ℝ* → (∃𝑥𝐴 -𝑒𝑦 = 𝐵 → ∃𝑥𝐴 𝑦 = -𝑒𝐵))
1918imp 444 . . . . . . . . . . 11 ((𝑦 ∈ ℝ* ∧ ∃𝑥𝐴 -𝑒𝑦 = 𝐵) → ∃𝑥𝐴 𝑦 = -𝑒𝐵)
20 simpl 472 . . . . . . . . . . 11 ((𝑦 ∈ ℝ* ∧ ∃𝑥𝐴 -𝑒𝑦 = 𝐵) → 𝑦 ∈ ℝ*)
2110, 19, 20elrnmptd 39680 . . . . . . . . . 10 ((𝑦 ∈ ℝ* ∧ ∃𝑥𝐴 -𝑒𝑦 = 𝐵) → 𝑦 ∈ ran (𝑥𝐴 ↦ -𝑒𝐵))
229, 21sylan2 490 . . . . . . . . 9 ((𝑦 ∈ ℝ* ∧ -𝑒𝑦 ∈ ran (𝑥𝐴𝐵)) → 𝑦 ∈ ran (𝑥𝐴 ↦ -𝑒𝐵))
2322ex 449 . . . . . . . 8 (𝑦 ∈ ℝ* → (-𝑒𝑦 ∈ ran (𝑥𝐴𝐵) → 𝑦 ∈ ran (𝑥𝐴 ↦ -𝑒𝐵)))
2423rgen 2951 . . . . . . 7 𝑦 ∈ ℝ* (-𝑒𝑦 ∈ ran (𝑥𝐴𝐵) → 𝑦 ∈ ran (𝑥𝐴 ↦ -𝑒𝐵))
25 rabss 3712 . . . . . . . 8 ({𝑦 ∈ ℝ* ∣ -𝑒𝑦 ∈ ran (𝑥𝐴𝐵)} ⊆ ran (𝑥𝐴 ↦ -𝑒𝐵) ↔ ∀𝑦 ∈ ℝ* (-𝑒𝑦 ∈ ran (𝑥𝐴𝐵) → 𝑦 ∈ ran (𝑥𝐴 ↦ -𝑒𝐵)))
2625biimpri 218 . . . . . . 7 (∀𝑦 ∈ ℝ* (-𝑒𝑦 ∈ ran (𝑥𝐴𝐵) → 𝑦 ∈ ran (𝑥𝐴 ↦ -𝑒𝐵)) → {𝑦 ∈ ℝ* ∣ -𝑒𝑦 ∈ ran (𝑥𝐴𝐵)} ⊆ ran (𝑥𝐴 ↦ -𝑒𝐵))
2724, 26ax-mp 5 . . . . . 6 {𝑦 ∈ ℝ* ∣ -𝑒𝑦 ∈ ran (𝑥𝐴𝐵)} ⊆ ran (𝑥𝐴 ↦ -𝑒𝐵)
2827a1i 11 . . . . 5 (𝜑 → {𝑦 ∈ ℝ* ∣ -𝑒𝑦 ∈ ran (𝑥𝐴𝐵)} ⊆ ran (𝑥𝐴 ↦ -𝑒𝐵))
29 nfcv 2793 . . . . . . . 8 𝑥-𝑒𝑦
30 nfmpt1 4780 . . . . . . . . 9 𝑥(𝑥𝐴𝐵)
3130nfrn 5400 . . . . . . . 8 𝑥ran (𝑥𝐴𝐵)
3229, 31nfel 2806 . . . . . . 7 𝑥-𝑒𝑦 ∈ ran (𝑥𝐴𝐵)
33 nfcv 2793 . . . . . . 7 𝑥*
3432, 33nfrab 3153 . . . . . 6 𝑥{𝑦 ∈ ℝ* ∣ -𝑒𝑦 ∈ ran (𝑥𝐴𝐵)}
35 xnegeq 12076 . . . . . . . 8 (𝑦 = -𝑒𝐵 → -𝑒𝑦 = -𝑒-𝑒𝐵)
3635eleq1d 2715 . . . . . . 7 (𝑦 = -𝑒𝐵 → (-𝑒𝑦 ∈ ran (𝑥𝐴𝐵) ↔ -𝑒-𝑒𝐵 ∈ ran (𝑥𝐴𝐵)))
373xnegcld 12168 . . . . . . 7 ((𝜑𝑥𝐴) → -𝑒𝐵 ∈ ℝ*)
38 xnegneg 12083 . . . . . . . . 9 (𝐵 ∈ ℝ* → -𝑒-𝑒𝐵 = 𝐵)
393, 38syl 17 . . . . . . . 8 ((𝜑𝑥𝐴) → -𝑒-𝑒𝐵 = 𝐵)
40 simpr 476 . . . . . . . . 9 ((𝜑𝑥𝐴) → 𝑥𝐴)
412, 40, 3elrnmpt1d 39749 . . . . . . . 8 ((𝜑𝑥𝐴) → 𝐵 ∈ ran (𝑥𝐴𝐵))
4239, 41eqeltrd 2730 . . . . . . 7 ((𝜑𝑥𝐴) → -𝑒-𝑒𝐵 ∈ ran (𝑥𝐴𝐵))
4336, 37, 42elrabd 3398 . . . . . 6 ((𝜑𝑥𝐴) → -𝑒𝐵 ∈ {𝑦 ∈ ℝ* ∣ -𝑒𝑦 ∈ ran (𝑥𝐴𝐵)})
441, 34, 10, 43rnmptssdf 39783 . . . . 5 (𝜑 → ran (𝑥𝐴 ↦ -𝑒𝐵) ⊆ {𝑦 ∈ ℝ* ∣ -𝑒𝑦 ∈ ran (𝑥𝐴𝐵)})
4528, 44eqssd 3653 . . . 4 (𝜑 → {𝑦 ∈ ℝ* ∣ -𝑒𝑦 ∈ ran (𝑥𝐴𝐵)} = ran (𝑥𝐴 ↦ -𝑒𝐵))
4645infeq1d 8424 . . 3 (𝜑 → inf({𝑦 ∈ ℝ* ∣ -𝑒𝑦 ∈ ran (𝑥𝐴𝐵)}, ℝ*, < ) = inf(ran (𝑥𝐴 ↦ -𝑒𝐵), ℝ*, < ))
4746xnegeqd 39977 . 2 (𝜑 → -𝑒inf({𝑦 ∈ ℝ* ∣ -𝑒𝑦 ∈ ran (𝑥𝐴𝐵)}, ℝ*, < ) = -𝑒inf(ran (𝑥𝐴 ↦ -𝑒𝐵), ℝ*, < ))
485, 47eqtrd 2685 1 (𝜑 → sup(ran (𝑥𝐴𝐵), ℝ*, < ) = -𝑒inf(ran (𝑥𝐴 ↦ -𝑒𝐵), ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383   = wceq 1523  wnf 1748  wcel 2030  wral 2941  wrex 2942  {crab 2945  Vcvv 3231  wss 3607  cmpt 4762  ran crn 5144  supcsup 8387  infcinf 8388  *cxr 10111   < clt 10112  -𝑒cxne 11981
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991  ax-cnex 10030  ax-resscn 10031  ax-1cn 10032  ax-icn 10033  ax-addcl 10034  ax-addrcl 10035  ax-mulcl 10036  ax-mulrcl 10037  ax-mulcom 10038  ax-addass 10039  ax-mulass 10040  ax-distr 10041  ax-i2m1 10042  ax-1ne0 10043  ax-1rid 10044  ax-rnegex 10045  ax-rrecex 10046  ax-cnre 10047  ax-pre-lttri 10048  ax-pre-lttrn 10049  ax-pre-ltadd 10050  ax-pre-mulgt0 10051  ax-pre-sup 10052
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-reu 2948  df-rmo 2949  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-mpt 4763  df-id 5053  df-po 5064  df-so 5065  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-isom 5935  df-riota 6651  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-er 7787  df-en 7998  df-dom 7999  df-sdom 8000  df-sup 8389  df-inf 8390  df-pnf 10114  df-mnf 10115  df-xr 10116  df-ltxr 10117  df-le 10118  df-sub 10306  df-neg 10307  df-xneg 11984
This theorem is referenced by:  liminfvalxr  40333
  Copyright terms: Public domain W3C validator