Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  issmf Structured version   Visualization version   GIF version

Theorem issmf 43004
Description: The predicate "𝐹 is a real-valued measurable function w.r.t. to the sigma-algebra 𝑆". A function is measurable iff the preimages of all open intervals unbounded below are in the subspace sigma-algebra induced by its domain. The domain of 𝐹 is required to be a subset of the underlying set of 𝑆. Definition 121C of [Fremlin1] p. 36, and Proposition 121B (i) of [Fremlin1] p. 35 . (Contributed by Glauco Siliprandi, 26-Jun-2021.)
Hypotheses
Ref Expression
issmf.s (𝜑𝑆 ∈ SAlg)
issmf.d 𝐷 = dom 𝐹
Assertion
Ref Expression
issmf (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (𝐷 𝑆𝐹:𝐷⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎} ∈ (𝑆t 𝐷))))
Distinct variable groups:   𝐷,𝑎,𝑥   𝐹,𝑎,𝑥   𝑆,𝑎
Allowed substitution hints:   𝜑(𝑥,𝑎)   𝑆(𝑥)

Proof of Theorem issmf
Dummy variables 𝑏 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 issmf.s . . 3 (𝜑𝑆 ∈ SAlg)
2 issmf.d . . 3 𝐷 = dom 𝐹
31, 2issmflem 43003 . 2 (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (𝐷 𝑆𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦𝐷 ∣ (𝐹𝑦) < 𝑏} ∈ (𝑆t 𝐷))))
4 breq2 5069 . . . . . . . 8 (𝑏 = 𝑎 → ((𝐹𝑦) < 𝑏 ↔ (𝐹𝑦) < 𝑎))
54rabbidv 3480 . . . . . . 7 (𝑏 = 𝑎 → {𝑦𝐷 ∣ (𝐹𝑦) < 𝑏} = {𝑦𝐷 ∣ (𝐹𝑦) < 𝑎})
65eleq1d 2897 . . . . . 6 (𝑏 = 𝑎 → ({𝑦𝐷 ∣ (𝐹𝑦) < 𝑏} ∈ (𝑆t 𝐷) ↔ {𝑦𝐷 ∣ (𝐹𝑦) < 𝑎} ∈ (𝑆t 𝐷)))
7 fveq2 6669 . . . . . . . . . 10 (𝑦 = 𝑥 → (𝐹𝑦) = (𝐹𝑥))
87breq1d 5075 . . . . . . . . 9 (𝑦 = 𝑥 → ((𝐹𝑦) < 𝑎 ↔ (𝐹𝑥) < 𝑎))
98cbvrabv 3491 . . . . . . . 8 {𝑦𝐷 ∣ (𝐹𝑦) < 𝑎} = {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎}
109eleq1i 2903 . . . . . . 7 ({𝑦𝐷 ∣ (𝐹𝑦) < 𝑎} ∈ (𝑆t 𝐷) ↔ {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎} ∈ (𝑆t 𝐷))
1110a1i 11 . . . . . 6 (𝑏 = 𝑎 → ({𝑦𝐷 ∣ (𝐹𝑦) < 𝑎} ∈ (𝑆t 𝐷) ↔ {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎} ∈ (𝑆t 𝐷)))
126, 11bitrd 281 . . . . 5 (𝑏 = 𝑎 → ({𝑦𝐷 ∣ (𝐹𝑦) < 𝑏} ∈ (𝑆t 𝐷) ↔ {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎} ∈ (𝑆t 𝐷)))
1312cbvralvw 3449 . . . 4 (∀𝑏 ∈ ℝ {𝑦𝐷 ∣ (𝐹𝑦) < 𝑏} ∈ (𝑆t 𝐷) ↔ ∀𝑎 ∈ ℝ {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎} ∈ (𝑆t 𝐷))
14133anbi3i 1155 . . 3 ((𝐷 𝑆𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦𝐷 ∣ (𝐹𝑦) < 𝑏} ∈ (𝑆t 𝐷)) ↔ (𝐷 𝑆𝐹:𝐷⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎} ∈ (𝑆t 𝐷)))
1514a1i 11 . 2 (𝜑 → ((𝐷 𝑆𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦𝐷 ∣ (𝐹𝑦) < 𝑏} ∈ (𝑆t 𝐷)) ↔ (𝐷 𝑆𝐹:𝐷⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎} ∈ (𝑆t 𝐷))))
163, 15bitrd 281 1 (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (𝐷 𝑆𝐹:𝐷⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎} ∈ (𝑆t 𝐷))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  w3a 1083   = wceq 1533  wcel 2110  wral 3138  {crab 3142  wss 3935   cuni 4837   class class class wbr 5065  dom cdm 5554  wf 6350  cfv 6354  (class class class)co 7155  cr 10535   < clt 10674  t crest 16693  SAlgcsalg 42592  SMblFncsmblfn 42976
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pow 5265  ax-pr 5329  ax-un 7460  ax-cnex 10592  ax-resscn 10593  ax-pre-lttri 10610  ax-pre-lttrn 10611
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4838  df-iun 4920  df-br 5066  df-opab 5128  df-mpt 5146  df-id 5459  df-po 5473  df-so 5474  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-ov 7158  df-oprab 7159  df-mpo 7160  df-1st 7688  df-2nd 7689  df-er 8288  df-pm 8408  df-en 8509  df-dom 8510  df-sdom 8511  df-pnf 10676  df-mnf 10677  df-xr 10678  df-ltxr 10679  df-le 10680  df-ioo 12741  df-ico 12743  df-smblfn 42977
This theorem is referenced by:  smfpreimalt  43007  smff  43008  smfdmss  43009  issmff  43010  issmfd  43011  issmflelem  43020  issmfgtlem  43031  issmfgelem  43044
  Copyright terms: Public domain W3C validator