| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > decsmflem | Structured version Visualization version GIF version | ||
| Description: A nonincreasing function is Borel measurable. Proposition 121D (c) of [Fremlin1] p. 36 . (Contributed by Glauco Siliprandi, 26-Jun-2021.) |
| Ref | Expression |
|---|---|
| decsmflem.x | ⊢ Ⅎ𝑥𝜑 |
| decsmflem.y | ⊢ Ⅎ𝑦𝜑 |
| decsmflem.a | ⊢ (𝜑 → 𝐴 ⊆ ℝ) |
| decsmflem.f | ⊢ (𝜑 → 𝐹:𝐴⟶ℝ*) |
| decsmflem.i | ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))) |
| decsmflem.j | ⊢ 𝐽 = (topGen‘ran (,)) |
| decsmflem.b | ⊢ 𝐵 = (SalGen‘𝐽) |
| decsmflem.r | ⊢ (𝜑 → 𝑅 ∈ ℝ*) |
| decsmflem.l | ⊢ 𝑌 = {𝑥 ∈ 𝐴 ∣ 𝑅 < (𝐹‘𝑥)} |
| decsmflem.c | ⊢ 𝐶 = sup(𝑌, ℝ*, < ) |
| decsmflem.d | ⊢ 𝐷 = (-∞(,)𝐶) |
| decsmflem.e | ⊢ 𝐸 = (-∞(,]𝐶) |
| Ref | Expression |
|---|---|
| decsmflem | ⊢ (𝜑 → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | decsmflem.e | . . . 4 ⊢ 𝐸 = (-∞(,]𝐶) | |
| 2 | mnfxr 11265 | . . . . . 6 ⊢ -∞ ∈ ℝ* | |
| 3 | 2 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → -∞ ∈ ℝ*) |
| 4 | decsmflem.l | . . . . . . . . 9 ⊢ 𝑌 = {𝑥 ∈ 𝐴 ∣ 𝑅 < (𝐹‘𝑥)} | |
| 5 | ssrab2 4033 | . . . . . . . . 9 ⊢ {𝑥 ∈ 𝐴 ∣ 𝑅 < (𝐹‘𝑥)} ⊆ 𝐴 | |
| 6 | 4, 5 | eqsstri 3982 | . . . . . . . 8 ⊢ 𝑌 ⊆ 𝐴 |
| 7 | 6 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → 𝑌 ⊆ 𝐴) |
| 8 | decsmflem.a | . . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ ℝ) | |
| 9 | 7, 8 | sstrd 3946 | . . . . . 6 ⊢ (𝜑 → 𝑌 ⊆ ℝ) |
| 10 | 9 | sselda 3936 | . . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐶 ∈ ℝ) |
| 11 | decsmflem.j | . . . . 5 ⊢ 𝐽 = (topGen‘ran (,)) | |
| 12 | decsmflem.b | . . . . 5 ⊢ 𝐵 = (SalGen‘𝐽) | |
| 13 | 3, 10, 11, 12 | iocborel 47040 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → (-∞(,]𝐶) ∈ 𝐵) |
| 14 | 1, 13 | eqeltrid 2865 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐸 ∈ 𝐵) |
| 15 | decsmflem.x | . . . . 5 ⊢ Ⅎ𝑥𝜑 | |
| 16 | decsmflem.c | . . . . . . 7 ⊢ 𝐶 = sup(𝑌, ℝ*, < ) | |
| 17 | nfrab1 3434 | . . . . . . . . 9 ⊢ Ⅎ𝑥{𝑥 ∈ 𝐴 ∣ 𝑅 < (𝐹‘𝑥)} | |
| 18 | 4, 17 | nfcxfr 2921 | . . . . . . . 8 ⊢ Ⅎ𝑥𝑌 |
| 19 | nfcv 2923 | . . . . . . . 8 ⊢ Ⅎ𝑥ℝ* | |
| 20 | nfcv 2923 | . . . . . . . 8 ⊢ Ⅎ𝑥 < | |
| 21 | 18, 19, 20 | nfsup 9410 | . . . . . . 7 ⊢ Ⅎ𝑥sup(𝑌, ℝ*, < ) |
| 22 | 16, 21 | nfcxfr 2921 | . . . . . 6 ⊢ Ⅎ𝑥𝐶 |
| 23 | 22, 18 | nfel 2937 | . . . . 5 ⊢ Ⅎ𝑥 𝐶 ∈ 𝑌 |
| 24 | 15, 23 | nfan 1927 | . . . 4 ⊢ Ⅎ𝑥(𝜑 ∧ 𝐶 ∈ 𝑌) |
| 25 | 8 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐴 ⊆ ℝ) |
| 26 | decsmflem.f | . . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ*) | |
| 27 | 26 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐹:𝐴⟶ℝ*) |
| 28 | decsmflem.i | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))) | |
| 29 | 28 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))) |
| 30 | decsmflem.r | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ ℝ*) | |
| 31 | 30 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝑅 ∈ ℝ*) |
| 32 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐶 ∈ 𝑌) | |
| 33 | 24, 25, 27, 29, 31, 4, 16, 32, 1 | pimdecfgtioc 47399 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝑌 = (𝐸 ∩ 𝐴)) |
| 34 | ineq1 4165 | . . . 4 ⊢ (𝑏 = 𝐸 → (𝑏 ∩ 𝐴) = (𝐸 ∩ 𝐴)) | |
| 35 | 34 | rspceeqv 3603 | . . 3 ⊢ ((𝐸 ∈ 𝐵 ∧ 𝑌 = (𝐸 ∩ 𝐴)) → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴)) |
| 36 | 14, 33, 35 | syl2anc 595 | . 2 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴)) |
| 37 | decsmflem.d | . . . . . 6 ⊢ 𝐷 = (-∞(,)𝐶) | |
| 38 | 11, 12 | iooborel 47035 | . . . . . 6 ⊢ (-∞(,)𝐶) ∈ 𝐵 |
| 39 | 37, 38 | eqeltri 2857 | . . . . 5 ⊢ 𝐷 ∈ 𝐵 |
| 40 | 39 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝐵) |
| 41 | 40 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝐷 ∈ 𝐵) |
| 42 | 23 | nfn 1885 | . . . . 5 ⊢ Ⅎ𝑥 ¬ 𝐶 ∈ 𝑌 |
| 43 | 15, 42 | nfan 1927 | . . . 4 ⊢ Ⅎ𝑥(𝜑 ∧ ¬ 𝐶 ∈ 𝑌) |
| 44 | decsmflem.y | . . . . 5 ⊢ Ⅎ𝑦𝜑 | |
| 45 | nfv 1942 | . . . . 5 ⊢ Ⅎ𝑦 ¬ 𝐶 ∈ 𝑌 | |
| 46 | 44, 45 | nfan 1927 | . . . 4 ⊢ Ⅎ𝑦(𝜑 ∧ ¬ 𝐶 ∈ 𝑌) |
| 47 | 8 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝐴 ⊆ ℝ) |
| 48 | 26 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝐹:𝐴⟶ℝ*) |
| 49 | 28 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))) |
| 50 | 30 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝑅 ∈ ℝ*) |
| 51 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → ¬ 𝐶 ∈ 𝑌) | |
| 52 | 43, 46, 47, 48, 49, 50, 4, 16, 51, 37 | pimdecfgtioo 47401 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝑌 = (𝐷 ∩ 𝐴)) |
| 53 | ineq1 4165 | . . . 4 ⊢ (𝑏 = 𝐷 → (𝑏 ∩ 𝐴) = (𝐷 ∩ 𝐴)) | |
| 54 | 53 | rspceeqv 3603 | . . 3 ⊢ ((𝐷 ∈ 𝐵 ∧ 𝑌 = (𝐷 ∩ 𝐴)) → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴)) |
| 55 | 41, 52, 54 | syl2anc 595 | . 2 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴)) |
| 56 | 36, 55 | pm2.61dan 824 | 1 ⊢ (𝜑 → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1568 Ⅎwnf 1811 ∈ wcel 2141 ∀wral 3077 ∃wrex 3087 {crab 3414 ∩ cin 3903 ⊆ wss 3904 class class class wbr 5108 ran crn 5662 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 supcsup 9399 ℝcr 11098 -∞cmnf 11240 ℝ*cxr 11241 < clt 11242 ≤ cle 11243 (,)cioo 13371 (,]cioc 13372 topGenctg 17489 SalGencsalgen 46996 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-inf2 9609 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 ax-pre-sup 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-iin 4958 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-se 5615 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-er 8693 df-map 8825 df-en 8943 df-dom 8944 df-sdom 8945 df-sup 9401 df-inf 9402 df-card 9924 df-acn 9927 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-div 11871 df-nn 12233 df-n0 12504 df-z 12591 df-uz 12862 df-q 12972 df-rp 13016 df-ioo 13375 df-ioc 13376 df-fl 13825 df-topgen 17495 df-top 23030 df-bases 23082 df-salg 46993 df-salgen 46997 |
| This theorem is referenced by: decsmf 47451 |
| Copyright terms: Public domain | W3C validator |