Theorem gsumfzz 13137

Description: Value of a group sum over the zero element. (Contributed by Mario Carneiro, 7-Dec-2014.) (Revised by Jim Kingdon, 15-Aug-2025.)

Hypothesis

Ref	Expression
gsumz.z	⊢ 0 = (0g‘𝐺)

Assertion

Ref	Expression
gsumfzz	⊢ ((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐺 Σg (𝑘 ∈ (𝑀...𝑁) ↦ 0 )) = 0 )

Distinct variable groups:   0 ,𝑘   𝑘,𝐺   𝑘,𝑀   𝑘,𝑁

Proof of Theorem gsumfzz

Dummy variables 𝑤 𝑢 𝑣 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2196	. . . . 5 ⊢ (Base‘𝐺) = (Base‘𝐺)
2		gsumz.z	. . . . 5 ⊢ 0 = (0g‘𝐺)
3		eqid 2196	. . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺)
4		simp1 999	. . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝐺 ∈ Mnd)
5		simp2 1000	. . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 ∈ ℤ)
6		simp3 1001	. . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑁 ∈ ℤ)
7	1, 2	mndidcl 13081	. . . . . . . 8 ⊢ (𝐺 ∈ Mnd → 0 ∈ (Base‘𝐺))
8	4, 7	syl 14	. . . . . . 7 ⊢ ((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 0 ∈ (Base‘𝐺))
9	8	adantr 276	. . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → 0 ∈ (Base‘𝐺))
10	9	fmpttd 5718	. . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑘 ∈ (𝑀...𝑁) ↦ 0 ):(𝑀...𝑁)⟶(Base‘𝐺))
11	1, 2, 3, 4, 5, 6, 10	gsumfzval 13044	. . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐺 Σg (𝑘 ∈ (𝑀...𝑁) ↦ 0 )) = if(𝑁 < 𝑀, 0 , (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑁)))
12	11	adantr 276	. . 3 ⊢ (((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑁 < 𝑀) → (𝐺 Σg (𝑘 ∈ (𝑀...𝑁) ↦ 0 )) = if(𝑁 < 𝑀, 0 , (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑁)))
13		simpr 110	. . . 4 ⊢ (((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑁 < 𝑀) → 𝑁 < 𝑀)
14	13	iftrued 3569	. . 3 ⊢ (((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑁 < 𝑀) → if(𝑁 < 𝑀, 0 , (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑁)) = 0 )
15	12, 14	eqtrd 2229	. 2 ⊢ (((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑁 < 𝑀) → (𝐺 Σg (𝑘 ∈ (𝑀...𝑁) ↦ 0 )) = 0 )
16	11	adantr 276	. . 3 ⊢ (((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ 𝑁 < 𝑀) → (𝐺 Σg (𝑘 ∈ (𝑀...𝑁) ↦ 0 )) = if(𝑁 < 𝑀, 0 , (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑁)))
17		simpr 110	. . . 4 ⊢ (((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ 𝑁 < 𝑀) → ¬ 𝑁 < 𝑀)
18	17	iffalsed 3572	. . 3 ⊢ (((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ 𝑁 < 𝑀) → if(𝑁 < 𝑀, 0 , (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑁)) = (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑁))
19	5	adantr 276	. . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ 𝑁 < 𝑀) → 𝑀 ∈ ℤ)
20	6	adantr 276	. . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ 𝑁 < 𝑀) → 𝑁 ∈ ℤ)
21	5	zred 9450	. . . . . . . 8 ⊢ ((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 ∈ ℝ)
22	6	zred 9450	. . . . . . . 8 ⊢ ((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑁 ∈ ℝ)
23	21, 22	lenltd 8146	. . . . . . 7 ⊢ ((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 ↔ ¬ 𝑁 < 𝑀))
24	23	biimpar 297	. . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ 𝑁 < 𝑀) → 𝑀 ≤ 𝑁)
25		eluz2 9609	. . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁))
26	19, 20, 24, 25	syl3anbrc 1183	. . . . 5 ⊢ (((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ 𝑁 < 𝑀) → 𝑁 ∈ (ℤ≥‘𝑀))
27		eluzfz2 10109	. . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ (𝑀...𝑁))
28	26, 27	syl 14	. . . 4 ⊢ (((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ 𝑁 < 𝑀) → 𝑁 ∈ (𝑀...𝑁))
29	4	adantr 276	. . . 4 ⊢ (((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ 𝑁 < 𝑀) → 𝐺 ∈ Mnd)
30		fveqeq2 5568	. . . . . 6 ⊢ (𝑤 = 𝑀 → ((seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑤) = 0 ↔ (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑀) = 0 ))
31	30	imbi2d 230	. . . . 5 ⊢ (𝑤 = 𝑀 → ((𝐺 ∈ Mnd → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑤) = 0 ) ↔ (𝐺 ∈ Mnd → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑀) = 0 )))
32		fveqeq2 5568	. . . . . 6 ⊢ (𝑤 = 𝑦 → ((seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑤) = 0 ↔ (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑦) = 0 ))
33	32	imbi2d 230	. . . . 5 ⊢ (𝑤 = 𝑦 → ((𝐺 ∈ Mnd → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑤) = 0 ) ↔ (𝐺 ∈ Mnd → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑦) = 0 )))
34		fveqeq2 5568	. . . . . 6 ⊢ (𝑤 = (𝑦 + 1) → ((seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑤) = 0 ↔ (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘(𝑦 + 1)) = 0 ))
35	34	imbi2d 230	. . . . 5 ⊢ (𝑤 = (𝑦 + 1) → ((𝐺 ∈ Mnd → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑤) = 0 ) ↔ (𝐺 ∈ Mnd → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘(𝑦 + 1)) = 0 )))
36		fveqeq2 5568	. . . . . 6 ⊢ (𝑤 = 𝑁 → ((seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑤) = 0 ↔ (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑁) = 0 ))
37	36	imbi2d 230	. . . . 5 ⊢ (𝑤 = 𝑁 → ((𝐺 ∈ Mnd → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑤) = 0 ) ↔ (𝐺 ∈ Mnd → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑁) = 0 )))
38		eluzel2 9608	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ)
39	38	adantr 276	. . . . . . . 8 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐺 ∈ Mnd) → 𝑀 ∈ ℤ)
40	39	adantr 276	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐺 ∈ Mnd) ∧ 𝑢 ∈ (ℤ≥‘𝑀)) → 𝑀 ∈ ℤ)
41		eluzelz 9612	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ)
42	41	ad2antrr 488	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐺 ∈ Mnd) ∧ 𝑢 ∈ (ℤ≥‘𝑀)) → 𝑁 ∈ ℤ)
43	40, 42	fzfigd 10525	. . . . . . . . . 10 ⊢ (((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐺 ∈ Mnd) ∧ 𝑢 ∈ (ℤ≥‘𝑀)) → (𝑀...𝑁) ∈ Fin)
44	43	mptexd 5790	. . . . . . . . 9 ⊢ (((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐺 ∈ Mnd) ∧ 𝑢 ∈ (ℤ≥‘𝑀)) → (𝑘 ∈ (𝑀...𝑁) ↦ 0 ) ∈ V)
45		vex 2766	. . . . . . . . 9 ⊢ 𝑢 ∈ V
46		fvexg 5578	. . . . . . . . 9 ⊢ (((𝑘 ∈ (𝑀...𝑁) ↦ 0 ) ∈ V ∧ 𝑢 ∈ V) → ((𝑘 ∈ (𝑀...𝑁) ↦ 0 )‘𝑢) ∈ V)
47	44, 45, 46	sylancl 413	. . . . . . . 8 ⊢ (((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐺 ∈ Mnd) ∧ 𝑢 ∈ (ℤ≥‘𝑀)) → ((𝑘 ∈ (𝑀...𝑁) ↦ 0 )‘𝑢) ∈ V)
48		plusgslid 12800	. . . . . . . . . . 11 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ)
49	48	slotex 12715	. . . . . . . . . 10 ⊢ (𝐺 ∈ Mnd → (+g‘𝐺) ∈ V)
50	49	ad2antlr 489	. . . . . . . . 9 ⊢ (((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐺 ∈ Mnd) ∧ (𝑢 ∈ V ∧ 𝑣 ∈ V)) → (+g‘𝐺) ∈ V)
51		simprr 531	. . . . . . . . 9 ⊢ (((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐺 ∈ Mnd) ∧ (𝑢 ∈ V ∧ 𝑣 ∈ V)) → 𝑣 ∈ V)
52		ovexg 5957	. . . . . . . . 9 ⊢ ((𝑢 ∈ V ∧ (+g‘𝐺) ∈ V ∧ 𝑣 ∈ V) → (𝑢(+g‘𝐺)𝑣) ∈ V)
53	45, 50, 51, 52	mp3an2i 1353	. . . . . . . 8 ⊢ (((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐺 ∈ Mnd) ∧ (𝑢 ∈ V ∧ 𝑣 ∈ V)) → (𝑢(+g‘𝐺)𝑣) ∈ V)
54	39, 47, 53	seq3-1 10556	. . . . . . 7 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐺 ∈ Mnd) → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑀) = ((𝑘 ∈ (𝑀...𝑁) ↦ 0 )‘𝑀))
55		eqid 2196	. . . . . . . 8 ⊢ (𝑘 ∈ (𝑀...𝑁) ↦ 0 ) = (𝑘 ∈ (𝑀...𝑁) ↦ 0 )
56		eqidd 2197	. . . . . . . 8 ⊢ (𝑘 = 𝑀 → 0 = 0 )
57		eluzfz1 10108	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁))
58	57	adantr 276	. . . . . . . 8 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐺 ∈ Mnd) → 𝑀 ∈ (𝑀...𝑁))
59	7	adantl 277	. . . . . . . 8 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐺 ∈ Mnd) → 0 ∈ (Base‘𝐺))
60	55, 56, 58, 59	fvmptd3 5656	. . . . . . 7 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐺 ∈ Mnd) → ((𝑘 ∈ (𝑀...𝑁) ↦ 0 )‘𝑀) = 0 )
61	54, 60	eqtrd 2229	. . . . . 6 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐺 ∈ Mnd) → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑀) = 0 )
62	61	ex 115	. . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝐺 ∈ Mnd → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑀) = 0 ))
63		elfzouz 10228	. . . . . . . . . . 11 ⊢ (𝑦 ∈ (𝑀..^𝑁) → 𝑦 ∈ (ℤ≥‘𝑀))
64	63	adantr 276	. . . . . . . . . 10 ⊢ ((𝑦 ∈ (𝑀..^𝑁) ∧ 𝐺 ∈ Mnd) → 𝑦 ∈ (ℤ≥‘𝑀))
65		elfzouz2 10239	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ (𝑀..^𝑁) → 𝑁 ∈ (ℤ≥‘𝑦))
66		uztrn 9620	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ (ℤ≥‘𝑦) ∧ 𝑦 ∈ (ℤ≥‘𝑀)) → 𝑁 ∈ (ℤ≥‘𝑀))
67	65, 63, 66	syl2anc 411	. . . . . . . . . . 11 ⊢ (𝑦 ∈ (𝑀..^𝑁) → 𝑁 ∈ (ℤ≥‘𝑀))
68	67, 47	sylanl1 402	. . . . . . . . . 10 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝐺 ∈ Mnd) ∧ 𝑢 ∈ (ℤ≥‘𝑀)) → ((𝑘 ∈ (𝑀...𝑁) ↦ 0 )‘𝑢) ∈ V)
69	67, 53	sylanl1 402	. . . . . . . . . 10 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝐺 ∈ Mnd) ∧ (𝑢 ∈ V ∧ 𝑣 ∈ V)) → (𝑢(+g‘𝐺)𝑣) ∈ V)
70	64, 68, 69	seq3p1 10559	. . . . . . . . 9 ⊢ ((𝑦 ∈ (𝑀..^𝑁) ∧ 𝐺 ∈ Mnd) → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘(𝑦 + 1)) = ((seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑦)(+g‘𝐺)((𝑘 ∈ (𝑀...𝑁) ↦ 0 )‘(𝑦 + 1))))
71	70	adantr 276	. . . . . . . 8 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝐺 ∈ Mnd) ∧ (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑦) = 0 ) → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘(𝑦 + 1)) = ((seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑦)(+g‘𝐺)((𝑘 ∈ (𝑀...𝑁) ↦ 0 )‘(𝑦 + 1))))
72		simpr 110	. . . . . . . . 9 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝐺 ∈ Mnd) ∧ (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑦) = 0 ) → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑦) = 0 )
73		eqidd 2197	. . . . . . . . . . 11 ⊢ (𝑘 = (𝑦 + 1) → 0 = 0 )
74		fzofzp1 10305	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ (𝑀..^𝑁) → (𝑦 + 1) ∈ (𝑀...𝑁))
75	74	adantr 276	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ (𝑀..^𝑁) ∧ 𝐺 ∈ Mnd) → (𝑦 + 1) ∈ (𝑀...𝑁))
76	7	adantl 277	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ (𝑀..^𝑁) ∧ 𝐺 ∈ Mnd) → 0 ∈ (Base‘𝐺))
77	55, 73, 75, 76	fvmptd3 5656	. . . . . . . . . 10 ⊢ ((𝑦 ∈ (𝑀..^𝑁) ∧ 𝐺 ∈ Mnd) → ((𝑘 ∈ (𝑀...𝑁) ↦ 0 )‘(𝑦 + 1)) = 0 )
78	77	adantr 276	. . . . . . . . 9 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝐺 ∈ Mnd) ∧ (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑦) = 0 ) → ((𝑘 ∈ (𝑀...𝑁) ↦ 0 )‘(𝑦 + 1)) = 0 )
79	72, 78	oveq12d 5941	. . . . . . . 8 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝐺 ∈ Mnd) ∧ (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑦) = 0 ) → ((seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑦)(+g‘𝐺)((𝑘 ∈ (𝑀...𝑁) ↦ 0 )‘(𝑦 + 1))) = ( 0 (+g‘𝐺) 0 ))
80	1, 3, 2	mndlid 13086	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Mnd ∧ 0 ∈ (Base‘𝐺)) → ( 0 (+g‘𝐺) 0 ) = 0 )
81	7, 80	mpdan 421	. . . . . . . . 9 ⊢ (𝐺 ∈ Mnd → ( 0 (+g‘𝐺) 0 ) = 0 )
82	81	ad2antlr 489	. . . . . . . 8 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝐺 ∈ Mnd) ∧ (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑦) = 0 ) → ( 0 (+g‘𝐺) 0 ) = 0 )
83	71, 79, 82	3eqtrd 2233	. . . . . . 7 ⊢ (((𝑦 ∈ (𝑀..^𝑁) ∧ 𝐺 ∈ Mnd) ∧ (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑦) = 0 ) → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘(𝑦 + 1)) = 0 )
84	83	exp31 364	. . . . . 6 ⊢ (𝑦 ∈ (𝑀..^𝑁) → (𝐺 ∈ Mnd → ((seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑦) = 0 → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘(𝑦 + 1)) = 0 )))
85	84	a2d 26	. . . . 5 ⊢ (𝑦 ∈ (𝑀..^𝑁) → ((𝐺 ∈ Mnd → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑦) = 0 ) → (𝐺 ∈ Mnd → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘(𝑦 + 1)) = 0 )))
86	31, 33, 35, 37, 62, 85	fzind2 10317	. . . 4 ⊢ (𝑁 ∈ (𝑀...𝑁) → (𝐺 ∈ Mnd → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑁) = 0 ))
87	28, 29, 86	sylc 62	. . 3 ⊢ (((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ 𝑁 < 𝑀) → (seq𝑀((+g‘𝐺), (𝑘 ∈ (𝑀...𝑁) ↦ 0 ))‘𝑁) = 0 )
88	16, 18, 87	3eqtrd 2233	. 2 ⊢ (((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ 𝑁 < 𝑀) → (𝐺 Σg (𝑘 ∈ (𝑀...𝑁) ↦ 0 )) = 0 )
89		zdclt 9405	. . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → DECID 𝑁 < 𝑀)
90	6, 5, 89	syl2anc 411	. . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑁 < 𝑀)
91		exmiddc 837	. . 3 ⊢ (DECID 𝑁 < 𝑀 → (𝑁 < 𝑀 ∨ ¬ 𝑁 < 𝑀))
92	90, 91	syl 14	. 2 ⊢ ((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝑀 ∨ ¬ 𝑁 < 𝑀))
93	15, 88, 92	mpjaodan 799	1 ⊢ ((𝐺 ∈ Mnd ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐺 Σg (𝑘 ∈ (𝑀...𝑁) ↦ 0 )) = 0 )

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 709  DECID wdc 835   ∧ w3a 980   = wceq 1364   ∈ wcel 2167  Vcvv 2763  ifcif 3562   class class class wbr 4034   ↦ cmpt 4095  ‘cfv 5259  (class class class)co 5923  Fincfn 6800  1c1 7882   + caddc 7884   < clt 8063   ≤ cle 8064  ℤcz 9328  ℤ_≥cuz 9603  ...cfz 10085  ..^cfzo 10219  seqcseq 10541  Basecbs 12688  +_gcplusg 12765  0_gc0g 12937   Σ_g cgsu 12938  Mndcmnd 13067

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625  ax-cnex 7972  ax-resscn 7973  ax-1cn 7974  ax-1re 7975  ax-icn 7976  ax-addcl 7977  ax-addrcl 7978  ax-mulcl 7979  ax-addcom 7981  ax-addass 7983  ax-distr 7985  ax-i2m1 7986  ax-0lt1 7987  ax-0id 7989  ax-rnegex 7990  ax-cnre 7992  ax-pre-ltirr 7993  ax-pre-ltwlin 7994  ax-pre-lttrn 7995  ax-pre-apti 7996  ax-pre-ltadd 7997

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-if 3563  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-iord 4402  df-on 4404  df-ilim 4405  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5878  df-ov 5926  df-oprab 5927  df-mpo 5928  df-1st 6199  df-2nd 6200  df-recs 6364  df-frec 6450  df-1o 6475  df-er 6593  df-en 6801  df-fin 6803  df-pnf 8065  df-mnf 8066  df-xr 8067  df-ltxr 8068  df-le 8069  df-sub 8201  df-neg 8202  df-inn 8993  df-2 9051  df-n0 9252  df-z 9329  df-uz 9604  df-fz 10086  df-fzo 10220  df-seqfrec 10542  df-ndx 12691  df-slot 12692  df-base 12694  df-plusg 12778  df-0g 12939  df-igsum 12940  df-mgm 13009  df-sgrp 13055  df-mnd 13068

This theorem is referenced by: (None)