Metamath Proof Explorer


Theorem ffsrn

Description: The range of a finitely supported function is finite. The proof uses fnrndomnum rather than fnrndomg , and so does not require ax-ac . (Contributed by Thierry Arnoux, 27-Aug-2017) (Revised by Vincent Gonzalez, 24-Aug-2026)

Ref Expression
Hypotheses ffsrn.z ⊢ φ → Z ∈ W
ffsrn.0 ⊢ φ → F ∈ V
ffsrn.1 ⊢ φ → Fun ⁡ F
ffsrn.2 ⊢ φ → F supp Z ∈ Fin
Assertion ffsrn ⊢ φ → ran ⁡ F ∈ Fin

Proof

Step Hyp Ref Expression
1 ffsrn.z ⊢ φ → Z ∈ W
2 ffsrn.0 ⊢ φ → F ∈ V
3 ffsrn.1 ⊢ φ → Fun ⁡ F
4 ffsrn.2 ⊢ φ → F supp Z ∈ Fin
5 dfdm4 ⊢ dom ⁡ F = ran ⁡ F -1
6 dfrn4 ⊢ ran ⁡ F -1 = F -1 V
7 5 6 eqtri ⊢ dom ⁡ F = F -1 V
8 df-fn ⊢ F Fn F -1 V ↔ Fun ⁡ F ∧ dom ⁡ F = F -1 V
9 fnresdm ⊢ F Fn F -1 V → F ↾ F -1 V = F
10 8 9 sylbir ⊢ Fun ⁡ F ∧ dom ⁡ F = F -1 V → F ↾ F -1 V = F
11 3 7 10 sylancl ⊢ φ → F ↾ F -1 V = F
12 imaundi ⊢ F -1 V ∖ Z ∪ Z = F -1 V ∖ Z ∪ F -1 Z
13 12 reseq2i ⊢ F ↾ F -1 V ∖ Z ∪ Z = F ↾ F -1 V ∖ Z ∪ F -1 Z
14 undif1 ⊢ V ∖ Z ∪ Z = V ∪ Z
15 ssv ⊢ Z ⊆ V
16 ssequn2 ⊢ Z ⊆ V ↔ V ∪ Z = V
17 15 16 mpbi ⊢ V ∪ Z = V
18 14 17 eqtri ⊢ V ∖ Z ∪ Z = V
19 18 imaeq2i ⊢ F -1 V ∖ Z ∪ Z = F -1 V
20 19 reseq2i ⊢ F ↾ F -1 V ∖ Z ∪ Z = F ↾ F -1 V
21 resundi ⊢ F ↾ F -1 V ∖ Z ∪ F -1 Z = F ↾ F -1 V ∖ Z ∪ F ↾ F -1 Z
22 13 20 21 3eqtr3i ⊢ F ↾ F -1 V = F ↾ F -1 V ∖ Z ∪ F ↾ F -1 Z
23 11 22 eqtr3di ⊢ φ → F = F ↾ F -1 V ∖ Z ∪ F ↾ F -1 Z
24 23 rneqd ⊢ φ → ran ⁡ F = ran ⁡ F ↾ F -1 V ∖ Z ∪ F ↾ F -1 Z
25 rnun ⊢ ran ⁡ F ↾ F -1 V ∖ Z ∪ F ↾ F -1 Z = ran ⁡ F ↾ F -1 V ∖ Z ∪ ran ⁡ F ↾ F -1 Z
26 24 25 eqtrdi ⊢ φ → ran ⁡ F = ran ⁡ F ↾ F -1 V ∖ Z ∪ ran ⁡ F ↾ F -1 Z
27 suppimacnv ⊢ F ∈ V ∧ Z ∈ W → F supp Z = F -1 V ∖ Z
28 2 1 27 syl2anc ⊢ φ → F supp Z = F -1 V ∖ Z
29 28 4 eqeltrrd ⊢ φ → F -1 V ∖ Z ∈ Fin
30 finnum ⊢ F -1 V ∖ Z ∈ Fin → F -1 V ∖ Z ∈ dom ⁡ card
31 29 30 syl ⊢ φ → F -1 V ∖ Z ∈ dom ⁡ card
32 cnvimass ⊢ F -1 V ∖ Z ⊆ dom ⁡ F
33 fores ⊢ Fun ⁡ F ∧ F -1 V ∖ Z ⊆ dom ⁡ F → F ↾ F -1 V ∖ Z : F -1 V ∖ Z ⟶ onto F F -1 V ∖ Z
34 3 32 33 sylancl ⊢ φ → F ↾ F -1 V ∖ Z : F -1 V ∖ Z ⟶ onto F F -1 V ∖ Z
35 fofn ⊢ F ↾ F -1 V ∖ Z : F -1 V ∖ Z ⟶ onto F F -1 V ∖ Z → F ↾ F -1 V ∖ Z Fn F -1 V ∖ Z
36 34 35 syl ⊢ φ → F ↾ F -1 V ∖ Z Fn F -1 V ∖ Z
37 fnrndomnum ⊢ F -1 V ∖ Z ∈ dom ⁡ card → F ↾ F -1 V ∖ Z Fn F -1 V ∖ Z → ran ⁡ F ↾ F -1 V ∖ Z ≼ F -1 V ∖ Z
38 31 36 37 sylc ⊢ φ → ran ⁡ F ↾ F -1 V ∖ Z ≼ F -1 V ∖ Z
39 domfi ⊢ F -1 V ∖ Z ∈ Fin ∧ ran ⁡ F ↾ F -1 V ∖ Z ≼ F -1 V ∖ Z → ran ⁡ F ↾ F -1 V ∖ Z ∈ Fin
40 29 38 39 syl2anc ⊢ φ → ran ⁡ F ↾ F -1 V ∖ Z ∈ Fin
41 snfi ⊢ Z ∈ Fin
42 df-ima ⊢ F F -1 Z = ran ⁡ F ↾ F -1 Z
43 funimacnv ⊢ Fun ⁡ F → F F -1 Z = Z ∩ ran ⁡ F
44 3 43 syl ⊢ φ → F F -1 Z = Z ∩ ran ⁡ F
45 42 44 eqtr3id ⊢ φ → ran ⁡ F ↾ F -1 Z = Z ∩ ran ⁡ F
46 inss1 ⊢ Z ∩ ran ⁡ F ⊆ Z
47 45 46 eqsstrdi ⊢ φ → ran ⁡ F ↾ F -1 Z ⊆ Z
48 ssfi ⊢ Z ∈ Fin ∧ ran ⁡ F ↾ F -1 Z ⊆ Z → ran ⁡ F ↾ F -1 Z ∈ Fin
49 41 47 48 sylancr ⊢ φ → ran ⁡ F ↾ F -1 Z ∈ Fin
50 unfi ⊢ ran ⁡ F ↾ F -1 V ∖ Z ∈ Fin ∧ ran ⁡ F ↾ F -1 Z ∈ Fin → ran ⁡ F ↾ F -1 V ∖ Z ∪ ran ⁡ F ↾ F -1 Z ∈ Fin
51 40 49 50 syl2anc ⊢ φ → ran ⁡ F ↾ F -1 V ∖ Z ∪ ran ⁡ F ↾ F -1 Z ∈ Fin
52 26 51 eqeltrd ⊢ φ → ran ⁡ F ∈ Fin