Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > incsmflem | Structured version Visualization version GIF version |
Description: A nondecreasing function is Borel measurable. Proposition 121D (c) of [Fremlin1] p. 36 . (Contributed by Glauco Siliprandi, 26-Jun-2021.) |
Ref | Expression |
---|---|
incsmflem.x | ⊢ Ⅎ𝑥𝜑 |
incsmflem.y | ⊢ Ⅎ𝑦𝜑 |
incsmflem.a | ⊢ (𝜑 → 𝐴 ⊆ ℝ) |
incsmflem.f | ⊢ (𝜑 → 𝐹:𝐴⟶ℝ*) |
incsmflem.i | ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦))) |
incsmflem.j | ⊢ 𝐽 = (topGen‘ran (,)) |
incsmflem.b | ⊢ 𝐵 = (SalGen‘𝐽) |
incsmflem.r | ⊢ (𝜑 → 𝑅 ∈ ℝ*) |
incsmflem.l | ⊢ 𝑌 = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝑅} |
incsmflem.c | ⊢ 𝐶 = sup(𝑌, ℝ*, < ) |
incsmflem.d | ⊢ 𝐷 = (-∞(,)𝐶) |
incsmflem.e | ⊢ 𝐸 = (-∞(,]𝐶) |
Ref | Expression |
---|---|
incsmflem | ⊢ (𝜑 → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | incsmflem.e | . . . 4 ⊢ 𝐸 = (-∞(,]𝐶) | |
2 | mnfxr 10855 | . . . . . 6 ⊢ -∞ ∈ ℝ* | |
3 | 2 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → -∞ ∈ ℝ*) |
4 | incsmflem.l | . . . . . . . . 9 ⊢ 𝑌 = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝑅} | |
5 | ssrab2 3979 | . . . . . . . . 9 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝑅} ⊆ 𝐴 | |
6 | 4, 5 | eqsstri 3921 | . . . . . . . 8 ⊢ 𝑌 ⊆ 𝐴 |
7 | 6 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → 𝑌 ⊆ 𝐴) |
8 | incsmflem.a | . . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ ℝ) | |
9 | 7, 8 | sstrd 3897 | . . . . . 6 ⊢ (𝜑 → 𝑌 ⊆ ℝ) |
10 | 9 | sselda 3887 | . . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐶 ∈ ℝ) |
11 | incsmflem.j | . . . . 5 ⊢ 𝐽 = (topGen‘ran (,)) | |
12 | incsmflem.b | . . . . 5 ⊢ 𝐵 = (SalGen‘𝐽) | |
13 | 3, 10, 11, 12 | iocborel 43513 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → (-∞(,]𝐶) ∈ 𝐵) |
14 | 1, 13 | eqeltrid 2835 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐸 ∈ 𝐵) |
15 | incsmflem.x | . . . . 5 ⊢ Ⅎ𝑥𝜑 | |
16 | nfcv 2897 | . . . . . 6 ⊢ Ⅎ𝑥𝐶 | |
17 | nfrab1 3286 | . . . . . . 7 ⊢ Ⅎ𝑥{𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝑅} | |
18 | 4, 17 | nfcxfr 2895 | . . . . . 6 ⊢ Ⅎ𝑥𝑌 |
19 | 16, 18 | nfel 2911 | . . . . 5 ⊢ Ⅎ𝑥 𝐶 ∈ 𝑌 |
20 | 15, 19 | nfan 1907 | . . . 4 ⊢ Ⅎ𝑥(𝜑 ∧ 𝐶 ∈ 𝑌) |
21 | incsmflem.y | . . . . 5 ⊢ Ⅎ𝑦𝜑 | |
22 | nfv 1922 | . . . . 5 ⊢ Ⅎ𝑦 𝐶 ∈ 𝑌 | |
23 | 21, 22 | nfan 1907 | . . . 4 ⊢ Ⅎ𝑦(𝜑 ∧ 𝐶 ∈ 𝑌) |
24 | 8 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐴 ⊆ ℝ) |
25 | incsmflem.f | . . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ*) | |
26 | 25 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐹:𝐴⟶ℝ*) |
27 | incsmflem.i | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦))) | |
28 | 27 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦))) |
29 | incsmflem.r | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ ℝ*) | |
30 | 29 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝑅 ∈ ℝ*) |
31 | incsmflem.c | . . . 4 ⊢ 𝐶 = sup(𝑌, ℝ*, < ) | |
32 | simpr 488 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐶 ∈ 𝑌) | |
33 | 20, 23, 24, 26, 28, 30, 4, 31, 32, 1 | pimincfltioc 43868 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝑌 = (𝐸 ∩ 𝐴)) |
34 | ineq1 4106 | . . . 4 ⊢ (𝑏 = 𝐸 → (𝑏 ∩ 𝐴) = (𝐸 ∩ 𝐴)) | |
35 | 34 | rspceeqv 3542 | . . 3 ⊢ ((𝐸 ∈ 𝐵 ∧ 𝑌 = (𝐸 ∩ 𝐴)) → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴)) |
36 | 14, 33, 35 | syl2anc 587 | . 2 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴)) |
37 | incsmflem.d | . . . . . 6 ⊢ 𝐷 = (-∞(,)𝐶) | |
38 | 11, 12 | iooborel 43508 | . . . . . 6 ⊢ (-∞(,)𝐶) ∈ 𝐵 |
39 | 37, 38 | eqeltri 2827 | . . . . 5 ⊢ 𝐷 ∈ 𝐵 |
40 | 39 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝐵) |
41 | 40 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝐷 ∈ 𝐵) |
42 | 19 | nfn 1865 | . . . . 5 ⊢ Ⅎ𝑥 ¬ 𝐶 ∈ 𝑌 |
43 | 15, 42 | nfan 1907 | . . . 4 ⊢ Ⅎ𝑥(𝜑 ∧ ¬ 𝐶 ∈ 𝑌) |
44 | nfv 1922 | . . . . 5 ⊢ Ⅎ𝑦 ¬ 𝐶 ∈ 𝑌 | |
45 | 21, 44 | nfan 1907 | . . . 4 ⊢ Ⅎ𝑦(𝜑 ∧ ¬ 𝐶 ∈ 𝑌) |
46 | 8 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝐴 ⊆ ℝ) |
47 | 25 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝐹:𝐴⟶ℝ*) |
48 | 27 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦))) |
49 | 29 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝑅 ∈ ℝ*) |
50 | simpr 488 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → ¬ 𝐶 ∈ 𝑌) | |
51 | 43, 45, 46, 47, 48, 49, 4, 31, 50, 37 | pimincfltioo 43870 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝑌 = (𝐷 ∩ 𝐴)) |
52 | ineq1 4106 | . . . 4 ⊢ (𝑏 = 𝐷 → (𝑏 ∩ 𝐴) = (𝐷 ∩ 𝐴)) | |
53 | 52 | rspceeqv 3542 | . . 3 ⊢ ((𝐷 ∈ 𝐵 ∧ 𝑌 = (𝐷 ∩ 𝐴)) → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴)) |
54 | 41, 51, 53 | syl2anc 587 | . 2 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴)) |
55 | 36, 54 | pm2.61dan 813 | 1 ⊢ (𝜑 → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 = wceq 1543 Ⅎwnf 1791 ∈ wcel 2112 ∀wral 3051 ∃wrex 3052 {crab 3055 ∩ cin 3852 ⊆ wss 3853 class class class wbr 5039 ran crn 5537 ⟶wf 6354 ‘cfv 6358 (class class class)co 7191 supcsup 9034 ℝcr 10693 -∞cmnf 10830 ℝ*cxr 10831 < clt 10832 ≤ cle 10833 (,)cioo 12900 (,]cioc 12901 topGenctg 16896 SalGencsalgen 43471 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 ax-rep 5164 ax-sep 5177 ax-nul 5184 ax-pow 5243 ax-pr 5307 ax-un 7501 ax-inf2 9234 ax-cnex 10750 ax-resscn 10751 ax-1cn 10752 ax-icn 10753 ax-addcl 10754 ax-addrcl 10755 ax-mulcl 10756 ax-mulrcl 10757 ax-mulcom 10758 ax-addass 10759 ax-mulass 10760 ax-distr 10761 ax-i2m1 10762 ax-1ne0 10763 ax-1rid 10764 ax-rnegex 10765 ax-rrecex 10766 ax-cnre 10767 ax-pre-lttri 10768 ax-pre-lttrn 10769 ax-pre-ltadd 10770 ax-pre-mulgt0 10771 ax-pre-sup 10772 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ne 2933 df-nel 3037 df-ral 3056 df-rex 3057 df-reu 3058 df-rmo 3059 df-rab 3060 df-v 3400 df-sbc 3684 df-csb 3799 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-pss 3872 df-nul 4224 df-if 4426 df-pw 4501 df-sn 4528 df-pr 4530 df-tp 4532 df-op 4534 df-uni 4806 df-int 4846 df-iun 4892 df-iin 4893 df-br 5040 df-opab 5102 df-mpt 5121 df-tr 5147 df-id 5440 df-eprel 5445 df-po 5453 df-so 5454 df-fr 5494 df-se 5495 df-we 5496 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-res 5548 df-ima 5549 df-pred 6140 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6316 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-isom 6367 df-riota 7148 df-ov 7194 df-oprab 7195 df-mpo 7196 df-om 7623 df-1st 7739 df-2nd 7740 df-wrecs 8025 df-recs 8086 df-rdg 8124 df-er 8369 df-map 8488 df-en 8605 df-dom 8606 df-sdom 8607 df-sup 9036 df-inf 9037 df-card 9520 df-acn 9523 df-pnf 10834 df-mnf 10835 df-xr 10836 df-ltxr 10837 df-le 10838 df-sub 11029 df-neg 11030 df-div 11455 df-nn 11796 df-n0 12056 df-z 12142 df-uz 12404 df-q 12510 df-rp 12552 df-ioo 12904 df-ioc 12905 df-fl 13332 df-topgen 16902 df-top 21745 df-bases 21797 df-salg 43468 df-salgen 43472 |
This theorem is referenced by: incsmf 43893 |
Copyright terms: Public domain | W3C validator |