Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > unelcarsg | Structured version Visualization version GIF version |
Description: The Caratheodory-measurable sets are closed under pairwise unions. (Contributed by Thierry Arnoux, 21-May-2020.) |
Ref | Expression |
---|---|
carsgval.1 | ⊢ (𝜑 → 𝑂 ∈ 𝑉) |
carsgval.2 | ⊢ (𝜑 → 𝑀:𝒫 𝑂⟶(0[,]+∞)) |
difelcarsg.1 | ⊢ (𝜑 → 𝐴 ∈ (toCaraSiga‘𝑀)) |
inelcarsg.1 | ⊢ ((𝜑 ∧ 𝑎 ∈ 𝒫 𝑂 ∧ 𝑏 ∈ 𝒫 𝑂) → (𝑀‘(𝑎 ∪ 𝑏)) ≤ ((𝑀‘𝑎) +𝑒 (𝑀‘𝑏))) |
inelcarsg.2 | ⊢ (𝜑 → 𝐵 ∈ (toCaraSiga‘𝑀)) |
Ref | Expression |
---|---|
unelcarsg | ⊢ (𝜑 → (𝐴 ∪ 𝐵) ∈ (toCaraSiga‘𝑀)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | carsgval.1 | . . . . 5 ⊢ (𝜑 → 𝑂 ∈ 𝑉) | |
2 | carsgval.2 | . . . . 5 ⊢ (𝜑 → 𝑀:𝒫 𝑂⟶(0[,]+∞)) | |
3 | difelcarsg.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ (toCaraSiga‘𝑀)) | |
4 | 1, 2, 3 | elcarsgss 31677 | . . . 4 ⊢ (𝜑 → 𝐴 ⊆ 𝑂) |
5 | dfss4 4185 | . . . 4 ⊢ (𝐴 ⊆ 𝑂 ↔ (𝑂 ∖ (𝑂 ∖ 𝐴)) = 𝐴) | |
6 | 4, 5 | sylib 221 | . . 3 ⊢ (𝜑 → (𝑂 ∖ (𝑂 ∖ 𝐴)) = 𝐴) |
7 | inelcarsg.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ (toCaraSiga‘𝑀)) | |
8 | 1, 2, 7 | elcarsgss 31677 | . . . 4 ⊢ (𝜑 → 𝐵 ⊆ 𝑂) |
9 | dfss4 4185 | . . . 4 ⊢ (𝐵 ⊆ 𝑂 ↔ (𝑂 ∖ (𝑂 ∖ 𝐵)) = 𝐵) | |
10 | 8, 9 | sylib 221 | . . 3 ⊢ (𝜑 → (𝑂 ∖ (𝑂 ∖ 𝐵)) = 𝐵) |
11 | 6, 10 | uneq12d 4091 | . 2 ⊢ (𝜑 → ((𝑂 ∖ (𝑂 ∖ 𝐴)) ∪ (𝑂 ∖ (𝑂 ∖ 𝐵))) = (𝐴 ∪ 𝐵)) |
12 | difindi 4208 | . . 3 ⊢ (𝑂 ∖ ((𝑂 ∖ 𝐴) ∩ (𝑂 ∖ 𝐵))) = ((𝑂 ∖ (𝑂 ∖ 𝐴)) ∪ (𝑂 ∖ (𝑂 ∖ 𝐵))) | |
13 | 1, 2, 3 | difelcarsg 31678 | . . . . 5 ⊢ (𝜑 → (𝑂 ∖ 𝐴) ∈ (toCaraSiga‘𝑀)) |
14 | inelcarsg.1 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝒫 𝑂 ∧ 𝑏 ∈ 𝒫 𝑂) → (𝑀‘(𝑎 ∪ 𝑏)) ≤ ((𝑀‘𝑎) +𝑒 (𝑀‘𝑏))) | |
15 | 1, 2, 7 | difelcarsg 31678 | . . . . 5 ⊢ (𝜑 → (𝑂 ∖ 𝐵) ∈ (toCaraSiga‘𝑀)) |
16 | 1, 2, 13, 14, 15 | inelcarsg 31679 | . . . 4 ⊢ (𝜑 → ((𝑂 ∖ 𝐴) ∩ (𝑂 ∖ 𝐵)) ∈ (toCaraSiga‘𝑀)) |
17 | 1, 2, 16 | difelcarsg 31678 | . . 3 ⊢ (𝜑 → (𝑂 ∖ ((𝑂 ∖ 𝐴) ∩ (𝑂 ∖ 𝐵))) ∈ (toCaraSiga‘𝑀)) |
18 | 12, 17 | eqeltrrid 2895 | . 2 ⊢ (𝜑 → ((𝑂 ∖ (𝑂 ∖ 𝐴)) ∪ (𝑂 ∖ (𝑂 ∖ 𝐵))) ∈ (toCaraSiga‘𝑀)) |
19 | 11, 18 | eqeltrrd 2891 | 1 ⊢ (𝜑 → (𝐴 ∪ 𝐵) ∈ (toCaraSiga‘𝑀)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ∖ cdif 3878 ∪ cun 3879 ∩ cin 3880 ⊆ wss 3881 𝒫 cpw 4497 class class class wbr 5030 ⟶wf 6320 ‘cfv 6324 (class class class)co 7135 0cc0 10526 +∞cpnf 10661 ≤ cle 10665 +𝑒 cxad 12493 [,]cicc 12729 toCaraSigaccarsg 31669 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-po 5438 df-so 5439 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-1st 7671 df-2nd 7672 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-xadd 12496 df-icc 12733 df-carsg 31670 |
This theorem is referenced by: fiunelcarsg 31684 |
Copyright terms: Public domain | W3C validator |