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 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 38415 | . . . 4 ⊢ (𝜑 → dom 𝐹 = 𝐷) |
3 | issmfd.d | . . . 4 ⊢ (𝜑 → 𝐷 ⊆ ∪ 𝑆) | |
4 | 2, 3 | eqsstrd 3602 | . . 3 ⊢ (𝜑 → dom 𝐹 ⊆ ∪ 𝑆) |
5 | 1 | ffdmd 5976 | . . 3 ⊢ (𝜑 → 𝐹:dom 𝐹⟶ℝ) |
6 | issmfd.a | . . . 4 ⊢ Ⅎ𝑎𝜑 | |
7 | issmfd.p | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷)) | |
8 | 2 | rabeqd 38304 | . . . . . . . 8 ⊢ (𝜑 → {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} = {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎}) |
9 | 2 | oveq2d 6565 | . . . . . . . 8 ⊢ (𝜑 → (𝑆 ↾t dom 𝐹) = (𝑆 ↾t 𝐷)) |
10 | 8, 9 | eleq12d 2682 | . . . . . . 7 ⊢ (𝜑 → ({𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹) ↔ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷))) |
11 | 10 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → ({𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹) ↔ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷))) |
12 | 7, 11 | mpbird 246 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹)) |
13 | 12 | ex 449 | . . . 4 ⊢ (𝜑 → (𝑎 ∈ ℝ → {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹))) |
14 | 6, 13 | ralrimi 2940 | . . 3 ⊢ (𝜑 → ∀𝑎 ∈ ℝ {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹)) |
15 | 4, 5, 14 | 3jca 1235 | . 2 ⊢ (𝜑 → (dom 𝐹 ⊆ ∪ 𝑆 ∧ 𝐹:dom 𝐹⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹))) |
16 | issmfd.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ SAlg) | |
17 | eqid 2610 | . . 3 ⊢ dom 𝐹 = dom 𝐹 | |
18 | 16, 17 | issmf 39614 | . 2 ⊢ (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (dom 𝐹 ⊆ ∪ 𝑆 ∧ 𝐹:dom 𝐹⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t dom 𝐹)))) |
19 | 15, 18 | mpbird 246 | 1 ⊢ (𝜑 → 𝐹 ∈ (SMblFn‘𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 ∧ w3a 1031 Ⅎwnf 1699 ∈ wcel 1977 ∀wral 2896 {crab 2900 ⊆ wss 3540 ∪ cuni 4372 class class class wbr 4583 dom cdm 5038 ⟶wf 5800 ‘cfv 5804 (class class class)co 6549 ℝcr 9814 < clt 9953 ↾t crest 15904 SAlgcsalg 39204 SMblFncsmblfn 39586 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-pre-lttri 9889 ax-pre-lttrn 9890 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-po 4959 df-so 4960 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-1st 7059 df-2nd 7060 df-er 7629 df-pm 7747 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-ioo 12050 df-ico 12052 df-smblfn 39587 |
This theorem is referenced by: sssmf 39625 mbfresmf 39626 cnfsmf 39627 incsmf 39629 smfsssmf 39630 smfres 39675 smfco 39687 |
Copyright terms: Public domain | W3C validator |