Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  psrbasfsupp Structured version   Visualization version   GIF version

Theorem psrbasfsupp 33704
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 21901, but with the former expression, theorems about finite support can be used more directly. (Contributed by Thierry Arnoux, 10-Jan-2026.)
Hypothesis
Ref Expression
psrbasfsupp.d 𝐷 = {𝑓 ∈ (ℕ0m 𝐼) ∣ 𝑓 finSupp 0}
Assertion
Ref Expression
psrbasfsupp 𝐷 = {𝑓 ∈ (ℕ0m 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}

Proof of Theorem psrbasfsupp
StepHypRef Expression
1 psrbasfsupp.d . 2 𝐷 = {𝑓 ∈ (ℕ0m 𝐼) ∣ 𝑓 finSupp 0}
2 0nn0 12428 . . . . 5 0 ∈ ℕ0
3 isfsupp 9280 . . . . 5 ((𝑓 ∈ (ℕ0m 𝐼) ∧ 0 ∈ ℕ0) → (𝑓 finSupp 0 ↔ (Fun 𝑓 ∧ (𝑓 supp 0) ∈ Fin)))
42, 3mpan2 692 . . . 4 (𝑓 ∈ (ℕ0m 𝐼) → (𝑓 finSupp 0 ↔ (Fun 𝑓 ∧ (𝑓 supp 0) ∈ Fin)))
5 elmapfun 8815 . . . . 5 (𝑓 ∈ (ℕ0m 𝐼) → Fun 𝑓)
65biantrurd 532 . . . 4 (𝑓 ∈ (ℕ0m 𝐼) → ((𝑓 supp 0) ∈ Fin ↔ (Fun 𝑓 ∧ (𝑓 supp 0) ∈ Fin)))
7 dfn2 12426 . . . . . . . . . 10 ℕ = (ℕ0 ∖ {0})
87ineq2i 4171 . . . . . . . . 9 (ran 𝑓 ∩ ℕ) = (ran 𝑓 ∩ (ℕ0 ∖ {0}))
9 incom 4163 . . . . . . . . 9 (ran 𝑓 ∩ ℕ) = (ℕ ∩ ran 𝑓)
10 indif2 4235 . . . . . . . . 9 (ran 𝑓 ∩ (ℕ0 ∖ {0})) = ((ran 𝑓 ∩ ℕ0) ∖ {0})
118, 9, 103eqtr3i 2768 . . . . . . . 8 (ℕ ∩ ran 𝑓) = ((ran 𝑓 ∩ ℕ0) ∖ {0})
12 elmapi 8798 . . . . . . . . . . 11 (𝑓 ∈ (ℕ0m 𝐼) → 𝑓:𝐼⟶ℕ0)
1312frnd 6678 . . . . . . . . . 10 (𝑓 ∈ (ℕ0m 𝐼) → ran 𝑓 ⊆ ℕ0)
14 dfss2 3921 . . . . . . . . . 10 (ran 𝑓 ⊆ ℕ0 ↔ (ran 𝑓 ∩ ℕ0) = ran 𝑓)
1513, 14sylib 218 . . . . . . . . 9 (𝑓 ∈ (ℕ0m 𝐼) → (ran 𝑓 ∩ ℕ0) = ran 𝑓)
1615difeq1d 4079 . . . . . . . 8 (𝑓 ∈ (ℕ0m 𝐼) → ((ran 𝑓 ∩ ℕ0) ∖ {0}) = (ran 𝑓 ∖ {0}))
1711, 16eqtrid 2784 . . . . . . 7 (𝑓 ∈ (ℕ0m 𝐼) → (ℕ ∩ ran 𝑓) = (ran 𝑓 ∖ {0}))
1817imaeq2d 6027 . . . . . 6 (𝑓 ∈ (ℕ0m 𝐼) → (𝑓 “ (ℕ ∩ ran 𝑓)) = (𝑓 “ (ran 𝑓 ∖ {0})))
19 fimacnvinrn 7025 . . . . . . 7 (Fun 𝑓 → (𝑓 “ ℕ) = (𝑓 “ (ℕ ∩ ran 𝑓)))
205, 19syl 17 . . . . . 6 (𝑓 ∈ (ℕ0m 𝐼) → (𝑓 “ ℕ) = (𝑓 “ (ℕ ∩ ran 𝑓)))
21 id 22 . . . . . . 7 (𝑓 ∈ (ℕ0m 𝐼) → 𝑓 ∈ (ℕ0m 𝐼))
222a1i 11 . . . . . . 7 (𝑓 ∈ (ℕ0m 𝐼) → 0 ∈ ℕ0)
23 supppreima 32780 . . . . . . 7 ((Fun 𝑓𝑓 ∈ (ℕ0m 𝐼) ∧ 0 ∈ ℕ0) → (𝑓 supp 0) = (𝑓 “ (ran 𝑓 ∖ {0})))
245, 21, 22, 23syl3anc 1374 . . . . . 6 (𝑓 ∈ (ℕ0m 𝐼) → (𝑓 supp 0) = (𝑓 “ (ran 𝑓 ∖ {0})))
2518, 20, 243eqtr4rd 2783 . . . . 5 (𝑓 ∈ (ℕ0m 𝐼) → (𝑓 supp 0) = (𝑓 “ ℕ))
2625eleq1d 2822 . . . 4 (𝑓 ∈ (ℕ0m 𝐼) → ((𝑓 supp 0) ∈ Fin ↔ (𝑓 “ ℕ) ∈ Fin))
274, 6, 263bitr2d 307 . . 3 (𝑓 ∈ (ℕ0m 𝐼) → (𝑓 finSupp 0 ↔ (𝑓 “ ℕ) ∈ Fin))
2827rabbiia 3405 . 2 {𝑓 ∈ (ℕ0m 𝐼) ∣ 𝑓 finSupp 0} = {𝑓 ∈ (ℕ0m 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}
291, 28eqtri 2760 1 𝐷 = {𝑓 ∈ (ℕ0m 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1542  wcel 2114  {crab 3401  cdif 3900  cin 3902  wss 3903  {csn 4582   class class class wbr 5100  ccnv 5631  ran crn 5633  cima 5635  Fun wfun 6494  (class class class)co 7368   supp csupp 8112  m cmap 8775  Fincfn 8895   finSupp cfsupp 9276  0cc0 11038  cn 12157  0cn0 12413
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-supp 8113  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-er 8645  df-map 8777  df-en 8896  df-dom 8897  df-sdom 8898  df-fsupp 9277  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-nn 12158  df-n0 12414
This theorem is referenced by:  extvfvvcl  33711  extvfvcl  33712  mplmulmvr  33715  evlextv  33718  mplvrpmfgalem  33720  mplvrpmga  33721  mplvrpmmhm  33722  mplvrpmrhm  33723  psrgsum  33724  psrmon  33725  psrmonmul  33726  psrmonmul2  33727  psrmonprod  33728  mplgsum  33729  mplmonprod  33730  issply  33737  esplyfval0  33740  esplyfval2  33741  esplympl  33743  esplymhp  33744  esplyfval3  33748  esplyfval1  33749  esplyfvaln  33750  esplyind  33751  vieta  33756
  Copyright terms: Public domain W3C validator