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 34438
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 1138 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝑅:𝑄⟶(0[,]+∞))
2 simp1 1137 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝑄𝑉)
31, 2fexd 7182 . . 3 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝑅 ∈ V)
4 omsval 34437 . . 3 (𝑅 ∈ V → (toOMeas‘𝑅) = (𝑎 ∈ 𝒫 dom 𝑅 ↦ inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < )))
53, 4syl 17 . 2 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → (toOMeas‘𝑅) = (𝑎 ∈ 𝒫 dom 𝑅 ↦ inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < )))
6 simpr 484 . . . . . . . 8 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → 𝑎 = 𝐴)
76sseq1d 3953 . . . . . . 7 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → (𝑎 𝑧𝐴 𝑧))
87anbi1d 632 . . . . . 6 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → ((𝑎 𝑧𝑧 ≼ ω) ↔ (𝐴 𝑧𝑧 ≼ ω)))
98rabbidv 3396 . . . . 5 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} = {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)})
109mpteq1d 5175 . . . 4 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)) = (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)))
1110rneqd 5893 . . 3 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)) = ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)))
1211infeq1d 9391 . 2 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ) = inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ))
13 simp3 1139 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝐴 𝑄)
14 fdm 6677 . . . . . 6 (𝑅:𝑄⟶(0[,]+∞) → dom 𝑅 = 𝑄)
15143ad2ant2 1135 . . . . 5 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → dom 𝑅 = 𝑄)
1615unieqd 4863 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → dom 𝑅 = 𝑄)
1713, 16sseqtrrd 3959 . . 3 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝐴 dom 𝑅)
182uniexd 7696 . . . . 5 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝑄 ∈ V)
19 ssexg 5264 . . . . 5 ((𝐴 𝑄 𝑄 ∈ V) → 𝐴 ∈ V)
2013, 18, 19syl2anc 585 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝐴 ∈ V)
21 elpwg 4544 . . . 4 (𝐴 ∈ V → (𝐴 ∈ 𝒫 dom 𝑅𝐴 dom 𝑅))
2220, 21syl 17 . . 3 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → (𝐴 ∈ 𝒫 dom 𝑅𝐴 dom 𝑅))
2317, 22mpbird 257 . 2 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝐴 ∈ 𝒫 dom 𝑅)
24 xrltso 13092 . . . 4 < Or ℝ*
25 iccssxr 13383 . . . . 5 (0[,]+∞) ⊆ ℝ*
26 soss 5559 . . . . 5 ((0[,]+∞) ⊆ ℝ* → ( < Or ℝ* → < Or (0[,]+∞)))
2725, 26ax-mp 5 . . . 4 ( < Or ℝ* → < Or (0[,]+∞))
2824, 27mp1i 13 . . 3 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → < Or (0[,]+∞))
2928infexd 9397 . 2 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ) ∈ V)
305, 12, 23, 29fvmptd 6955 1 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → ((toOMeas‘𝑅)‘𝐴) = inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  {crab 3389  Vcvv 3429  wss 3889  𝒫 cpw 4541   cuni 4850   class class class wbr 5085  cmpt 5166   Or wor 5538  dom cdm 5631  ran crn 5632  wf 6494  cfv 6498  (class class class)co 7367  ωcom 7817  cdom 8891  infcinf 9354  0cc0 11038  +∞cpnf 11176  *cxr 11178   < clt 11179  [,]cicc 13301  Σ*cesum 34171  toOMeascoms 34435
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-pre-lttri 11112  ax-pre-lttrn 11113
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-po 5539  df-so 5540  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-sup 9355  df-inf 9356  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-icc 13305  df-esum 34172  df-oms 34436
This theorem is referenced by:  omsf  34440  oms0  34441  omsmon  34442  omssubaddlem  34443  omssubadd  34444
  Copyright terms: Public domain W3C validator