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

Theorem caragensplit 47843
Description: If 𝐸 is in the set generated by the Caratheodory's method, then it splits any set 𝐴 in two parts such that the sum of the outer measures of the two parts is equal to the outer measure of the whole set 𝐴. (Contributed by Glauco Siliprandi, 17-Aug-2020.)
Hypotheses
Ref Expression
caragensplit.o (𝜑 → 𝑂 ∈ OutMeas)
caragensplit.s 𝑆 = (CaraGen‘𝑂)
caragensplit.x 𝑋 = ∪ dom 𝑂
caragensplit.e (𝜑 → 𝐸 ∈ 𝑆)
caragensplit.a (𝜑 → 𝐴 ⊆ 𝑋)
Assertion
Ref Expression
caragensplit (𝜑 → ((𝑂‘(𝐴 ∩ 𝐸)) +e (𝑂‘(𝐴 ∖ 𝐸))) = (𝑂‘𝐴))

Proof of Theorem caragensplit
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 caragensplit.a . . . 4 (𝜑 → 𝐴 ⊆ 𝑋)
2 caragensplit.o . . . . . . 7 (𝜑 → 𝑂 ∈ OutMeas)
3 caragensplit.x . . . . . . 7 𝑋 = ∪ dom 𝑂
42, 3unidmex 46401 . . . . . 6 (𝜑 → 𝑋 ∈ V)
5 ssexg 5287 . . . . . 6 ((𝐴 ⊆ 𝑋 ∧ 𝑋 ∈ V) → 𝐴 ∈ V)
61, 4, 5syl2anc 596 . . . . 5 (𝜑 → 𝐴 ∈ V)
7 elpwg 4562 . . . . 5 (𝐴 ∈ V → (𝐴 ∈ 𝒫 𝑋 ↔ 𝐴 ⊆ 𝑋))
86, 7syl 18 . . . 4 (𝜑 → (𝐴 ∈ 𝒫 𝑋 ↔ 𝐴 ⊆ 𝑋))
91, 8mpbird 260 . . 3 (𝜑 → 𝐴 ∈ 𝒫 𝑋)
103pweqi 4575 . . 3 𝒫 𝑋 = 𝒫 ∪ dom 𝑂
119, 10eleqtrdi 2877 . 2 (𝜑 → 𝐴 ∈ 𝒫 ∪ dom 𝑂)
12 caragensplit.e . . . 4 (𝜑 → 𝐸 ∈ 𝑆)
13 caragensplit.s . . . . 5 𝑆 = (CaraGen‘𝑂)
142, 13caragenel 47838 . . . 4 (𝜑 → (𝐸 ∈ 𝑆 ↔ (𝐸 ∈ 𝒫 ∪ dom 𝑂 ∧ ∀𝑎 ∈ 𝒫 ∪ dom 𝑂((𝑂‘(𝑎 ∩ 𝐸)) +e (𝑂‘(𝑎 ∖ 𝐸))) = (𝑂‘𝑎))))
1512, 14mpbid 235 . . 3 (𝜑 → (𝐸 ∈ 𝒫 ∪ dom 𝑂 ∧ ∀𝑎 ∈ 𝒫 ∪ dom 𝑂((𝑂‘(𝑎 ∩ 𝐸)) +e (𝑂‘(𝑎 ∖ 𝐸))) = (𝑂‘𝑎)))
1615simprd 501 . 2 (𝜑 → ∀𝑎 ∈ 𝒫 ∪ dom 𝑂((𝑂‘(𝑎 ∩ 𝐸)) +e (𝑂‘(𝑎 ∖ 𝐸))) = (𝑂‘𝑎))
17 ineq1 4112 . . . . . 6 (𝑎 = 𝐴 → (𝑎 ∩ 𝐸) = (𝐴 ∩ 𝐸))
1817fveq2d 6919 . . . . 5 (𝑎 = 𝐴 → (𝑂‘(𝑎 ∩ 𝐸)) = (𝑂‘(𝐴 ∩ 𝐸)))
19 difeq1 4058 . . . . . 6 (𝑎 = 𝐴 → (𝑎 ∖ 𝐸) = (𝐴 ∖ 𝐸))
2019fveq2d 6919 . . . . 5 (𝑎 = 𝐴 → (𝑂‘(𝑎 ∖ 𝐸)) = (𝑂‘(𝐴 ∖ 𝐸)))
2118, 20oveq12d 7468 . . . 4 (𝑎 = 𝐴 → ((𝑂‘(𝑎 ∩ 𝐸)) +e (𝑂‘(𝑎 ∖ 𝐸))) = ((𝑂‘(𝐴 ∩ 𝐸)) +e (𝑂‘(𝐴 ∖ 𝐸))))
22 fveq2 6915 . . . 4 (𝑎 = 𝐴 → (𝑂‘𝑎) = (𝑂‘𝐴))
2321, 22eqeq12d 2782 . . 3 (𝑎 = 𝐴 → (((𝑂‘(𝑎 ∩ 𝐸)) +e (𝑂‘(𝑎 ∖ 𝐸))) = (𝑂‘𝑎) ↔ ((𝑂‘(𝐴 ∩ 𝐸)) +e (𝑂‘(𝐴 ∖ 𝐸))) = (𝑂‘𝐴)))
2423rspcva 3577 . 2 ((𝐴 ∈ 𝒫 ∪ dom 𝑂 ∧ ∀𝑎 ∈ 𝒫 ∪ dom 𝑂((𝑂‘(𝑎 ∩ 𝐸)) +e (𝑂‘(𝑎 ∖ 𝐸))) = (𝑂‘𝑎)) → ((𝑂‘(𝐴 ∩ 𝐸)) +e (𝑂‘(𝐴 ∖ 𝐸))) = (𝑂‘𝐴))
2511, 16, 24syl2anc 596 1 (𝜑 → ((𝑂‘(𝐴 ∩ 𝐸)) +e (𝑂‘(𝐴 ∖ 𝐸))) = (𝑂‘𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572   ∈ wcel 2150  ∀wral 3083  Vcvv 3453   ⊆ wss 3899   ∖ cdif 4047   ∩ cin 4091  𝒫 cpw 4559  ∪ cuni 4871  dom cdm 5657  ‘cfv 6565  (class class class)co 7450   +e cxad 13278  OutMeascome 47832  CaraGenccaragen 47834
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-iota 6519  df-fun 6567  df-fv 6573  df-ov 7453  df-caragen 47835
This theorem is used by:  caragenuncllem  47855  carageniuncllem1  47864  carageniuncllem2  47865  caratheodorylem1  47869
  Copyright terms: Public domain W3C validator