![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fsuppmptif | Structured version Visualization version GIF version |
Description: A function mapping an argument to either a value of a finitely supported function or zero is finitely supported. (Contributed by AV, 6-Jun-2019.) |
Ref | Expression |
---|---|
fsuppmptif.f | ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) |
fsuppmptif.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
fsuppmptif.z | ⊢ (𝜑 → 𝑍 ∈ 𝑊) |
fsuppmptif.s | ⊢ (𝜑 → 𝐹 finSupp 𝑍) |
Ref | Expression |
---|---|
fsuppmptif | ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) finSupp 𝑍) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvex 6201 | . . . . 5 ⊢ (𝐹‘𝑘) ∈ V | |
2 | fsuppmptif.z | . . . . . 6 ⊢ (𝜑 → 𝑍 ∈ 𝑊) | |
3 | 2 | adantr 481 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑍 ∈ 𝑊) |
4 | ifexg 4157 | . . . . 5 ⊢ (((𝐹‘𝑘) ∈ V ∧ 𝑍 ∈ 𝑊) → if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍) ∈ V) | |
5 | 1, 3, 4 | sylancr 695 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍) ∈ V) |
6 | eqid 2622 | . . . 4 ⊢ (𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) = (𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) | |
7 | 5, 6 | fmptd 6385 | . . 3 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)):𝐴⟶V) |
8 | ffun 6048 | . . 3 ⊢ ((𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)):𝐴⟶V → Fun (𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍))) | |
9 | 7, 8 | syl 17 | . 2 ⊢ (𝜑 → Fun (𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍))) |
10 | fsuppmptif.s | . . . 4 ⊢ (𝜑 → 𝐹 finSupp 𝑍) | |
11 | 10 | fsuppimpd 8282 | . . 3 ⊢ (𝜑 → (𝐹 supp 𝑍) ∈ Fin) |
12 | fsuppmptif.f | . . . . . . 7 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) | |
13 | ssid 3624 | . . . . . . . 8 ⊢ (𝐹 supp 𝑍) ⊆ (𝐹 supp 𝑍) | |
14 | 13 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → (𝐹 supp 𝑍) ⊆ (𝐹 supp 𝑍)) |
15 | fsuppmptif.a | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
16 | 12, 14, 15, 2 | suppssr 7326 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ (𝐹 supp 𝑍))) → (𝐹‘𝑘) = 𝑍) |
17 | 16 | ifeq1d 4104 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ (𝐹 supp 𝑍))) → if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍) = if(𝑘 ∈ 𝐷, 𝑍, 𝑍)) |
18 | ifid 4125 | . . . . 5 ⊢ if(𝑘 ∈ 𝐷, 𝑍, 𝑍) = 𝑍 | |
19 | 17, 18 | syl6eq 2672 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ (𝐹 supp 𝑍))) → if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍) = 𝑍) |
20 | 19, 15 | suppss2 7329 | . . 3 ⊢ (𝜑 → ((𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) supp 𝑍) ⊆ (𝐹 supp 𝑍)) |
21 | ssfi 8180 | . . 3 ⊢ (((𝐹 supp 𝑍) ∈ Fin ∧ ((𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) supp 𝑍) ⊆ (𝐹 supp 𝑍)) → ((𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) supp 𝑍) ∈ Fin) | |
22 | 11, 20, 21 | syl2anc 693 | . 2 ⊢ (𝜑 → ((𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) supp 𝑍) ∈ Fin) |
23 | mptexg 6484 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) ∈ V) | |
24 | 15, 23 | syl 17 | . . 3 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) ∈ V) |
25 | isfsupp 8279 | . . 3 ⊢ (((𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) ∈ V ∧ 𝑍 ∈ 𝑊) → ((𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) finSupp 𝑍 ↔ (Fun (𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) ∧ ((𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) supp 𝑍) ∈ Fin))) | |
26 | 24, 2, 25 | syl2anc 693 | . 2 ⊢ (𝜑 → ((𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) finSupp 𝑍 ↔ (Fun (𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) ∧ ((𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) supp 𝑍) ∈ Fin))) |
27 | 9, 22, 26 | mpbir2and 957 | 1 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ if(𝑘 ∈ 𝐷, (𝐹‘𝑘), 𝑍)) finSupp 𝑍) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 ∈ wcel 1990 Vcvv 3200 ∖ cdif 3571 ⊆ wss 3574 ifcif 4086 class class class wbr 4653 ↦ cmpt 4729 Fun wfun 5882 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 supp csupp 7295 Fincfn 7955 finSupp cfsupp 8275 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-supp 7296 df-er 7742 df-en 7956 df-fin 7959 df-fsupp 8276 |
This theorem is referenced by: cantnflem1d 8585 gsumzsplit 18327 |
Copyright terms: Public domain | W3C validator |