MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  lebnumlem1 Structured version   Visualization version   GIF version

Theorem lebnumlem1 24324
Description: Lemma for lebnum 24327. The function 𝐹 measures the sum of all of the distances to escape the sets of the cover. Since by assumption it is a cover, there is at least one set which covers a given point, and since it is open, the point is a positive distance from the edge of the set. Thus, the sum is a strictly positive number. (Contributed by Mario Carneiro, 14-Feb-2015.) (Revised by AV, 30-Sep-2020.)
Hypotheses
Ref Expression
lebnum.j 𝐽 = (MetOpen‘𝐷)
lebnum.d (𝜑𝐷 ∈ (Met‘𝑋))
lebnum.c (𝜑𝐽 ∈ Comp)
lebnum.s (𝜑𝑈𝐽)
lebnum.u (𝜑𝑋 = 𝑈)
lebnumlem1.u (𝜑𝑈 ∈ Fin)
lebnumlem1.n (𝜑 → ¬ 𝑋𝑈)
lebnumlem1.f 𝐹 = (𝑦𝑋 ↦ Σ𝑘𝑈 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
Assertion
Ref Expression
lebnumlem1 (𝜑𝐹:𝑋⟶ℝ+)
Distinct variable groups:   𝑦,𝑘,𝑧,𝐷   𝑘,𝐽,𝑦,𝑧   𝑈,𝑘,𝑦,𝑧   𝜑,𝑘,𝑦,𝑧   𝑘,𝑋,𝑦,𝑧
Allowed substitution hints:   𝐹(𝑦,𝑧,𝑘)

Proof of Theorem lebnumlem1
Dummy variables 𝑚 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lebnumlem1.u . . . . 5 (𝜑𝑈 ∈ Fin)
21adantr 481 . . . 4 ((𝜑𝑦𝑋) → 𝑈 ∈ Fin)
3 lebnum.d . . . . . . . 8 (𝜑𝐷 ∈ (Met‘𝑋))
43ad2antrr 724 . . . . . . 7 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 𝐷 ∈ (Met‘𝑋))
5 difssd 4092 . . . . . . 7 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → (𝑋𝑘) ⊆ 𝑋)
6 lebnum.s . . . . . . . . . . . 12 (𝜑𝑈𝐽)
76adantr 481 . . . . . . . . . . 11 ((𝜑𝑦𝑋) → 𝑈𝐽)
87sselda 3944 . . . . . . . . . 10 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 𝑘𝐽)
9 elssuni 4898 . . . . . . . . . 10 (𝑘𝐽𝑘 𝐽)
108, 9syl 17 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 𝑘 𝐽)
11 metxmet 23687 . . . . . . . . . . . 12 (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋))
123, 11syl 17 . . . . . . . . . . 11 (𝜑𝐷 ∈ (∞Met‘𝑋))
13 lebnum.j . . . . . . . . . . . 12 𝐽 = (MetOpen‘𝐷)
1413mopnuni 23794 . . . . . . . . . . 11 (𝐷 ∈ (∞Met‘𝑋) → 𝑋 = 𝐽)
1512, 14syl 17 . . . . . . . . . 10 (𝜑𝑋 = 𝐽)
1615ad2antrr 724 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 𝑋 = 𝐽)
1710, 16sseqtrrd 3985 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 𝑘𝑋)
18 lebnumlem1.n . . . . . . . . . . . 12 (𝜑 → ¬ 𝑋𝑈)
19 eleq1 2825 . . . . . . . . . . . . 13 (𝑘 = 𝑋 → (𝑘𝑈𝑋𝑈))
2019notbid 317 . . . . . . . . . . . 12 (𝑘 = 𝑋 → (¬ 𝑘𝑈 ↔ ¬ 𝑋𝑈))
2118, 20syl5ibrcom 246 . . . . . . . . . . 11 (𝜑 → (𝑘 = 𝑋 → ¬ 𝑘𝑈))
2221necon2ad 2958 . . . . . . . . . 10 (𝜑 → (𝑘𝑈𝑘𝑋))
2322adantr 481 . . . . . . . . 9 ((𝜑𝑦𝑋) → (𝑘𝑈𝑘𝑋))
2423imp 407 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 𝑘𝑋)
25 pssdifn0 4325 . . . . . . . 8 ((𝑘𝑋𝑘𝑋) → (𝑋𝑘) ≠ ∅)
2617, 24, 25syl2anc 584 . . . . . . 7 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → (𝑋𝑘) ≠ ∅)
27 eqid 2736 . . . . . . . 8 (𝑦𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )) = (𝑦𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
2827metdsre 24216 . . . . . . 7 ((𝐷 ∈ (Met‘𝑋) ∧ (𝑋𝑘) ⊆ 𝑋 ∧ (𝑋𝑘) ≠ ∅) → (𝑦𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )):𝑋⟶ℝ)
294, 5, 26, 28syl3anc 1371 . . . . . 6 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → (𝑦𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )):𝑋⟶ℝ)
3027fmpt 7058 . . . . . 6 (∀𝑦𝑋 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ ↔ (𝑦𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )):𝑋⟶ℝ)
3129, 30sylibr 233 . . . . 5 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → ∀𝑦𝑋 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ)
32 simplr 767 . . . . 5 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 𝑦𝑋)
33 rsp 3230 . . . . 5 (∀𝑦𝑋 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ → (𝑦𝑋 → inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ))
3431, 32, 33sylc 65 . . . 4 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ)
352, 34fsumrecl 15619 . . 3 ((𝜑𝑦𝑋) → Σ𝑘𝑈 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ)
36 lebnum.u . . . . . . 7 (𝜑𝑋 = 𝑈)
3736eleq2d 2823 . . . . . 6 (𝜑 → (𝑦𝑋𝑦 𝑈))
3837biimpa 477 . . . . 5 ((𝜑𝑦𝑋) → 𝑦 𝑈)
39 eluni2 4869 . . . . 5 (𝑦 𝑈 ↔ ∃𝑚𝑈 𝑦𝑚)
4038, 39sylib 217 . . . 4 ((𝜑𝑦𝑋) → ∃𝑚𝑈 𝑦𝑚)
41 0red 11158 . . . . 5 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 0 ∈ ℝ)
42 simplr 767 . . . . . . 7 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑦𝑋)
43 eqid 2736 . . . . . . . 8 (𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < )) = (𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))
4443metdsval 24210 . . . . . . 7 (𝑦𝑋 → ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) = inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
4542, 44syl 17 . . . . . 6 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) = inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
463ad2antrr 724 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝐷 ∈ (Met‘𝑋))
47 difssd 4092 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (𝑋𝑚) ⊆ 𝑋)
486ad2antrr 724 . . . . . . . . . . . 12 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑈𝐽)
49 simprl 769 . . . . . . . . . . . 12 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑚𝑈)
5048, 49sseldd 3945 . . . . . . . . . . 11 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑚𝐽)
51 elssuni 4898 . . . . . . . . . . 11 (𝑚𝐽𝑚 𝐽)
5250, 51syl 17 . . . . . . . . . 10 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑚 𝐽)
5346, 11, 143syl 18 . . . . . . . . . 10 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑋 = 𝐽)
5452, 53sseqtrrd 3985 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑚𝑋)
55 eleq1 2825 . . . . . . . . . . . . . 14 (𝑚 = 𝑋 → (𝑚𝑈𝑋𝑈))
5655notbid 317 . . . . . . . . . . . . 13 (𝑚 = 𝑋 → (¬ 𝑚𝑈 ↔ ¬ 𝑋𝑈))
5718, 56syl5ibrcom 246 . . . . . . . . . . . 12 (𝜑 → (𝑚 = 𝑋 → ¬ 𝑚𝑈))
5857necon2ad 2958 . . . . . . . . . . 11 (𝜑 → (𝑚𝑈𝑚𝑋))
5958ad2antrr 724 . . . . . . . . . 10 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (𝑚𝑈𝑚𝑋))
6049, 59mpd 15 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑚𝑋)
61 pssdifn0 4325 . . . . . . . . 9 ((𝑚𝑋𝑚𝑋) → (𝑋𝑚) ≠ ∅)
6254, 60, 61syl2anc 584 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (𝑋𝑚) ≠ ∅)
6343metdsre 24216 . . . . . . . 8 ((𝐷 ∈ (Met‘𝑋) ∧ (𝑋𝑚) ⊆ 𝑋 ∧ (𝑋𝑚) ≠ ∅) → (𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < )):𝑋⟶ℝ)
6446, 47, 62, 63syl3anc 1371 . . . . . . 7 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < )):𝑋⟶ℝ)
6564, 42ffvelcdmd 7036 . . . . . 6 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) ∈ ℝ)
6645, 65eqeltrrd 2839 . . . . 5 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ)
6735adantr 481 . . . . 5 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → Σ𝑘𝑈 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ)
6812ad2antrr 724 . . . . . . . . . . 11 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝐷 ∈ (∞Met‘𝑋))
6943metdsf 24211 . . . . . . . . . . 11 ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑋𝑚) ⊆ 𝑋) → (𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < )):𝑋⟶(0[,]+∞))
7068, 47, 69syl2anc 584 . . . . . . . . . 10 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < )):𝑋⟶(0[,]+∞))
7170, 42ffvelcdmd 7036 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) ∈ (0[,]+∞))
72 elxrge0 13374 . . . . . . . . 9 (((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) ∈ (0[,]+∞) ↔ (((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) ∈ ℝ* ∧ 0 ≤ ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦)))
7371, 72sylib 217 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) ∈ ℝ* ∧ 0 ≤ ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦)))
7473simprd 496 . . . . . . 7 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 0 ≤ ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦))
75 elndif 4088 . . . . . . . . . 10 (𝑦𝑚 → ¬ 𝑦 ∈ (𝑋𝑚))
7675ad2antll 727 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → ¬ 𝑦 ∈ (𝑋𝑚))
7753difeq1d 4081 . . . . . . . . . . 11 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (𝑋𝑚) = ( 𝐽𝑚))
7813mopntop 23793 . . . . . . . . . . . . 13 (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ Top)
7968, 78syl 17 . . . . . . . . . . . 12 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝐽 ∈ Top)
80 eqid 2736 . . . . . . . . . . . . 13 𝐽 = 𝐽
8180opncld 22384 . . . . . . . . . . . 12 ((𝐽 ∈ Top ∧ 𝑚𝐽) → ( 𝐽𝑚) ∈ (Clsd‘𝐽))
8279, 50, 81syl2anc 584 . . . . . . . . . . 11 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → ( 𝐽𝑚) ∈ (Clsd‘𝐽))
8377, 82eqeltrd 2838 . . . . . . . . . 10 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (𝑋𝑚) ∈ (Clsd‘𝐽))
84 cldcls 22393 . . . . . . . . . 10 ((𝑋𝑚) ∈ (Clsd‘𝐽) → ((cls‘𝐽)‘(𝑋𝑚)) = (𝑋𝑚))
8583, 84syl 17 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → ((cls‘𝐽)‘(𝑋𝑚)) = (𝑋𝑚))
8676, 85neleqtrrd 2860 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → ¬ 𝑦 ∈ ((cls‘𝐽)‘(𝑋𝑚)))
8743, 13metdseq0 24217 . . . . . . . . . 10 ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑋𝑚) ⊆ 𝑋𝑦𝑋) → (((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) = 0 ↔ 𝑦 ∈ ((cls‘𝐽)‘(𝑋𝑚))))
8868, 47, 42, 87syl3anc 1371 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) = 0 ↔ 𝑦 ∈ ((cls‘𝐽)‘(𝑋𝑚))))
8988necon3abid 2980 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) ≠ 0 ↔ ¬ 𝑦 ∈ ((cls‘𝐽)‘(𝑋𝑚))))
9086, 89mpbird 256 . . . . . . 7 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) ≠ 0)
9165, 74, 90ne0gt0d 11292 . . . . . 6 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 0 < ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦))
9291, 45breqtrd 5131 . . . . 5 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 0 < inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
931ad2antrr 724 . . . . . 6 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑈 ∈ Fin)
9434adantlr 713 . . . . . 6 ((((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) ∧ 𝑘𝑈) → inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ)
9512ad2antrr 724 . . . . . . . . . . . 12 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 𝐷 ∈ (∞Met‘𝑋))
9627metdsf 24211 . . . . . . . . . . . 12 ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑋𝑘) ⊆ 𝑋) → (𝑦𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )):𝑋⟶(0[,]+∞))
9795, 5, 96syl2anc 584 . . . . . . . . . . 11 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → (𝑦𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )):𝑋⟶(0[,]+∞))
9827fmpt 7058 . . . . . . . . . . 11 (∀𝑦𝑋 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ (0[,]+∞) ↔ (𝑦𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )):𝑋⟶(0[,]+∞))
9997, 98sylibr 233 . . . . . . . . . 10 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → ∀𝑦𝑋 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ (0[,]+∞))
100 rsp 3230 . . . . . . . . . 10 (∀𝑦𝑋 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ (0[,]+∞) → (𝑦𝑋 → inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ (0[,]+∞)))
10199, 32, 100sylc 65 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ (0[,]+∞))
102 elxrge0 13374 . . . . . . . . 9 (inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ (0[,]+∞) ↔ (inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ* ∧ 0 ≤ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )))
103101, 102sylib 217 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → (inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ* ∧ 0 ≤ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )))
104103simprd 496 . . . . . . 7 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 0 ≤ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
105104adantlr 713 . . . . . 6 ((((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) ∧ 𝑘𝑈) → 0 ≤ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
106 difeq2 4076 . . . . . . . . 9 (𝑘 = 𝑚 → (𝑋𝑘) = (𝑋𝑚))
107106mpteq1d 5200 . . . . . . . 8 (𝑘 = 𝑚 → (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)) = (𝑧 ∈ (𝑋𝑚) ↦ (𝑦𝐷𝑧)))
108107rneqd 5893 . . . . . . 7 (𝑘 = 𝑚 → ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)) = ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑦𝐷𝑧)))
109108infeq1d 9413 . . . . . 6 (𝑘 = 𝑚 → inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) = inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
11093, 94, 105, 109, 49fsumge1 15682 . . . . 5 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ≤ Σ𝑘𝑈 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
11141, 66, 67, 92, 110ltletrd 11315 . . . 4 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 0 < Σ𝑘𝑈 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
11240, 111rexlimddv 3158 . . 3 ((𝜑𝑦𝑋) → 0 < Σ𝑘𝑈 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
11335, 112elrpd 12954 . 2 ((𝜑𝑦𝑋) → Σ𝑘𝑈 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ+)
114 lebnumlem1.f . 2 𝐹 = (𝑦𝑋 ↦ Σ𝑘𝑈 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
115113, 114fmptd 7062 1 (𝜑𝐹:𝑋⟶ℝ+)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396   = wceq 1541  wcel 2106  wne 2943  wral 3064  wrex 3073  cdif 3907  wss 3910  c0 4282   cuni 4865   class class class wbr 5105  cmpt 5188  ran crn 5634  wf 6492  cfv 6496  (class class class)co 7357  Fincfn 8883  infcinf 9377  cr 11050  0cc0 11051  +∞cpnf 11186  *cxr 11188   < clt 11189  cle 11190  +crp 12915  [,]cicc 13267  Σcsu 15570  ∞Metcxmet 20781  Metcmet 20782  MetOpencmopn 20786  Topctop 22242  Clsdccld 22367  clsccl 22369  Compccmp 22737
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-inf2 9577  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128  ax-pre-sup 11129
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-rmo 3353  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-int 4908  df-iun 4956  df-iin 4957  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-se 5589  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-isom 6505  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7803  df-1st 7921  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-1o 8412  df-er 8648  df-ec 8650  df-map 8767  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-sup 9378  df-inf 9379  df-oi 9446  df-card 9875  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-div 11813  df-nn 12154  df-2 12216  df-3 12217  df-n0 12414  df-z 12500  df-uz 12764  df-q 12874  df-rp 12916  df-xneg 13033  df-xadd 13034  df-xmul 13035  df-ico 13270  df-icc 13271  df-fz 13425  df-fzo 13568  df-seq 13907  df-exp 13968  df-hash 14231  df-cj 14984  df-re 14985  df-im 14986  df-sqrt 15120  df-abs 15121  df-clim 15370  df-sum 15571  df-topgen 17325  df-psmet 20788  df-xmet 20789  df-met 20790  df-bl 20791  df-mopn 20792  df-top 22243  df-topon 22260  df-bases 22296  df-cld 22370  df-ntr 22371  df-cls 22372
This theorem is referenced by:  lebnumlem2  24325  lebnumlem3  24326
  Copyright terms: Public domain W3C validator