Metamath Proof Explorer


Theorem issmflelem

Description: The predicate " F is a real-valued measurable function w.r.t. to the sigma-algebra S ". 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 F is required to be a subset of the underlying set of S . Definition 121C of Fremlin1 p. 36, and Proposition 121B (ii) of Fremlin1 p. 35 . (Contributed by Glauco Siliprandi, 26-Jun-2021)

Ref Expression
Hypotheses issmflelem.x ⊢ Ⅎ x φ
issmflelem.a ⊢ Ⅎ a φ
issmflelem.s ⊢ φ → S ∈ SAlg
issmflelem.d ⊢ D = dom ⁡ F
issmflelem.i ⊢ φ → D ⊆ ⋃ S
issmflelem.f ⊢ φ → F : D ⟶ ℝ
issmflelem.l ⊢ φ ∧ a ∈ ℝ → x ∈ D | F ⁡ x ≤ a ∈ S ↾ 𝑡 D
Assertion issmflelem ⊢ φ → F ∈ SMblFn ⁡ S

Proof

Step Hyp Ref Expression
1 issmflelem.x ⊢ Ⅎ x φ
2 issmflelem.a ⊢ Ⅎ a φ
3 issmflelem.s ⊢ φ → S ∈ SAlg
4 issmflelem.d ⊢ D = dom ⁡ F
5 issmflelem.i ⊢ φ → D ⊆ ⋃ S
6 issmflelem.f ⊢ φ → F : D ⟶ ℝ
7 issmflelem.l ⊢ φ ∧ a ∈ ℝ → x ∈ D | F ⁡ x ≤ a ∈ S ↾ 𝑡 D
8 3 adantr ⊢ φ ∧ D ⊆ ⋃ S → S ∈ SAlg
9 simpr ⊢ φ ∧ D ⊆ ⋃ S → D ⊆ ⋃ S
10 8 9 restuni4 ⊢ φ ∧ D ⊆ ⋃ S → ⋃ S ↾ 𝑡 D = D
11 10 eqcomd ⊢ φ ∧ D ⊆ ⋃ S → D = ⋃ S ↾ 𝑡 D
12 5 11 mpdan ⊢ φ → D = ⋃ S ↾ 𝑡 D
13 12 rabeqdv ⊢ φ → x ∈ D | F ⁡ x < b = x ∈ ⋃ S ↾ 𝑡 D | F ⁡ x < b
14 13 adantr ⊢ φ ∧ b ∈ ℝ → x ∈ D | F ⁡ x < b = x ∈ ⋃ S ↾ 𝑡 D | F ⁡ x < b
15 nfv ⊢ Ⅎ x b ∈ ℝ
16 1 15 nfan ⊢ Ⅎ x φ ∧ b ∈ ℝ
17 nfv ⊢ Ⅎ a b ∈ ℝ
18 2 17 nfan ⊢ Ⅎ a φ ∧ b ∈ ℝ
19 3 uniexd ⊢ φ → ⋃ S ∈ V
20 19 adantr ⊢ φ ∧ D ⊆ ⋃ S → ⋃ S ∈ V
21 20 9 ssexd ⊢ φ ∧ D ⊆ ⋃ S → D ∈ V
22 eqid ⊢ S ↾ 𝑡 D = S ↾ 𝑡 D
23 8 21 22 subsalsal ⊢ φ ∧ D ⊆ ⋃ S → S ↾ 𝑡 D ∈ SAlg
24 5 23 mpdan ⊢ φ → S ↾ 𝑡 D ∈ SAlg
25 24 adantr ⊢ φ ∧ b ∈ ℝ → S ↾ 𝑡 D ∈ SAlg
26 eqid ⊢ ⋃ S ↾ 𝑡 D = ⋃ S ↾ 𝑡 D
27 simpr ⊢ φ ∧ x ∈ ⋃ S ↾ 𝑡 D → x ∈ ⋃ S ↾ 𝑡 D
28 5 10 mpdan ⊢ φ → ⋃ S ↾ 𝑡 D = D
29 28 adantr ⊢ φ ∧ x ∈ ⋃ S ↾ 𝑡 D → ⋃ S ↾ 𝑡 D = D
30 27 29 eleqtrd ⊢ φ ∧ x ∈ ⋃ S ↾ 𝑡 D → x ∈ D
31 6 ffvelcdmda ⊢ φ ∧ x ∈ D → F ⁡ x ∈ ℝ
32 30 31 syldan ⊢ φ ∧ x ∈ ⋃ S ↾ 𝑡 D → F ⁡ x ∈ ℝ
33 32 rexrd ⊢ φ ∧ x ∈ ⋃ S ↾ 𝑡 D → F ⁡ x ∈ ℝ *
34 33 adantlr ⊢ φ ∧ b ∈ ℝ ∧ x ∈ ⋃ S ↾ 𝑡 D → F ⁡ x ∈ ℝ *
35 28 rabeqdv ⊢ φ → x ∈ ⋃ S ↾ 𝑡 D | F ⁡ x ≤ a = x ∈ D | F ⁡ x ≤ a
36 35 adantr ⊢ φ ∧ a ∈ ℝ → x ∈ ⋃ S ↾ 𝑡 D | F ⁡ x ≤ a = x ∈ D | F ⁡ x ≤ a
37 36 7 eqeltrd ⊢ φ ∧ a ∈ ℝ → x ∈ ⋃ S ↾ 𝑡 D | F ⁡ x ≤ a ∈ S ↾ 𝑡 D
38 37 adantlr ⊢ φ ∧ b ∈ ℝ ∧ a ∈ ℝ → x ∈ ⋃ S ↾ 𝑡 D | F ⁡ x ≤ a ∈ S ↾ 𝑡 D
39 simpr ⊢ φ ∧ b ∈ ℝ → b ∈ ℝ
40 16 18 25 26 34 38 39 salpreimalelt ⊢ φ ∧ b ∈ ℝ → x ∈ ⋃ S ↾ 𝑡 D | F ⁡ x < b ∈ S ↾ 𝑡 D
41 14 40 eqeltrd ⊢ φ ∧ b ∈ ℝ → x ∈ D | F ⁡ x < b ∈ S ↾ 𝑡 D
42 41 ralrimiva ⊢ φ → ∀ b ∈ ℝ x ∈ D | F ⁡ x < b ∈ S ↾ 𝑡 D
43 5 6 42 3jca ⊢ φ → D ⊆ ⋃ S ∧ F : D ⟶ ℝ ∧ ∀ b ∈ ℝ x ∈ D | F ⁡ x < b ∈ S ↾ 𝑡 D
44 3 4 issmf ⊢ φ → F ∈ SMblFn ⁡ S ↔ D ⊆ ⋃ S ∧ F : D ⟶ ℝ ∧ ∀ b ∈ ℝ x ∈ D | F ⁡ x < b ∈ S ↾ 𝑡 D
45 43 44 mpbird ⊢ φ → F ∈ SMblFn ⁡ S