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 45434
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 45433 . 2 (πœ‘ β†’ (𝐹 ∈ (SMblFnβ€˜π‘†) ↔ (𝐷 βŠ† βˆͺ 𝑆 ∧ 𝐹:π·βŸΆβ„ ∧ βˆ€π‘ ∈ ℝ {𝑦 ∈ 𝐷 ∣ (πΉβ€˜π‘¦) < 𝑏} ∈ (𝑆 β†Ύt 𝐷))))
4 breq2 5152 . . . . . . . 8 (𝑏 = π‘Ž β†’ ((πΉβ€˜π‘¦) < 𝑏 ↔ (πΉβ€˜π‘¦) < π‘Ž))
54rabbidv 3440 . . . . . . 7 (𝑏 = π‘Ž β†’ {𝑦 ∈ 𝐷 ∣ (πΉβ€˜π‘¦) < 𝑏} = {𝑦 ∈ 𝐷 ∣ (πΉβ€˜π‘¦) < π‘Ž})
65eleq1d 2818 . . . . . 6 (𝑏 = π‘Ž β†’ ({𝑦 ∈ 𝐷 ∣ (πΉβ€˜π‘¦) < 𝑏} ∈ (𝑆 β†Ύt 𝐷) ↔ {𝑦 ∈ 𝐷 ∣ (πΉβ€˜π‘¦) < π‘Ž} ∈ (𝑆 β†Ύt 𝐷)))
7 fveq2 6891 . . . . . . . . . 10 (𝑦 = π‘₯ β†’ (πΉβ€˜π‘¦) = (πΉβ€˜π‘₯))
87breq1d 5158 . . . . . . . . 9 (𝑦 = π‘₯ β†’ ((πΉβ€˜π‘¦) < π‘Ž ↔ (πΉβ€˜π‘₯) < π‘Ž))
98cbvrabv 3442 . . . . . . . 8 {𝑦 ∈ 𝐷 ∣ (πΉβ€˜π‘¦) < π‘Ž} = {π‘₯ ∈ 𝐷 ∣ (πΉβ€˜π‘₯) < π‘Ž}
109eleq1i 2824 . . . . . . 7 ({𝑦 ∈ 𝐷 ∣ (πΉβ€˜π‘¦) < π‘Ž} ∈ (𝑆 β†Ύt 𝐷) ↔ {π‘₯ ∈ 𝐷 ∣ (πΉβ€˜π‘₯) < π‘Ž} ∈ (𝑆 β†Ύt 𝐷))
1110a1i 11 . . . . . 6 (𝑏 = π‘Ž β†’ ({𝑦 ∈ 𝐷 ∣ (πΉβ€˜π‘¦) < π‘Ž} ∈ (𝑆 β†Ύt 𝐷) ↔ {π‘₯ ∈ 𝐷 ∣ (πΉβ€˜π‘₯) < π‘Ž} ∈ (𝑆 β†Ύt 𝐷)))
126, 11bitrd 278 . . . . 5 (𝑏 = π‘Ž β†’ ({𝑦 ∈ 𝐷 ∣ (πΉβ€˜π‘¦) < 𝑏} ∈ (𝑆 β†Ύt 𝐷) ↔ {π‘₯ ∈ 𝐷 ∣ (πΉβ€˜π‘₯) < π‘Ž} ∈ (𝑆 β†Ύt 𝐷)))
1312cbvralvw 3234 . . . 4 (βˆ€π‘ ∈ ℝ {𝑦 ∈ 𝐷 ∣ (πΉβ€˜π‘¦) < 𝑏} ∈ (𝑆 β†Ύt 𝐷) ↔ βˆ€π‘Ž ∈ ℝ {π‘₯ ∈ 𝐷 ∣ (πΉβ€˜π‘₯) < π‘Ž} ∈ (𝑆 β†Ύt 𝐷))
14133anbi3i 1159 . . 3 ((𝐷 βŠ† βˆͺ 𝑆 ∧ 𝐹:π·βŸΆβ„ ∧ βˆ€π‘ ∈ ℝ {𝑦 ∈ 𝐷 ∣ (πΉβ€˜π‘¦) < 𝑏} ∈ (𝑆 β†Ύt 𝐷)) ↔ (𝐷 βŠ† βˆͺ 𝑆 ∧ 𝐹:π·βŸΆβ„ ∧ βˆ€π‘Ž ∈ ℝ {π‘₯ ∈ 𝐷 ∣ (πΉβ€˜π‘₯) < π‘Ž} ∈ (𝑆 β†Ύt 𝐷)))
1514a1i 11 . 2 (πœ‘ β†’ ((𝐷 βŠ† βˆͺ 𝑆 ∧ 𝐹:π·βŸΆβ„ ∧ βˆ€π‘ ∈ ℝ {𝑦 ∈ 𝐷 ∣ (πΉβ€˜π‘¦) < 𝑏} ∈ (𝑆 β†Ύt 𝐷)) ↔ (𝐷 βŠ† βˆͺ 𝑆 ∧ 𝐹:π·βŸΆβ„ ∧ βˆ€π‘Ž ∈ ℝ {π‘₯ ∈ 𝐷 ∣ (πΉβ€˜π‘₯) < π‘Ž} ∈ (𝑆 β†Ύt 𝐷))))
163, 15bitrd 278 1 (πœ‘ β†’ (𝐹 ∈ (SMblFnβ€˜π‘†) ↔ (𝐷 βŠ† βˆͺ 𝑆 ∧ 𝐹:π·βŸΆβ„ ∧ βˆ€π‘Ž ∈ ℝ {π‘₯ ∈ 𝐷 ∣ (πΉβ€˜π‘₯) < π‘Ž} ∈ (𝑆 β†Ύt 𝐷))))
Colors of variables: wff setvar class
Syntax hints:   β†’ wi 4   ↔ wb 205   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  βˆ€wral 3061  {crab 3432   βŠ† wss 3948  βˆͺ cuni 4908   class class class wbr 5148  dom cdm 5676  βŸΆwf 6539  β€˜cfv 6543  (class class class)co 7408  β„cr 11108   < clt 11247   β†Ύt crest 17365  SAlgcsalg 45014  SMblFncsmblfn 45401
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7724  ax-cnex 11165  ax-resscn 11166  ax-pre-lttri 11183  ax-pre-lttrn 11184
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-po 5588  df-so 5589  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7974  df-2nd 7975  df-er 8702  df-pm 8822  df-en 8939  df-dom 8940  df-sdom 8941  df-pnf 11249  df-mnf 11250  df-xr 11251  df-ltxr 11252  df-le 11253  df-ioo 13327  df-ico 13329  df-smblfn 45402
This theorem is referenced by:  smfpreimalt  45437  smff  45438  smfdmss  45439  issmff  45440  issmfd  45441  issmflelem  45450  issmfgtlem  45461  issmfgelem  45475
  Copyright terms: Public domain W3C validator