| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > itg1addlem1 | Structured version Visualization version GIF version | ||
| Description: Decompose a preimage, which is always a disjoint union. (Contributed by Mario Carneiro, 25-Jun-2014.) (Proof shortened by Mario Carneiro, 11-Dec-2016.) |
| Ref | Expression |
|---|---|
| itg1addlem.1 | ⊢ (𝜑 → 𝐹:𝑋⟶𝑌) |
| itg1addlem.2 | ⊢ (𝜑 → 𝐴 ∈ Fin) |
| itg1addlem.3 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ⊆ (◡𝐹 “ {𝑘})) |
| itg1addlem.4 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ dom vol) |
| itg1addlem.5 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (vol‘𝐵) ∈ ℝ) |
| Ref | Expression |
|---|---|
| itg1addlem1 | ⊢ (𝜑 → (vol‘∪ 𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (vol‘𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | itg1addlem.2 | . 2 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 2 | itg1addlem.4 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ dom vol) | |
| 3 | itg1addlem.5 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (vol‘𝐵) ∈ ℝ) | |
| 4 | 2, 3 | jca 516 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐵 ∈ dom vol ∧ (vol‘𝐵) ∈ ℝ)) |
| 5 | 4 | ralrimiva 3131 | . 2 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 (𝐵 ∈ dom vol ∧ (vol‘𝐵) ∈ ℝ)) |
| 6 | itg1addlem.3 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ⊆ (◡𝐹 “ {𝑘})) | |
| 7 | 6 | adantrr 723 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) → 𝐵 ⊆ (◡𝐹 “ {𝑘})) |
| 8 | simprr 778 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) → 𝑥 ∈ 𝐵) | |
| 9 | 7, 8 | sseldd 3916 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) → 𝑥 ∈ (◡𝐹 “ {𝑘})) |
| 10 | itg1addlem.1 | . . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝑋⟶𝑌) | |
| 11 | 10 | ffnd 6656 | . . . . . . . 8 ⊢ (𝜑 → 𝐹 Fn 𝑋) |
| 12 | 11 | adantr 481 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) → 𝐹 Fn 𝑋) |
| 13 | fniniseg 7001 | . . . . . . 7 ⊢ (𝐹 Fn 𝑋 → (𝑥 ∈ (◡𝐹 “ {𝑘}) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) = 𝑘))) | |
| 14 | 12, 13 | syl 17 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) → (𝑥 ∈ (◡𝐹 “ {𝑘}) ↔ (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) = 𝑘))) |
| 15 | 9, 14 | mpbid 233 | . . . . 5 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) → (𝑥 ∈ 𝑋 ∧ (𝐹‘𝑥) = 𝑘)) |
| 16 | 15 | simprd 496 | . . . 4 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) → (𝐹‘𝑥) = 𝑘) |
| 17 | 16 | ralrimivva 3182 | . . 3 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = 𝑘) |
| 18 | invdisj 5058 | . . 3 ⊢ (∀𝑘 ∈ 𝐴 ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = 𝑘 → Disj 𝑘 ∈ 𝐴 𝐵) | |
| 19 | 17, 18 | syl 17 | . 2 ⊢ (𝜑 → Disj 𝑘 ∈ 𝐴 𝐵) |
| 20 | volfiniun 25532 | . 2 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑘 ∈ 𝐴 (𝐵 ∈ dom vol ∧ (vol‘𝐵) ∈ ℝ) ∧ Disj 𝑘 ∈ 𝐴 𝐵) → (vol‘∪ 𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (vol‘𝐵)) | |
| 21 | 1, 5, 19, 20 | syl3anc 1379 | 1 ⊢ (𝜑 → (vol‘∪ 𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (vol‘𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∀wral 3053 ⊆ wss 3883 {csn 4555 ∪ ciun 4921 Disj wdisj 5039 ◡ccnv 5617 dom cdm 5618 “ cima 5621 Fn wfn 6480 ⟶wf 6481 ‘cfv 6485 Fincfn 8883 ℝcr 11028 Σcsu 15639 volcvol 25448 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-inf2 9553 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-int 4878 df-iun 4923 df-disj 5040 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-se 5572 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-isom 6494 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-of 7620 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-er 8633 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-sup 9345 df-inf 9346 df-oi 9415 df-dju 9816 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-n0 12429 df-z 12516 df-uz 12780 df-q 12890 df-rp 12934 df-xadd 13055 df-ioo 13293 df-ico 13295 df-icc 13296 df-fz 13453 df-fzo 13600 df-fl 13742 df-seq 13955 df-exp 14015 df-hash 14284 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-clim 15441 df-sum 15640 df-xmet 21340 df-met 21341 df-ovol 25449 df-vol 25450 |
| This theorem is referenced by: itg1addlem4 25684 itg1addlem5 25685 |
| Copyright terms: Public domain | W3C validator |