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

Theorem sitmfval 34749
Description: Value of the integral distance between two simple functions. (Contributed by Thierry Arnoux, 30-Jan-2018.)
Hypotheses
Ref Expression
sitmval.d 𝐷 = (dist‘𝑊)
sitmval.1 (𝜑𝑊𝑉)
sitmval.2 (𝜑𝑀 ran measures)
sitmfval.1 (𝜑𝐹 ∈ dom (𝑊sitg𝑀))
sitmfval.2 (𝜑𝐺 ∈ dom (𝑊sitg𝑀))
Assertion
Ref Expression
sitmfval (𝜑 → (𝐹(𝑊sitm𝑀)𝐺) = (((ℝ*𝑠s (0[,]+∞))sitg𝑀)‘(𝐹f 𝐷𝐺)))

Proof of Theorem sitmfval
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sitmval.d . . 3 𝐷 = (dist‘𝑊)
2 sitmval.1 . . 3 (𝜑𝑊𝑉)
3 sitmval.2 . . 3 (𝜑𝑀 ran measures)
41, 2, 3sitmval 34748 . 2 (𝜑 → (𝑊sitm𝑀) = (𝑓 ∈ dom (𝑊sitg𝑀), 𝑔 ∈ dom (𝑊sitg𝑀) ↦ (((ℝ*𝑠s (0[,]+∞))sitg𝑀)‘(𝑓f 𝐷𝑔))))
5 simprl 782 . . . 4 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → 𝑓 = 𝐹)
6 simprr 784 . . . 4 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → 𝑔 = 𝐺)
75, 6oveq12d 7428 . . 3 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → (𝑓f 𝐷𝑔) = (𝐹f 𝐷𝐺))
87fveq2d 6885 . 2 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → (((ℝ*𝑠s (0[,]+∞))sitg𝑀)‘(𝑓f 𝐷𝑔)) = (((ℝ*𝑠s (0[,]+∞))sitg𝑀)‘(𝐹f 𝐷𝐺)))
9 sitmfval.1 . 2 (𝜑𝐹 ∈ dom (𝑊sitg𝑀))
10 sitmfval.2 . 2 (𝜑𝐺 ∈ dom (𝑊sitg𝑀))
11 fvexd 6896 . 2 (𝜑 → (((ℝ*𝑠s (0[,]+∞))sitg𝑀)‘(𝐹f 𝐷𝐺)) ∈ V)
124, 8, 9, 10, 11ovmpod 7562 1 (𝜑 → (𝐹(𝑊sitm𝑀)𝐺) = (((ℝ*𝑠s (0[,]+∞))sitg𝑀)‘(𝐹f 𝐷𝐺)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 400   = wceq 1570  wcel 2143  Vcvv 3455   cuni 4872  dom cdm 5661  ran crn 5662  cfv 6536  (class class class)co 7410  f cof 7672  0cc0 11104  +∞cpnf 11244  [,]cicc 13379  s cress 17294  distcds 17323  *𝑠cxrs 17558  measurescmeas 34594  sitmcsitm 34727  sitgcsitg 34728
This proof depends on 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
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  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-ral 3080  df-rex 3090  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-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-of 7674  df-1st 7982  df-2nd 7983  df-sitm 34730
This theorem is used by:  sitmcl  34750  sitmf  34751
  Copyright terms: Public domain W3C validator