Metamath Proof Explorer


Theorem fsuppssind

Description: Induction on functions F : A --> B with finite support (see fsuppind ) whose supports are subsets of S . (Contributed by SN, 15-Jun-2024)

Ref Expression
Hypotheses fsuppssind.b ⊢ B = Base G
fsuppssind.z ⊢ 0 ˙ = 0 G
fsuppssind.p ⊢ + ˙ = + G
fsuppssind.g ⊢ φ → G ∈ Grp
fsuppssind.v ⊢ φ → I ∈ V
fsuppssind.s ⊢ φ → S ⊆ I
fsuppssind.0 ⊢ φ → I × 0 ˙ ∈ H
fsuppssind.1 ⊢ φ ∧ a ∈ S ∧ b ∈ B → s ∈ I ⟼ if s = a b 0 ˙ ∈ H
fsuppssind.2 ⊢ φ ∧ x ∈ H ∧ y ∈ H → x + ˙ f y ∈ H
fsuppssind.3 ⊢ φ → X : I ⟶ B
fsuppssind.4 ⊢ φ → finSupp 0 ˙⁡ X
fsuppssind.5 ⊢ φ → X supp 0 ˙ ⊆ S
Assertion fsuppssind ⊢ φ → X ∈ H

Proof

Step Hyp Ref Expression
1 fsuppssind.b ⊢ B = Base G
2 fsuppssind.z ⊢ 0 ˙ = 0 G
3 fsuppssind.p ⊢ + ˙ = + G
4 fsuppssind.g ⊢ φ → G ∈ Grp
5 fsuppssind.v ⊢ φ → I ∈ V
6 fsuppssind.s ⊢ φ → S ⊆ I
7 fsuppssind.0 ⊢ φ → I × 0 ˙ ∈ H
8 fsuppssind.1 ⊢ φ ∧ a ∈ S ∧ b ∈ B → s ∈ I ⟼ if s = a b 0 ˙ ∈ H
9 fsuppssind.2 ⊢ φ ∧ x ∈ H ∧ y ∈ H → x + ˙ f y ∈ H
10 fsuppssind.3 ⊢ φ → X : I ⟶ B
11 fsuppssind.4 ⊢ φ → finSupp 0 ˙⁡ X
12 fsuppssind.5 ⊢ φ → X supp 0 ˙ ⊆ S
13 10 6 fssresd ⊢ φ → X ↾ S : S ⟶ B
14 2 fvexi ⊢ 0 ˙ ∈ V
15 14 a1i ⊢ φ → 0 ˙ ∈ V
16 11 15 fsuppres ⊢ φ → finSupp 0 ˙⁡ X ↾ S
17 13 16 jca ⊢ φ → X ↾ S : S ⟶ B ∧ finSupp 0 ˙⁡ X ↾ S
18 5 6 ssexd ⊢ φ → S ∈ V
19 1 2 grpidcl ⊢ G ∈ Grp → 0 ˙ ∈ B
20 4 19 syl ⊢ φ → 0 ˙ ∈ B
21 fconst6g ⊢ 0 ˙ ∈ B → S × 0 ˙ : S ⟶ B
22 20 21 syl ⊢ φ → S × 0 ˙ : S ⟶ B
23 xpundir ⊢ S ∪ I ∖ S × 0 ˙ = S × 0 ˙ ∪ I ∖ S × 0 ˙
24 undif ⊢ S ⊆ I ↔ S ∪ I ∖ S = I
25 6 24 sylib ⊢ φ → S ∪ I ∖ S = I
26 25 xpeq1d ⊢ φ → S ∪ I ∖ S × 0 ˙ = I × 0 ˙
27 23 26 eqtr3id ⊢ φ → S × 0 ˙ ∪ I ∖ S × 0 ˙ = I × 0 ˙
28 27 7 eqeltrd ⊢ φ → S × 0 ˙ ∪ I ∖ S × 0 ˙ ∈ H
29 1 fvexi ⊢ B ∈ V
30 29 a1i ⊢ φ → B ∈ V
31 30 5 6 fsuppssindlem2 ⊢ φ → S × 0 ˙ ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H ↔ S × 0 ˙ : S ⟶ B ∧ S × 0 ˙ ∪ I ∖ S × 0 ˙ ∈ H
32 22 28 31 mpbir2and ⊢ φ → S × 0 ˙ ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H
33 simplrr ⊢ φ ∧ a ∈ S ∧ b ∈ B ∧ s ∈ S → b ∈ B
34 20 ad2antrr ⊢ φ ∧ a ∈ S ∧ b ∈ B ∧ s ∈ S → 0 ˙ ∈ B
35 33 34 ifcld ⊢ φ ∧ a ∈ S ∧ b ∈ B ∧ s ∈ S → if s = a b 0 ˙ ∈ B
36 35 fmpttd ⊢ φ ∧ a ∈ S ∧ b ∈ B → s ∈ S ⟼ if s = a b 0 ˙ : S ⟶ B
37 fconstmpt ⊢ I ∖ S × 0 ˙ = s ∈ I ∖ S ⟼ 0 ˙
38 37 uneq2i ⊢ s ∈ S ⟼ if s = a b 0 ˙ ∪ I ∖ S × 0 ˙ = s ∈ S ⟼ if s = a b 0 ˙ ∪ s ∈ I ∖ S ⟼ 0 ˙
39 eldifn ⊢ s ∈ I ∖ S → ¬ s ∈ S
40 eleq1a ⊢ a ∈ S → s = a → s ∈ S
41 40 con3dimp ⊢ a ∈ S ∧ ¬ s ∈ S → ¬ s = a
42 41 adantlr ⊢ a ∈ S ∧ b ∈ B ∧ ¬ s ∈ S → ¬ s = a
43 42 adantll ⊢ φ ∧ a ∈ S ∧ b ∈ B ∧ ¬ s ∈ S → ¬ s = a
44 39 43 sylan2 ⊢ φ ∧ a ∈ S ∧ b ∈ B ∧ s ∈ I ∖ S → ¬ s = a
45 44 iffalsed ⊢ φ ∧ a ∈ S ∧ b ∈ B ∧ s ∈ I ∖ S → if s = a b 0 ˙ = 0 ˙
46 45 mpteq2dva ⊢ φ ∧ a ∈ S ∧ b ∈ B → s ∈ I ∖ S ⟼ if s = a b 0 ˙ = s ∈ I ∖ S ⟼ 0 ˙
47 46 uneq2d ⊢ φ ∧ a ∈ S ∧ b ∈ B → s ∈ S ⟼ if s = a b 0 ˙ ∪ s ∈ I ∖ S ⟼ if s = a b 0 ˙ = s ∈ S ⟼ if s = a b 0 ˙ ∪ s ∈ I ∖ S ⟼ 0 ˙
48 mptun ⊢ s ∈ S ∪ I ∖ S ⟼ if s = a b 0 ˙ = s ∈ S ⟼ if s = a b 0 ˙ ∪ s ∈ I ∖ S ⟼ if s = a b 0 ˙
49 6 adantr ⊢ φ ∧ a ∈ S ∧ b ∈ B → S ⊆ I
50 49 24 sylib ⊢ φ ∧ a ∈ S ∧ b ∈ B → S ∪ I ∖ S = I
51 50 mpteq1d ⊢ φ ∧ a ∈ S ∧ b ∈ B → s ∈ S ∪ I ∖ S ⟼ if s = a b 0 ˙ = s ∈ I ⟼ if s = a b 0 ˙
52 48 51 eqtr3id ⊢ φ ∧ a ∈ S ∧ b ∈ B → s ∈ S ⟼ if s = a b 0 ˙ ∪ s ∈ I ∖ S ⟼ if s = a b 0 ˙ = s ∈ I ⟼ if s = a b 0 ˙
53 47 52 eqtr3d ⊢ φ ∧ a ∈ S ∧ b ∈ B → s ∈ S ⟼ if s = a b 0 ˙ ∪ s ∈ I ∖ S ⟼ 0 ˙ = s ∈ I ⟼ if s = a b 0 ˙
54 38 53 eqtrid ⊢ φ ∧ a ∈ S ∧ b ∈ B → s ∈ S ⟼ if s = a b 0 ˙ ∪ I ∖ S × 0 ˙ = s ∈ I ⟼ if s = a b 0 ˙
55 54 8 eqeltrd ⊢ φ ∧ a ∈ S ∧ b ∈ B → s ∈ S ⟼ if s = a b 0 ˙ ∪ I ∖ S × 0 ˙ ∈ H
56 29 a1i ⊢ φ ∧ a ∈ S ∧ b ∈ B → B ∈ V
57 5 adantr ⊢ φ ∧ a ∈ S ∧ b ∈ B → I ∈ V
58 56 57 49 fsuppssindlem2 ⊢ φ ∧ a ∈ S ∧ b ∈ B → s ∈ S ⟼ if s = a b 0 ˙ ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H ↔ s ∈ S ⟼ if s = a b 0 ˙ : S ⟶ B ∧ s ∈ S ⟼ if s = a b 0 ˙ ∪ I ∖ S × 0 ˙ ∈ H
59 36 55 58 mpbir2and ⊢ φ ∧ a ∈ S ∧ b ∈ B → s ∈ S ⟼ if s = a b 0 ˙ ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H
60 30 5 6 fsuppssindlem2 ⊢ φ → s ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H ↔ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H
61 30 5 6 fsuppssindlem2 ⊢ φ → t ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H ↔ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H
62 60 61 anbi12d ⊢ φ → s ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H ∧ t ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H ↔ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H
63 1 3 grpcl ⊢ G ∈ Grp ∧ u ∈ B ∧ v ∈ B → u + ˙ v ∈ B
64 4 63 syl3an1 ⊢ φ ∧ u ∈ B ∧ v ∈ B → u + ˙ v ∈ B
65 64 3expb ⊢ φ ∧ u ∈ B ∧ v ∈ B → u + ˙ v ∈ B
66 65 adantlr ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H ∧ u ∈ B ∧ v ∈ B → u + ˙ v ∈ B
67 simprll ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → s : S ⟶ B
68 simprrl ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → t : S ⟶ B
69 18 adantr ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → S ∈ V
70 inidm ⊢ S ∩ S = S
71 66 67 68 69 69 70 off ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → s + ˙ f t : S ⟶ B
72 67 ffnd ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → s Fn S
73 68 ffnd ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → t Fn S
74 fnconstg ⊢ 0 ˙ ∈ V → I ∖ S × 0 ˙ Fn I ∖ S
75 14 74 mp1i ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → I ∖ S × 0 ˙ Fn I ∖ S
76 5 difexd ⊢ φ → I ∖ S ∈ V
77 76 adantr ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → I ∖ S ∈ V
78 disjdif ⊢ S ∩ I ∖ S = ∅
79 78 a1i ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → S ∩ I ∖ S = ∅
80 72 73 75 75 69 77 79 ofun ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → s ∪ I ∖ S × 0 ˙ + ˙ f t ∪ I ∖ S × 0 ˙ = s + ˙ f t ∪ I ∖ S × 0 ˙ + ˙ f I ∖ S × 0 ˙
81 14 74 mp1i ⊢ φ → I ∖ S × 0 ˙ Fn I ∖ S
82 fvconst2g ⊢ 0 ˙ ∈ V ∧ j ∈ I ∖ S → I ∖ S × 0 ˙ ⁡ j = 0 ˙
83 15 82 sylan ⊢ φ ∧ j ∈ I ∖ S → I ∖ S × 0 ˙ ⁡ j = 0 ˙
84 1 3 2 grplid ⊢ G ∈ Grp ∧ 0 ˙ ∈ B → 0 ˙ + ˙ 0 ˙ = 0 ˙
85 4 20 84 syl2anc ⊢ φ → 0 ˙ + ˙ 0 ˙ = 0 ˙
86 85 adantr ⊢ φ ∧ j ∈ I ∖ S → 0 ˙ + ˙ 0 ˙ = 0 ˙
87 14 a1i ⊢ φ ∧ j ∈ I ∖ S → 0 ˙ ∈ V
88 87 82 sylancom ⊢ φ ∧ j ∈ I ∖ S → I ∖ S × 0 ˙ ⁡ j = 0 ˙
89 86 88 eqtr4d ⊢ φ ∧ j ∈ I ∖ S → 0 ˙ + ˙ 0 ˙ = I ∖ S × 0 ˙ ⁡ j
90 76 81 81 81 83 83 89 offveq ⊢ φ → I ∖ S × 0 ˙ + ˙ f I ∖ S × 0 ˙ = I ∖ S × 0 ˙
91 90 uneq2d ⊢ φ → s + ˙ f t ∪ I ∖ S × 0 ˙ + ˙ f I ∖ S × 0 ˙ = s + ˙ f t ∪ I ∖ S × 0 ˙
92 91 adantr ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → s + ˙ f t ∪ I ∖ S × 0 ˙ + ˙ f I ∖ S × 0 ˙ = s + ˙ f t ∪ I ∖ S × 0 ˙
93 80 92 eqtrd ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → s ∪ I ∖ S × 0 ˙ + ˙ f t ∪ I ∖ S × 0 ˙ = s + ˙ f t ∪ I ∖ S × 0 ˙
94 9 caovclg ⊢ φ ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t ∪ I ∖ S × 0 ˙ ∈ H → s ∪ I ∖ S × 0 ˙ + ˙ f t ∪ I ∖ S × 0 ˙ ∈ H
95 94 adantrrl ⊢ φ ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → s ∪ I ∖ S × 0 ˙ + ˙ f t ∪ I ∖ S × 0 ˙ ∈ H
96 95 adantrll ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → s ∪ I ∖ S × 0 ˙ + ˙ f t ∪ I ∖ S × 0 ˙ ∈ H
97 93 96 eqeltrrd ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → s + ˙ f t ∪ I ∖ S × 0 ˙ ∈ H
98 30 5 6 fsuppssindlem2 ⊢ φ → s + ˙ f t ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H ↔ s + ˙ f t : S ⟶ B ∧ s + ˙ f t ∪ I ∖ S × 0 ˙ ∈ H
99 98 adantr ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → s + ˙ f t ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H ↔ s + ˙ f t : S ⟶ B ∧ s + ˙ f t ∪ I ∖ S × 0 ˙ ∈ H
100 71 97 99 mpbir2and ⊢ φ ∧ s : S ⟶ B ∧ s ∪ I ∖ S × 0 ˙ ∈ H ∧ t : S ⟶ B ∧ t ∪ I ∖ S × 0 ˙ ∈ H → s + ˙ f t ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H
101 62 100 sylbida ⊢ φ ∧ s ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H ∧ t ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H → s + ˙ f t ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H
102 1 2 3 4 18 32 59 101 fsuppind ⊢ φ ∧ X ↾ S : S ⟶ B ∧ finSupp 0 ˙⁡ X ↾ S → X ↾ S ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H
103 17 102 mpdan ⊢ φ → X ↾ S ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H
104 30 18 elmapd ⊢ φ → X ↾ S ∈ B S ↔ X ↾ S : S ⟶ B
105 13 104 mpbird ⊢ φ → X ↾ S ∈ B S
106 fveq1 ⊢ f = X ↾ S → f ⁡ i = X ↾ S ⁡ i
107 106 ifeq1d ⊢ f = X ↾ S → if i ∈ S f ⁡ i 0 ˙ = if i ∈ S X ↾ S ⁡ i 0 ˙
108 107 mpteq2dv ⊢ f = X ↾ S → i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ = i ∈ I ⟼ if i ∈ S X ↾ S ⁡ i 0 ˙
109 108 eleq1d ⊢ f = X ↾ S → i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H ↔ i ∈ I ⟼ if i ∈ S X ↾ S ⁡ i 0 ˙ ∈ H
110 109 elrab3 ⊢ X ↾ S ∈ B S → X ↾ S ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H ↔ i ∈ I ⟼ if i ∈ S X ↾ S ⁡ i 0 ˙ ∈ H
111 105 110 syl ⊢ φ → X ↾ S ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H ↔ i ∈ I ⟼ if i ∈ S X ↾ S ⁡ i 0 ˙ ∈ H
112 15 5 10 12 fsuppssindlem1 ⊢ φ → X = i ∈ I ⟼ if i ∈ S X ↾ S ⁡ i 0 ˙
113 112 eleq1d ⊢ φ → X ∈ H ↔ i ∈ I ⟼ if i ∈ S X ↾ S ⁡ i 0 ˙ ∈ H
114 111 113 bitr4d ⊢ φ → X ↾ S ∈ f ∈ B S | i ∈ I ⟼ if i ∈ S f ⁡ i 0 ˙ ∈ H ↔ X ∈ H
115 103 114 mpbid ⊢ φ → X ∈ H