Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > issmfdf | Structured version Visualization version GIF version |
Description: A sufficient condition for "𝐹 being a measurable function w.r.t. to the sigma-algebra 𝑆". (Contributed by Glauco Siliprandi, 26-Jun-2021.) |
Ref | Expression |
---|---|
issmfdf.x | ⊢ Ⅎ𝑥𝐹 |
issmfdf.a | ⊢ Ⅎ𝑎𝜑 |
issmfdf.s | ⊢ (𝜑 → 𝑆 ∈ SAlg) |
issmfdf.d | ⊢ (𝜑 → 𝐷 ⊆ ∪ 𝑆) |
issmfdf.f | ⊢ (𝜑 → 𝐹:𝐷⟶ℝ) |
issmfdf.p | ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷)) |
Ref | Expression |
---|---|
issmfdf | ⊢ (𝜑 → 𝐹 ∈ (SMblFn‘𝑆)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | issmfdf.f | . . . . 5 ⊢ (𝜑 → 𝐹:𝐷⟶ℝ) | |
2 | 1 | fdmd 6516 | . . . 4 ⊢ (𝜑 → dom 𝐹 = 𝐷) |
3 | issmfdf.d | . . . 4 ⊢ (𝜑 → 𝐷 ⊆ ∪ 𝑆) | |
4 | 2, 3 | eqsstrd 3916 | . . 3 ⊢ (𝜑 → dom 𝐹 ⊆ ∪ 𝑆) |
5 | 1 | ffdmd 6536 | . . 3 ⊢ (𝜑 → 𝐹:dom 𝐹⟶ℝ) |
6 | issmfdf.a | . . . 4 ⊢ Ⅎ𝑎𝜑 | |
7 | issmfdf.p | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷)) | |
8 | issmfdf.x | . . . . . . . . . . 11 ⊢ Ⅎ𝑥𝐹 | |
9 | 8 | nfdm 5795 | . . . . . . . . . 10 ⊢ Ⅎ𝑥dom 𝐹 |
10 | nfcv 2900 | . . . . . . . . . 10 ⊢ Ⅎ𝑥𝐷 | |
11 | 9, 10 | rabeqf 3383 | . . . . . . . . 9 ⊢ (dom 𝐹 = 𝐷 → {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} = {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎}) |
12 | 2, 11 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} = {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎}) |
13 | 2 | oveq2d 7189 | . . . . . . . 8 ⊢ (𝜑 → (𝑆 ↾t dom 𝐹) = (𝑆 ↾t 𝐷)) |
14 | 12, 13 | eleq12d 2828 | . . . . . . 7 ⊢ (𝜑 → ({𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹) ↔ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷))) |
15 | 14 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → ({𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹) ↔ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷))) |
16 | 7, 15 | mpbird 260 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹)) |
17 | 16 | ex 416 | . . . 4 ⊢ (𝜑 → (𝑎 ∈ ℝ → {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹))) |
18 | 6, 17 | ralrimi 3129 | . . 3 ⊢ (𝜑 → ∀𝑎 ∈ ℝ {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹)) |
19 | 4, 5, 18 | 3jca 1129 | . 2 ⊢ (𝜑 → (dom 𝐹 ⊆ ∪ 𝑆 ∧ 𝐹:dom 𝐹⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹))) |
20 | issmfdf.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ SAlg) | |
21 | eqid 2739 | . . 3 ⊢ dom 𝐹 = dom 𝐹 | |
22 | 8, 20, 21 | issmff 43832 | . 2 ⊢ (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (dom 𝐹 ⊆ ∪ 𝑆 ∧ 𝐹:dom 𝐹⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹)))) |
23 | 19, 22 | mpbird 260 | 1 ⊢ (𝜑 → 𝐹 ∈ (SMblFn‘𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1088 = wceq 1542 Ⅎwnf 1790 ∈ wcel 2114 Ⅎwnfc 2880 ∀wral 3054 {crab 3058 ⊆ wss 3844 ∪ cuni 4797 class class class wbr 5031 dom cdm 5526 ⟶wf 6336 ‘cfv 6340 (class class class)co 7173 ℝcr 10617 < clt 10756 ↾t crest 16800 SAlgcsalg 43414 SMblFncsmblfn 43798 |
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 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2711 ax-sep 5168 ax-nul 5175 ax-pow 5233 ax-pr 5297 ax-un 7482 ax-cnex 10674 ax-resscn 10675 ax-pre-lttri 10692 ax-pre-lttrn 10693 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2541 df-eu 2571 df-clab 2718 df-cleq 2731 df-clel 2812 df-nfc 2882 df-ne 2936 df-nel 3040 df-ral 3059 df-rex 3060 df-rab 3063 df-v 3401 df-sbc 3682 df-csb 3792 df-dif 3847 df-un 3849 df-in 3851 df-ss 3861 df-nul 4213 df-if 4416 df-pw 4491 df-sn 4518 df-pr 4520 df-op 4524 df-uni 4798 df-iun 4884 df-br 5032 df-opab 5094 df-mpt 5112 df-id 5430 df-po 5443 df-so 5444 df-xp 5532 df-rel 5533 df-cnv 5534 df-co 5535 df-dm 5536 df-rn 5537 df-res 5538 df-ima 5539 df-iota 6298 df-fun 6342 df-fn 6343 df-f 6344 df-f1 6345 df-fo 6346 df-f1o 6347 df-fv 6348 df-ov 7176 df-oprab 7177 df-mpo 7178 df-1st 7717 df-2nd 7718 df-er 8323 df-pm 8443 df-en 8559 df-dom 8560 df-sdom 8561 df-pnf 10758 df-mnf 10759 df-xr 10760 df-ltxr 10761 df-le 10762 df-ioo 12828 df-ico 12830 df-smblfn 43799 |
This theorem is referenced by: issmfdmpt 43846 smfconst 43847 |
Copyright terms: Public domain | W3C validator |