Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > issmflelem | Structured version Visualization version GIF version |
Description: The predicate "𝐹 is a real-valued measurable function w.r.t. to the sigma-algebra 𝑆". A function is measurable iff the preimages of all right-closed intervals unbounded below are in the subspace sigma-algebra induced by its domain. The domain of 𝐹 is required to be a subset of the underlying set of 𝑆. Definition 121C of [Fremlin1] p. 36, and Proposition 121B (ii) of [Fremlin1] p. 35 . (Contributed by Glauco Siliprandi, 26-Jun-2021.) |
Ref | Expression |
---|---|
issmflelem.x | ⊢ Ⅎ𝑥𝜑 |
issmflelem.a | ⊢ Ⅎ𝑎𝜑 |
issmflelem.s | ⊢ (𝜑 → 𝑆 ∈ SAlg) |
issmflelem.d | ⊢ 𝐷 = dom 𝐹 |
issmflelem.i | ⊢ (𝜑 → 𝐷 ⊆ ∪ 𝑆) |
issmflelem.f | ⊢ (𝜑 → 𝐹:𝐷⟶ℝ) |
issmflelem.l | ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) ≤ 𝑎} ∈ (𝑆 ↾t 𝐷)) |
Ref | Expression |
---|---|
issmflelem | ⊢ (𝜑 → 𝐹 ∈ (SMblFn‘𝑆)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | issmflelem.i | . . 3 ⊢ (𝜑 → 𝐷 ⊆ ∪ 𝑆) | |
2 | issmflelem.f | . . 3 ⊢ (𝜑 → 𝐹:𝐷⟶ℝ) | |
3 | issmflelem.s | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑆 ∈ SAlg) | |
4 | 3 | adantr 483 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → 𝑆 ∈ SAlg) |
5 | simpr 487 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → 𝐷 ⊆ ∪ 𝑆) | |
6 | 4, 5 | restuni4 41380 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → ∪ (𝑆 ↾t 𝐷) = 𝐷) |
7 | 6 | eqcomd 2827 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → 𝐷 = ∪ (𝑆 ↾t 𝐷)) |
8 | 1, 7 | mpdan 685 | . . . . . . 7 ⊢ (𝜑 → 𝐷 = ∪ (𝑆 ↾t 𝐷)) |
9 | 8 | rabeqdv 3484 | . . . . . 6 ⊢ (𝜑 → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑏} = {𝑥 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑥) < 𝑏}) |
10 | 9 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ ℝ) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑏} = {𝑥 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑥) < 𝑏}) |
11 | issmflelem.x | . . . . . . 7 ⊢ Ⅎ𝑥𝜑 | |
12 | nfv 1911 | . . . . . . 7 ⊢ Ⅎ𝑥 𝑏 ∈ ℝ | |
13 | 11, 12 | nfan 1896 | . . . . . 6 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑏 ∈ ℝ) |
14 | issmflelem.a | . . . . . . 7 ⊢ Ⅎ𝑎𝜑 | |
15 | nfv 1911 | . . . . . . 7 ⊢ Ⅎ𝑎 𝑏 ∈ ℝ | |
16 | 14, 15 | nfan 1896 | . . . . . 6 ⊢ Ⅎ𝑎(𝜑 ∧ 𝑏 ∈ ℝ) |
17 | 3 | uniexd 7462 | . . . . . . . . . . 11 ⊢ (𝜑 → ∪ 𝑆 ∈ V) |
18 | 17 | adantr 483 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → ∪ 𝑆 ∈ V) |
19 | 18, 5 | ssexd 5220 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → 𝐷 ∈ V) |
20 | eqid 2821 | . . . . . . . . 9 ⊢ (𝑆 ↾t 𝐷) = (𝑆 ↾t 𝐷) | |
21 | 4, 19, 20 | subsalsal 42636 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → (𝑆 ↾t 𝐷) ∈ SAlg) |
22 | 1, 21 | mpdan 685 | . . . . . . 7 ⊢ (𝜑 → (𝑆 ↾t 𝐷) ∈ SAlg) |
23 | 22 | adantr 483 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ ℝ) → (𝑆 ↾t 𝐷) ∈ SAlg) |
24 | eqid 2821 | . . . . . 6 ⊢ ∪ (𝑆 ↾t 𝐷) = ∪ (𝑆 ↾t 𝐷) | |
25 | simpr 487 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ (𝑆 ↾t 𝐷)) → 𝑥 ∈ ∪ (𝑆 ↾t 𝐷)) | |
26 | 1, 6 | mpdan 685 | . . . . . . . . . . 11 ⊢ (𝜑 → ∪ (𝑆 ↾t 𝐷) = 𝐷) |
27 | 26 | adantr 483 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ (𝑆 ↾t 𝐷)) → ∪ (𝑆 ↾t 𝐷) = 𝐷) |
28 | 25, 27 | eleqtrd 2915 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ (𝑆 ↾t 𝐷)) → 𝑥 ∈ 𝐷) |
29 | 2 | ffvelrnda 6845 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐹‘𝑥) ∈ ℝ) |
30 | 28, 29 | syldan 593 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ (𝑆 ↾t 𝐷)) → (𝐹‘𝑥) ∈ ℝ) |
31 | 30 | rexrd 10685 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ (𝑆 ↾t 𝐷)) → (𝐹‘𝑥) ∈ ℝ*) |
32 | 31 | adantlr 713 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑥 ∈ ∪ (𝑆 ↾t 𝐷)) → (𝐹‘𝑥) ∈ ℝ*) |
33 | 26 | rabeqdv 3484 | . . . . . . . . 9 ⊢ (𝜑 → {𝑥 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑥) ≤ 𝑎} = {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) ≤ 𝑎}) |
34 | 33 | adantr 483 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑥) ≤ 𝑎} = {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) ≤ 𝑎}) |
35 | issmflelem.l | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) ≤ 𝑎} ∈ (𝑆 ↾t 𝐷)) | |
36 | 34, 35 | eqeltrd 2913 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑥) ≤ 𝑎} ∈ (𝑆 ↾t 𝐷)) |
37 | 36 | adantlr 713 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑥) ≤ 𝑎} ∈ (𝑆 ↾t 𝐷)) |
38 | simpr 487 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ ℝ) → 𝑏 ∈ ℝ) | |
39 | 13, 16, 23, 24, 32, 37, 38 | salpreimalelt 43000 | . . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ ℝ) → {𝑥 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑥) < 𝑏} ∈ (𝑆 ↾t 𝐷)) |
40 | 10, 39 | eqeltrd 2913 | . . . 4 ⊢ ((𝜑 ∧ 𝑏 ∈ ℝ) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑏} ∈ (𝑆 ↾t 𝐷)) |
41 | 40 | ralrimiva 3182 | . . 3 ⊢ (𝜑 → ∀𝑏 ∈ ℝ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑏} ∈ (𝑆 ↾t 𝐷)) |
42 | 1, 2, 41 | 3jca 1124 | . 2 ⊢ (𝜑 → (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑏} ∈ (𝑆 ↾t 𝐷))) |
43 | issmflelem.d | . . 3 ⊢ 𝐷 = dom 𝐹 | |
44 | 3, 43 | issmf 42999 | . 2 ⊢ (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑏} ∈ (𝑆 ↾t 𝐷)))) |
45 | 42, 44 | mpbird 259 | 1 ⊢ (𝜑 → 𝐹 ∈ (SMblFn‘𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1533 Ⅎwnf 1780 ∈ wcel 2110 ∀wral 3138 {crab 3142 Vcvv 3494 ⊆ wss 3935 ∪ cuni 4831 class class class wbr 5058 dom cdm 5549 ⟶wf 6345 ‘cfv 6349 (class class class)co 7150 ℝcr 10530 ℝ*cxr 10668 < clt 10669 ≤ cle 10670 ↾t crest 16688 SAlgcsalg 42587 SMblFncsmblfn 42971 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-inf2 9098 ax-cc 9851 ax-ac2 9879 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 ax-pre-sup 10609 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-iin 4914 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-se 5509 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-isom 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-oadd 8100 df-er 8283 df-map 8402 df-pm 8403 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-sup 8900 df-inf 8901 df-card 9362 df-acn 9365 df-ac 9536 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-div 11292 df-nn 11633 df-n0 11892 df-z 11976 df-uz 12238 df-q 12343 df-rp 12384 df-ioo 12736 df-ico 12738 df-fl 13156 df-rest 16690 df-salg 42588 df-smblfn 42972 |
This theorem is referenced by: issmfle 43016 |
Copyright terms: Public domain | W3C validator |