Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  omessle Structured version   Visualization version   GIF version

Theorem omessle 41226
Description: The outer measure of a set is larger or equal to the measure of a subset, Definition 113A (ii) of [Fremlin1] p. 19. (Contributed by Glauco Siliprandi, 17-Aug-2020.)
Hypotheses
Ref Expression
omessle.o (𝜑𝑂 ∈ OutMeas)
omessle.x 𝑋 = dom 𝑂
omessle.b (𝜑𝐵𝑋)
omessle.a (𝜑𝐴𝐵)
Assertion
Ref Expression
omessle (𝜑 → (𝑂𝐴) ≤ (𝑂𝐵))

Proof of Theorem omessle
Dummy variables 𝑧 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 omessle.a . . 3 (𝜑𝐴𝐵)
2 omessle.o . . . . . . 7 (𝜑𝑂 ∈ OutMeas)
3 omessle.x . . . . . . 7 𝑋 = dom 𝑂
42, 3unidmex 39732 . . . . . 6 (𝜑𝑋 ∈ V)
5 omessle.b . . . . . 6 (𝜑𝐵𝑋)
64, 5ssexd 4936 . . . . 5 (𝜑𝐵 ∈ V)
76, 1ssexd 4936 . . . 4 (𝜑𝐴 ∈ V)
8 elpwg 4303 . . . 4 (𝐴 ∈ V → (𝐴 ∈ 𝒫 𝐵𝐴𝐵))
97, 8syl 17 . . 3 (𝜑 → (𝐴 ∈ 𝒫 𝐵𝐴𝐵))
101, 9mpbird 247 . 2 (𝜑𝐴 ∈ 𝒫 𝐵)
115, 3syl6sseq 3798 . . . 4 (𝜑𝐵 dom 𝑂)
12 elpwg 4303 . . . . 5 (𝐵 ∈ V → (𝐵 ∈ 𝒫 dom 𝑂𝐵 dom 𝑂))
136, 12syl 17 . . . 4 (𝜑 → (𝐵 ∈ 𝒫 dom 𝑂𝐵 dom 𝑂))
1411, 13mpbird 247 . . 3 (𝜑𝐵 ∈ 𝒫 dom 𝑂)
15 isome 41222 . . . . . 6 (𝑂 ∈ OutMeas → (𝑂 ∈ OutMeas ↔ ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂𝑧 ∈ 𝒫 𝑦(𝑂𝑧) ≤ (𝑂𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂 𝑦) ≤ (Σ^‘(𝑂𝑦))))))
162, 15syl 17 . . . . 5 (𝜑 → (𝑂 ∈ OutMeas ↔ ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂𝑧 ∈ 𝒫 𝑦(𝑂𝑧) ≤ (𝑂𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂 𝑦) ≤ (Σ^‘(𝑂𝑦))))))
172, 16mpbid 222 . . . 4 (𝜑 → ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂𝑧 ∈ 𝒫 𝑦(𝑂𝑧) ≤ (𝑂𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂 𝑦) ≤ (Σ^‘(𝑂𝑦)))))
1817simplrd 745 . . 3 (𝜑 → ∀𝑦 ∈ 𝒫 dom 𝑂𝑧 ∈ 𝒫 𝑦(𝑂𝑧) ≤ (𝑂𝑦))
19 pweq 4298 . . . . . 6 (𝑦 = 𝐵 → 𝒫 𝑦 = 𝒫 𝐵)
2019raleqdv 3292 . . . . 5 (𝑦 = 𝐵 → (∀𝑧 ∈ 𝒫 𝑦(𝑂𝑧) ≤ (𝑂𝑦) ↔ ∀𝑧 ∈ 𝒫 𝐵(𝑂𝑧) ≤ (𝑂𝑦)))
21 fveq2 6332 . . . . . . 7 (𝑦 = 𝐵 → (𝑂𝑦) = (𝑂𝐵))
2221breq2d 4796 . . . . . 6 (𝑦 = 𝐵 → ((𝑂𝑧) ≤ (𝑂𝑦) ↔ (𝑂𝑧) ≤ (𝑂𝐵)))
2322ralbidv 3134 . . . . 5 (𝑦 = 𝐵 → (∀𝑧 ∈ 𝒫 𝐵(𝑂𝑧) ≤ (𝑂𝑦) ↔ ∀𝑧 ∈ 𝒫 𝐵(𝑂𝑧) ≤ (𝑂𝐵)))
2420, 23bitrd 268 . . . 4 (𝑦 = 𝐵 → (∀𝑧 ∈ 𝒫 𝑦(𝑂𝑧) ≤ (𝑂𝑦) ↔ ∀𝑧 ∈ 𝒫 𝐵(𝑂𝑧) ≤ (𝑂𝐵)))
2524rspcva 3456 . . 3 ((𝐵 ∈ 𝒫 dom 𝑂 ∧ ∀𝑦 ∈ 𝒫 dom 𝑂𝑧 ∈ 𝒫 𝑦(𝑂𝑧) ≤ (𝑂𝑦)) → ∀𝑧 ∈ 𝒫 𝐵(𝑂𝑧) ≤ (𝑂𝐵))
2614, 18, 25syl2anc 565 . 2 (𝜑 → ∀𝑧 ∈ 𝒫 𝐵(𝑂𝑧) ≤ (𝑂𝐵))
27 fveq2 6332 . . . 4 (𝑧 = 𝐴 → (𝑂𝑧) = (𝑂𝐴))
2827breq1d 4794 . . 3 (𝑧 = 𝐴 → ((𝑂𝑧) ≤ (𝑂𝐵) ↔ (𝑂𝐴) ≤ (𝑂𝐵)))
2928rspcva 3456 . 2 ((𝐴 ∈ 𝒫 𝐵 ∧ ∀𝑧 ∈ 𝒫 𝐵(𝑂𝑧) ≤ (𝑂𝐵)) → (𝑂𝐴) ≤ (𝑂𝐵))
3010, 26, 29syl2anc 565 1 (𝜑 → (𝑂𝐴) ≤ (𝑂𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 382   = wceq 1630  wcel 2144  wral 3060  Vcvv 3349  wss 3721  c0 4061  𝒫 cpw 4295   cuni 4572   class class class wbr 4784  dom cdm 5249  cres 5251  wf 6027  cfv 6031  (class class class)co 6792  ωcom 7211  cdom 8106  0cc0 10137  +∞cpnf 10272  cle 10276  [,]cicc 12382  Σ^csumge0 41090  OutMeascome 41217
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056  ax-7 2092  ax-8 2146  ax-9 2153  ax-10 2173  ax-11 2189  ax-12 2202  ax-13 2407  ax-ext 2750  ax-sep 4912  ax-nul 4920  ax-pr 5034  ax-un 7095
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-3an 1072  df-tru 1633  df-ex 1852  df-nf 1857  df-sb 2049  df-eu 2621  df-mo 2622  df-clab 2757  df-cleq 2763  df-clel 2766  df-nfc 2901  df-ral 3065  df-rex 3066  df-rab 3069  df-v 3351  df-dif 3724  df-un 3726  df-in 3728  df-ss 3735  df-nul 4062  df-if 4224  df-pw 4297  df-sn 4315  df-pr 4317  df-op 4321  df-uni 4573  df-br 4785  df-opab 4845  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-fv 6039  df-ome 41218
This theorem is referenced by:  omessre  41238  omeiunltfirp  41247  carageniuncllem2  41250  caratheodorylem2  41255  omess0  41262  caragencmpl  41263
  Copyright terms: Public domain W3C validator