Metamath Proof Explorer


Theorem psrbasfsupp

Description: Rewrite a finite support for nonnegative integers : For functions mapping a set I 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 , but with the former expression, theorems about finite support can be used more directly. (Contributed by Thierry Arnoux, 10-Jan-2026)

Ref Expression
Hypothesis psrbasfsupp.d D = f 0 I | finSupp 0 f
Assertion psrbasfsupp D = f 0 I | f -1 Fin

Proof

Step Hyp Ref Expression
1 psrbasfsupp.d D = f 0 I | finSupp 0 f
2 0nn0 0 0
3 isfsupp f 0 I 0 0 finSupp 0 f Fun f f supp 0 Fin
4 2 3 mpan2 f 0 I finSupp 0 f Fun f f supp 0 Fin
5 elmapfun f 0 I Fun f
6 5 biantrurd f 0 I f supp 0 Fin Fun f f supp 0 Fin
7 dfn2 = 0 0
8 7 ineq2i ran f = ran f 0 0
9 incom ran f = ran f
10 indif2 ran f 0 0 = ran f 0 0
11 8 9 10 3eqtr3i ran f = ran f 0 0
12 elmapi f 0 I f : I 0
13 12 frnd f 0 I ran f 0
14 dfss2 ran f 0 ran f 0 = ran f
15 13 14 sylib f 0 I ran f 0 = ran f
16 15 difeq1d f 0 I ran f 0 0 = ran f 0
17 11 16 eqtrid f 0 I ran f = ran f 0
18 17 imaeq2d f 0 I f -1 ran f = f -1 ran f 0
19 fimacnvinrn Fun f f -1 = f -1 ran f
20 5 19 syl f 0 I f -1 = f -1 ran f
21 id f 0 I f 0 I
22 2 a1i f 0 I 0 0
23 supppreima Fun f f 0 I 0 0 f supp 0 = f -1 ran f 0
24 5 21 22 23 syl3anc f 0 I f supp 0 = f -1 ran f 0
25 18 20 24 3eqtr4rd f 0 I f supp 0 = f -1
26 25 eleq1d f 0 I f supp 0 Fin f -1 Fin
27 4 6 26 3bitr2d f 0 I finSupp 0 f f -1 Fin
28 27 rabbiia f 0 I | finSupp 0 f = f 0 I | f -1 Fin
29 1 28 eqtri D = f 0 I | f -1 Fin