| 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 9028 | . . . 4 ⊢ {𝑋} ∈ Fin | |
| 3 | eldifsni 4753 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝐼 ∖ {𝑋}) → 𝑥 ≠ 𝑋) | |
| 4 | 3 | adantl 486 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ {𝑋})) → 𝑥 ≠ 𝑋) |
| 5 | 4 | neneqd 2965 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ {𝑋})) → ¬ 𝑥 = 𝑋) |
| 6 | 5 | iffalsed 4494 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ {𝑋})) → if(𝑥 = 𝑋, 𝐴, 0 ) = 0 ) |
| 7 | sniffsupp.i | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ 𝑉) | |
| 8 | 6, 7 | suppss2 8184 | . . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ⊆ {𝑋}) |
| 9 | ssfi 9145 | . . . 4 ⊢ (({𝑋} ∈ Fin ∧ ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ⊆ {𝑋}) → ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ∈ Fin) | |
| 10 | 2, 8, 9 | sylancr 598 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ∈ Fin) |
| 11 | funmpt 6563 | . . . 4 ⊢ Fun (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) | |
| 12 | 7 | mptexd 7212 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) ∈ V) |
| 13 | sniffsupp.0 | . . . 4 ⊢ (𝜑 → 0 ∈ 𝑊) | |
| 14 | funisfsupp 9315 | . . . 4 ⊢ ((Fun (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) ∧ (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) ∈ V ∧ 0 ∈ 𝑊) → ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) finSupp 0 ↔ ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ∈ Fin)) | |
| 15 | 11, 12, 13, 14 | mp3an2i 1490 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) finSupp 0 ↔ ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ∈ Fin)) |
| 16 | 10, 15 | mpbird 260 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) finSupp 0 ) |
| 17 | 1, 16 | eqbrtrid 5139 | 1 ⊢ (𝜑 → 𝐹 finSupp 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1563 ∈ wcel 2145 ≠ wne 2960 Vcvv 3457 ∖ cdif 3904 ⊆ wss 3907 ifcif 4483 {csn 4585 class class class wbr 5104 ↦ cmpt 5185 Fun wfun 6519 (class class class)co 7400 supp csupp 8144 Fincfn 8931 finSupp cfsupp 9309 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5231 ax-sep 5250 ax-nul 5260 ax-pr 5394 ax-un 7722 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5105 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-supp 8145 df-1o 8441 df-en 8932 df-fin 8935 df-fsupp 9310 |
| This theorem is referenced by: dprdfid 20077 snifpsrbag 22027 evlsbagval 43175 mhpind 43183 cantnfresb 43908 mnringmulrcld 44811 |
| Copyright terms: Public domain | W3C validator |