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

Theorem lebnumlem1 23137
Description: Lemma for lebnum 23140. 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 474 . . . 4 ((𝜑𝑦𝑋) → 𝑈 ∈ Fin)
3 lebnum.d . . . . . . . 8 (𝜑𝐷 ∈ (Met‘𝑋))
43ad2antrr 717 . . . . . . 7 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 𝐷 ∈ (Met‘𝑋))
5 difssd 3967 . . . . . . 7 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → (𝑋𝑘) ⊆ 𝑋)
6 lebnum.s . . . . . . . . . . . 12 (𝜑𝑈𝐽)
76adantr 474 . . . . . . . . . . 11 ((𝜑𝑦𝑋) → 𝑈𝐽)
87sselda 3827 . . . . . . . . . 10 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 𝑘𝐽)
9 elssuni 4691 . . . . . . . . . 10 (𝑘𝐽𝑘 𝐽)
108, 9syl 17 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 𝑘 𝐽)
11 metxmet 22516 . . . . . . . . . . . 12 (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋))
123, 11syl 17 . . . . . . . . . . 11 (𝜑𝐷 ∈ (∞Met‘𝑋))
13 lebnum.j . . . . . . . . . . . 12 𝐽 = (MetOpen‘𝐷)
1413mopnuni 22623 . . . . . . . . . . 11 (𝐷 ∈ (∞Met‘𝑋) → 𝑋 = 𝐽)
1512, 14syl 17 . . . . . . . . . 10 (𝜑𝑋 = 𝐽)
1615ad2antrr 717 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 𝑋 = 𝐽)
1710, 16sseqtr4d 3867 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 𝑘𝑋)
18 lebnumlem1.n . . . . . . . . . . . 12 (𝜑 → ¬ 𝑋𝑈)
19 eleq1 2894 . . . . . . . . . . . . 13 (𝑘 = 𝑋 → (𝑘𝑈𝑋𝑈))
2019notbid 310 . . . . . . . . . . . 12 (𝑘 = 𝑋 → (¬ 𝑘𝑈 ↔ ¬ 𝑋𝑈))
2118, 20syl5ibrcom 239 . . . . . . . . . . 11 (𝜑 → (𝑘 = 𝑋 → ¬ 𝑘𝑈))
2221necon2ad 3014 . . . . . . . . . 10 (𝜑 → (𝑘𝑈𝑘𝑋))
2322adantr 474 . . . . . . . . 9 ((𝜑𝑦𝑋) → (𝑘𝑈𝑘𝑋))
2423imp 397 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 𝑘𝑋)
25 pssdifn0 4175 . . . . . . . 8 ((𝑘𝑋𝑘𝑋) → (𝑋𝑘) ≠ ∅)
2617, 24, 25syl2anc 579 . . . . . . 7 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → (𝑋𝑘) ≠ ∅)
27 eqid 2825 . . . . . . . 8 (𝑦𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )) = (𝑦𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
2827metdsre 23033 . . . . . . 7 ((𝐷 ∈ (Met‘𝑋) ∧ (𝑋𝑘) ⊆ 𝑋 ∧ (𝑋𝑘) ≠ ∅) → (𝑦𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )):𝑋⟶ℝ)
294, 5, 26, 28syl3anc 1494 . . . . . 6 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → (𝑦𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )):𝑋⟶ℝ)
3027fmpt 6634 . . . . . 6 (∀𝑦𝑋 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ ↔ (𝑦𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )):𝑋⟶ℝ)
3129, 30sylibr 226 . . . . 5 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → ∀𝑦𝑋 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ)
32 simplr 785 . . . . 5 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 𝑦𝑋)
33 rsp 3138 . . . . 5 (∀𝑦𝑋 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ → (𝑦𝑋 → inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ))
3431, 32, 33sylc 65 . . . 4 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ)
352, 34fsumrecl 14849 . . 3 ((𝜑𝑦𝑋) → Σ𝑘𝑈 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ)
36 lebnum.u . . . . . . 7 (𝜑𝑋 = 𝑈)
3736eleq2d 2892 . . . . . 6 (𝜑 → (𝑦𝑋𝑦 𝑈))
3837biimpa 470 . . . . 5 ((𝜑𝑦𝑋) → 𝑦 𝑈)
39 eluni2 4664 . . . . 5 (𝑦 𝑈 ↔ ∃𝑚𝑈 𝑦𝑚)
4038, 39sylib 210 . . . 4 ((𝜑𝑦𝑋) → ∃𝑚𝑈 𝑦𝑚)
41 0red 10367 . . . . 5 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 0 ∈ ℝ)
42 simplr 785 . . . . . . 7 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑦𝑋)
43 eqid 2825 . . . . . . . 8 (𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < )) = (𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))
4443metdsval 23027 . . . . . . 7 (𝑦𝑋 → ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) = inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
4542, 44syl 17 . . . . . 6 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) = inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
463ad2antrr 717 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝐷 ∈ (Met‘𝑋))
47 difssd 3967 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (𝑋𝑚) ⊆ 𝑋)
486ad2antrr 717 . . . . . . . . . . . 12 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑈𝐽)
49 simprl 787 . . . . . . . . . . . 12 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑚𝑈)
5048, 49sseldd 3828 . . . . . . . . . . 11 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑚𝐽)
51 elssuni 4691 . . . . . . . . . . 11 (𝑚𝐽𝑚 𝐽)
5250, 51syl 17 . . . . . . . . . 10 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑚 𝐽)
5346, 11, 143syl 18 . . . . . . . . . 10 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑋 = 𝐽)
5452, 53sseqtr4d 3867 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑚𝑋)
55 eleq1 2894 . . . . . . . . . . . . . 14 (𝑚 = 𝑋 → (𝑚𝑈𝑋𝑈))
5655notbid 310 . . . . . . . . . . . . 13 (𝑚 = 𝑋 → (¬ 𝑚𝑈 ↔ ¬ 𝑋𝑈))
5718, 56syl5ibrcom 239 . . . . . . . . . . . 12 (𝜑 → (𝑚 = 𝑋 → ¬ 𝑚𝑈))
5857necon2ad 3014 . . . . . . . . . . 11 (𝜑 → (𝑚𝑈𝑚𝑋))
5958ad2antrr 717 . . . . . . . . . 10 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (𝑚𝑈𝑚𝑋))
6049, 59mpd 15 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑚𝑋)
61 pssdifn0 4175 . . . . . . . . 9 ((𝑚𝑋𝑚𝑋) → (𝑋𝑚) ≠ ∅)
6254, 60, 61syl2anc 579 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (𝑋𝑚) ≠ ∅)
6343metdsre 23033 . . . . . . . 8 ((𝐷 ∈ (Met‘𝑋) ∧ (𝑋𝑚) ⊆ 𝑋 ∧ (𝑋𝑚) ≠ ∅) → (𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < )):𝑋⟶ℝ)
6446, 47, 62, 63syl3anc 1494 . . . . . . 7 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < )):𝑋⟶ℝ)
6564, 42ffvelrnd 6614 . . . . . 6 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) ∈ ℝ)
6645, 65eqeltrrd 2907 . . . . 5 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ)
6735adantr 474 . . . . 5 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → Σ𝑘𝑈 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ)
6812ad2antrr 717 . . . . . . . . . . 11 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝐷 ∈ (∞Met‘𝑋))
6943metdsf 23028 . . . . . . . . . . 11 ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑋𝑚) ⊆ 𝑋) → (𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < )):𝑋⟶(0[,]+∞))
7068, 47, 69syl2anc 579 . . . . . . . . . 10 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < )):𝑋⟶(0[,]+∞))
7170, 42ffvelrnd 6614 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) ∈ (0[,]+∞))
72 elxrge0 12578 . . . . . . . . 9 (((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) ∈ (0[,]+∞) ↔ (((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) ∈ ℝ* ∧ 0 ≤ ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦)))
7371, 72sylib 210 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) ∈ ℝ* ∧ 0 ≤ ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦)))
7473simprd 491 . . . . . . 7 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 0 ≤ ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦))
75 elndif 3963 . . . . . . . . . 10 (𝑦𝑚 → ¬ 𝑦 ∈ (𝑋𝑚))
7675ad2antll 720 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → ¬ 𝑦 ∈ (𝑋𝑚))
7753difeq1d 3956 . . . . . . . . . . 11 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (𝑋𝑚) = ( 𝐽𝑚))
7813mopntop 22622 . . . . . . . . . . . . 13 (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ Top)
7968, 78syl 17 . . . . . . . . . . . 12 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝐽 ∈ Top)
80 eqid 2825 . . . . . . . . . . . . 13 𝐽 = 𝐽
8180opncld 21215 . . . . . . . . . . . 12 ((𝐽 ∈ Top ∧ 𝑚𝐽) → ( 𝐽𝑚) ∈ (Clsd‘𝐽))
8279, 50, 81syl2anc 579 . . . . . . . . . . 11 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → ( 𝐽𝑚) ∈ (Clsd‘𝐽))
8377, 82eqeltrd 2906 . . . . . . . . . 10 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (𝑋𝑚) ∈ (Clsd‘𝐽))
84 cldcls 21224 . . . . . . . . . 10 ((𝑋𝑚) ∈ (Clsd‘𝐽) → ((cls‘𝐽)‘(𝑋𝑚)) = (𝑋𝑚))
8583, 84syl 17 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → ((cls‘𝐽)‘(𝑋𝑚)) = (𝑋𝑚))
8676, 85neleqtrrd 2928 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → ¬ 𝑦 ∈ ((cls‘𝐽)‘(𝑋𝑚)))
8743, 13metdseq0 23034 . . . . . . . . . 10 ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑋𝑚) ⊆ 𝑋𝑦𝑋) → (((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) = 0 ↔ 𝑦 ∈ ((cls‘𝐽)‘(𝑋𝑚))))
8868, 47, 42, 87syl3anc 1494 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) = 0 ↔ 𝑦 ∈ ((cls‘𝐽)‘(𝑋𝑚))))
8988necon3abid 3035 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → (((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) ≠ 0 ↔ ¬ 𝑦 ∈ ((cls‘𝐽)‘(𝑋𝑚))))
9086, 89mpbird 249 . . . . . . 7 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦) ≠ 0)
9165, 74, 90ne0gt0d 10500 . . . . . 6 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 0 < ((𝑤𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑤𝐷𝑧)), ℝ*, < ))‘𝑦))
9291, 45breqtrd 4901 . . . . 5 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 0 < inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
931ad2antrr 717 . . . . . 6 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 𝑈 ∈ Fin)
9434adantlr 706 . . . . . 6 ((((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) ∧ 𝑘𝑈) → inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ)
9512ad2antrr 717 . . . . . . . . . . . 12 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 𝐷 ∈ (∞Met‘𝑋))
9627metdsf 23028 . . . . . . . . . . . 12 ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑋𝑘) ⊆ 𝑋) → (𝑦𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )):𝑋⟶(0[,]+∞))
9795, 5, 96syl2anc 579 . . . . . . . . . . 11 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → (𝑦𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )):𝑋⟶(0[,]+∞))
9827fmpt 6634 . . . . . . . . . . 11 (∀𝑦𝑋 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ (0[,]+∞) ↔ (𝑦𝑋 ↦ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )):𝑋⟶(0[,]+∞))
9997, 98sylibr 226 . . . . . . . . . 10 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → ∀𝑦𝑋 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ (0[,]+∞))
100 rsp 3138 . . . . . . . . . 10 (∀𝑦𝑋 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ (0[,]+∞) → (𝑦𝑋 → inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ (0[,]+∞)))
10199, 32, 100sylc 65 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ (0[,]+∞))
102 elxrge0 12578 . . . . . . . . 9 (inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ (0[,]+∞) ↔ (inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ* ∧ 0 ≤ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )))
103101, 102sylib 210 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → (inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ* ∧ 0 ≤ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < )))
104103simprd 491 . . . . . . 7 (((𝜑𝑦𝑋) ∧ 𝑘𝑈) → 0 ≤ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
105104adantlr 706 . . . . . 6 ((((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) ∧ 𝑘𝑈) → 0 ≤ inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
106 difeq2 3951 . . . . . . . . 9 (𝑘 = 𝑚 → (𝑋𝑘) = (𝑋𝑚))
107106mpteq1d 4963 . . . . . . . 8 (𝑘 = 𝑚 → (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)) = (𝑧 ∈ (𝑋𝑚) ↦ (𝑦𝐷𝑧)))
108107rneqd 5589 . . . . . . 7 (𝑘 = 𝑚 → ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)) = ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑦𝐷𝑧)))
109108infeq1d 8658 . . . . . 6 (𝑘 = 𝑚 → inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) = inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
11093, 94, 105, 109, 49fsumge1 14910 . . . . 5 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → inf(ran (𝑧 ∈ (𝑋𝑚) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ≤ Σ𝑘𝑈 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
11141, 66, 67, 92, 110ltletrd 10523 . . . 4 (((𝜑𝑦𝑋) ∧ (𝑚𝑈𝑦𝑚)) → 0 < Σ𝑘𝑈 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
11240, 111rexlimddv 3245 . . 3 ((𝜑𝑦𝑋) → 0 < Σ𝑘𝑈 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
11335, 112elrpd 12160 . 2 ((𝜑𝑦𝑋) → Σ𝑘𝑈 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ) ∈ ℝ+)
114 lebnumlem1.f . 2 𝐹 = (𝑦𝑋 ↦ Σ𝑘𝑈 inf(ran (𝑧 ∈ (𝑋𝑘) ↦ (𝑦𝐷𝑧)), ℝ*, < ))
115113, 114fmptd 6638 1 (𝜑𝐹:𝑋⟶ℝ+)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 198  wa 386   = wceq 1656  wcel 2164  wne 2999  wral 3117  wrex 3118  cdif 3795  wss 3798  c0 4146   cuni 4660   class class class wbr 4875  cmpt 4954  ran crn 5347  wf 6123  cfv 6127  (class class class)co 6910  Fincfn 8228  infcinf 8622  cr 10258  0cc0 10259  +∞cpnf 10395  *cxr 10397   < clt 10398  cle 10399  +crp 12119  [,]cicc 12473  Σcsu 14800  ∞Metcxmet 20098  Metcmet 20099  MetOpencmopn 20103  Topctop 21075  Clsdccld 21198  clsccl 21200  Compccmp 21567
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1894  ax-4 1908  ax-5 2009  ax-6 2075  ax-7 2112  ax-8 2166  ax-9 2173  ax-10 2192  ax-11 2207  ax-12 2220  ax-13 2389  ax-ext 2803  ax-rep 4996  ax-sep 5007  ax-nul 5015  ax-pow 5067  ax-pr 5129  ax-un 7214  ax-inf2 8822  ax-cnex 10315  ax-resscn 10316  ax-1cn 10317  ax-icn 10318  ax-addcl 10319  ax-addrcl 10320  ax-mulcl 10321  ax-mulrcl 10322  ax-mulcom 10323  ax-addass 10324  ax-mulass 10325  ax-distr 10326  ax-i2m1 10327  ax-1ne0 10328  ax-1rid 10329  ax-rnegex 10330  ax-rrecex 10331  ax-cnre 10332  ax-pre-lttri 10333  ax-pre-lttrn 10334  ax-pre-ltadd 10335  ax-pre-mulgt0 10336  ax-pre-sup 10337
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 879  df-3or 1112  df-3an 1113  df-tru 1660  df-fal 1670  df-ex 1879  df-nf 1883  df-sb 2068  df-mo 2605  df-eu 2640  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ne 3000  df-nel 3103  df-ral 3122  df-rex 3123  df-reu 3124  df-rmo 3125  df-rab 3126  df-v 3416  df-sbc 3663  df-csb 3758  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-pss 3814  df-nul 4147  df-if 4309  df-pw 4382  df-sn 4400  df-pr 4402  df-tp 4404  df-op 4406  df-uni 4661  df-int 4700  df-iun 4744  df-iin 4745  df-br 4876  df-opab 4938  df-mpt 4955  df-tr 4978  df-id 5252  df-eprel 5257  df-po 5265  df-so 5266  df-fr 5305  df-se 5306  df-we 5307  df-xp 5352  df-rel 5353  df-cnv 5354  df-co 5355  df-dm 5356  df-rn 5357  df-res 5358  df-ima 5359  df-pred 5924  df-ord 5970  df-on 5971  df-lim 5972  df-suc 5973  df-iota 6090  df-fun 6129  df-fn 6130  df-f 6131  df-f1 6132  df-fo 6133  df-f1o 6134  df-fv 6135  df-isom 6136  df-riota 6871  df-ov 6913  df-oprab 6914  df-mpt2 6915  df-om 7332  df-1st 7433  df-2nd 7434  df-wrecs 7677  df-recs 7739  df-rdg 7777  df-1o 7831  df-oadd 7835  df-er 8014  df-ec 8016  df-map 8129  df-en 8229  df-dom 8230  df-sdom 8231  df-fin 8232  df-sup 8623  df-inf 8624  df-oi 8691  df-card 9085  df-pnf 10400  df-mnf 10401  df-xr 10402  df-ltxr 10403  df-le 10404  df-sub 10594  df-neg 10595  df-div 11017  df-nn 11358  df-2 11421  df-3 11422  df-n0 11626  df-z 11712  df-uz 11976  df-q 12079  df-rp 12120  df-xneg 12239  df-xadd 12240  df-xmul 12241  df-ico 12476  df-icc 12477  df-fz 12627  df-fzo 12768  df-seq 13103  df-exp 13162  df-hash 13418  df-cj 14223  df-re 14224  df-im 14225  df-sqrt 14359  df-abs 14360  df-clim 14603  df-sum 14801  df-topgen 16464  df-psmet 20105  df-xmet 20106  df-met 20107  df-bl 20108  df-mopn 20109  df-top 21076  df-topon 21093  df-bases 21128  df-cld 21201  df-ntr 21202  df-cls 21203
This theorem is referenced by:  lebnumlem2  23138  lebnumlem3  23139
  Copyright terms: Public domain W3C validator