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 47956

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 11393	. . . . . 6 ⊢ -∞ ∈ ℝ^*
3	2	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → -∞ ∈ ℝ^*)
4		incsmflem.l	. . . . . . . . 9 ⊢ 𝑌 = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝑅}
5		ssrab2 4008	. . . . . . . . 9 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝑅} ⊆ 𝐴
6	4, 5	eqsstri 3959	. . . . . . . 8 ⊢ 𝑌 ⊆ 𝐴
7	6	a1i 11	. . . . . . 7 ⊢ (𝜑 → 𝑌 ⊆ 𝐴)
8		incsmflem.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
9	7, 8	sstrd 3923	. . . . . 6 ⊢ (𝜑 → 𝑌 ⊆ ℝ)
10	9	sselda 3913	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐶 ∈ ℝ)
11		incsmflem.j	. . . . 5 ⊢ 𝐽 = (topGen‘ran (,))
12		incsmflem.b	. . . . 5 ⊢ 𝐵 = (SalGen‘𝐽)
13	3, 10, 11, 12	iocborel 47571	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → (-∞(,]𝐶) ∈ 𝐵)
14	1, 13	eqeltrid 2868	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝐸 ∈ 𝐵)
15		incsmflem.x	. . . . 5 ⊢ Ⅎ𝑥𝜑
16		nfcv 2926	. . . . . 6 ⊢ Ⅎ𝑥𝐶
17		nfrab1 3435	. . . . . . 7 ⊢ Ⅎ𝑥{𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝑅}
18	4, 17	nfcxfr 2924	. . . . . 6 ⊢ Ⅎ𝑥𝑌
19	16, 18	nfel 2940	. . . . 5 ⊢ Ⅎ𝑥 𝐶 ∈ 𝑌
20	15, 19	nfan 1934	. . . 4 ⊢ Ⅎ𝑥(𝜑 ∧ 𝐶 ∈ 𝑌)
21		incsmflem.y	. . . . 5 ⊢ Ⅎ𝑦𝜑
22		nfv 1949	. . . . 5 ⊢ Ⅎ𝑦 𝐶 ∈ 𝑌
23	21, 22	nfan 1934	. . . 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 47931	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → 𝑌 = (𝐸 ∩ 𝐴))
34		ineq1 4113	. . . 4 ⊢ (𝑏 = 𝐸 → (𝑏 ∩ 𝐴) = (𝐸 ∩ 𝐴))
35	34	rspceeqv 3602	. . 3 ⊢ ((𝐸 ∈ 𝐵 ∧ 𝑌 = (𝐸 ∩ 𝐴)) → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴))
36	14, 33, 35	syl2anc 596	. 2 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑌) → ∃𝑏 ∈ 𝐵 𝑌 = (𝑏 ∩ 𝐴))
37		incsmflem.d	. . . . . 6 ⊢ 𝐷 = (-∞(,)𝐶)
38	11, 12	iooborel 47566	. . . . . 6 ⊢ (-∞(,)𝐶) ∈ 𝐵
39	37, 38	eqeltri 2860	. . . . 5 ⊢ 𝐷 ∈ 𝐵
40	39	a1i 11	. . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝐵)
41	40	adantr 486	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝐷 ∈ 𝐵)
42	19	nfn 1890	. . . . 5 ⊢ Ⅎ𝑥 ¬ 𝐶 ∈ 𝑌
43	15, 42	nfan 1934	. . . 4 ⊢ Ⅎ𝑥(𝜑 ∧ ¬ 𝐶 ∈ 𝑌)
44		nfv 1949	. . . . 5 ⊢ Ⅎ𝑦 ¬ 𝐶 ∈ 𝑌
45	21, 44	nfan 1934	. . . 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 47933	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ 𝑌) → 𝑌 = (𝐷 ∩ 𝐴))
52		ineq1 4113	. . . 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 2147 ∀wral 3080 ∃wrex 3090 {crab 3416 ⊆ wss 3900 ∩ cin 4092 class class class wbr 5106 ran crn 5656 ⟶wf 6554 ‘cfv 6558 (class class class)co 7443 supcsup 9459 ℝcr 11226 -∞cmnf 11368 ℝ^*cxr 11369 < clt 11370 ≤ cle 11371 (,)cioo 13503 (,]cioc 13504 topGenctg 17637 SalGencsalgen 47527

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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-inf2 9669 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 ax-pre-sup 11305

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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-isom 6567 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-er 8745 df-map 8877 df-en 9002 df-dom 9003 df-sdom 9004 df-sup 9461 df-inf 9462 df-card 10047 df-acn 10050 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-div 12001 df-nn 12363 df-n0 12634 df-z 12721 df-uz 12993 df-q 13103 df-rp 13148 df-ioo 13507 df-ioc 13508 df-fl 13959 df-topgen 17643 df-top 23242 df-bases 23294 df-salg 47524 df-salgen 47528

This theorem is used by: incsmf 47957

W3C validator