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 481 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → 𝑆 ∈ SAlg) |
5 | simpr 485 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → 𝐷 ⊆ ∪ 𝑆) | |
6 | 4, 5 | restuni4 41264 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → ∪ (𝑆 ↾t 𝐷) = 𝐷) |
7 | 6 | eqcomd 2824 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → 𝐷 = ∪ (𝑆 ↾t 𝐷)) |
8 | 1, 7 | mpdan 683 | . . . . . . 7 ⊢ (𝜑 → 𝐷 = ∪ (𝑆 ↾t 𝐷)) |
9 | 8 | rabeqdv 3482 | . . . . . 6 ⊢ (𝜑 → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑏} = {𝑥 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑥) < 𝑏}) |
10 | 9 | adantr 481 | . . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ ℝ) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑏} = {𝑥 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑥) < 𝑏}) |
11 | issmflelem.x | . . . . . . 7 ⊢ Ⅎ𝑥𝜑 | |
12 | nfv 1906 | . . . . . . 7 ⊢ Ⅎ𝑥 𝑏 ∈ ℝ | |
13 | 11, 12 | nfan 1891 | . . . . . 6 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑏 ∈ ℝ) |
14 | issmflelem.a | . . . . . . 7 ⊢ Ⅎ𝑎𝜑 | |
15 | nfv 1906 | . . . . . . 7 ⊢ Ⅎ𝑎 𝑏 ∈ ℝ | |
16 | 14, 15 | nfan 1891 | . . . . . 6 ⊢ Ⅎ𝑎(𝜑 ∧ 𝑏 ∈ ℝ) |
17 | 3 | uniexd 7457 | . . . . . . . . . . 11 ⊢ (𝜑 → ∪ 𝑆 ∈ V) |
18 | 17 | adantr 481 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → ∪ 𝑆 ∈ V) |
19 | 18, 5 | ssexd 5219 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → 𝐷 ∈ V) |
20 | eqid 2818 | . . . . . . . . 9 ⊢ (𝑆 ↾t 𝐷) = (𝑆 ↾t 𝐷) | |
21 | 4, 19, 20 | subsalsal 42519 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → (𝑆 ↾t 𝐷) ∈ SAlg) |
22 | 1, 21 | mpdan 683 | . . . . . . 7 ⊢ (𝜑 → (𝑆 ↾t 𝐷) ∈ SAlg) |
23 | 22 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ ℝ) → (𝑆 ↾t 𝐷) ∈ SAlg) |
24 | eqid 2818 | . . . . . 6 ⊢ ∪ (𝑆 ↾t 𝐷) = ∪ (𝑆 ↾t 𝐷) | |
25 | simpr 485 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ (𝑆 ↾t 𝐷)) → 𝑥 ∈ ∪ (𝑆 ↾t 𝐷)) | |
26 | 1, 6 | mpdan 683 | . . . . . . . . . . 11 ⊢ (𝜑 → ∪ (𝑆 ↾t 𝐷) = 𝐷) |
27 | 26 | adantr 481 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ (𝑆 ↾t 𝐷)) → ∪ (𝑆 ↾t 𝐷) = 𝐷) |
28 | 25, 27 | eleqtrd 2912 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ (𝑆 ↾t 𝐷)) → 𝑥 ∈ 𝐷) |
29 | 2 | ffvelrnda 6843 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐹‘𝑥) ∈ ℝ) |
30 | 28, 29 | syldan 591 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ (𝑆 ↾t 𝐷)) → (𝐹‘𝑥) ∈ ℝ) |
31 | 30 | rexrd 10679 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ (𝑆 ↾t 𝐷)) → (𝐹‘𝑥) ∈ ℝ*) |
32 | 31 | adantlr 711 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑥 ∈ ∪ (𝑆 ↾t 𝐷)) → (𝐹‘𝑥) ∈ ℝ*) |
33 | 26 | rabeqdv 3482 | . . . . . . . . 9 ⊢ (𝜑 → {𝑥 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑥) ≤ 𝑎} = {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) ≤ 𝑎}) |
34 | 33 | adantr 481 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑥) ≤ 𝑎} = {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) ≤ 𝑎}) |
35 | issmflelem.l | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) ≤ 𝑎} ∈ (𝑆 ↾t 𝐷)) | |
36 | 34, 35 | eqeltrd 2910 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑥) ≤ 𝑎} ∈ (𝑆 ↾t 𝐷)) |
37 | 36 | adantlr 711 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑥) ≤ 𝑎} ∈ (𝑆 ↾t 𝐷)) |
38 | simpr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ ℝ) → 𝑏 ∈ ℝ) | |
39 | 13, 16, 23, 24, 32, 37, 38 | salpreimalelt 42883 | . . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ ℝ) → {𝑥 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑥) < 𝑏} ∈ (𝑆 ↾t 𝐷)) |
40 | 10, 39 | eqeltrd 2910 | . . . 4 ⊢ ((𝜑 ∧ 𝑏 ∈ ℝ) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑏} ∈ (𝑆 ↾t 𝐷)) |
41 | 40 | ralrimiva 3179 | . . 3 ⊢ (𝜑 → ∀𝑏 ∈ ℝ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑏} ∈ (𝑆 ↾t 𝐷)) |
42 | 1, 2, 41 | 3jca 1120 | . 2 ⊢ (𝜑 → (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑏} ∈ (𝑆 ↾t 𝐷))) |
43 | issmflelem.d | . . 3 ⊢ 𝐷 = dom 𝐹 | |
44 | 3, 43 | issmf 42882 | . 2 ⊢ (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑏} ∈ (𝑆 ↾t 𝐷)))) |
45 | 42, 44 | mpbird 258 | 1 ⊢ (𝜑 → 𝐹 ∈ (SMblFn‘𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1079 = wceq 1528 Ⅎwnf 1775 ∈ wcel 2105 ∀wral 3135 {crab 3139 Vcvv 3492 ⊆ wss 3933 ∪ cuni 4830 class class class wbr 5057 dom cdm 5548 ⟶wf 6344 ‘cfv 6348 (class class class)co 7145 ℝcr 10524 ℝ*cxr 10662 < clt 10663 ≤ cle 10664 ↾t crest 16682 SAlgcsalg 42470 SMblFncsmblfn 42854 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-inf2 9092 ax-cc 9845 ax-ac2 9873 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 ax-pre-sup 10603 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-iin 4913 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-oadd 8095 df-er 8278 df-map 8397 df-pm 8398 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-sup 8894 df-inf 8895 df-card 9356 df-acn 9359 df-ac 9530 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-div 11286 df-nn 11627 df-n0 11886 df-z 11970 df-uz 12232 df-q 12337 df-rp 12378 df-ioo 12730 df-ico 12732 df-fl 13150 df-rest 16684 df-salg 42471 df-smblfn 42855 |
This theorem is referenced by: issmfle 42899 |
Copyright terms: Public domain | W3C validator |