MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ovolfsval Structured version   Visualization version   GIF version

Theorem ovolfsval 22990
Description: The value of the interval length function. (Contributed by Mario Carneiro, 16-Mar-2014.)
Hypothesis
Ref Expression
ovolfs.1 𝐺 = ((abs ∘ − ) ∘ 𝐹)
Assertion
Ref Expression
ovolfsval ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (𝐺𝑁) = ((2nd ‘(𝐹𝑁)) − (1st ‘(𝐹𝑁))))

Proof of Theorem ovolfsval
StepHypRef Expression
1 ovolfs.1 . . . 4 𝐺 = ((abs ∘ − ) ∘ 𝐹)
21fveq1i 6088 . . 3 (𝐺𝑁) = (((abs ∘ − ) ∘ 𝐹)‘𝑁)
3 fvco3 6169 . . 3 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐹)‘𝑁) = ((abs ∘ − )‘(𝐹𝑁)))
42, 3syl5eq 2655 . 2 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (𝐺𝑁) = ((abs ∘ − )‘(𝐹𝑁)))
5 inss2 3795 . . . . . . 7 ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ × ℝ)
6 ffvelrn 6249 . . . . . . 7 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (𝐹𝑁) ∈ ( ≤ ∩ (ℝ × ℝ)))
75, 6sseldi 3565 . . . . . 6 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (𝐹𝑁) ∈ (ℝ × ℝ))
8 1st2nd2 7073 . . . . . 6 ((𝐹𝑁) ∈ (ℝ × ℝ) → (𝐹𝑁) = ⟨(1st ‘(𝐹𝑁)), (2nd ‘(𝐹𝑁))⟩)
97, 8syl 17 . . . . 5 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (𝐹𝑁) = ⟨(1st ‘(𝐹𝑁)), (2nd ‘(𝐹𝑁))⟩)
109fveq2d 6091 . . . 4 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → ((abs ∘ − )‘(𝐹𝑁)) = ((abs ∘ − )‘⟨(1st ‘(𝐹𝑁)), (2nd ‘(𝐹𝑁))⟩))
11 df-ov 6529 . . . 4 ((1st ‘(𝐹𝑁))(abs ∘ − )(2nd ‘(𝐹𝑁))) = ((abs ∘ − )‘⟨(1st ‘(𝐹𝑁)), (2nd ‘(𝐹𝑁))⟩)
1210, 11syl6eqr 2661 . . 3 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → ((abs ∘ − )‘(𝐹𝑁)) = ((1st ‘(𝐹𝑁))(abs ∘ − )(2nd ‘(𝐹𝑁))))
13 ovolfcl 22986 . . . . . . 7 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → ((1st ‘(𝐹𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹𝑁)) ∈ ℝ ∧ (1st ‘(𝐹𝑁)) ≤ (2nd ‘(𝐹𝑁))))
1413simp1d 1065 . . . . . 6 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (1st ‘(𝐹𝑁)) ∈ ℝ)
1514recnd 9924 . . . . 5 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (1st ‘(𝐹𝑁)) ∈ ℂ)
1613simp2d 1066 . . . . . 6 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (2nd ‘(𝐹𝑁)) ∈ ℝ)
1716recnd 9924 . . . . 5 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (2nd ‘(𝐹𝑁)) ∈ ℂ)
18 eqid 2609 . . . . . 6 (abs ∘ − ) = (abs ∘ − )
1918cnmetdval 22331 . . . . 5 (((1st ‘(𝐹𝑁)) ∈ ℂ ∧ (2nd ‘(𝐹𝑁)) ∈ ℂ) → ((1st ‘(𝐹𝑁))(abs ∘ − )(2nd ‘(𝐹𝑁))) = (abs‘((1st ‘(𝐹𝑁)) − (2nd ‘(𝐹𝑁)))))
2015, 17, 19syl2anc 690 . . . 4 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → ((1st ‘(𝐹𝑁))(abs ∘ − )(2nd ‘(𝐹𝑁))) = (abs‘((1st ‘(𝐹𝑁)) − (2nd ‘(𝐹𝑁)))))
21 abssuble0 13864 . . . . 5 (((1st ‘(𝐹𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹𝑁)) ∈ ℝ ∧ (1st ‘(𝐹𝑁)) ≤ (2nd ‘(𝐹𝑁))) → (abs‘((1st ‘(𝐹𝑁)) − (2nd ‘(𝐹𝑁)))) = ((2nd ‘(𝐹𝑁)) − (1st ‘(𝐹𝑁))))
2213, 21syl 17 . . . 4 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (abs‘((1st ‘(𝐹𝑁)) − (2nd ‘(𝐹𝑁)))) = ((2nd ‘(𝐹𝑁)) − (1st ‘(𝐹𝑁))))
2320, 22eqtrd 2643 . . 3 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → ((1st ‘(𝐹𝑁))(abs ∘ − )(2nd ‘(𝐹𝑁))) = ((2nd ‘(𝐹𝑁)) − (1st ‘(𝐹𝑁))))
2412, 23eqtrd 2643 . 2 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → ((abs ∘ − )‘(𝐹𝑁)) = ((2nd ‘(𝐹𝑁)) − (1st ‘(𝐹𝑁))))
254, 24eqtrd 2643 1 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (𝐺𝑁) = ((2nd ‘(𝐹𝑁)) − (1st ‘(𝐹𝑁))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 382  w3a 1030   = wceq 1474  wcel 1976  cin 3538  cop 4130   class class class wbr 4577   × cxp 5025  ccom 5031  wf 5785  cfv 5789  (class class class)co 6526  1st c1st 7034  2nd c2nd 7035  cc 9790  cr 9791  cle 9931  cmin 10117  cn 10869  abscabs 13770
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1712  ax-4 1727  ax-5 1826  ax-6 1874  ax-7 1921  ax-8 1978  ax-9 1985  ax-10 2005  ax-11 2020  ax-12 2033  ax-13 2233  ax-ext 2589  ax-sep 4703  ax-nul 4711  ax-pow 4763  ax-pr 4827  ax-un 6824  ax-cnex 9848  ax-resscn 9849  ax-1cn 9850  ax-icn 9851  ax-addcl 9852  ax-addrcl 9853  ax-mulcl 9854  ax-mulrcl 9855  ax-mulcom 9856  ax-addass 9857  ax-mulass 9858  ax-distr 9859  ax-i2m1 9860  ax-1ne0 9861  ax-1rid 9862  ax-rnegex 9863  ax-rrecex 9864  ax-cnre 9865  ax-pre-lttri 9866  ax-pre-lttrn 9867  ax-pre-ltadd 9868  ax-pre-mulgt0 9869  ax-pre-sup 9870
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3or 1031  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1867  df-eu 2461  df-mo 2462  df-clab 2596  df-cleq 2602  df-clel 2605  df-nfc 2739  df-ne 2781  df-nel 2782  df-ral 2900  df-rex 2901  df-reu 2902  df-rmo 2903  df-rab 2904  df-v 3174  df-sbc 3402  df-csb 3499  df-dif 3542  df-un 3544  df-in 3546  df-ss 3553  df-pss 3555  df-nul 3874  df-if 4036  df-pw 4109  df-sn 4125  df-pr 4127  df-tp 4129  df-op 4131  df-uni 4367  df-iun 4451  df-br 4578  df-opab 4638  df-mpt 4639  df-tr 4675  df-eprel 4938  df-id 4942  df-po 4948  df-so 4949  df-fr 4986  df-we 4988  df-xp 5033  df-rel 5034  df-cnv 5035  df-co 5036  df-dm 5037  df-rn 5038  df-res 5039  df-ima 5040  df-pred 5582  df-ord 5628  df-on 5629  df-lim 5630  df-suc 5631  df-iota 5753  df-fun 5791  df-fn 5792  df-f 5793  df-f1 5794  df-fo 5795  df-f1o 5796  df-fv 5797  df-riota 6488  df-ov 6529  df-oprab 6530  df-mpt2 6531  df-om 6935  df-1st 7036  df-2nd 7037  df-wrecs 7271  df-recs 7332  df-rdg 7370  df-er 7606  df-en 7819  df-dom 7820  df-sdom 7821  df-sup 8208  df-pnf 9932  df-mnf 9933  df-xr 9934  df-ltxr 9935  df-le 9936  df-sub 10119  df-neg 10120  df-div 10536  df-nn 10870  df-2 10928  df-3 10929  df-n0 11142  df-z 11213  df-uz 11522  df-rp 11667  df-seq 12621  df-exp 12680  df-cj 13635  df-re 13636  df-im 13637  df-sqrt 13771  df-abs 13772
This theorem is referenced by:  ovolfsf  22991  ovollb2lem  23007  ovolunlem1a  23015  ovoliunlem1  23021  ovolshftlem1  23028  ovolscalem1  23032  ovolicc1  23035  ovolicc2lem4  23039  ioombl1lem3  23079  ovolfs2  23089  uniioovol  23097  uniioombllem3  23103
  Copyright terms: Public domain W3C validator