Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  omsfval Structured version   Visualization version   GIF version

Theorem omsfval 34684
Description: Value of the outer measure evaluated for a given set 𝐴. (Contributed by Thierry Arnoux, 15-Sep-2019.) (Revised by AV, 4-Oct-2020.)
Assertion
Ref Expression
omsfval ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → ((toOMeas‘𝑅)‘𝐴) = inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ))
Distinct variable groups:   𝑥,𝑦,𝑧,𝑅   𝑥,𝐴,𝑦,𝑧   𝑥,𝑄,𝑦,𝑧   𝑥,𝑉,𝑦,𝑧

Proof of Theorem omsfval
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 simp2 1155 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝑅:𝑄⟶(0[,]+∞))
2 simp1 1154 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝑄𝑉)
31, 2fexd 7225 . . 3 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝑅 ∈ V)
4 omsval 34683 . . 3 (𝑅 ∈ V → (toOMeas‘𝑅) = (𝑎 ∈ 𝒫 dom 𝑅 ↦ inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < )))
53, 4syl 18 . 2 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → (toOMeas‘𝑅) = (𝑎 ∈ 𝒫 dom 𝑅 ↦ inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < )))
6 simpr 489 . . . . . . . 8 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → 𝑎 = 𝐴)
76sseq1d 3968 . . . . . . 7 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → (𝑎 𝑧𝐴 𝑧))
87anbi1d 642 . . . . . 6 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → ((𝑎 𝑧𝑧 ≼ ω) ↔ (𝐴 𝑧𝑧 ≼ ω)))
98rabbidv 3423 . . . . 5 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} = {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)})
109mpteq1d 5201 . . . 4 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)) = (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)))
1110rneqd 5928 . . 3 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)) = ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)))
1211infeq1d 9434 . 2 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ) = inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ))
13 simp3 1156 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝐴 𝑄)
14 fdm 6715 . . . . . 6 (𝑅:𝑄⟶(0[,]+∞) → dom 𝑅 = 𝑄)
15143ad2ant2 1152 . . . . 5 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → dom 𝑅 = 𝑄)
1615unieqd 4885 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → dom 𝑅 = 𝑄)
1713, 16sseqtrrd 3974 . . 3 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝐴 dom 𝑅)
182uniexd 7740 . . . . 5 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝑄 ∈ V)
19 ssexg 5290 . . . . 5 ((𝐴 𝑄 𝑄 ∈ V) → 𝐴 ∈ V)
2013, 18, 19syl2anc 595 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝐴 ∈ V)
21 elpwg 4565 . . . 4 (𝐴 ∈ V → (𝐴 ∈ 𝒫 dom 𝑅𝐴 dom 𝑅))
2220, 21syl 18 . . 3 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → (𝐴 ∈ 𝒫 dom 𝑅𝐴 dom 𝑅))
2317, 22mpbird 260 . 2 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝐴 ∈ 𝒫 dom 𝑅)
24 xrltso 13161 . . . 4 < Or ℝ*
25 iccssxr 13452 . . . . 5 (0[,]+∞) ⊆ ℝ*
26 soss 5589 . . . . 5 ((0[,]+∞) ⊆ ℝ* → ( < Or ℝ* → < Or (0[,]+∞)))
2725, 26ax-mp 5 . . . 4 ( < Or ℝ* → < Or (0[,]+∞))
2824, 27mp1i 14 . . 3 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → < Or (0[,]+∞))
2928infexd 9440 . 2 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ) ∈ V)
305, 12, 23, 29fvmptd 6997 1 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → ((toOMeas‘𝑅)‘𝐴) = inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1103   = wceq 1570  wcel 2143  {crab 3416  Vcvv 3455  wss 3905  𝒫 cpw 4562   cuni 4872   class class class wbr 5109  cmpt 5192   Or wor 5568  dom cdm 5661  ran crn 5662  wf 6532  cfv 6536  (class class class)co 7410  ωcom 7858  cdom 8937  infcinf 9397  0cc0 11095  +∞cpnf 11235  *cxr 11237   < clt 11238  [,]cicc 13370  Σ*cesum 34417  toOMeascoms 34681
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11151  ax-resscn 11152  ax-pre-lttri 11169  ax-pre-lttrn 11170
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-po 5569  df-so 5570  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-sup 9398  df-inf 9399  df-pnf 11240  df-mnf 11241  df-xr 11242  df-ltxr 11243  df-icc 13374  df-esum 34418  df-oms 34682
This theorem is referenced by:  omsf  34686  oms0  34687  omsmon  34688  omssubaddlem  34689  omssubadd  34690
  Copyright terms: Public domain W3C validator