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

Theorem smfpreimalt 47946
Description: Given a function measurable w.r.t. to a sigma-algebra, the preimage of an open interval unbounded below is in the subspace sigma-algebra induced by its domain. (Contributed by Glauco Siliprandi, 26-Jun-2021.)
Hypotheses
Ref Expression
smfpreimalt.s (𝜑 → 𝑆 ∈ SAlg)
smfpreimalt.f (𝜑 → 𝐹 ∈ (SMblFn‘𝑆))
smfpreimalt.d 𝐷 = dom 𝐹
smfpreimalt.a (𝜑 → 𝐴 ∈ ℝ)
Assertion
Ref Expression
smfpreimalt (𝜑 → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝐴} ∈ (𝑆 ↾t 𝐷))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐷   𝑥,𝐹
Allowed substitution hints:   𝜑(𝑥)   𝑆(𝑥)

Proof of Theorem smfpreimalt
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 smfpreimalt.a . 2 (𝜑 → 𝐴 ∈ ℝ)
2 smfpreimalt.f . . . 4 (𝜑 → 𝐹 ∈ (SMblFn‘𝑆))
3 smfpreimalt.s . . . . 5 (𝜑 → 𝑆 ∈ SAlg)
4 smfpreimalt.d . . . . 5 𝐷 = dom 𝐹
53, 4issmf 47943 . . . 4 (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷))))
62, 5mpbid 235 . . 3 (𝜑 → (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷)))
76simp3d 1162 . 2 (𝜑 → ∀𝑎 ∈ ℝ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷))
8 breq2 5110 . . . . 5 (𝑎 = 𝐴 → ((𝐹‘𝑥) < 𝑎 ↔ (𝐹‘𝑥) < 𝐴))
98rabbidv 3423 . . . 4 (𝑎 = 𝐴 → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} = {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝐴})
109eleq1d 2849 . . 3 (𝑎 = 𝐴 → ({𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷) ↔ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝐴} ∈ (𝑆 ↾t 𝐷)))
1110rspcva 3578 . 2 ((𝐴 ∈ ℝ ∧ ∀𝑎 ∈ ℝ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝑎} ∈ (𝑆 ↾t 𝐷)) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝐴} ∈ (𝑆 ↾t 𝐷))
121, 7, 11syl2anc 596 1 (𝜑 → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) < 𝐴} ∈ (𝑆 ↾t 𝐷))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416   ⊆ wss 3900  ∪ cuni 4870   class class class wbr 5106  dom cdm 5655  ⟶wf 6554  ‘cfv 6558  (class class class)co 7443  ℝcr 11226   < clt 11370   ↾t crest 17620  SAlgcsalg 47523  SMblFncsmblfn 47910
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-cnex 11283  ax-resscn 11284  ax-pre-lttri 11301  ax-pre-lttrn 11302
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-po 5563  df-so 5564  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-1st 8025  df-2nd 8026  df-er 8745  df-pm 8878  df-en 9002  df-dom 9003  df-sdom 9004  df-pnf 11372  df-mnf 11373  df-xr 11374  df-ltxr 11375  df-le 11376  df-ioo 13507  df-ico 13509  df-smblfn 47911
This theorem is used by:  sssmf  47953  smfsssmf  47958  issmfle  47960  smflimlem6  47991  smfco  48017
  Copyright terms: Public domain W3C validator