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 35049
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 35048 . 2 (𝜑 → (𝑊sitm𝑀) = (𝑓 ∈ dom (𝑊sitg𝑀), 𝑔 ∈ dom (𝑊sitg𝑀) ↦ (((ℝ*𝑠 ↾s (0[,]+∞))sitg𝑀)‘(𝑓 ∘f 𝐷𝑔))))
5 simprl 783 . . . 4 ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → 𝑓 = 𝐹)
6 simprr 785 . . . 4 ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → 𝑔 = 𝐺)
75, 6oveq12d 7458 . . 3 ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → (𝑓 ∘f 𝐷𝑔) = (𝐹 ∘f 𝐷𝐺))
87fveq2d 6909 . 2 ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → (((ℝ*𝑠 ↾s (0[,]+∞))sitg𝑀)‘(𝑓 ∘f 𝐷𝑔)) = (((ℝ*𝑠 ↾s (0[,]+∞))sitg𝑀)‘(𝐹 ∘f 𝐷𝐺)))
9 sitmfval.1 . 2 (𝜑 → 𝐹 ∈ dom (𝑊sitg𝑀))
10 sitmfval.2 . 2 (𝜑 → 𝐺 ∈ dom (𝑊sitg𝑀))
11 fvexd 6920 . 2 (𝜑 → (((ℝ*𝑠 ↾s (0[,]+∞))sitg𝑀)‘(𝐹 ∘f 𝐷𝐺)) ∈ V)
124, 8, 9, 10, 11ovmpod 7593 1 (𝜑 → (𝐹(𝑊sitm𝑀)𝐺) = (((ℝ*𝑠 ↾s (0[,]+∞))sitg𝑀)‘(𝐹 ∘f 𝐷𝐺)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ∪ cuni 4870  dom cdm 5655  ran crn 5656  ‘cfv 6555  (class class class)co 7440   ∘f cof 7712  0cc0 11224  +∞cpnf 11364  [,]cicc 13503   ↾s cress 17434  distcds 17463  ℝ*𝑠cxrs 17698  measurescmeas 34895  sitmcsitm 35027  sitgcsitg 35028
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-of 7714  df-1st 8022  df-2nd 8023  df-sitm 35030
This theorem is used by:  sitmcl  35050  sitmf  35051
  Copyright terms: Public domain W3C validator