Theorem seq1st 16538

Description: A sequence whose iteration function ignores the second argument is only affected by the first point of the initial value function. (Contributed by Mario Carneiro, 11-Feb-2015.)

Hypotheses

Ref	Expression
algrf.1	⊢ 𝑍 = (ℤ≥‘𝑀)
algrf.2	⊢ 𝑅 = seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))

Assertion

Ref	Expression
seq1st	⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → 𝑅 = seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩}))

Proof of Theorem seq1st

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		algrf.2	. 2 ⊢ 𝑅 = seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))
2		seqfn 13973	. . . 4 ⊢ (𝑀 ∈ ℤ → seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴})) Fn (ℤ≥‘𝑀))
3	2	adantr 481	. . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴})) Fn (ℤ≥‘𝑀))
4		seqfn 13973	. . . 4 ⊢ (𝑀 ∈ ℤ → seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩}) Fn (ℤ≥‘𝑀))
5	4	adantr 481	. . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩}) Fn (ℤ≥‘𝑀))
6		fveq2 6834	. . . . . . . 8 ⊢ (𝑦 = 𝑀 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀))
7		fveq2 6834	. . . . . . . 8 ⊢ (𝑦 = 𝑀 → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀))
8	6, 7	eqeq12d 2756	. . . . . . 7 ⊢ (𝑦 = 𝑀 → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) ↔ (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀)))
9	8	imbi2d 341	. . . . . 6 ⊢ (𝑦 = 𝑀 → ((𝐴 ∈ 𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦)) ↔ (𝐴 ∈ 𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀))))
10		fveq2 6834	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥))
11		fveq2 6834	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))
12	10, 11	eqeq12d 2756	. . . . . . 7 ⊢ (𝑦 = 𝑥 → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) ↔ (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)))
13	12	imbi2d 341	. . . . . 6 ⊢ (𝑦 = 𝑥 → ((𝐴 ∈ 𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦)) ↔ (𝐴 ∈ 𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))))
14		fveq2 6834	. . . . . . . 8 ⊢ (𝑦 = (𝑥 + 1) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)))
15		fveq2 6834	. . . . . . . 8 ⊢ (𝑦 = (𝑥 + 1) → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)))
16	14, 15	eqeq12d 2756	. . . . . . 7 ⊢ (𝑦 = (𝑥 + 1) → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) ↔ (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1))))
17	16	imbi2d 341	. . . . . 6 ⊢ (𝑦 = (𝑥 + 1) → ((𝐴 ∈ 𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦)) ↔ (𝐴 ∈ 𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)))))
18		seq1 13974	. . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = ((𝑍 × {𝐴})‘𝑀))
19	18	adantr 481	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = ((𝑍 × {𝐴})‘𝑀))
20		seq1 13974	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀) = ({⟨𝑀, 𝐴⟩}‘𝑀))
21	20	adantr 481	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀) = ({⟨𝑀, 𝐴⟩}‘𝑀))
22		id 22	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ 𝑉)
23		uzid 12801	. . . . . . . . . . . 12 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀))
24		algrf.1	. . . . . . . . . . . 12 ⊢ 𝑍 = (ℤ≥‘𝑀)
25	23, 24	eleqtrrdi 2851	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ 𝑍)
26		fvconst2g 7153	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑀 ∈ 𝑍) → ((𝑍 × {𝐴})‘𝑀) = 𝐴)
27	22, 25, 26	syl2anr 603	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → ((𝑍 × {𝐴})‘𝑀) = 𝐴)
28		fvsng 7131	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → ({⟨𝑀, 𝐴⟩}‘𝑀) = 𝐴)
29	27, 28	eqtr4d 2778	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → ((𝑍 × {𝐴})‘𝑀) = ({⟨𝑀, 𝐴⟩}‘𝑀))
30	21, 29	eqtr4d 2778	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀) = ((𝑍 × {𝐴})‘𝑀))
31	19, 30	eqtr4d 2778	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀))
32	31	ex 413	. . . . . 6 ⊢ (𝑀 ∈ ℤ → (𝐴 ∈ 𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀)))
33		fveq2 6834	. . . . . . . . 9 ⊢ ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥) → (𝐹‘(seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥)) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)))
34		seqp1 13976	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (ℤ≥‘𝑀) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥)(𝐹 ∘ 1st )((𝑍 × {𝐴})‘(𝑥 + 1))))
35		fvex 6847	. . . . . . . . . . . . 13 ⊢ (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) ∈ V
36		fvex 6847	. . . . . . . . . . . . 13 ⊢ ((𝑍 × {𝐴})‘(𝑥 + 1)) ∈ V
37	35, 36	opco1i 8071	. . . . . . . . . . . 12 ⊢ ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥)(𝐹 ∘ 1st )((𝑍 × {𝐴})‘(𝑥 + 1))) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥))
38	34, 37	eqtrdi 2791	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (ℤ≥‘𝑀) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥)))
39		seqp1 13976	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (ℤ≥‘𝑀) → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)) = ((seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)(𝐹 ∘ 1st )({⟨𝑀, 𝐴⟩}‘(𝑥 + 1))))
40		fvex 6847	. . . . . . . . . . . . 13 ⊢ (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥) ∈ V
41		fvex 6847	. . . . . . . . . . . . 13 ⊢ ({⟨𝑀, 𝐴⟩}‘(𝑥 + 1)) ∈ V
42	40, 41	opco1i 8071	. . . . . . . . . . . 12 ⊢ ((seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)(𝐹 ∘ 1st )({⟨𝑀, 𝐴⟩}‘(𝑥 + 1))) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))
43	39, 42	eqtrdi 2791	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (ℤ≥‘𝑀) → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)))
44	38, 43	eqeq12d 2756	. . . . . . . . . 10 ⊢ (𝑥 ∈ (ℤ≥‘𝑀) → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)) ↔ (𝐹‘(seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥)) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))))
45	44	adantl 482	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)) ↔ (𝐹‘(seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥)) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))))
46	33, 45	imbitrrid 247	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1))))
47	46	expcom 414	. . . . . . 7 ⊢ (𝑥 ∈ (ℤ≥‘𝑀) → (𝐴 ∈ 𝑉 → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)))))
48	47	a2d 29	. . . . . 6 ⊢ (𝑥 ∈ (ℤ≥‘𝑀) → ((𝐴 ∈ 𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)) → (𝐴 ∈ 𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)))))
49	9, 13, 17, 13, 32, 48	uzind4 12854	. . . . 5 ⊢ (𝑥 ∈ (ℤ≥‘𝑀) → (𝐴 ∈ 𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)))
50	49	impcom 408	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))
51	50	adantll 720	. . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))
52	3, 5, 51	eqfnfvd 6981	. 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴})) = seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩}))
53	1, 52	eqtrid 2787	1 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → 𝑅 = seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩}))

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   = wceq 1547   ∈ wcel 2119  {csn 4562  ⟨cop 4568   × cxp 5623   ∘ ccom 5629   Fn wfn 6487  ‘cfv 6492  (class class class)co 7363  1^st c1st 7936  1c1 11037   + caddc 11039  ℤcz 12522  ℤ_≥cuz 12786  seqcseq 13961

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685  ax-cnex 11092  ax-resscn 11093  ax-1cn 11094  ax-icn 11095  ax-addcl 11096  ax-addrcl 11097  ax-mulcl 11098  ax-mulrcl 11099  ax-mulcom 11100  ax-addass 11101  ax-mulass 11102  ax-distr 11103  ax-i2m1 11104  ax-1ne0 11105  ax-1rid 11106  ax-rnegex 11107  ax-rrecex 11108  ax-cnre 11109  ax-pre-lttri 11110  ax-pre-lttrn 11111  ax-pre-ltadd 11112  ax-pre-mulgt0 11113

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-nel 3040  df-ral 3055  df-rex 3065  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7320  df-ov 7366  df-oprab 7367  df-mpo 7368  df-om 7814  df-1st 7938  df-2nd 7939  df-frecs 8228  df-wrecs 8259  df-recs 8308  df-rdg 8346  df-er 8640  df-en 8891  df-dom 8892  df-sdom 8893  df-pnf 11179  df-mnf 11180  df-xr 11181  df-ltxr 11182  df-le 11183  df-sub 11377  df-neg 11378  df-nn 12173  df-n0 12436  df-z 12523  df-uz 12787  df-seq 13962

This theorem is referenced by: (None)