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 30356
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 1062 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝑅:𝑄⟶(0[,]+∞))
2 simp1 1061 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝑄𝑉)
3 fex 6490 . . . 4 ((𝑅:𝑄⟶(0[,]+∞) ∧ 𝑄𝑉) → 𝑅 ∈ V)
41, 2, 3syl2anc 693 . . 3 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝑅 ∈ V)
5 omsval 30355 . . 3 (𝑅 ∈ V → (toOMeas‘𝑅) = (𝑎 ∈ 𝒫 dom 𝑅 ↦ inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < )))
64, 5syl 17 . 2 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → (toOMeas‘𝑅) = (𝑎 ∈ 𝒫 dom 𝑅 ↦ inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < )))
7 simpr 477 . . . . . . . 8 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → 𝑎 = 𝐴)
87sseq1d 3632 . . . . . . 7 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → (𝑎 𝑧𝐴 𝑧))
98anbi1d 741 . . . . . 6 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → ((𝑎 𝑧𝑧 ≼ ω) ↔ (𝐴 𝑧𝑧 ≼ ω)))
109rabbidv 3189 . . . . 5 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} = {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)})
1110mpteq1d 4738 . . . 4 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)) = (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)))
1211rneqd 5353 . . 3 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)) = ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)))
1312infeq1d 8383 . 2 (((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) ∧ 𝑎 = 𝐴) → inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝑎 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ) = inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ))
14 simp3 1063 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝐴 𝑄)
15 fdm 6051 . . . . . 6 (𝑅:𝑄⟶(0[,]+∞) → dom 𝑅 = 𝑄)
16153ad2ant2 1083 . . . . 5 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → dom 𝑅 = 𝑄)
1716unieqd 4446 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → dom 𝑅 = 𝑄)
1814, 17sseqtr4d 3642 . . 3 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝐴 dom 𝑅)
19 elex 3212 . . . . . 6 (𝑄𝑉𝑄 ∈ V)
20 uniexb 6973 . . . . . . 7 (𝑄 ∈ V ↔ 𝑄 ∈ V)
2120biimpi 206 . . . . . 6 (𝑄 ∈ V → 𝑄 ∈ V)
222, 19, 213syl 18 . . . . 5 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝑄 ∈ V)
23 ssexg 4804 . . . . 5 ((𝐴 𝑄 𝑄 ∈ V) → 𝐴 ∈ V)
2414, 22, 23syl2anc 693 . . . 4 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝐴 ∈ V)
25 elpwg 4166 . . . 4 (𝐴 ∈ V → (𝐴 ∈ 𝒫 dom 𝑅𝐴 dom 𝑅))
2624, 25syl 17 . . 3 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → (𝐴 ∈ 𝒫 dom 𝑅𝐴 dom 𝑅))
2718, 26mpbird 247 . 2 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → 𝐴 ∈ 𝒫 dom 𝑅)
28 xrltso 11974 . . . 4 < Or ℝ*
29 iccssxr 12256 . . . . 5 (0[,]+∞) ⊆ ℝ*
30 soss 5053 . . . . 5 ((0[,]+∞) ⊆ ℝ* → ( < Or ℝ* → < Or (0[,]+∞)))
3129, 30ax-mp 5 . . . 4 ( < Or ℝ* → < Or (0[,]+∞))
3228, 31mp1i 13 . . 3 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → < Or (0[,]+∞))
3332infexd 8389 . 2 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ) ∈ V)
346, 13, 27, 33fvmptd 6288 1 ((𝑄𝑉𝑅:𝑄⟶(0[,]+∞) ∧ 𝐴 𝑄) → ((toOMeas‘𝑅)‘𝐴) = inf(ran (𝑥 ∈ {𝑧 ∈ 𝒫 dom 𝑅 ∣ (𝐴 𝑧𝑧 ≼ ω)} ↦ Σ*𝑦𝑥(𝑅𝑦)), (0[,]+∞), < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  w3a 1037   = wceq 1483  wcel 1990  {crab 2916  Vcvv 3200  wss 3574  𝒫 cpw 4158   cuni 4436   class class class wbr 4653  cmpt 4729   Or wor 5034  dom cdm 5114  ran crn 5115  wf 5884  cfv 5888  (class class class)co 6650  ωcom 7065  cdom 7953  infcinf 8347  0cc0 9936  +∞cpnf 10071  *cxr 10073   < clt 10074  [,]cicc 12178  Σ*cesum 30089  toOMeascoms 30353
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-cnex 9992  ax-resscn 9993  ax-pre-lttri 10010  ax-pre-lttrn 10011
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-po 5035  df-so 5036  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-sup 8348  df-inf 8349  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-icc 12182  df-esum 30090  df-oms 30354
This theorem is referenced by:  omsf  30358  oms0  30359  omsmon  30360  omssubaddlem  30361  omssubadd  30362
  Copyright terms: Public domain W3C validator