Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > pmeasadd | Structured version Visualization version GIF version |
Description: A premeasure on a ring of sets is additive on disjoint countable collections. This is called sigma-additivity. (Contributed by Thierry Arnoux, 19-Jul-2020.) |
Ref | Expression |
---|---|
caraext.1 | ⊢ (𝜑 → 𝑃:𝑅⟶(0[,]+∞)) |
caraext.2 | ⊢ (𝜑 → (𝑃‘∅) = 0) |
caraext.3 | ⊢ ((𝜑 ∧ (𝑥 ≼ ω ∧ 𝑥 ⊆ 𝑅 ∧ Disj 𝑦 ∈ 𝑥 𝑦)) → (𝑃‘∪ 𝑥) = Σ*𝑦 ∈ 𝑥(𝑃‘𝑦)) |
pmeassubadd.q | ⊢ 𝑄 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠))} |
pmeassubadd.1 | ⊢ (𝜑 → 𝑅 ∈ 𝑄) |
pmeassubadd.2 | ⊢ (𝜑 → 𝐴 ≼ ω) |
pmeassubadd.3 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ 𝑅) |
pmeasadd.4 | ⊢ (𝜑 → Disj 𝑘 ∈ 𝐴 𝐵) |
Ref | Expression |
---|---|
pmeasadd | ⊢ (𝜑 → (𝑃‘∪ 𝑘 ∈ 𝐴 𝐵) = Σ*𝑘 ∈ 𝐴(𝑃‘𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pmeassubadd.3 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ 𝑅) | |
2 | 1 | ralrimiva 3182 | . . . 4 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐵 ∈ 𝑅) |
3 | dfiun3g 5835 | . . . 4 ⊢ (∀𝑘 ∈ 𝐴 𝐵 ∈ 𝑅 → ∪ 𝑘 ∈ 𝐴 𝐵 = ∪ ran (𝑘 ∈ 𝐴 ↦ 𝐵)) | |
4 | 2, 3 | syl 17 | . . 3 ⊢ (𝜑 → ∪ 𝑘 ∈ 𝐴 𝐵 = ∪ ran (𝑘 ∈ 𝐴 ↦ 𝐵)) |
5 | 4 | fveq2d 6674 | . 2 ⊢ (𝜑 → (𝑃‘∪ 𝑘 ∈ 𝐴 𝐵) = (𝑃‘∪ ran (𝑘 ∈ 𝐴 ↦ 𝐵))) |
6 | pmeassubadd.2 | . . . . . 6 ⊢ (𝜑 → 𝐴 ≼ ω) | |
7 | mptct 9960 | . . . . . 6 ⊢ (𝐴 ≼ ω → (𝑘 ∈ 𝐴 ↦ 𝐵) ≼ ω) | |
8 | rnct 9947 | . . . . . 6 ⊢ ((𝑘 ∈ 𝐴 ↦ 𝐵) ≼ ω → ran (𝑘 ∈ 𝐴 ↦ 𝐵) ≼ ω) | |
9 | 6, 7, 8 | 3syl 18 | . . . . 5 ⊢ (𝜑 → ran (𝑘 ∈ 𝐴 ↦ 𝐵) ≼ ω) |
10 | eqid 2821 | . . . . . . 7 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐵) = (𝑘 ∈ 𝐴 ↦ 𝐵) | |
11 | 10 | rnmptss 6886 | . . . . . 6 ⊢ (∀𝑘 ∈ 𝐴 𝐵 ∈ 𝑅 → ran (𝑘 ∈ 𝐴 ↦ 𝐵) ⊆ 𝑅) |
12 | 2, 11 | syl 17 | . . . . 5 ⊢ (𝜑 → ran (𝑘 ∈ 𝐴 ↦ 𝐵) ⊆ 𝑅) |
13 | pmeasadd.4 | . . . . . 6 ⊢ (𝜑 → Disj 𝑘 ∈ 𝐴 𝐵) | |
14 | disjrnmpt 30335 | . . . . . 6 ⊢ (Disj 𝑘 ∈ 𝐴 𝐵 → Disj 𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)𝑦) | |
15 | 13, 14 | syl 17 | . . . . 5 ⊢ (𝜑 → Disj 𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)𝑦) |
16 | 9, 12, 15 | 3jca 1124 | . . . 4 ⊢ (𝜑 → (ran (𝑘 ∈ 𝐴 ↦ 𝐵) ≼ ω ∧ ran (𝑘 ∈ 𝐴 ↦ 𝐵) ⊆ 𝑅 ∧ Disj 𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)𝑦)) |
17 | 16 | ancli 551 | . . 3 ⊢ (𝜑 → (𝜑 ∧ (ran (𝑘 ∈ 𝐴 ↦ 𝐵) ≼ ω ∧ ran (𝑘 ∈ 𝐴 ↦ 𝐵) ⊆ 𝑅 ∧ Disj 𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)𝑦))) |
18 | ctex 8524 | . . . . 5 ⊢ (𝐴 ≼ ω → 𝐴 ∈ V) | |
19 | mptexg 6984 | . . . . 5 ⊢ (𝐴 ∈ V → (𝑘 ∈ 𝐴 ↦ 𝐵) ∈ V) | |
20 | 6, 18, 19 | 3syl 18 | . . . 4 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝐵) ∈ V) |
21 | rnexg 7614 | . . . 4 ⊢ ((𝑘 ∈ 𝐴 ↦ 𝐵) ∈ V → ran (𝑘 ∈ 𝐴 ↦ 𝐵) ∈ V) | |
22 | breq1 5069 | . . . . . . . 8 ⊢ (𝑥 = ran (𝑘 ∈ 𝐴 ↦ 𝐵) → (𝑥 ≼ ω ↔ ran (𝑘 ∈ 𝐴 ↦ 𝐵) ≼ ω)) | |
23 | sseq1 3992 | . . . . . . . 8 ⊢ (𝑥 = ran (𝑘 ∈ 𝐴 ↦ 𝐵) → (𝑥 ⊆ 𝑅 ↔ ran (𝑘 ∈ 𝐴 ↦ 𝐵) ⊆ 𝑅)) | |
24 | disjeq1 5038 | . . . . . . . 8 ⊢ (𝑥 = ran (𝑘 ∈ 𝐴 ↦ 𝐵) → (Disj 𝑦 ∈ 𝑥 𝑦 ↔ Disj 𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)𝑦)) | |
25 | 22, 23, 24 | 3anbi123d 1432 | . . . . . . 7 ⊢ (𝑥 = ran (𝑘 ∈ 𝐴 ↦ 𝐵) → ((𝑥 ≼ ω ∧ 𝑥 ⊆ 𝑅 ∧ Disj 𝑦 ∈ 𝑥 𝑦) ↔ (ran (𝑘 ∈ 𝐴 ↦ 𝐵) ≼ ω ∧ ran (𝑘 ∈ 𝐴 ↦ 𝐵) ⊆ 𝑅 ∧ Disj 𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)𝑦))) |
26 | 25 | anbi2d 630 | . . . . . 6 ⊢ (𝑥 = ran (𝑘 ∈ 𝐴 ↦ 𝐵) → ((𝜑 ∧ (𝑥 ≼ ω ∧ 𝑥 ⊆ 𝑅 ∧ Disj 𝑦 ∈ 𝑥 𝑦)) ↔ (𝜑 ∧ (ran (𝑘 ∈ 𝐴 ↦ 𝐵) ≼ ω ∧ ran (𝑘 ∈ 𝐴 ↦ 𝐵) ⊆ 𝑅 ∧ Disj 𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)𝑦)))) |
27 | unieq 4849 | . . . . . . . 8 ⊢ (𝑥 = ran (𝑘 ∈ 𝐴 ↦ 𝐵) → ∪ 𝑥 = ∪ ran (𝑘 ∈ 𝐴 ↦ 𝐵)) | |
28 | 27 | fveq2d 6674 | . . . . . . 7 ⊢ (𝑥 = ran (𝑘 ∈ 𝐴 ↦ 𝐵) → (𝑃‘∪ 𝑥) = (𝑃‘∪ ran (𝑘 ∈ 𝐴 ↦ 𝐵))) |
29 | esumeq1 31293 | . . . . . . 7 ⊢ (𝑥 = ran (𝑘 ∈ 𝐴 ↦ 𝐵) → Σ*𝑦 ∈ 𝑥(𝑃‘𝑦) = Σ*𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)(𝑃‘𝑦)) | |
30 | 28, 29 | eqeq12d 2837 | . . . . . 6 ⊢ (𝑥 = ran (𝑘 ∈ 𝐴 ↦ 𝐵) → ((𝑃‘∪ 𝑥) = Σ*𝑦 ∈ 𝑥(𝑃‘𝑦) ↔ (𝑃‘∪ ran (𝑘 ∈ 𝐴 ↦ 𝐵)) = Σ*𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)(𝑃‘𝑦))) |
31 | 26, 30 | imbi12d 347 | . . . . 5 ⊢ (𝑥 = ran (𝑘 ∈ 𝐴 ↦ 𝐵) → (((𝜑 ∧ (𝑥 ≼ ω ∧ 𝑥 ⊆ 𝑅 ∧ Disj 𝑦 ∈ 𝑥 𝑦)) → (𝑃‘∪ 𝑥) = Σ*𝑦 ∈ 𝑥(𝑃‘𝑦)) ↔ ((𝜑 ∧ (ran (𝑘 ∈ 𝐴 ↦ 𝐵) ≼ ω ∧ ran (𝑘 ∈ 𝐴 ↦ 𝐵) ⊆ 𝑅 ∧ Disj 𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)𝑦)) → (𝑃‘∪ ran (𝑘 ∈ 𝐴 ↦ 𝐵)) = Σ*𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)(𝑃‘𝑦)))) |
32 | caraext.3 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ≼ ω ∧ 𝑥 ⊆ 𝑅 ∧ Disj 𝑦 ∈ 𝑥 𝑦)) → (𝑃‘∪ 𝑥) = Σ*𝑦 ∈ 𝑥(𝑃‘𝑦)) | |
33 | 31, 32 | vtoclg 3567 | . . . 4 ⊢ (ran (𝑘 ∈ 𝐴 ↦ 𝐵) ∈ V → ((𝜑 ∧ (ran (𝑘 ∈ 𝐴 ↦ 𝐵) ≼ ω ∧ ran (𝑘 ∈ 𝐴 ↦ 𝐵) ⊆ 𝑅 ∧ Disj 𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)𝑦)) → (𝑃‘∪ ran (𝑘 ∈ 𝐴 ↦ 𝐵)) = Σ*𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)(𝑃‘𝑦))) |
34 | 20, 21, 33 | 3syl 18 | . . 3 ⊢ (𝜑 → ((𝜑 ∧ (ran (𝑘 ∈ 𝐴 ↦ 𝐵) ≼ ω ∧ ran (𝑘 ∈ 𝐴 ↦ 𝐵) ⊆ 𝑅 ∧ Disj 𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)𝑦)) → (𝑃‘∪ ran (𝑘 ∈ 𝐴 ↦ 𝐵)) = Σ*𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)(𝑃‘𝑦))) |
35 | 17, 34 | mpd 15 | . 2 ⊢ (𝜑 → (𝑃‘∪ ran (𝑘 ∈ 𝐴 ↦ 𝐵)) = Σ*𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)(𝑃‘𝑦)) |
36 | fveq2 6670 | . . 3 ⊢ (𝑦 = 𝐵 → (𝑃‘𝑦) = (𝑃‘𝐵)) | |
37 | 6, 18 | syl 17 | . . 3 ⊢ (𝜑 → 𝐴 ∈ V) |
38 | caraext.1 | . . . . 5 ⊢ (𝜑 → 𝑃:𝑅⟶(0[,]+∞)) | |
39 | 38 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑃:𝑅⟶(0[,]+∞)) |
40 | 39, 1 | ffvelrnd 6852 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑃‘𝐵) ∈ (0[,]+∞)) |
41 | fveq2 6670 | . . . . 5 ⊢ (𝐵 = ∅ → (𝑃‘𝐵) = (𝑃‘∅)) | |
42 | 41 | adantl 484 | . . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝐵 = ∅) → (𝑃‘𝐵) = (𝑃‘∅)) |
43 | caraext.2 | . . . . 5 ⊢ (𝜑 → (𝑃‘∅) = 0) | |
44 | 43 | ad2antrr 724 | . . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝐵 = ∅) → (𝑃‘∅) = 0) |
45 | 42, 44 | eqtrd 2856 | . . 3 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝐵 = ∅) → (𝑃‘𝐵) = 0) |
46 | 36, 37, 40, 1, 45, 13 | esumrnmpt2 31327 | . 2 ⊢ (𝜑 → Σ*𝑦 ∈ ran (𝑘 ∈ 𝐴 ↦ 𝐵)(𝑃‘𝑦) = Σ*𝑘 ∈ 𝐴(𝑃‘𝐵)) |
47 | 5, 35, 46 | 3eqtrd 2860 | 1 ⊢ (𝜑 → (𝑃‘∪ 𝑘 ∈ 𝐴 𝐵) = Σ*𝑘 ∈ 𝐴(𝑃‘𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ∀wral 3138 {crab 3142 Vcvv 3494 ∖ cdif 3933 ∪ cun 3934 ⊆ wss 3936 ∅c0 4291 𝒫 cpw 4539 ∪ cuni 4838 ∪ ciun 4919 Disj wdisj 5031 class class class wbr 5066 ↦ cmpt 5146 ran crn 5556 ⟶wf 6351 ‘cfv 6355 (class class class)co 7156 ωcom 7580 ≼ cdom 8507 0cc0 10537 +∞cpnf 10672 [,]cicc 12742 Σ*cesum 31286 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-inf2 9104 ax-ac2 9885 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 ax-pre-sup 10615 ax-addf 10616 ax-mulf 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-fal 1550 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-int 4877 df-iun 4921 df-iin 4922 df-disj 5032 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-se 5515 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-isom 6364 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-of 7409 df-om 7581 df-1st 7689 df-2nd 7690 df-supp 7831 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-1o 8102 df-2o 8103 df-oadd 8106 df-er 8289 df-map 8408 df-pm 8409 df-ixp 8462 df-en 8510 df-dom 8511 df-sdom 8512 df-fin 8513 df-fsupp 8834 df-fi 8875 df-sup 8906 df-inf 8907 df-oi 8974 df-card 9368 df-acn 9371 df-ac 9542 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-div 11298 df-nn 11639 df-2 11701 df-3 11702 df-4 11703 df-5 11704 df-6 11705 df-7 11706 df-8 11707 df-9 11708 df-n0 11899 df-z 11983 df-dec 12100 df-uz 12245 df-q 12350 df-rp 12391 df-xneg 12508 df-xadd 12509 df-xmul 12510 df-ioo 12743 df-ioc 12744 df-ico 12745 df-icc 12746 df-fz 12894 df-fzo 13035 df-fl 13163 df-mod 13239 df-seq 13371 df-exp 13431 df-fac 13635 df-bc 13664 df-hash 13692 df-shft 14426 df-cj 14458 df-re 14459 df-im 14460 df-sqrt 14594 df-abs 14595 df-limsup 14828 df-clim 14845 df-rlim 14846 df-sum 15043 df-ef 15421 df-sin 15423 df-cos 15424 df-pi 15426 df-struct 16485 df-ndx 16486 df-slot 16487 df-base 16489 df-sets 16490 df-ress 16491 df-plusg 16578 df-mulr 16579 df-starv 16580 df-sca 16581 df-vsca 16582 df-ip 16583 df-tset 16584 df-ple 16585 df-ds 16587 df-unif 16588 df-hom 16589 df-cco 16590 df-rest 16696 df-topn 16697 df-0g 16715 df-gsum 16716 df-topgen 16717 df-pt 16718 df-prds 16721 df-ordt 16774 df-xrs 16775 df-qtop 16780 df-imas 16781 df-xps 16783 df-mre 16857 df-mrc 16858 df-acs 16860 df-ps 17810 df-tsr 17811 df-plusf 17851 df-mgm 17852 df-sgrp 17901 df-mnd 17912 df-mhm 17956 df-submnd 17957 df-grp 18106 df-minusg 18107 df-sbg 18108 df-mulg 18225 df-subg 18276 df-cntz 18447 df-cmn 18908 df-abl 18909 df-mgp 19240 df-ur 19252 df-ring 19299 df-cring 19300 df-subrg 19533 df-abv 19588 df-lmod 19636 df-scaf 19637 df-sra 19944 df-rgmod 19945 df-psmet 20537 df-xmet 20538 df-met 20539 df-bl 20540 df-mopn 20541 df-fbas 20542 df-fg 20543 df-cnfld 20546 df-top 21502 df-topon 21519 df-topsp 21541 df-bases 21554 df-cld 21627 df-ntr 21628 df-cls 21629 df-nei 21706 df-lp 21744 df-perf 21745 df-cn 21835 df-cnp 21836 df-haus 21923 df-tx 22170 df-hmeo 22363 df-fil 22454 df-fm 22546 df-flim 22547 df-flf 22548 df-tmd 22680 df-tgp 22681 df-tsms 22735 df-trg 22768 df-xms 22930 df-ms 22931 df-tms 22932 df-nm 23192 df-ngp 23193 df-nrg 23195 df-nlm 23196 df-ii 23485 df-cncf 23486 df-limc 24464 df-dv 24465 df-log 25140 df-esum 31287 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |