| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > issmfd | Structured version Visualization version GIF version | ||
| Description: A sufficient condition for "𝐹 being a real-valued measurable function w.r.t. to the sigma-algebra 𝑆". (Contributed by Glauco Siliprandi, 26-Jun-2021.) |
| Ref | Expression |
|---|---|
| issmfd.a | ⊢ Ⅎ𝑎𝜑 |
| issmfd.s | ⊢ (𝜑 → 𝑆 ∈ SAlg) |
| issmfd.d | ⊢ (𝜑 → 𝐷 ⊆ ∪ 𝑆) |
| issmfd.f | ⊢ (𝜑 → 𝐹:𝐷⟶ℝ) |
| issmfd.p | ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷)) |
| Ref | Expression |
|---|---|
| issmfd | ⊢ (𝜑 → 𝐹 ∈ (SMblFn‘𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | issmfd.f | . . . . 5 ⊢ (𝜑 → 𝐹:𝐷⟶ℝ) | |
| 2 | 1 | fdmd 6665 | . . . 4 ⊢ (𝜑 → dom 𝐹 = 𝐷) |
| 3 | issmfd.d | . . . 4 ⊢ (𝜑 → 𝐷 ⊆ ∪ 𝑆) | |
| 4 | 2, 3 | eqsstrd 3949 | . . 3 ⊢ (𝜑 → dom 𝐹 ⊆ ∪ 𝑆) |
| 5 | 1 | ffdmd 6685 | . . 3 ⊢ (𝜑 → 𝐹:dom 𝐹⟶ℝ) |
| 6 | issmfd.a | . . . 4 ⊢ Ⅎ𝑎𝜑 | |
| 7 | issmfd.p | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷)) | |
| 8 | 2 | rabeqdv 3406 | . . . . . . . 8 ⊢ (𝜑 → {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} = {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎}) |
| 9 | 2 | oveq2d 7372 | . . . . . . . 8 ⊢ (𝜑 → (𝑆 ↾t dom 𝐹) = (𝑆 ↾t 𝐷)) |
| 10 | 8, 9 | eleq12d 2833 | . . . . . . 7 ⊢ (𝜑 → ({𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹) ↔ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷))) |
| 11 | 10 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → ({𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹) ↔ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷))) |
| 12 | 7, 11 | mpbird 258 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹)) |
| 13 | 12 | ex 413 | . . . 4 ⊢ (𝜑 → (𝑎 ∈ ℝ → {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹))) |
| 14 | 6, 13 | ralrimi 3237 | . . 3 ⊢ (𝜑 → ∀𝑎 ∈ ℝ {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹)) |
| 15 | 4, 5, 14 | 3jca 1134 | . 2 ⊢ (𝜑 → (dom 𝐹 ⊆ ∪ 𝑆 ∧ 𝐹:dom 𝐹⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹))) |
| 16 | issmfd.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ SAlg) | |
| 17 | eqid 2739 | . . 3 ⊢ dom 𝐹 = dom 𝐹 | |
| 18 | 16, 17 | issmf 47171 | . 2 ⊢ (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (dom 𝐹 ⊆ ∪ 𝑆 ∧ 𝐹:dom 𝐹⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹)))) |
| 19 | 15, 18 | mpbird 258 | 1 ⊢ (𝜑 → 𝐹 ∈ (SMblFn‘𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1092 Ⅎwnf 1790 ∈ wcel 2119 ∀wral 3053 {crab 3391 ⊆ wss 3883 ∪ cuni 4838 class class class wbr 5072 dom cdm 5618 ⟶wf 6481 ‘cfv 6485 (class class class)co 7356 ℝcr 11028 < clt 11170 ↾t crest 17374 SAlgcsalg 46751 SMblFncsmblfn 47138 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-cnex 11085 ax-resscn 11086 ax-pre-lttri 11103 ax-pre-lttrn 11104 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-po 5526 df-so 5527 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-ov 7359 df-oprab 7360 df-mpo 7361 df-1st 7931 df-2nd 7932 df-er 8633 df-pm 8766 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-ioo 13293 df-ico 13295 df-smblfn 47139 |
| This theorem is referenced by: sssmf 47181 mbfresmf 47182 cnfsmf 47183 incsmf 47185 smfsssmf 47186 smfres 47233 smfco 47245 |
| Copyright terms: Public domain | W3C validator |