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 45768
Description: The outer measure of a set is greater than 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 44294 . . . . . 6 (𝜑𝑋 ∈ V)
5 omessle.b . . . . . 6 (𝜑𝐵𝑋)
64, 5ssexd 5317 . . . . 5 (𝜑𝐵 ∈ V)
76, 1ssexd 5317 . . . 4 (𝜑𝐴 ∈ V)
8 elpwg 4600 . . . 4 (𝐴 ∈ V → (𝐴 ∈ 𝒫 𝐵𝐴𝐵))
97, 8syl 17 . . 3 (𝜑 → (𝐴 ∈ 𝒫 𝐵𝐴𝐵))
101, 9mpbird 257 . 2 (𝜑𝐴 ∈ 𝒫 𝐵)
115, 3sseqtrdi 4027 . . . 4 (𝜑𝐵 dom 𝑂)
12 elpwg 4600 . . . . 5 (𝐵 ∈ V → (𝐵 ∈ 𝒫 dom 𝑂𝐵 dom 𝑂))
136, 12syl 17 . . . 4 (𝜑 → (𝐵 ∈ 𝒫 dom 𝑂𝐵 dom 𝑂))
1411, 13mpbird 257 . . 3 (𝜑𝐵 ∈ 𝒫 dom 𝑂)
15 isome 45764 . . . . . 6 (𝑂 ∈ OutMeas → (𝑂 ∈ OutMeas ↔ ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂𝑧 ∈ 𝒫 𝑦(𝑂𝑧) ≤ (𝑂𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂 𝑦) ≤ (Σ^‘(𝑂𝑦))))))
162, 15syl 17 . . . . 5 (𝜑 → (𝑂 ∈ OutMeas ↔ ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂𝑧 ∈ 𝒫 𝑦(𝑂𝑧) ≤ (𝑂𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂 𝑦) ≤ (Σ^‘(𝑂𝑦))))))
172, 16mpbid 231 . . . 4 (𝜑 → ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂𝑧 ∈ 𝒫 𝑦(𝑂𝑧) ≤ (𝑂𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂 𝑦) ≤ (Σ^‘(𝑂𝑦)))))
1817simplrd 767 . . 3 (𝜑 → ∀𝑦 ∈ 𝒫 dom 𝑂𝑧 ∈ 𝒫 𝑦(𝑂𝑧) ≤ (𝑂𝑦))
19 pweq 4611 . . . . . 6 (𝑦 = 𝐵 → 𝒫 𝑦 = 𝒫 𝐵)
2019raleqdv 3319 . . . . 5 (𝑦 = 𝐵 → (∀𝑧 ∈ 𝒫 𝑦(𝑂𝑧) ≤ (𝑂𝑦) ↔ ∀𝑧 ∈ 𝒫 𝐵(𝑂𝑧) ≤ (𝑂𝑦)))
21 fveq2 6884 . . . . . . 7 (𝑦 = 𝐵 → (𝑂𝑦) = (𝑂𝐵))
2221breq2d 5153 . . . . . 6 (𝑦 = 𝐵 → ((𝑂𝑧) ≤ (𝑂𝑦) ↔ (𝑂𝑧) ≤ (𝑂𝐵)))
2322ralbidv 3171 . . . . 5 (𝑦 = 𝐵 → (∀𝑧 ∈ 𝒫 𝐵(𝑂𝑧) ≤ (𝑂𝑦) ↔ ∀𝑧 ∈ 𝒫 𝐵(𝑂𝑧) ≤ (𝑂𝐵)))
2420, 23bitrd 279 . . . 4 (𝑦 = 𝐵 → (∀𝑧 ∈ 𝒫 𝑦(𝑂𝑧) ≤ (𝑂𝑦) ↔ ∀𝑧 ∈ 𝒫 𝐵(𝑂𝑧) ≤ (𝑂𝐵)))
2524rspcva 3604 . . 3 ((𝐵 ∈ 𝒫 dom 𝑂 ∧ ∀𝑦 ∈ 𝒫 dom 𝑂𝑧 ∈ 𝒫 𝑦(𝑂𝑧) ≤ (𝑂𝑦)) → ∀𝑧 ∈ 𝒫 𝐵(𝑂𝑧) ≤ (𝑂𝐵))
2614, 18, 25syl2anc 583 . 2 (𝜑 → ∀𝑧 ∈ 𝒫 𝐵(𝑂𝑧) ≤ (𝑂𝐵))
27 fveq2 6884 . . . 4 (𝑧 = 𝐴 → (𝑂𝑧) = (𝑂𝐴))
2827breq1d 5151 . . 3 (𝑧 = 𝐴 → ((𝑂𝑧) ≤ (𝑂𝐵) ↔ (𝑂𝐴) ≤ (𝑂𝐵)))
2928rspcva 3604 . 2 ((𝐴 ∈ 𝒫 𝐵 ∧ ∀𝑧 ∈ 𝒫 𝐵(𝑂𝑧) ≤ (𝑂𝐵)) → (𝑂𝐴) ≤ (𝑂𝐵))
3010, 26, 29syl2anc 583 1 (𝜑 → (𝑂𝐴) ≤ (𝑂𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1533  wcel 2098  wral 3055  Vcvv 3468  wss 3943  c0 4317  𝒫 cpw 4597   cuni 4902   class class class wbr 5141  dom cdm 5669  cres 5671  wf 6532  cfv 6536  (class class class)co 7404  ωcom 7851  cdom 8936  0cc0 11109  +∞cpnf 11246  cle 11250  [,]cicc 13330  Σ^csumge0 45632  OutMeascome 45759
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420  ax-un 7721
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2704  df-cleq 2718  df-clel 2804  df-ral 3056  df-rex 3065  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-br 5142  df-opab 5204  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-res 5681  df-iota 6488  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ome 45760
This theorem is referenced by:  omessre  45780  omeiunltfirp  45789  carageniuncllem2  45792  caratheodorylem2  45797  omess0  45804  caragencmpl  45805
  Copyright terms: Public domain W3C validator