MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  seq1st Structured version   Visualization version   GIF version

Theorem seq1st 16152
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.
StepHypRef Expression
1 algrf.2 . 2 𝑅 = seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))
2 seqfn 13610 . . . 4 (𝑀 ∈ ℤ → seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴})) Fn (ℤ𝑀))
32adantr 484 . . 3 ((𝑀 ∈ ℤ ∧ 𝐴𝑉) → seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴})) Fn (ℤ𝑀))
4 seqfn 13610 . . . 4 (𝑀 ∈ ℤ → seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩}) Fn (ℤ𝑀))
54adantr 484 . . 3 ((𝑀 ∈ ℤ ∧ 𝐴𝑉) → seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩}) Fn (ℤ𝑀))
6 fveq2 6735 . . . . . . . 8 (𝑦 = 𝑀 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀))
7 fveq2 6735 . . . . . . . 8 (𝑦 = 𝑀 → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀))
86, 7eqeq12d 2754 . . . . . . 7 (𝑦 = 𝑀 → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) ↔ (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀)))
98imbi2d 344 . . . . . 6 (𝑦 = 𝑀 → ((𝐴𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦)) ↔ (𝐴𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀))))
10 fveq2 6735 . . . . . . . 8 (𝑦 = 𝑥 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥))
11 fveq2 6735 . . . . . . . 8 (𝑦 = 𝑥 → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))
1210, 11eqeq12d 2754 . . . . . . 7 (𝑦 = 𝑥 → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) ↔ (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)))
1312imbi2d 344 . . . . . 6 (𝑦 = 𝑥 → ((𝐴𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦)) ↔ (𝐴𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))))
14 fveq2 6735 . . . . . . . 8 (𝑦 = (𝑥 + 1) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)))
15 fveq2 6735 . . . . . . . 8 (𝑦 = (𝑥 + 1) → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)))
1614, 15eqeq12d 2754 . . . . . . 7 (𝑦 = (𝑥 + 1) → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦) ↔ (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1))))
1716imbi2d 344 . . . . . 6 (𝑦 = (𝑥 + 1) → ((𝐴𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑦) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑦)) ↔ (𝐴𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)))))
18 seq1 13611 . . . . . . . . 9 (𝑀 ∈ ℤ → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = ((𝑍 × {𝐴})‘𝑀))
1918adantr 484 . . . . . . . 8 ((𝑀 ∈ ℤ ∧ 𝐴𝑉) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = ((𝑍 × {𝐴})‘𝑀))
20 seq1 13611 . . . . . . . . . 10 (𝑀 ∈ ℤ → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀) = ({⟨𝑀, 𝐴⟩}‘𝑀))
2120adantr 484 . . . . . . . . 9 ((𝑀 ∈ ℤ ∧ 𝐴𝑉) → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀) = ({⟨𝑀, 𝐴⟩}‘𝑀))
22 id 22 . . . . . . . . . . 11 (𝐴𝑉𝐴𝑉)
23 uzid 12477 . . . . . . . . . . . 12 (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ𝑀))
24 algrf.1 . . . . . . . . . . . 12 𝑍 = (ℤ𝑀)
2523, 24eleqtrrdi 2850 . . . . . . . . . . 11 (𝑀 ∈ ℤ → 𝑀𝑍)
26 fvconst2g 7035 . . . . . . . . . . 11 ((𝐴𝑉𝑀𝑍) → ((𝑍 × {𝐴})‘𝑀) = 𝐴)
2722, 25, 26syl2anr 600 . . . . . . . . . 10 ((𝑀 ∈ ℤ ∧ 𝐴𝑉) → ((𝑍 × {𝐴})‘𝑀) = 𝐴)
28 fvsng 7013 . . . . . . . . . 10 ((𝑀 ∈ ℤ ∧ 𝐴𝑉) → ({⟨𝑀, 𝐴⟩}‘𝑀) = 𝐴)
2927, 28eqtr4d 2781 . . . . . . . . 9 ((𝑀 ∈ ℤ ∧ 𝐴𝑉) → ((𝑍 × {𝐴})‘𝑀) = ({⟨𝑀, 𝐴⟩}‘𝑀))
3021, 29eqtr4d 2781 . . . . . . . 8 ((𝑀 ∈ ℤ ∧ 𝐴𝑉) → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀) = ((𝑍 × {𝐴})‘𝑀))
3119, 30eqtr4d 2781 . . . . . . 7 ((𝑀 ∈ ℤ ∧ 𝐴𝑉) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀))
3231ex 416 . . . . . 6 (𝑀 ∈ ℤ → (𝐴𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑀) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑀)))
33 fveq2 6735 . . . . . . . . 9 ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥) → (𝐹‘(seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥)) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)))
34 seqp1 13613 . . . . . . . . . . . 12 (𝑥 ∈ (ℤ𝑀) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥)(𝐹 ∘ 1st )((𝑍 × {𝐴})‘(𝑥 + 1))))
35 fvex 6748 . . . . . . . . . . . . 13 (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) ∈ V
36 fvex 6748 . . . . . . . . . . . . 13 ((𝑍 × {𝐴})‘(𝑥 + 1)) ∈ V
3735, 36opco1i 7912 . . . . . . . . . . . 12 ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥)(𝐹 ∘ 1st )((𝑍 × {𝐴})‘(𝑥 + 1))) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥))
3834, 37eqtrdi 2795 . . . . . . . . . . 11 (𝑥 ∈ (ℤ𝑀) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥)))
39 seqp1 13613 . . . . . . . . . . . 12 (𝑥 ∈ (ℤ𝑀) → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)) = ((seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)(𝐹 ∘ 1st )({⟨𝑀, 𝐴⟩}‘(𝑥 + 1))))
40 fvex 6748 . . . . . . . . . . . . 13 (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥) ∈ V
41 fvex 6748 . . . . . . . . . . . . 13 ({⟨𝑀, 𝐴⟩}‘(𝑥 + 1)) ∈ V
4240, 41opco1i 7912 . . . . . . . . . . . 12 ((seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)(𝐹 ∘ 1st )({⟨𝑀, 𝐴⟩}‘(𝑥 + 1))) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))
4339, 42eqtrdi 2795 . . . . . . . . . . 11 (𝑥 ∈ (ℤ𝑀) → (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)))
4438, 43eqeq12d 2754 . . . . . . . . . 10 (𝑥 ∈ (ℤ𝑀) → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)) ↔ (𝐹‘(seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥)) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))))
4544adantl 485 . . . . . . . . 9 ((𝐴𝑉𝑥 ∈ (ℤ𝑀)) → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)) ↔ (𝐹‘(seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥)) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))))
4633, 45syl5ibr 249 . . . . . . . 8 ((𝐴𝑉𝑥 ∈ (ℤ𝑀)) → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1))))
4746expcom 417 . . . . . . 7 (𝑥 ∈ (ℤ𝑀) → (𝐴𝑉 → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)))))
4847a2d 29 . . . . . 6 (𝑥 ∈ (ℤ𝑀) → ((𝐴𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)) → (𝐴𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘(𝑥 + 1)) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘(𝑥 + 1)))))
499, 13, 17, 13, 32, 48uzind4 12526 . . . . 5 (𝑥 ∈ (ℤ𝑀) → (𝐴𝑉 → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥)))
5049impcom 411 . . . 4 ((𝐴𝑉𝑥 ∈ (ℤ𝑀)) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))
5150adantll 714 . . 3 (((𝑀 ∈ ℤ ∧ 𝐴𝑉) ∧ 𝑥 ∈ (ℤ𝑀)) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}))‘𝑥) = (seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩})‘𝑥))
523, 5, 51eqfnfvd 6873 . 2 ((𝑀 ∈ ℤ ∧ 𝐴𝑉) → seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴})) = seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩}))
531, 52eqtrid 2790 1 ((𝑀 ∈ ℤ ∧ 𝐴𝑉) → 𝑅 = seq𝑀((𝐹 ∘ 1st ), {⟨𝑀, 𝐴⟩}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1543  wcel 2111  {csn 4555  cop 4561   × cxp 5563  ccom 5569   Fn wfn 6392  cfv 6397  (class class class)co 7231  1st c1st 7777  1c1 10754   + caddc 10756  cz 12200  cuz 12462  seqcseq 13598
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2159  ax-12 2176  ax-ext 2709  ax-sep 5206  ax-nul 5213  ax-pow 5272  ax-pr 5336  ax-un 7541  ax-cnex 10809  ax-resscn 10810  ax-1cn 10811  ax-icn 10812  ax-addcl 10813  ax-addrcl 10814  ax-mulcl 10815  ax-mulrcl 10816  ax-mulcom 10817  ax-addass 10818  ax-mulass 10819  ax-distr 10820  ax-i2m1 10821  ax-1ne0 10822  ax-1rid 10823  ax-rnegex 10824  ax-rrecex 10825  ax-cnre 10826  ax-pre-lttri 10827  ax-pre-lttrn 10828  ax-pre-ltadd 10829  ax-pre-mulgt0 10830
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2072  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2887  df-ne 2942  df-nel 3048  df-ral 3067  df-rex 3068  df-reu 3069  df-rab 3071  df-v 3422  df-sbc 3709  df-csb 3826  df-dif 3883  df-un 3885  df-in 3887  df-ss 3897  df-pss 3899  df-nul 4252  df-if 4454  df-pw 4529  df-sn 4556  df-pr 4558  df-tp 4560  df-op 4562  df-uni 4834  df-iun 4920  df-br 5068  df-opab 5130  df-mpt 5150  df-tr 5176  df-id 5469  df-eprel 5474  df-po 5482  df-so 5483  df-fr 5523  df-we 5525  df-xp 5571  df-rel 5572  df-cnv 5573  df-co 5574  df-dm 5575  df-rn 5576  df-res 5577  df-ima 5578  df-pred 6175  df-ord 6233  df-on 6234  df-lim 6235  df-suc 6236  df-iota 6355  df-fun 6399  df-fn 6400  df-f 6401  df-f1 6402  df-fo 6403  df-f1o 6404  df-fv 6405  df-riota 7188  df-ov 7234  df-oprab 7235  df-mpo 7236  df-om 7663  df-1st 7779  df-2nd 7780  df-wrecs 8067  df-recs 8128  df-rdg 8166  df-er 8411  df-en 8647  df-dom 8648  df-sdom 8649  df-pnf 10893  df-mnf 10894  df-xr 10895  df-ltxr 10896  df-le 10897  df-sub 11088  df-neg 11089  df-nn 11855  df-n0 12115  df-z 12201  df-uz 12463  df-seq 13599
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator