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

Theorem ovolfioo 23575
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 12521 . . . . . 6 (,):(ℝ* × ℝ*)⟶𝒫 ℝ
2 inss2 4029 . . . . . . . 8 ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ × ℝ)
3 rexpssxrxp 10373 . . . . . . . 8 (ℝ × ℝ) ⊆ (ℝ* × ℝ*)
42, 3sstri 3807 . . . . . . 7 ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ* × ℝ*)
5 fss 6269 . . . . . . 7 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ* × ℝ*)) → 𝐹:ℕ⟶(ℝ* × ℝ*))
64, 5mpan2 683 . . . . . 6 (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → 𝐹:ℕ⟶(ℝ* × ℝ*))
7 fco 6273 . . . . . 6 (((,):(ℝ* × ℝ*)⟶𝒫 ℝ ∧ 𝐹:ℕ⟶(ℝ* × ℝ*)) → ((,) ∘ 𝐹):ℕ⟶𝒫 ℝ)
81, 6, 7sylancr 582 . . . . 5 (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → ((,) ∘ 𝐹):ℕ⟶𝒫 ℝ)
9 ffn 6256 . . . . 5 (((,) ∘ 𝐹):ℕ⟶𝒫 ℝ → ((,) ∘ 𝐹) Fn ℕ)
10 fniunfv 6733 . . . . 5 (((,) ∘ 𝐹) Fn ℕ → 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) = ran ((,) ∘ 𝐹))
118, 9, 103syl 18 . . . 4 (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) = ran ((,) ∘ 𝐹))
1211sseq2d 3829 . . 3 (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → (𝐴 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ 𝐴 ran ((,) ∘ 𝐹)))
1312adantl 474 . 2 ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐴 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ 𝐴 ran ((,) ∘ 𝐹)))
14 dfss3 3787 . . 3 (𝐴 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ ∀𝑧𝐴 𝑧 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛))
15 ssel2 3793 . . . . . 6 ((𝐴 ⊆ ℝ ∧ 𝑧𝐴) → 𝑧 ∈ ℝ)
16 eliun 4714 . . . . . . 7 (𝑧 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ ∃𝑛 ∈ ℕ 𝑧 ∈ (((,) ∘ 𝐹)‘𝑛))
17 fvco3 6500 . . . . . . . . . . . . 13 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (((,) ∘ 𝐹)‘𝑛) = ((,)‘(𝐹𝑛)))
18 ffvelrn 6583 . . . . . . . . . . . . . . . . 17 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝐹𝑛) ∈ ( ≤ ∩ (ℝ × ℝ)))
192, 18sseldi 3796 . . . . . . . . . . . . . . . 16 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝐹𝑛) ∈ (ℝ × ℝ))
20 1st2nd2 7440 . . . . . . . . . . . . . . . 16 ((𝐹𝑛) ∈ (ℝ × ℝ) → (𝐹𝑛) = ⟨(1st ‘(𝐹𝑛)), (2nd ‘(𝐹𝑛))⟩)
2119, 20syl 17 . . . . . . . . . . . . . . 15 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝐹𝑛) = ⟨(1st ‘(𝐹𝑛)), (2nd ‘(𝐹𝑛))⟩)
2221fveq2d 6415 . . . . . . . . . . . . . 14 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → ((,)‘(𝐹𝑛)) = ((,)‘⟨(1st ‘(𝐹𝑛)), (2nd ‘(𝐹𝑛))⟩))
23 df-ov 6881 . . . . . . . . . . . . . 14 ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛))) = ((,)‘⟨(1st ‘(𝐹𝑛)), (2nd ‘(𝐹𝑛))⟩)
2422, 23syl6eqr 2851 . . . . . . . . . . . . 13 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → ((,)‘(𝐹𝑛)) = ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛))))
2517, 24eqtrd 2833 . . . . . . . . . . . 12 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (((,) ∘ 𝐹)‘𝑛) = ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛))))
2625eleq2d 2864 . . . . . . . . . . 11 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝑧 ∈ (((,) ∘ 𝐹)‘𝑛) ↔ 𝑧 ∈ ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛)))))
27 ovolfcl 23574 . . . . . . . . . . . 12 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹𝑛)) ∈ ℝ ∧ (1st ‘(𝐹𝑛)) ≤ (2nd ‘(𝐹𝑛))))
28 rexr 10374 . . . . . . . . . . . . . . 15 ((1st ‘(𝐹𝑛)) ∈ ℝ → (1st ‘(𝐹𝑛)) ∈ ℝ*)
29 rexr 10374 . . . . . . . . . . . . . . 15 ((2nd ‘(𝐹𝑛)) ∈ ℝ → (2nd ‘(𝐹𝑛)) ∈ ℝ*)
30 elioo1 12464 . . . . . . . . . . . . . . 15 (((1st ‘(𝐹𝑛)) ∈ ℝ* ∧ (2nd ‘(𝐹𝑛)) ∈ ℝ*) → (𝑧 ∈ ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛))) ↔ (𝑧 ∈ ℝ* ∧ (1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
3128, 29, 30syl2an 590 . . . . . . . . . . . . . 14 (((1st ‘(𝐹𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹𝑛)) ∈ ℝ) → (𝑧 ∈ ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛))) ↔ (𝑧 ∈ ℝ* ∧ (1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
32 3anass 1117 . . . . . . . . . . . . . 14 ((𝑧 ∈ ℝ* ∧ (1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛))) ↔ (𝑧 ∈ ℝ* ∧ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
3331, 32syl6bb 279 . . . . . . . . . . . . 13 (((1st ‘(𝐹𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹𝑛)) ∈ ℝ) → (𝑧 ∈ ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛))) ↔ (𝑧 ∈ ℝ* ∧ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛))))))
34333adant3 1163 . . . . . . . . . . . 12 (((1st ‘(𝐹𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹𝑛)) ∈ ℝ ∧ (1st ‘(𝐹𝑛)) ≤ (2nd ‘(𝐹𝑛))) → (𝑧 ∈ ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛))) ↔ (𝑧 ∈ ℝ* ∧ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛))))))
3527, 34syl 17 . . . . . . . . . . 11 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝑧 ∈ ((1st ‘(𝐹𝑛))(,)(2nd ‘(𝐹𝑛))) ↔ (𝑧 ∈ ℝ* ∧ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛))))))
3626, 35bitrd 271 . . . . . . . . . 10 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝑧 ∈ (((,) ∘ 𝐹)‘𝑛) ↔ (𝑧 ∈ ℝ* ∧ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛))))))
3736adantll 706 . . . . . . . . 9 (((𝑧 ∈ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) ∧ 𝑛 ∈ ℕ) → (𝑧 ∈ (((,) ∘ 𝐹)‘𝑛) ↔ (𝑧 ∈ ℝ* ∧ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛))))))
38 rexr 10374 . . . . . . . . . . 11 (𝑧 ∈ ℝ → 𝑧 ∈ ℝ*)
3938ad2antrr 718 . . . . . . . . . 10 (((𝑧 ∈ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) ∧ 𝑛 ∈ ℕ) → 𝑧 ∈ ℝ*)
4039biantrurd 529 . . . . . . . . 9 (((𝑧 ∈ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) ∧ 𝑛 ∈ ℕ) → (((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛))) ↔ (𝑧 ∈ ℝ* ∧ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛))))))
4137, 40bitr4d 274 . . . . . . . 8 (((𝑧 ∈ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) ∧ 𝑛 ∈ ℕ) → (𝑧 ∈ (((,) ∘ 𝐹)‘𝑛) ↔ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
4241rexbidva 3230 . . . . . . 7 ((𝑧 ∈ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (∃𝑛 ∈ ℕ 𝑧 ∈ (((,) ∘ 𝐹)‘𝑛) ↔ ∃𝑛 ∈ ℕ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
4316, 42syl5bb 275 . . . . . 6 ((𝑧 ∈ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝑧 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ ∃𝑛 ∈ ℕ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
4415, 43sylan 576 . . . . 5 (((𝐴 ⊆ ℝ ∧ 𝑧𝐴) ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝑧 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ ∃𝑛 ∈ ℕ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
4544an32s 643 . . . 4 (((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) ∧ 𝑧𝐴) → (𝑧 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ ∃𝑛 ∈ ℕ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
4645ralbidva 3166 . . 3 ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (∀𝑧𝐴 𝑧 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ ∀𝑧𝐴𝑛 ∈ ℕ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
4714, 46syl5bb 275 . 2 ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐴 𝑛 ∈ ℕ (((,) ∘ 𝐹)‘𝑛) ↔ ∀𝑧𝐴𝑛 ∈ ℕ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
4813, 47bitr3d 273 1 ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐴 ran ((,) ∘ 𝐹) ↔ ∀𝑧𝐴𝑛 ∈ ℕ ((1st ‘(𝐹𝑛)) < 𝑧𝑧 < (2nd ‘(𝐹𝑛)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 198  wa 385  w3a 1108   = wceq 1653  wcel 2157  wral 3089  wrex 3090  cin 3768  wss 3769  𝒫 cpw 4349  cop 4374   cuni 4628   ciun 4710   class class class wbr 4843   × cxp 5310  ran crn 5313  ccom 5316   Fn wfn 6096  wf 6097  cfv 6101  (class class class)co 6878  1st c1st 7399  2nd c2nd 7400  cr 10223  *cxr 10362   < clt 10363  cle 10364  cn 11312  (,)cioo 12424
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-8 2159  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2377  ax-ext 2777  ax-sep 4975  ax-nul 4983  ax-pow 5035  ax-pr 5097  ax-un 7183  ax-cnex 10280  ax-resscn 10281  ax-pre-lttri 10298  ax-pre-lttrn 10299
This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-3or 1109  df-3an 1110  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-mo 2591  df-eu 2609  df-clab 2786  df-cleq 2792  df-clel 2795  df-nfc 2930  df-ne 2972  df-nel 3075  df-ral 3094  df-rex 3095  df-rab 3098  df-v 3387  df-sbc 3634  df-csb 3729  df-dif 3772  df-un 3774  df-in 3776  df-ss 3783  df-nul 4116  df-if 4278  df-pw 4351  df-sn 4369  df-pr 4371  df-op 4375  df-uni 4629  df-iun 4712  df-br 4844  df-opab 4906  df-mpt 4923  df-id 5220  df-po 5233  df-so 5234  df-xp 5318  df-rel 5319  df-cnv 5320  df-co 5321  df-dm 5322  df-rn 5323  df-res 5324  df-ima 5325  df-iota 6064  df-fun 6103  df-fn 6104  df-f 6105  df-f1 6106  df-fo 6107  df-f1o 6108  df-fv 6109  df-ov 6881  df-oprab 6882  df-mpt2 6883  df-1st 7401  df-2nd 7402  df-er 7982  df-en 8196  df-dom 8197  df-sdom 8198  df-pnf 10365  df-mnf 10366  df-xr 10367  df-ltxr 10368  df-le 10369  df-ioo 12428
This theorem is referenced by:  ovollb2lem  23596  ovolunlem1  23605  ovoliunlem2  23611  ovolshftlem1  23617  ovolscalem1  23621  ioombl1lem4  23669
  Copyright terms: Public domain W3C validator