| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > psrbasfsupp | Structured version Visualization version GIF version | ||
| Description: Rewrite a finite support for nonnegative integers : For functions mapping a set 𝐼 to the nonnegative integers, having finite support can also be written as having a finite preimage of the positive integers. The latter expression is used for example in psrbas 21889, but with the former expression, theorems about finite support can be used more directly. (Contributed by Thierry Arnoux, 10-Jan-2026.) |
| Ref | Expression |
|---|---|
| psrbasfsupp.d | ⊢ 𝐷 = {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ 𝑓 finSupp 0} |
| Ref | Expression |
|---|---|
| psrbasfsupp | ⊢ 𝐷 = {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | psrbasfsupp.d | . 2 ⊢ 𝐷 = {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ 𝑓 finSupp 0} | |
| 2 | 0nn0 12416 | . . . . 5 ⊢ 0 ∈ ℕ0 | |
| 3 | isfsupp 9268 | . . . . 5 ⊢ ((𝑓 ∈ (ℕ0 ↑m 𝐼) ∧ 0 ∈ ℕ0) → (𝑓 finSupp 0 ↔ (Fun 𝑓 ∧ (𝑓 supp 0) ∈ Fin))) | |
| 4 | 2, 3 | mpan2 691 | . . . 4 ⊢ (𝑓 ∈ (ℕ0 ↑m 𝐼) → (𝑓 finSupp 0 ↔ (Fun 𝑓 ∧ (𝑓 supp 0) ∈ Fin))) |
| 5 | elmapfun 8803 | . . . . 5 ⊢ (𝑓 ∈ (ℕ0 ↑m 𝐼) → Fun 𝑓) | |
| 6 | 5 | biantrurd 532 | . . . 4 ⊢ (𝑓 ∈ (ℕ0 ↑m 𝐼) → ((𝑓 supp 0) ∈ Fin ↔ (Fun 𝑓 ∧ (𝑓 supp 0) ∈ Fin))) |
| 7 | dfn2 12414 | . . . . . . . . . 10 ⊢ ℕ = (ℕ0 ∖ {0}) | |
| 8 | 7 | ineq2i 4169 | . . . . . . . . 9 ⊢ (ran 𝑓 ∩ ℕ) = (ran 𝑓 ∩ (ℕ0 ∖ {0})) |
| 9 | incom 4161 | . . . . . . . . 9 ⊢ (ran 𝑓 ∩ ℕ) = (ℕ ∩ ran 𝑓) | |
| 10 | indif2 4233 | . . . . . . . . 9 ⊢ (ran 𝑓 ∩ (ℕ0 ∖ {0})) = ((ran 𝑓 ∩ ℕ0) ∖ {0}) | |
| 11 | 8, 9, 10 | 3eqtr3i 2767 | . . . . . . . 8 ⊢ (ℕ ∩ ran 𝑓) = ((ran 𝑓 ∩ ℕ0) ∖ {0}) |
| 12 | elmapi 8786 | . . . . . . . . . . 11 ⊢ (𝑓 ∈ (ℕ0 ↑m 𝐼) → 𝑓:𝐼⟶ℕ0) | |
| 13 | 12 | frnd 6670 | . . . . . . . . . 10 ⊢ (𝑓 ∈ (ℕ0 ↑m 𝐼) → ran 𝑓 ⊆ ℕ0) |
| 14 | dfss2 3919 | . . . . . . . . . 10 ⊢ (ran 𝑓 ⊆ ℕ0 ↔ (ran 𝑓 ∩ ℕ0) = ran 𝑓) | |
| 15 | 13, 14 | sylib 218 | . . . . . . . . 9 ⊢ (𝑓 ∈ (ℕ0 ↑m 𝐼) → (ran 𝑓 ∩ ℕ0) = ran 𝑓) |
| 16 | 15 | difeq1d 4077 | . . . . . . . 8 ⊢ (𝑓 ∈ (ℕ0 ↑m 𝐼) → ((ran 𝑓 ∩ ℕ0) ∖ {0}) = (ran 𝑓 ∖ {0})) |
| 17 | 11, 16 | eqtrid 2783 | . . . . . . 7 ⊢ (𝑓 ∈ (ℕ0 ↑m 𝐼) → (ℕ ∩ ran 𝑓) = (ran 𝑓 ∖ {0})) |
| 18 | 17 | imaeq2d 6019 | . . . . . 6 ⊢ (𝑓 ∈ (ℕ0 ↑m 𝐼) → (◡𝑓 “ (ℕ ∩ ran 𝑓)) = (◡𝑓 “ (ran 𝑓 ∖ {0}))) |
| 19 | fimacnvinrn 7016 | . . . . . . 7 ⊢ (Fun 𝑓 → (◡𝑓 “ ℕ) = (◡𝑓 “ (ℕ ∩ ran 𝑓))) | |
| 20 | 5, 19 | syl 17 | . . . . . 6 ⊢ (𝑓 ∈ (ℕ0 ↑m 𝐼) → (◡𝑓 “ ℕ) = (◡𝑓 “ (ℕ ∩ ran 𝑓))) |
| 21 | id 22 | . . . . . . 7 ⊢ (𝑓 ∈ (ℕ0 ↑m 𝐼) → 𝑓 ∈ (ℕ0 ↑m 𝐼)) | |
| 22 | 2 | a1i 11 | . . . . . . 7 ⊢ (𝑓 ∈ (ℕ0 ↑m 𝐼) → 0 ∈ ℕ0) |
| 23 | supppreima 32770 | . . . . . . 7 ⊢ ((Fun 𝑓 ∧ 𝑓 ∈ (ℕ0 ↑m 𝐼) ∧ 0 ∈ ℕ0) → (𝑓 supp 0) = (◡𝑓 “ (ran 𝑓 ∖ {0}))) | |
| 24 | 5, 21, 22, 23 | syl3anc 1373 | . . . . . 6 ⊢ (𝑓 ∈ (ℕ0 ↑m 𝐼) → (𝑓 supp 0) = (◡𝑓 “ (ran 𝑓 ∖ {0}))) |
| 25 | 18, 20, 24 | 3eqtr4rd 2782 | . . . . 5 ⊢ (𝑓 ∈ (ℕ0 ↑m 𝐼) → (𝑓 supp 0) = (◡𝑓 “ ℕ)) |
| 26 | 25 | eleq1d 2821 | . . . 4 ⊢ (𝑓 ∈ (ℕ0 ↑m 𝐼) → ((𝑓 supp 0) ∈ Fin ↔ (◡𝑓 “ ℕ) ∈ Fin)) |
| 27 | 4, 6, 26 | 3bitr2d 307 | . . 3 ⊢ (𝑓 ∈ (ℕ0 ↑m 𝐼) → (𝑓 finSupp 0 ↔ (◡𝑓 “ ℕ) ∈ Fin)) |
| 28 | 27 | rabbiia 3403 | . 2 ⊢ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ 𝑓 finSupp 0} = {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} |
| 29 | 1, 28 | eqtri 2759 | 1 ⊢ 𝐷 = {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 {crab 3399 ∖ cdif 3898 ∩ cin 3900 ⊆ wss 3901 {csn 4580 class class class wbr 5098 ◡ccnv 5623 ran crn 5625 “ cima 5627 Fun wfun 6486 (class class class)co 7358 supp csupp 8102 ↑m cmap 8763 Fincfn 8883 finSupp cfsupp 9264 0cc0 11026 ℕcn 12145 ℕ0cn0 12401 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-supp 8103 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fsupp 9265 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-nn 12146 df-n0 12402 |
| This theorem is referenced by: extvfvvcl 33700 extvfvcl 33701 mplmulmvr 33704 evlextv 33707 mplvrpmfgalem 33709 mplvrpmga 33710 mplvrpmmhm 33711 mplvrpmrhm 33712 issply 33719 esplyfval0 33722 esplyfval2 33723 esplympl 33725 esplymhp 33726 esplyfval3 33730 esplyind 33731 vieta 33736 |
| Copyright terms: Public domain | W3C validator |