incsmflem - Mathbox for Glauco Siliprandi

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

Theorem incsmflem 47556

Description: A nondecreasing function is Borel measurable. Proposition 121D (c) of [Fremlin1] p. 36 . (Contributed by Glauco Siliprandi, 26-Jun-2021.)

**Hypotheses**
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	⊢ 𝐸 = (-∞(,]𝐶)

**Assertion**
Ref	Expression
incsmflem	⊢ (𝜑 → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴))

Distinct variable groups: 𝐴,𝑏 𝑥,𝐴,𝑦 𝐵,𝑏 𝑥,𝐶,𝑦 𝐷,𝑏 𝑥,𝐷,𝑦 𝐸,𝑏 𝑥,𝐸,𝑦 𝑥,𝐹,𝑦 𝑥,𝑅,𝑦 𝑌,𝑏 𝑦,𝑌 Allowed substitution hints: 𝜑(𝑥, 𝑦, 𝑏) 𝐵(𝑥, 𝑦) 𝐶(𝑏) 𝑅(𝑏) 𝐹(𝑏) 𝐽(𝑥, 𝑦, 𝑏) 𝑌(𝑥)

**Proof of Theorem incsmflem**
Step	Hyp	Ref	Expression
1		incsmflem.e	. . . 4 ⊢ 𝐸 = (-∞(,]𝐶)
2		mnfxr 11293	. . . . . 6 ⊢ -∞ ∈ ℝ^*
3	2	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → -∞ ∈ ℝ^*)
4		incsmflem.l	. . . . . . . . 9 ⊢ 𝑌 = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝑅}
5		ssrab2 4031	. . . . . . . . 9 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝑅} ⊆ 𝐴
6	4, 5	eqsstri 3980	. . . . . . . 8 ⊢ 𝑌 ⊆ 𝐴
7	6	a1i 11	. . . . . . 7 ⊢ (𝜑 → 𝑌 ⊆ 𝐴)
8		incsmflem.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
9	7, 8	sstrd 3944	. . . . . 6 ⊢ (𝜑 → 𝑌 ⊆ ℝ)
10	9	sselda 3934	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐶 ∈ ℝ)
11		incsmflem.j	. . . . 5 ⊢ 𝐽 = (topGen‘ran (,))
12		incsmflem.b	. . . . 5 ⊢ 𝐵 = (SalGen‘𝐽)
13	3, 10, 11, 12	iocborel 47171	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → (-∞(,]𝐶) ∈ 𝐵)
14	1, 13	eqeltrid 2866	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐸 ∈ 𝐵)
15		incsmflem.x	. . . . 5 ⊢ Ⅎ𝑥𝜑
16		nfcv 2924	. . . . . 6 ⊢ Ⅎ𝑥𝐶
17		nfrab1 3434	. . . . . . 7 ⊢ Ⅎ𝑥{𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝑅}
18	4, 17	nfcxfr 2922	. . . . . 6 ⊢ Ⅎ𝑥𝑌
19	16, 18	nfel 2938	. . . . 5 ⊢ Ⅎ𝑥 𝐶 ∈ 𝑌
20	15, 19	nfan 1932	. . . 4 ⊢ Ⅎ𝑥(𝜑 ∧ 𝐶 ∈ 𝑌)
21		incsmflem.y	. . . . 5 ⊢ Ⅎ𝑦𝜑
22		nfv 1947	. . . . 5 ⊢ Ⅎ𝑦 𝐶 ∈ 𝑌
23	21, 22	nfan 1932	. . . 4 ⊢ Ⅎ𝑦(𝜑 ∧ 𝐶 ∈ 𝑌)
24	8	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐴 ⊆ ℝ)
25		incsmflem.f	. . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ^*)
26	25	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐹:𝐴⟶ℝ^*)
27		incsmflem.i	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)))
28	27	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)))
29		incsmflem.r	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ ℝ^*)
30	29	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝑅 ∈ ℝ^*)
31		incsmflem.c	. . . 4 ⊢ 𝐶 = sup(𝑌, ℝ^*, < )
32		simpr 490	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐶 ∈ 𝑌)
33	20, 23, 24, 26, 28, 30, 4, 31, 32, 1	pimincfltioc 47531	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝑌 = (𝐸 ∩ 𝐴))
34		ineq1 4162	. . . 4 ⊢ (𝑏 = 𝐸 → (𝑏 ∩ 𝐴) = (𝐸 ∩ 𝐴))
35	34	rspceeqv 3602	. . 3 ⊢ ((𝐸 ∈ 𝐵 ∧ 𝑌 = (𝐸 ∩ 𝐴)) → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴))
36	14, 33, 35	syl2anc 596	. 2 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴))
37		incsmflem.d	. . . . . 6 ⊢ 𝐷 = (-∞(,)𝐶)
38	11, 12	iooborel 47166	. . . . . 6 ⊢ (-∞(,)𝐶) ∈ 𝐵
39	37, 38	eqeltri 2858	. . . . 5 ⊢ 𝐷 ∈ 𝐵
40	39	a1i 11	. . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝐵)
41	40	adantr 486	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝐷 ∈ 𝐵)
42	19	nfn 1890	. . . . 5 ⊢ Ⅎ𝑥 ¬ 𝐶 ∈ 𝑌
43	15, 42	nfan 1932	. . . 4 ⊢ Ⅎ𝑥(𝜑 ∧ ¬ 𝐶 ∈ 𝑌)
44		nfv 1947	. . . . 5 ⊢ Ⅎ𝑦 ¬ 𝐶 ∈ 𝑌
45	21, 44	nfan 1932	. . . 4 ⊢ Ⅎ𝑦(𝜑 ∧ ¬ 𝐶 ∈ 𝑌)
46	8	adantr 486	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝐴 ⊆ ℝ)
47	25	adantr 486	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝐹:𝐴⟶ℝ^*)
48	27	adantr 486	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)))
49	29	adantr 486	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝑅 ∈ ℝ^*)
50		simpr 490	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → ¬ 𝐶 ∈ 𝑌)
51	43, 45, 46, 47, 48, 49, 4, 31, 50, 37	pimincfltioo 47533	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝑌 = (𝐷 ∩ 𝐴))
52		ineq1 4162	. . . 4 ⊢ (𝑏 = 𝐷 → (𝑏 ∩ 𝐴) = (𝐷 ∩ 𝐴))
53	52	rspceeqv 3602	. . 3 ⊢ ((𝐷 ∈ 𝐵 ∧ 𝑌 = (𝐷 ∩ 𝐴)) → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴))
54	41, 51, 53	syl2anc 596	. 2 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴))
55	36, 54	pm2.61dan 825	1 ⊢ (𝜑 → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2145 ∀wral 3078 ∃wrex 3088 {crab 3414 ∩ cin 3901 ⊆ wss 3902 class class class wbr 5107 ran crn 5660 ⟶wf 6533 ‘cfv 6537 (class class class)co 7416 supcsup 9413 ℝcr 11126 -∞cmnf 11268 ℝ^*cxr 11269 < clt 11270 ≤ cle 11271 (,)cioo 13400 (,]cioc 13401 topGenctg 17526 SalGencsalgen 47127

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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-inf2 9623 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 ax-pre-sup 11205

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 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8699 df-map 8831 df-en 8956 df-dom 8957 df-sdom 8958 df-sup 9415 df-inf 9416 df-card 9947 df-acn 9950 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-div 11899 df-nn 12261 df-n0 12532 df-z 12619 df-uz 12891 df-q 13001 df-rp 13045 df-ioo 13404 df-ioc 13405 df-fl 13855 df-topgen 17532 df-top 23120 df-bases 23172 df-salg 47124 df-salgen 47128

This theorem is used by: incsmf 47557

W3C validator