Metamath Proof Explorer


Theorem mapfien

Description: A bijection of the base sets induces a bijection on the set of finitely supported functions. (Contributed by Mario Carneiro, 30-May-2015) (Revised by AV, 3-Jul-2019) (Revised by AV, 28-Jul-2024)

Ref Expression
Hypotheses mapfien.s ⊢ S = x ∈ B A | finSupp Z⁡ x
mapfien.t ⊢ T = x ∈ D C | finSupp W⁡ x
mapfien.w ⊢ W = G ⁡ Z
mapfien.f ⊢ φ → F : C ⟶ 1-1 onto A
mapfien.g ⊢ φ → G : B ⟶ 1-1 onto D
mapfien.a ⊢ φ → A ∈ U
mapfien.b ⊢ φ → B ∈ V
mapfien.c ⊢ φ → C ∈ X
mapfien.d ⊢ φ → D ∈ Y
mapfien.z ⊢ φ → Z ∈ B
Assertion mapfien ⊢ φ → f ∈ S ⟼ G ∘ f ∘ F : S ⟶ 1-1 onto T

Proof

Step Hyp Ref Expression
1 mapfien.s ⊢ S = x ∈ B A | finSupp Z⁡ x
2 mapfien.t ⊢ T = x ∈ D C | finSupp W⁡ x
3 mapfien.w ⊢ W = G ⁡ Z
4 mapfien.f ⊢ φ → F : C ⟶ 1-1 onto A
5 mapfien.g ⊢ φ → G : B ⟶ 1-1 onto D
6 mapfien.a ⊢ φ → A ∈ U
7 mapfien.b ⊢ φ → B ∈ V
8 mapfien.c ⊢ φ → C ∈ X
9 mapfien.d ⊢ φ → D ∈ Y
10 mapfien.z ⊢ φ → Z ∈ B
11 eqid ⊢ f ∈ S ⟼ G ∘ f ∘ F = f ∈ S ⟼ G ∘ f ∘ F
12 f1of ⊢ G : B ⟶ 1-1 onto D → G : B ⟶ D
13 5 12 syl ⊢ φ → G : B ⟶ D
14 13 adantr ⊢ φ ∧ f ∈ S → G : B ⟶ D
15 breq1 ⊢ x = f → finSupp Z⁡ x ↔ finSupp Z⁡ f
16 15 1 elrab2 ⊢ f ∈ S ↔ f ∈ B A ∧ finSupp Z⁡ f
17 16 simplbi ⊢ f ∈ S → f ∈ B A
18 17 adantl ⊢ φ ∧ f ∈ S → f ∈ B A
19 elmapi ⊢ f ∈ B A → f : A ⟶ B
20 18 19 syl ⊢ φ ∧ f ∈ S → f : A ⟶ B
21 f1of ⊢ F : C ⟶ 1-1 onto A → F : C ⟶ A
22 4 21 syl ⊢ φ → F : C ⟶ A
23 22 adantr ⊢ φ ∧ f ∈ S → F : C ⟶ A
24 20 23 fcod ⊢ φ ∧ f ∈ S → f ∘ F : C ⟶ B
25 14 24 fcod ⊢ φ ∧ f ∈ S → G ∘ f ∘ F : C ⟶ D
26 9 8 elmapd ⊢ φ → G ∘ f ∘ F ∈ D C ↔ G ∘ f ∘ F : C ⟶ D
27 26 adantr ⊢ φ ∧ f ∈ S → G ∘ f ∘ F ∈ D C ↔ G ∘ f ∘ F : C ⟶ D
28 25 27 mpbird ⊢ φ ∧ f ∈ S → G ∘ f ∘ F ∈ D C
29 1 2 3 4 5 6 7 8 9 10 mapfienlem1 ⊢ φ ∧ f ∈ S → finSupp W⁡ G ∘ f ∘ F
30 breq1 ⊢ x = G ∘ f ∘ F → finSupp W⁡ x ↔ finSupp W⁡ G ∘ f ∘ F
31 30 2 elrab2 ⊢ G ∘ f ∘ F ∈ T ↔ G ∘ f ∘ F ∈ D C ∧ finSupp W⁡ G ∘ f ∘ F
32 28 29 31 sylanbrc ⊢ φ ∧ f ∈ S → G ∘ f ∘ F ∈ T
33 1 2 3 4 5 6 7 8 9 10 mapfienlem3 ⊢ φ ∧ g ∈ T → G -1 ∘ g ∘ F -1 ∈ S
34 coass ⊢ G -1 ∘ g ∘ F -1 ∘ F = G -1 ∘ g ∘ F -1 ∘ F
35 4 adantr ⊢ φ ∧ f ∈ S ∧ g ∈ T → F : C ⟶ 1-1 onto A
36 f1ococnv1 ⊢ F : C ⟶ 1-1 onto A → F -1 ∘ F = I ↾ C
37 35 36 syl ⊢ φ ∧ f ∈ S ∧ g ∈ T → F -1 ∘ F = I ↾ C
38 37 coeq2d ⊢ φ ∧ f ∈ S ∧ g ∈ T → G -1 ∘ g ∘ F -1 ∘ F = G -1 ∘ g ∘ I ↾ C
39 f1ocnv ⊢ G : B ⟶ 1-1 onto D → G -1 : D ⟶ 1-1 onto B
40 f1of ⊢ G -1 : D ⟶ 1-1 onto B → G -1 : D ⟶ B
41 5 39 40 3syl ⊢ φ → G -1 : D ⟶ B
42 41 adantr ⊢ φ ∧ g ∈ T → G -1 : D ⟶ B
43 breq1 ⊢ x = g → finSupp W⁡ x ↔ finSupp W⁡ g
44 43 2 elrab2 ⊢ g ∈ T ↔ g ∈ D C ∧ finSupp W⁡ g
45 44 bilani ⊢ φ ∧ g ∈ T → g ∈ D C ∧ finSupp W⁡ g
46 45 simpld ⊢ φ ∧ g ∈ T → g ∈ D C
47 elmapi ⊢ g ∈ D C → g : C ⟶ D
48 46 47 syl ⊢ φ ∧ g ∈ T → g : C ⟶ D
49 42 48 fcod ⊢ φ ∧ g ∈ T → G -1 ∘ g : C ⟶ B
50 49 adantrl ⊢ φ ∧ f ∈ S ∧ g ∈ T → G -1 ∘ g : C ⟶ B
51 fcoi1 ⊢ G -1 ∘ g : C ⟶ B → G -1 ∘ g ∘ I ↾ C = G -1 ∘ g
52 50 51 syl ⊢ φ ∧ f ∈ S ∧ g ∈ T → G -1 ∘ g ∘ I ↾ C = G -1 ∘ g
53 38 52 eqtrd ⊢ φ ∧ f ∈ S ∧ g ∈ T → G -1 ∘ g ∘ F -1 ∘ F = G -1 ∘ g
54 34 53 eqtrid ⊢ φ ∧ f ∈ S ∧ g ∈ T → G -1 ∘ g ∘ F -1 ∘ F = G -1 ∘ g
55 54 eqeq2d ⊢ φ ∧ f ∈ S ∧ g ∈ T → f ∘ F = G -1 ∘ g ∘ F -1 ∘ F ↔ f ∘ F = G -1 ∘ g
56 coass ⊢ G -1 ∘ G ∘ f ∘ F = G -1 ∘ G ∘ f ∘ F
57 5 adantr ⊢ φ ∧ f ∈ S ∧ g ∈ T → G : B ⟶ 1-1 onto D
58 f1ococnv1 ⊢ G : B ⟶ 1-1 onto D → G -1 ∘ G = I ↾ B
59 57 58 syl ⊢ φ ∧ f ∈ S ∧ g ∈ T → G -1 ∘ G = I ↾ B
60 59 coeq1d ⊢ φ ∧ f ∈ S ∧ g ∈ T → G -1 ∘ G ∘ f ∘ F = I ↾ B ∘ f ∘ F
61 24 adantrr ⊢ φ ∧ f ∈ S ∧ g ∈ T → f ∘ F : C ⟶ B
62 fcoi2 ⊢ f ∘ F : C ⟶ B → I ↾ B ∘ f ∘ F = f ∘ F
63 61 62 syl ⊢ φ ∧ f ∈ S ∧ g ∈ T → I ↾ B ∘ f ∘ F = f ∘ F
64 60 63 eqtrd ⊢ φ ∧ f ∈ S ∧ g ∈ T → G -1 ∘ G ∘ f ∘ F = f ∘ F
65 56 64 eqtr3id ⊢ φ ∧ f ∈ S ∧ g ∈ T → G -1 ∘ G ∘ f ∘ F = f ∘ F
66 65 eqeq2d ⊢ φ ∧ f ∈ S ∧ g ∈ T → G -1 ∘ g = G -1 ∘ G ∘ f ∘ F ↔ G -1 ∘ g = f ∘ F
67 eqcom ⊢ G -1 ∘ g = f ∘ F ↔ f ∘ F = G -1 ∘ g
68 66 67 bitrdi ⊢ φ ∧ f ∈ S ∧ g ∈ T → G -1 ∘ g = G -1 ∘ G ∘ f ∘ F ↔ f ∘ F = G -1 ∘ g
69 55 68 bitr4d ⊢ φ ∧ f ∈ S ∧ g ∈ T → f ∘ F = G -1 ∘ g ∘ F -1 ∘ F ↔ G -1 ∘ g = G -1 ∘ G ∘ f ∘ F
70 f1ofo ⊢ F : C ⟶ 1-1 onto A → F : C ⟶ onto A
71 35 70 syl ⊢ φ ∧ f ∈ S ∧ g ∈ T → F : C ⟶ onto A
72 ffn ⊢ f : A ⟶ B → f Fn A
73 18 19 72 3syl ⊢ φ ∧ f ∈ S → f Fn A
74 73 adantrr ⊢ φ ∧ f ∈ S ∧ g ∈ T → f Fn A
75 f1ocnv ⊢ F : C ⟶ 1-1 onto A → F -1 : A ⟶ 1-1 onto C
76 f1of ⊢ F -1 : A ⟶ 1-1 onto C → F -1 : A ⟶ C
77 4 75 76 3syl ⊢ φ → F -1 : A ⟶ C
78 77 adantr ⊢ φ ∧ g ∈ T → F -1 : A ⟶ C
79 49 78 fcod ⊢ φ ∧ g ∈ T → G -1 ∘ g ∘ F -1 : A ⟶ B
80 79 ffnd ⊢ φ ∧ g ∈ T → G -1 ∘ g ∘ F -1 Fn A
81 80 adantrl ⊢ φ ∧ f ∈ S ∧ g ∈ T → G -1 ∘ g ∘ F -1 Fn A
82 cocan2 ⊢ F : C ⟶ onto A ∧ f Fn A ∧ G -1 ∘ g ∘ F -1 Fn A → f ∘ F = G -1 ∘ g ∘ F -1 ∘ F ↔ f = G -1 ∘ g ∘ F -1
83 71 74 81 82 syl3anc ⊢ φ ∧ f ∈ S ∧ g ∈ T → f ∘ F = G -1 ∘ g ∘ F -1 ∘ F ↔ f = G -1 ∘ g ∘ F -1
84 5 39 syl ⊢ φ → G -1 : D ⟶ 1-1 onto B
85 84 adantr ⊢ φ ∧ f ∈ S ∧ g ∈ T → G -1 : D ⟶ 1-1 onto B
86 f1of1 ⊢ G -1 : D ⟶ 1-1 onto B → G -1 : D ⟶ 1-1 B
87 85 86 syl ⊢ φ ∧ f ∈ S ∧ g ∈ T → G -1 : D ⟶ 1-1 B
88 48 adantrl ⊢ φ ∧ f ∈ S ∧ g ∈ T → g : C ⟶ D
89 25 adantrr ⊢ φ ∧ f ∈ S ∧ g ∈ T → G ∘ f ∘ F : C ⟶ D
90 cocan1 ⊢ G -1 : D ⟶ 1-1 B ∧ g : C ⟶ D ∧ G ∘ f ∘ F : C ⟶ D → G -1 ∘ g = G -1 ∘ G ∘ f ∘ F ↔ g = G ∘ f ∘ F
91 87 88 89 90 syl3anc ⊢ φ ∧ f ∈ S ∧ g ∈ T → G -1 ∘ g = G -1 ∘ G ∘ f ∘ F ↔ g = G ∘ f ∘ F
92 69 83 91 3bitr3d ⊢ φ ∧ f ∈ S ∧ g ∈ T → f = G -1 ∘ g ∘ F -1 ↔ g = G ∘ f ∘ F
93 11 32 33 92 f1o2d ⊢ φ → f ∈ S ⟼ G ∘ f ∘ F : S ⟶ 1-1 onto T