| 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 6703 | . . . 4 ⊢ (𝜑 → dom 𝐹 = 𝐷) |
| 3 | issmfd.d | . . . 4 ⊢ (𝜑 → 𝐷 ⊆ ∪ 𝑆) | |
| 4 | 2, 3 | eqsstrd 3971 | . . 3 ⊢ (𝜑 → dom 𝐹 ⊆ ∪ 𝑆) |
| 5 | 1 | ffdmd 6723 | . . 3 ⊢ (𝜑 → 𝐹:dom 𝐹⟶ℝ) |
| 6 | issmfd.a | . . . 4 ⊢ Ⅎ𝑎𝜑 | |
| 7 | issmfd.p | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷)) | |
| 8 | 2 | rabeqdv 3430 | . . . . . . . 8 ⊢ (𝜑 → {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} = {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎}) |
| 9 | 2 | oveq2d 7413 | . . . . . . . 8 ⊢ (𝜑 → (𝑆 ↾t dom 𝐹) = (𝑆 ↾t 𝐷)) |
| 10 | 8, 9 | eleq12d 2857 | . . . . . . 7 ⊢ (𝜑 → ({𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹) ↔ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷))) |
| 11 | 10 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → ({𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹) ↔ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷))) |
| 12 | 7, 11 | mpbird 259 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹)) |
| 13 | 12 | ex 416 | . . . 4 ⊢ (𝜑 → (𝑎 ∈ ℝ → {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹))) |
| 14 | 6, 13 | ralrimi 3261 | . . 3 ⊢ (𝜑 → ∀𝑎 ∈ ℝ {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹)) |
| 15 | 4, 5, 14 | 3jca 1142 | . 2 ⊢ (𝜑 → (dom 𝐹 ⊆ ∪ 𝑆 ∧ 𝐹:dom 𝐹⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹))) |
| 16 | issmfd.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ SAlg) | |
| 17 | eqid 2763 | . . 3 ⊢ dom 𝐹 = dom 𝐹 | |
| 18 | 16, 17 | issmf 47303 | . 2 ⊢ (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (dom 𝐹 ⊆ ∪ 𝑆 ∧ 𝐹:dom 𝐹⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹)))) |
| 19 | 15, 18 | mpbird 259 | 1 ⊢ (𝜑 → 𝐹 ∈ (SMblFn‘𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1099 Ⅎwnf 1804 ∈ wcel 2143 ∀wral 3077 {crab 3415 ⊆ wss 3905 ∪ cuni 4866 class class class wbr 5101 dom cdm 5648 ⟶wf 6518 ‘cfv 6522 (class class class)co 7397 ℝcr 11073 < clt 11217 ↾t crest 17450 SAlgcsalg 46883 SMblFncsmblfn 47270 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7719 ax-cnex 11130 ax-resscn 11131 ax-pre-lttri 11148 ax-pre-lttrn 11149 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3063 df-ral 3078 df-rex 3088 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-id 5543 df-po 5556 df-so 5557 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-iota 6478 df-fun 6524 df-fn 6525 df-f 6526 df-f1 6527 df-fo 6528 df-f1o 6529 df-fv 6530 df-ov 7400 df-oprab 7401 df-mpo 7402 df-1st 7971 df-2nd 7972 df-er 8679 df-pm 8812 df-en 8929 df-dom 8930 df-sdom 8931 df-pnf 11219 df-mnf 11220 df-xr 11221 df-ltxr 11222 df-le 11223 df-ioo 13354 df-ico 13356 df-smblfn 47271 |
| This theorem is referenced by: sssmf 47313 mbfresmf 47314 cnfsmf 47315 incsmf 47317 smfsssmf 47318 smfres 47365 smfco 47377 |
| Copyright terms: Public domain | W3C validator |