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 34628
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 1153 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝑅:𝑄⟶(0[,]+∞))
2 simp1 1152 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝑄𝑉)
31, 2fexd 7226 . . 3 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝑅 ∈ V)
4 omsval 34627 . . 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 3976 . . . . . . 7 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → (𝑎 𝑧𝐴 𝑧))
87anbi1d 642 . . . . . 6 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → ((𝑎 𝑧𝑧 ≼ ω) ↔ (𝐴 𝑧𝑧 ≼ ω)))
98rabbidv 3430 . . . . 5 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} = {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)})
109mpteq1d 5205 . . . 4 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)) = (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)))
1110rneqd 5929 . . 3 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)) = ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)))
1211infeq1d 9437 . 2 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ) = inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ))
13 simp3 1154 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝐴 𝑄)
14 fdm 6716 . . . . . 6 (𝑅:𝑄⟶(0[,]+∞) → dom 𝑅 = 𝑄)
15143ad2ant2 1150 . . . . 5 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → dom 𝑅 = 𝑄)
1615unieqd 4889 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → dom 𝑅 = 𝑄)
1713, 16sseqtrrd 3982 . . 3 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝐴 dom 𝑅)
182uniexd 7740 . . . . 5 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝑄 ∈ V)
19 ssexg 5294 . . . . 5 ((𝐴 𝑄 𝑄 ∈ V) → 𝐴 ∈ V)
2013, 18, 19syl2anc 595 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝐴 ∈ V)
21 elpwg 4570 . . . 4 (𝐴 ∈ V → (𝐴 ∈ 𝒫 dom 𝑅𝐴 dom 𝑅))
2220, 21syl 18 . . 3 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → (𝐴 ∈ 𝒫 dom 𝑅𝐴 dom 𝑅))
2317, 22mpbird 260 . 2 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝐴 ∈ 𝒫 dom 𝑅)
24 xrltso 13165 . . . 4 < Or ℝ*
25 iccssxr 13456 . . . . 5 (0[,]+∞) ⊆ ℝ*
26 soss 5590 . . . . 5 ((0[,]+∞) ⊆ ℝ* → ( < Or ℝ* → < Or (0[,]+∞)))
2725, 26ax-mp 5 . . . 4 ( < Or ℝ* → < Or (0[,]+∞))
2824, 27mp1i 14 . . 3 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → < Or (0[,]+∞))
2928infexd 9443 . 2 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ) ∈ V)
305, 12, 23, 29fvmptd 6998 1 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → ((toOMeas‘𝑅)‘𝐴) = inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1101   = wceq 1567  wcel 2149  {crab 3423  Vcvv 3463  wss 3913  𝒫 cpw 4567   cuni 4876   class class class wbr 5113  cmpt 5196   Or wor 5569  dom cdm 5662  ran crn 5663  wf 6533  cfv 6537  (class class class)co 7411  ωcom 7861  cdom 8940  infcinf 9400  0cc0 11099  +∞cpnf 11239  *cxr 11241   < clt 11242  [,]cicc 13374  Σ*cesum 34361  toOMeascoms 34625
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-cnex 11155  ax-resscn 11156  ax-pre-lttri 11173  ax-pre-lttrn 11174
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-po 5570  df-so 5571  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-1st 7985  df-2nd 7986  df-er 8693  df-en 8943  df-dom 8944  df-sdom 8945  df-sup 9401  df-inf 9402  df-pnf 11244  df-mnf 11245  df-xr 11246  df-ltxr 11247  df-icc 13378  df-esum 34362  df-oms 34626
This theorem is referenced by:  omsf  34630  oms0  34631  omsmon  34632  omssubaddlem  34633  omssubadd  34634
  Copyright terms: Public domain W3C validator