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

Theorem ovolfioo 23995
Description: Unpack the interval covering property of the outer measure definition. (Contributed by Mario Carneiro, 16-Mar-2014.)
Assertion
Ref Expression
ovolfioo ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐴 ran ((,) ∘ 𝐹) ↔ ∀𝑧𝐴𝑛 ∈ ℕ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
Distinct variable groups:   𝑧,𝑛,𝐴   𝑛,𝐹,𝑧

Proof of Theorem ovolfioo
StepHypRef Expression
1 ioof 12823 . . . . . 6 (,):(ℝ* × ℝ*)⟶𝒫 ℝ
2 inss2 4203 . . . . . . . 8 ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ × ℝ)
3 rexpssxrxp 10674 . . . . . . . 8 (ℝ × ℝ) ⊆ (ℝ* × ℝ*)
42, 3sstri 3973 . . . . . . 7 ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ* × ℝ*)
5 fss 6520 . . . . . . 7 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ* × ℝ*)) → 𝐹:ℕ⟶(ℝ* × ℝ*))
64, 5mpan2 687 . . . . . 6 (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → 𝐹:ℕ⟶(ℝ* × ℝ*))
7 fco 6524 . . . . . 6 (((,):(ℝ* × ℝ*)⟶𝒫 ℝ ∧ 𝐹:ℕ⟶(ℝ* × ℝ*)) → ((,) ∘ 𝐹):ℕ⟶𝒫 ℝ)
81, 6, 7sylancr 587 . . . . 5 (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → ((,) ∘ 𝐹):ℕ⟶𝒫 ℝ)
9 ffn 6507 . . . . 5 (((,) ∘ 𝐹):ℕ⟶𝒫 ℝ → ((,) ∘ 𝐹) Fn ℕ)
10 fniunfv 6997 . . . . 5 (((,) ∘ 𝐹) Fn ℕ → 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) = ran ((,) ∘ 𝐹))
118, 9, 103syl 18 . . . 4 (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) = ran ((,) ∘ 𝐹))
1211sseq2d 3996 . . 3 (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → (𝐴 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ 𝐴 ran ((,) ∘ 𝐹)))
1312adantl 482 . 2 ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐴 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ 𝐴 ran ((,) ∘ 𝐹)))
14 dfss3 3953 . . 3 (𝐴 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ ∀𝑧𝐴 𝑧 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛))
15 ssel2 3959 . . . . . 6 ((𝐴 ⊆ ℝ ∧ 𝑧𝐴) → 𝑧 ∈ ℝ)
16 eliun 4914 . . . . . . 7 (𝑧 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ ∃𝑛 ∈ ℕ 𝑧 ∈ (((,) ∘ 𝐹)‘𝑛))
17 rexr 10675 . . . . . . . . . 10 (𝑧 ∈ ℝ → 𝑧 ∈ ℝ*)
1817ad2antrr 722 . . . . . . . . 9 (((𝑧 ∈ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) ∧ 𝑛 ∈ ℕ) → 𝑧 ∈ ℝ*)
19 fvco3 6753 . . . . . . . . . . . . 13 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (((,) ∘ 𝐹)‘𝑛) = ((,)‘(𝐹𝑛)))
20 ffvelrn 6841 . . . . . . . . . . . . . . . . 17 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝐹𝑛) ∈ ( ≤ ∩ (ℝ × ℝ)))
2120elin2d 4173 . . . . . . . . . . . . . . . 16 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝐹𝑛) ∈ (ℝ × ℝ))
22 1st2nd2 7717 . . . . . . . . . . . . . . . 16 ((𝐹𝑛) ∈ (ℝ × ℝ) → (𝐹𝑛) = ⟨(1st ‘(𝐹𝑛)), (2nd ‘(𝐹𝑛))⟩)
2321, 22syl 17 . . . . . . . . . . . . . . 15 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝐹𝑛) = ⟨(1st ‘(𝐹𝑛)), (2nd ‘(𝐹𝑛))⟩)
2423fveq2d 6667 . . . . . . . . . . . . . 14 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → ((,)‘(𝐹𝑛)) = ((,)‘⟨(1st ‘(𝐹𝑛)), (2nd ‘(𝐹𝑛))⟩))
25 df-ov 7148 . . . . . . . . . . . . . 14 ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛))) = ((,)‘⟨(1st ‘(𝐹𝑛)), (2nd ‘(𝐹𝑛))⟩)
2624, 25syl6eqr 2871 . . . . . . . . . . . . 13 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → ((,)‘(𝐹𝑛)) = ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛))))
2719, 26eqtrd 2853 . . . . . . . . . . . 12 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (((,) ∘ 𝐹)‘𝑛) = ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛))))
2827eleq2d 2895 . . . . . . . . . . 11 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝑧 ∈ (((,) ∘ 𝐹)‘𝑛) ↔ 𝑧 ∈ ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛)))))
29 ovolfcl 23994 . . . . . . . . . . . 12 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹𝑛)) ∈ ℝ ∧ (1st ‘(𝐹𝑛)) ≤ (2nd ‘(𝐹𝑛))))
30 rexr 10675 . . . . . . . . . . . . . . 15 ((1st ‘(𝐹𝑛)) ∈ ℝ → (1st ‘(𝐹𝑛)) ∈ ℝ*)
31 rexr 10675 . . . . . . . . . . . . . . 15 ((2nd ‘(𝐹𝑛)) ∈ ℝ → (2nd ‘(𝐹𝑛)) ∈ ℝ*)
32 elioo1 12766 . . . . . . . . . . . . . . 15 (((1st ‘(𝐹𝑛)) ∈ ℝ* ∧ (2nd ‘(𝐹𝑛)) ∈ ℝ*) → (𝑧 ∈ ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛))) ↔ (𝑧 ∈ ℝ* ∧ (1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
3330, 31, 32syl2an 595 . . . . . . . . . . . . . 14 (((1st ‘(𝐹𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹𝑛)) ∈ ℝ) → (𝑧 ∈ ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛))) ↔ (𝑧 ∈ ℝ* ∧ (1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
34 3anass 1087 . . . . . . . . . . . . . 14 ((𝑧 ∈ ℝ* ∧ (1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛))) ↔ (𝑧 ∈ ℝ* ∧ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
3533, 34syl6bb 288 . . . . . . . . . . . . 13 (((1st ‘(𝐹𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹𝑛)) ∈ ℝ) → (𝑧 ∈ ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛))) ↔ (𝑧 ∈ ℝ* ∧ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛))))))
36353adant3 1124 . . . . . . . . . . . 12 (((1st ‘(𝐹𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹𝑛)) ∈ ℝ ∧ (1st ‘(𝐹𝑛)) ≤ (2nd ‘(𝐹𝑛))) → (𝑧 ∈ ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛))) ↔ (𝑧 ∈ ℝ* ∧ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛))))))
3729, 36syl 17 . . . . . . . . . . 11 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝑧 ∈ ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛))) ↔ (𝑧 ∈ ℝ* ∧ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛))))))
3828, 37bitrd 280 . . . . . . . . . 10 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝑧 ∈ (((,) ∘ 𝐹)‘𝑛) ↔ (𝑧 ∈ ℝ* ∧ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛))))))
3938adantll 710 . . . . . . . . 9 (((𝑧 ∈ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) ∧ 𝑛 ∈ ℕ) → (𝑧 ∈ (((,) ∘ 𝐹)‘𝑛) ↔ (𝑧 ∈ ℝ* ∧ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛))))))
4018, 39mpbirand 703 . . . . . . . 8 (((𝑧 ∈ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) ∧ 𝑛 ∈ ℕ) → (𝑧 ∈ (((,) ∘ 𝐹)‘𝑛) ↔ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
4140rexbidva 3293 . . . . . . 7 ((𝑧 ∈ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (∃𝑛 ∈ ℕ 𝑧 ∈ (((,) ∘ 𝐹)‘𝑛) ↔ ∃𝑛 ∈ ℕ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
4216, 41syl5bb 284 . . . . . 6 ((𝑧 ∈ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝑧 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ ∃𝑛 ∈ ℕ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
4315, 42sylan 580 . . . . 5 (((𝐴 ⊆ ℝ ∧ 𝑧𝐴) ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝑧 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ ∃𝑛 ∈ ℕ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
4443an32s 648 . . . 4 (((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) ∧ 𝑧𝐴) → (𝑧 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ ∃𝑛 ∈ ℕ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
4544ralbidva 3193 . . 3 ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (∀𝑧𝐴 𝑧 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ ∀𝑧𝐴𝑛 ∈ ℕ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
4614, 45syl5bb 284 . 2 ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐴 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ ∀𝑧𝐴𝑛 ∈ ℕ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
4713, 46bitr3d 282 1 ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐴 ran ((,) ∘ 𝐹) ↔ ∀𝑧𝐴𝑛 ∈ ℕ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  w3a 1079   = wceq 1528  wcel 2105  wral 3135  wrex 3136  cin 3932  wss 3933  𝒫 cpw 4535  cop 4563   cuni 4830   ciun 4910   class class class wbr 5057   × cxp 5546  ran crn 5549  ccom 5552   Fn wfn 6343  wf 6344  cfv 6348  (class class class)co 7145  1st c1st 7676  2nd c2nd 7677  cr 10524  *cxr 10662   < clt 10663  cle 10664  cn 11626  (,)cioo 12726
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7450  ax-cnex 10581  ax-resscn 10582  ax-pre-lttri 10599  ax-pre-lttrn 10600
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3or 1080  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ne 3014  df-nel 3121  df-ral 3140  df-rex 3141  df-rab 3144  df-v 3494  df-sbc 3770  df-csb 3881  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4464  df-pw 4537  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4831  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-id 5453  df-po 5467  df-so 5468  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-ov 7148  df-oprab 7149  df-mpo 7150  df-1st 7678  df-2nd 7679  df-er 8278  df-en 8498  df-dom 8499  df-sdom 8500  df-pnf 10665  df-mnf 10666  df-xr 10667  df-ltxr 10668  df-le 10669  df-ioo 12730
This theorem is referenced by:  ovollb2lem  24016  ovolunlem1  24025  ovoliunlem2  24031  ovolshftlem1  24037  ovolscalem1  24041  ioombl1lem4  24089
  Copyright terms: Public domain W3C validator