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

Theorem infnsuprnmpt 46596
Description: The indexed infimum of real numbers is the negative of the indexed supremum of the negative values. (Contributed by Glauco Siliprandi, 23-Oct-2021.)
Hypotheses
Ref Expression
infnsuprnmpt.x Ⅎ𝑥𝜑
infnsuprnmpt.a (𝜑 → 𝐴 ≠ ∅)
infnsuprnmpt.b ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ)
infnsuprnmpt.l (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑦 ≤ 𝐵)
Assertion
Ref Expression
infnsuprnmpt (𝜑 → inf(ran (𝑥 ∈ 𝐴 ↦ 𝐵), ℝ, < ) = -sup(ran (𝑥 ∈ 𝐴 ↦ -𝐵), ℝ, < ))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑦,𝐵
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐵(𝑥)

Proof of Theorem infnsuprnmpt
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 infnsuprnmpt.x . . . 4 Ⅎ𝑥𝜑
2 eqid 2763 . . . 4 (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
3 infnsuprnmpt.b . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ)
41, 2, 3rnmptssd 7156 . . 3 (𝜑 → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ ℝ)
5 infnsuprnmpt.a . . . 4 (𝜑 → 𝐴 ≠ ∅)
61, 3, 2, 5rnmptn0 6264 . . 3 (𝜑 → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ≠ ∅)
7 infnsuprnmpt.l . . . 4 (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑦 ≤ 𝐵)
87rnmptlb 46589 . . 3 (𝜑 → ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ≤ 𝑧)
9 infrenegsup 12340 . . 3 ((ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ ℝ ∧ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ≤ 𝑧) → inf(ran (𝑥 ∈ 𝐴 ↦ 𝐵), ℝ, < ) = -sup({𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}, ℝ, < ))
104, 6, 8, 9syl3anc 1399 . 2 (𝜑 → inf(ran (𝑥 ∈ 𝐴 ↦ 𝐵), ℝ, < ) = -sup({𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}, ℝ, < ))
11 eqid 2763 . . . . . . . . 9 (𝑥 ∈ 𝐴 ↦ -𝐵) = (𝑥 ∈ 𝐴 ↦ -𝐵)
12 rabidim2 46451 . . . . . . . . . . . 12 (𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)} → -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
1312adantl 487 . . . . . . . . . . 11 ((𝜑 ∧ 𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}) → -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
14 negex 11594 . . . . . . . . . . . 12 -𝑤 ∈ V
152elrnmpt 5952 . . . . . . . . . . . 12 ( -𝑤 ∈ V → ( -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ↔ ∃𝑥 ∈ 𝐴 -𝑤 = 𝐵))
1614, 15ax-mp 5 . . . . . . . . . . 11 ( -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ↔ ∃𝑥 ∈ 𝐴 -𝑤 = 𝐵)
1713, 16sylib 221 . . . . . . . . . 10 ((𝜑 ∧ 𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}) → ∃𝑥 ∈ 𝐴 -𝑤 = 𝐵)
18 nfcv 2926 . . . . . . . . . . . . 13 Ⅎ𝑥𝑤
1918nfneg 11592 . . . . . . . . . . . . . . 15 Ⅎ𝑥 -𝑤
20 nfmpt1 5210 . . . . . . . . . . . . . . . 16 Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵)
2120nfrn 5946 . . . . . . . . . . . . . . 15 Ⅎ𝑥ran (𝑥 ∈ 𝐴 ↦ 𝐵)
2219, 21nfel 2940 . . . . . . . . . . . . . 14 Ⅎ𝑥 -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)
23 nfcv 2926 . . . . . . . . . . . . . 14 Ⅎ𝑥ℝ
2422, 23nfrabw 3451 . . . . . . . . . . . . 13 Ⅎ𝑥{𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}
2518, 24nfel 2940 . . . . . . . . . . . 12 Ⅎ𝑥 𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}
261, 25nfan 1934 . . . . . . . . . . 11 Ⅎ𝑥(𝜑 ∧ 𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)})
27 rabidim1 3437 . . . . . . . . . . . . 13 (𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)} → 𝑤 ∈ ℝ)
2827adantl 487 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}) → 𝑤 ∈ ℝ)
29 negeq 11588 . . . . . . . . . . . . . . . 16 ( -𝑤 = 𝐵 → - -𝑤 = -𝐵)
3029eqcomd 2769 . . . . . . . . . . . . . . 15 ( -𝑤 = 𝐵 → -𝐵 = - -𝑤)
31303ad2ant3 1153 . . . . . . . . . . . . . 14 (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ 𝑥 ∈ 𝐴 ∧ -𝑤 = 𝐵) → -𝐵 = - -𝑤)
32 simp1r 1217 . . . . . . . . . . . . . . 15 (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ 𝑥 ∈ 𝐴 ∧ -𝑤 = 𝐵) → 𝑤 ∈ ℝ)
33 recn 11329 . . . . . . . . . . . . . . . 16 (𝑤 ∈ ℝ → 𝑤 ∈ ℂ)
3433negnegd 11699 . . . . . . . . . . . . . . 15 (𝑤 ∈ ℝ → - -𝑤 = 𝑤)
3532, 34syl 18 . . . . . . . . . . . . . 14 (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ 𝑥 ∈ 𝐴 ∧ -𝑤 = 𝐵) → - -𝑤 = 𝑤)
3631, 35eqtr2d 2799 . . . . . . . . . . . . 13 (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ 𝑥 ∈ 𝐴 ∧ -𝑤 = 𝐵) → 𝑤 = -𝐵)
37363exp 1137 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑤 ∈ ℝ) → (𝑥 ∈ 𝐴 → ( -𝑤 = 𝐵 → 𝑤 = -𝐵)))
3828, 37syldan 603 . . . . . . . . . . 11 ((𝜑 ∧ 𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}) → (𝑥 ∈ 𝐴 → ( -𝑤 = 𝐵 → 𝑤 = -𝐵)))
3926, 38reximdai 3268 . . . . . . . . . 10 ((𝜑 ∧ 𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}) → (∃𝑥 ∈ 𝐴 -𝑤 = 𝐵 → ∃𝑥 ∈ 𝐴 𝑤 = -𝐵))
4017, 39mpd 16 . . . . . . . . 9 ((𝜑 ∧ 𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}) → ∃𝑥 ∈ 𝐴 𝑤 = -𝐵)
41 simpr 490 . . . . . . . . 9 ((𝜑 ∧ 𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}) → 𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)})
4211, 40, 41elrnmptd 5957 . . . . . . . 8 ((𝜑 ∧ 𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}) → 𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ -𝐵))
4342ex 418 . . . . . . 7 (𝜑 → (𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)} → 𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ -𝐵)))
44 vex 3458 . . . . . . . . . . . 12 𝑤 ∈ V
4511elrnmpt 5952 . . . . . . . . . . . 12 (𝑤 ∈ V → (𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ -𝐵) ↔ ∃𝑥 ∈ 𝐴 𝑤 = -𝐵))
4644, 45ax-mp 5 . . . . . . . . . . 11 (𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ -𝐵) ↔ ∃𝑥 ∈ 𝐴 𝑤 = -𝐵)
4746bilani 510 . . . . . . . . . 10 ((𝜑 ∧ 𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ -𝐵)) → ∃𝑥 ∈ 𝐴 𝑤 = -𝐵)
4818, 23nfel 2940 . . . . . . . . . . . . 13 Ⅎ𝑥 𝑤 ∈ ℝ
4948, 22nfan 1934 . . . . . . . . . . . 12 Ⅎ𝑥(𝑤 ∈ ℝ ∧ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
50 simp3 1156 . . . . . . . . . . . . . . 15 ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑤 = -𝐵) → 𝑤 = -𝐵)
513renegcld 11782 . . . . . . . . . . . . . . . 16 ((𝜑 ∧ 𝑥 ∈ 𝐴) → -𝐵 ∈ ℝ)
52513adant3 1150 . . . . . . . . . . . . . . 15 ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑤 = -𝐵) → -𝐵 ∈ ℝ)
5350, 52eqeltrd 2864 . . . . . . . . . . . . . 14 ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑤 = -𝐵) → 𝑤 ∈ ℝ)
54 simp2 1155 . . . . . . . . . . . . . . . 16 ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑤 = -𝐵) → 𝑥 ∈ 𝐴)
5550negeqd 11590 . . . . . . . . . . . . . . . . 17 ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑤 = -𝐵) → -𝑤 = - -𝐵)
563recnd 11376 . . . . . . . . . . . . . . . . . . 19 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
5756negnegd 11699 . . . . . . . . . . . . . . . . . 18 ((𝜑 ∧ 𝑥 ∈ 𝐴) → - -𝐵 = 𝐵)
58573adant3 1150 . . . . . . . . . . . . . . . . 17 ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑤 = -𝐵) → - -𝐵 = 𝐵)
5955, 58eqtrd 2798 . . . . . . . . . . . . . . . 16 ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑤 = -𝐵) → -𝑤 = 𝐵)
60 rspe 3256 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ 𝐴 ∧ -𝑤 = 𝐵) → ∃𝑥 ∈ 𝐴 -𝑤 = 𝐵)
6154, 59, 60syl2anc 596 . . . . . . . . . . . . . . 15 ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑤 = -𝐵) → ∃𝑥 ∈ 𝐴 -𝑤 = 𝐵)
6214a1i 11 . . . . . . . . . . . . . . 15 ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑤 = -𝐵) → -𝑤 ∈ V)
632, 61, 62elrnmptd 5957 . . . . . . . . . . . . . 14 ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑤 = -𝐵) → -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
6453, 63jca 521 . . . . . . . . . . . . 13 ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑤 = -𝐵) → (𝑤 ∈ ℝ ∧ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)))
65643exp 1137 . . . . . . . . . . . 12 (𝜑 → (𝑥 ∈ 𝐴 → (𝑤 = -𝐵 → (𝑤 ∈ ℝ ∧ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)))))
661, 49, 65rexlimd 3273 . . . . . . . . . . 11 (𝜑 → (∃𝑥 ∈ 𝐴 𝑤 = -𝐵 → (𝑤 ∈ ℝ ∧ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵))))
6766imp 412 . . . . . . . . . 10 ((𝜑 ∧ ∃𝑥 ∈ 𝐴 𝑤 = -𝐵) → (𝑤 ∈ ℝ ∧ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)))
6847, 67syldan 603 . . . . . . . . 9 ((𝜑 ∧ 𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ -𝐵)) → (𝑤 ∈ ℝ ∧ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)))
69 rabid 3436 . . . . . . . . 9 (𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)} ↔ (𝑤 ∈ ℝ ∧ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)))
7068, 69sylibr 237 . . . . . . . 8 ((𝜑 ∧ 𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ -𝐵)) → 𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)})
7170ex 418 . . . . . . 7 (𝜑 → (𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ -𝐵) → 𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}))
7243, 71impbid 215 . . . . . 6 (𝜑 → (𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)} ↔ 𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ -𝐵)))
7372alrimiv 1962 . . . . 5 (𝜑 → ∀𝑤(𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)} ↔ 𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ -𝐵)))
74 nfrab1 3435 . . . . . 6 Ⅎ𝑤{𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}
75 nfcv 2926 . . . . . 6 Ⅎ𝑤ran (𝑥 ∈ 𝐴 ↦ -𝐵)
7674, 75cleqf 2954 . . . . 5 ({𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)} = ran (𝑥 ∈ 𝐴 ↦ -𝐵) ↔ ∀𝑤(𝑤 ∈ {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)} ↔ 𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ -𝐵)))
7773, 76sylibr 237 . . . 4 (𝜑 → {𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)} = ran (𝑥 ∈ 𝐴 ↦ -𝐵))
7877supeq1d 9475 . . 3 (𝜑 → sup({𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}, ℝ, < ) = sup(ran (𝑥 ∈ 𝐴 ↦ -𝐵), ℝ, < ))
7978negeqd 11590 . 2 (𝜑 → -sup({𝑤 ∈ ℝ ∣ -𝑤 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)}, ℝ, < ) = -sup(ran (𝑥 ∈ 𝐴 ↦ -𝐵), ℝ, < ))
80 eqidd 2764 . 2 (𝜑 → -sup(ran (𝑥 ∈ 𝐴 ↦ -𝐵), ℝ, < ) = -sup(ran (𝑥 ∈ 𝐴 ↦ -𝐵), ℝ, < ))
8110, 79, 803eqtrd 2802 1 (𝜑 → inf(ran (𝑥 ∈ 𝐴 ↦ 𝐵), ℝ, < ) = -sup(ran (𝑥 ∈ 𝐴 ↦ -𝐵), ℝ, < ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  {crab 3416  Vcvv 3454   ⊆ wss 3900  ∅c0 4281   class class class wbr 5108   ↦ cmpt 5192  ran crn 5659  supcsup 9469  infcinf 9470  ℝcr 11238   < clt 11382   ≤ cle 11383   -cneg 11581
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316  ax-pre-sup 11317
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-po 5566  df-so 5567  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-isom 6575  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-sup 9471  df-inf 9472  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583
This theorem is used by:  smfinflem  48161
  Copyright terms: Public domain W3C validator