Theorem seq1st 16276

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 13733	. . . 4 ⊢ (𝑀 ∈ ℤ → seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴})) Fn (ℤ≥‘𝑀))
3	2	adantr 481	. . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴})) Fn (ℤ≥‘𝑀))
4		seqfn 13733	. . . 4 ⊢ (𝑀 ∈ ℤ → seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩}) Fn (ℤ≥‘𝑀))
5	4	adantr 481	. . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩}) Fn (ℤ≥‘𝑀))
6		fveq2 6774	. . . . . . . 8 ⊢ (𝑦 = 𝑀 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀))
7		fveq2 6774	. . . . . . . 8 ⊢ (𝑦 = 𝑀 → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀))
8	6, 7	eqeq12d 2754	. . . . . . 7 ⊢ (𝑦 = 𝑀 → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) ↔ (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀)))
9	8	imbi2d 341	. . . . . 6 ⊢ (𝑦 = 𝑀 → ((𝐴 ∈ 𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦)) ↔ (𝐴 ∈ 𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀))))
10		fveq2 6774	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥))
11		fveq2 6774	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))
12	10, 11	eqeq12d 2754	. . . . . . 7 ⊢ (𝑦 = 𝑥 → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) ↔ (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)))
13	12	imbi2d 341	. . . . . 6 ⊢ (𝑦 = 𝑥 → ((𝐴 ∈ 𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦)) ↔ (𝐴 ∈ 𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))))
14		fveq2 6774	. . . . . . . 8 ⊢ (𝑦 = (𝑥 + 1) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)))
15		fveq2 6774	. . . . . . . 8 ⊢ (𝑦 = (𝑥 + 1) → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)))
16	14, 15	eqeq12d 2754	. . . . . . 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 13734	. . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = ((𝑍 × {𝐴})‘𝑀))
19	18	adantr 481	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = ((𝑍 × {𝐴})‘𝑀))
20		seq1 13734	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀) = ({⟨𝑀, 𝐴⟩}‘𝑀))
21	20	adantr 481	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀) = ({⟨𝑀, 𝐴⟩}‘𝑀))
22		id 22	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ 𝑉)
23		uzid 12597	. . . . . . . . . . . 12 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀))
24		algrf.1	. . . . . . . . . . . 12 ⊢ 𝑍 = (ℤ≥‘𝑀)
25	23, 24	eleqtrrdi 2850	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ 𝑍)
26		fvconst2g 7077	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑀 ∈ 𝑍) → ((𝑍 × {𝐴})‘𝑀) = 𝐴)
27	22, 25, 26	syl2anr 597	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → ((𝑍 × {𝐴})‘𝑀) = 𝐴)
28		fvsng 7052	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → ({⟨𝑀, 𝐴⟩}‘𝑀) = 𝐴)
29	27, 28	eqtr4d 2781	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → ((𝑍 × {𝐴})‘𝑀) = ({⟨𝑀, 𝐴⟩}‘𝑀))
30	21, 29	eqtr4d 2781	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀) = ((𝑍 × {𝐴})‘𝑀))
31	19, 30	eqtr4d 2781	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀))
32	31	ex 413	. . . . . 6 ⊢ (𝑀 ∈ ℤ → (𝐴 ∈ 𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀)))
33		fveq2 6774	. . . . . . . . 9 ⊢ ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥) → (𝐹‘(seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥)) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)))
34		seqp1 13736	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (ℤ≥‘𝑀) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥)(𝐹 ∘ 1st )((𝑍 × {𝐴})‘(𝑥 + 1))))
35		fvex 6787	. . . . . . . . . . . . 13 ⊢ (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) ∈ V
36		fvex 6787	. . . . . . . . . . . . 13 ⊢ ((𝑍 × {𝐴})‘(𝑥 + 1)) ∈ V
37	35, 36	opco1i 7966	. . . . . . . . . . . 12 ⊢ ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥)(𝐹 ∘ 1st )((𝑍 × {𝐴})‘(𝑥 + 1))) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥))
38	34, 37	eqtrdi 2794	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (ℤ≥‘𝑀) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥)))
39		seqp1 13736	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (ℤ≥‘𝑀) → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)) = ((seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)(𝐹 ∘ 1st )({⟨𝑀, 𝐴⟩}‘(𝑥 + 1))))
40		fvex 6787	. . . . . . . . . . . . 13 ⊢ (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥) ∈ V
41		fvex 6787	. . . . . . . . . . . . 13 ⊢ ({⟨𝑀, 𝐴⟩}‘(𝑥 + 1)) ∈ V
42	40, 41	opco1i 7966	. . . . . . . . . . . 12 ⊢ ((seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)(𝐹 ∘ 1st )({⟨𝑀, 𝐴⟩}‘(𝑥 + 1))) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))
43	39, 42	eqtrdi 2794	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (ℤ≥‘𝑀) → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)))
44	38, 43	eqeq12d 2754	. . . . . . . . . 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	syl5ibr 245	. . . . . . . 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 12646	. . . . 5 ⊢ (𝑥 ∈ (ℤ≥‘𝑀) → (𝐴 ∈ 𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)))
50	49	impcom 408	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))
51	50	adantll 711	. . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))
52	3, 5, 51	eqfnfvd 6912	. 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴})) = seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩}))
53	1, 52	eqtrid 2790	1 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ 𝑉) → 𝑅 = seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩}))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2106  {csn 4561  ⟨cop 4567   × cxp 5587   ∘ ccom 5593   Fn wfn 6428  ‘cfv 6433  (class class class)co 7275  1^st c1st 7829  1c1 10872   + caddc 10874  ℤcz 12319  ℤ_≥cuz 12582  seqcseq 13721

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-er 8498  df-en 8734  df-dom 8735  df-sdom 8736  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-nn 11974  df-n0 12234  df-z 12320  df-uz 12583  df-seq 13722

This theorem is referenced by: (None)