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 40700
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 40699 . 2 (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (𝐷 𝑆𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦𝐷 ∣ (𝐹𝑦) < 𝑏} ∈ (𝑆t 𝐷))))
4 breq2 4648 . . . . . . . 8 (𝑏 = 𝑎 → ((𝐹𝑦) < 𝑏 ↔ (𝐹𝑦) < 𝑎))
54rabbidv 3184 . . . . . . 7 (𝑏 = 𝑎 → {𝑦𝐷 ∣ (𝐹𝑦) < 𝑏} = {𝑦𝐷 ∣ (𝐹𝑦) < 𝑎})
65eleq1d 2684 . . . . . 6 (𝑏 = 𝑎 → ({𝑦𝐷 ∣ (𝐹𝑦) < 𝑏} ∈ (𝑆t 𝐷) ↔ {𝑦𝐷 ∣ (𝐹𝑦) < 𝑎} ∈ (𝑆t 𝐷)))
7 fveq2 6178 . . . . . . . . . 10 (𝑦 = 𝑥 → (𝐹𝑦) = (𝐹𝑥))
87breq1d 4654 . . . . . . . . 9 (𝑦 = 𝑥 → ((𝐹𝑦) < 𝑎 ↔ (𝐹𝑥) < 𝑎))
98cbvrabv 3194 . . . . . . . 8 {𝑦𝐷 ∣ (𝐹𝑦) < 𝑎} = {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎}
109eleq1i 2690 . . . . . . 7 ({𝑦𝐷 ∣ (𝐹𝑦) < 𝑎} ∈ (𝑆t 𝐷) ↔ {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎} ∈ (𝑆t 𝐷))
1110a1i 11 . . . . . 6 (𝑏 = 𝑎 → ({𝑦𝐷 ∣ (𝐹𝑦) < 𝑎} ∈ (𝑆t 𝐷) ↔ {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎} ∈ (𝑆t 𝐷)))
126, 11bitrd 268 . . . . 5 (𝑏 = 𝑎 → ({𝑦𝐷 ∣ (𝐹𝑦) < 𝑏} ∈ (𝑆t 𝐷) ↔ {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎} ∈ (𝑆t 𝐷)))
1312cbvralv 3166 . . . 4 (∀𝑏 ∈ ℝ {𝑦𝐷 ∣ (𝐹𝑦) < 𝑏} ∈ (𝑆t 𝐷) ↔ ∀𝑎 ∈ ℝ {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎} ∈ (𝑆t 𝐷))
14133anbi3i 1253 . . 3 ((𝐷 𝑆𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦𝐷 ∣ (𝐹𝑦) < 𝑏} ∈ (𝑆t 𝐷)) ↔ (𝐷 𝑆𝐹:𝐷⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎} ∈ (𝑆t 𝐷)))
1514a1i 11 . 2 (𝜑 → ((𝐷 𝑆𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦𝐷 ∣ (𝐹𝑦) < 𝑏} ∈ (𝑆t 𝐷)) ↔ (𝐷 𝑆𝐹:𝐷⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎} ∈ (𝑆t 𝐷))))
163, 15bitrd 268 1 (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (𝐷 𝑆𝐹:𝐷⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥𝐷 ∣ (𝐹𝑥) < 𝑎} ∈ (𝑆t 𝐷))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  w3a 1036   = wceq 1481  wcel 1988  wral 2909  {crab 2913  wss 3567   cuni 4427   class class class wbr 4644  dom cdm 5104  wf 5872  cfv 5876  (class class class)co 6635  cr 9920   < clt 10059  t crest 16062  SAlgcsalg 40291  SMblFncsmblfn 40672
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-8 1990  ax-9 1997  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244  ax-ext 2600  ax-sep 4772  ax-nul 4780  ax-pow 4834  ax-pr 4897  ax-un 6934  ax-cnex 9977  ax-resscn 9978  ax-pre-lttri 9995  ax-pre-lttrn 9996
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1484  df-ex 1703  df-nf 1708  df-sb 1879  df-eu 2472  df-mo 2473  df-clab 2607  df-cleq 2613  df-clel 2616  df-nfc 2751  df-ne 2792  df-nel 2895  df-ral 2914  df-rex 2915  df-rab 2918  df-v 3197  df-sbc 3430  df-csb 3527  df-dif 3570  df-un 3572  df-in 3574  df-ss 3581  df-nul 3908  df-if 4078  df-pw 4151  df-sn 4169  df-pr 4171  df-op 4175  df-uni 4428  df-iun 4513  df-br 4645  df-opab 4704  df-mpt 4721  df-id 5014  df-po 5025  df-so 5026  df-xp 5110  df-rel 5111  df-cnv 5112  df-co 5113  df-dm 5114  df-rn 5115  df-res 5116  df-ima 5117  df-iota 5839  df-fun 5878  df-fn 5879  df-f 5880  df-f1 5881  df-fo 5882  df-f1o 5883  df-fv 5884  df-ov 6638  df-oprab 6639  df-mpt2 6640  df-1st 7153  df-2nd 7154  df-er 7727  df-pm 7845  df-en 7941  df-dom 7942  df-sdom 7943  df-pnf 10061  df-mnf 10062  df-xr 10063  df-ltxr 10064  df-le 10065  df-ioo 12164  df-ico 12166  df-smblfn 40673
This theorem is referenced by:  smfpreimalt  40703  smff  40704  smfdmss  40705  issmff  40706  issmfd  40707  issmflelem  40716  issmfgtlem  40727  issmfgelem  40740
  Copyright terms: Public domain W3C validator