![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > sniffsupp | Structured version Visualization version GIF version |
Description: A function mapping all but one arguments to zero is finitely supported. (Contributed by AV, 8-Jul-2019.) |
Ref | Expression |
---|---|
sniffsupp.i | ⊢ (𝜑 → 𝐼 ∈ 𝑉) |
sniffsupp.0 | ⊢ (𝜑 → 0 ∈ 𝑊) |
sniffsupp.f | ⊢ 𝐹 = (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) |
Ref | Expression |
---|---|
sniffsupp | ⊢ (𝜑 → 𝐹 finSupp 0 ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sniffsupp.f | . 2 ⊢ 𝐹 = (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) | |
2 | snfi 8577 | . . . 4 ⊢ {𝑋} ∈ Fin | |
3 | eldifsni 4683 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝐼 ∖ {𝑋}) → 𝑥 ≠ 𝑋) | |
4 | 3 | adantl 485 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ {𝑋})) → 𝑥 ≠ 𝑋) |
5 | 4 | neneqd 2992 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ {𝑋})) → ¬ 𝑥 = 𝑋) |
6 | 5 | iffalsed 4436 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ {𝑋})) → if(𝑥 = 𝑋, 𝐴, 0 ) = 0 ) |
7 | sniffsupp.i | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ 𝑉) | |
8 | 6, 7 | suppss2 7847 | . . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ⊆ {𝑋}) |
9 | ssfi 8722 | . . . 4 ⊢ (({𝑋} ∈ Fin ∧ ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ⊆ {𝑋}) → ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ∈ Fin) | |
10 | 2, 8, 9 | sylancr 590 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ∈ Fin) |
11 | funmpt 6362 | . . . 4 ⊢ Fun (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) | |
12 | 7 | mptexd 6964 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) ∈ V) |
13 | sniffsupp.0 | . . . 4 ⊢ (𝜑 → 0 ∈ 𝑊) | |
14 | funisfsupp 8822 | . . . 4 ⊢ ((Fun (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) ∧ (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) ∈ V ∧ 0 ∈ 𝑊) → ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) finSupp 0 ↔ ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ∈ Fin)) | |
15 | 11, 12, 13, 14 | mp3an2i 1463 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) finSupp 0 ↔ ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ∈ Fin)) |
16 | 10, 15 | mpbird 260 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) finSupp 0 ) |
17 | 1, 16 | eqbrtrid 5065 | 1 ⊢ (𝜑 → 𝐹 finSupp 0 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 Vcvv 3441 ∖ cdif 3878 ⊆ wss 3881 ifcif 4425 {csn 4525 class class class wbr 5030 ↦ cmpt 5110 Fun wfun 6318 (class class class)co 7135 supp csupp 7813 Fincfn 8492 finSupp cfsupp 8817 |
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 |
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-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-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 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-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 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-om 7561 df-supp 7814 df-1o 8085 df-er 8272 df-en 8493 df-fin 8496 df-fsupp 8818 |
This theorem is referenced by: dprdfid 19132 snifpsrbag 20604 mnringmulrcld 40936 |
Copyright terms: Public domain | W3C validator |