| 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 9050 | . . . 4 ⊢ {𝑋} ∈ Fin | |
| 3 | eldifsni 4763 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝐼 ∖ {𝑋}) → 𝑥 ≠ 𝑋) | |
| 4 | 3 | adantl 487 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ {𝑋})) → 𝑥 ≠ 𝑋) |
| 5 | 4 | neneqd 2966 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ {𝑋})) → ¬ 𝑥 = 𝑋) |
| 6 | 5 | iffalsed 4503 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐼 ∖ {𝑋})) → if(𝑥 = 𝑋, 𝐴, 0 ) = 0 ) |
| 7 | sniffsupp.i | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ 𝑉) | |
| 8 | 6, 7 | suppss2 8205 | . . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ⊆ {𝑋}) |
| 9 | ssfi 9167 | . . . 4 ⊢ (({𝑋} ∈ Fin ∧ ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ⊆ {𝑋}) → ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ∈ Fin) | |
| 10 | 2, 8, 9 | sylancr 599 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ∈ Fin) |
| 11 | funmpt 6581 | . . . 4 ⊢ Fun (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) | |
| 12 | 7 | mptexd 7229 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) ∈ V) |
| 13 | sniffsupp.0 | . . . 4 ⊢ (𝜑 → 0 ∈ 𝑊) | |
| 14 | funisfsupp 9337 | . . . 4 ⊢ ((Fun (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) ∧ (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) ∈ V ∧ 0 ∈ 𝑊) → ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) finSupp 0 ↔ ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ∈ Fin)) | |
| 15 | 11, 12, 13, 14 | mp3an2i 1495 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) finSupp 0 ↔ ((𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) supp 0 ) ∈ Fin)) |
| 16 | 10, 15 | mpbird 260 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ if(𝑥 = 𝑋, 𝐴, 0 )) finSupp 0 ) |
| 17 | 1, 16 | eqbrtrid 5151 | 1 ⊢ (𝜑 → 𝐹 finSupp 0 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ≠ wne 2961 Vcvv 3458 ∖ cdif 3905 ⊆ wss 3908 ifcif 4492 {csn 4594 class class class wbr 5114 ↦ cmpt 5197 Fun wfun 6537 (class class class)co 7423 supp csupp 8165 Fincfn 8952 finSupp cfsupp 9331 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pr 5409 ax-un 7745 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-supp 8166 df-1o 8462 df-en 8953 df-fin 8956 df-fsupp 9332 |
| This theorem is used by: dprdfid 20120 snifpsrbag 22107 evlsbagval 43359 mhpind 43367 cantnfresb 44092 mnringmulrcld 44993 |
| Copyright terms: Public domain | W3C validator |