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

Theorem seqof2 13431
 Description: Distribute function operation through a sequence. Maps-to notation version of seqof 13430. (Contributed by Mario Carneiro, 7-Jul-2017.)
Hypotheses
Ref Expression
seqof2.1 (𝜑𝐴𝑉)
seqof2.2 (𝜑𝑁 ∈ (ℤ𝑀))
seqof2.3 (𝜑 → (𝑀...𝑁) ⊆ 𝐵)
seqof2.4 ((𝜑 ∧ (𝑥𝐵𝑧𝐴)) → 𝑋𝑊)
Assertion
Ref Expression
seqof2 (𝜑 → (seq𝑀( ∘f + , (𝑥𝐵 ↦ (𝑧𝐴𝑋)))‘𝑁) = (𝑧𝐴 ↦ (seq𝑀( + , (𝑥𝐵𝑋))‘𝑁)))
Distinct variable groups:   𝑥,𝑧,𝐴   𝑥,𝑀,𝑧   𝑥,𝑁,𝑧   𝜑,𝑥,𝑧   𝑧, +   𝑥,𝐵
Allowed substitution hints:   𝐵(𝑧)   + (𝑥)   𝑉(𝑥,𝑧)   𝑊(𝑥,𝑧)   𝑋(𝑥,𝑧)

Proof of Theorem seqof2
Dummy variables 𝑛 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 seqof2.1 . . 3 (𝜑𝐴𝑉)
2 seqof2.2 . . 3 (𝜑𝑁 ∈ (ℤ𝑀))
3 nfv 1914 . . . . . 6 𝑥(𝜑𝑛 ∈ (𝑀...𝑁))
4 nffvmpt1 6684 . . . . . . 7 𝑥((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛)
5 nfcv 2980 . . . . . . . 8 𝑥𝐴
6 nffvmpt1 6684 . . . . . . . 8 𝑥((𝑥𝐵𝑋)‘𝑛)
75, 6nfmpt 5166 . . . . . . 7 𝑥(𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛))
84, 7nfeq 2994 . . . . . 6 𝑥((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛))
93, 8nfim 1896 . . . . 5 𝑥((𝜑𝑛 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛)))
10 eleq1w 2898 . . . . . . 7 (𝑥 = 𝑛 → (𝑥 ∈ (𝑀...𝑁) ↔ 𝑛 ∈ (𝑀...𝑁)))
1110anbi2d 630 . . . . . 6 (𝑥 = 𝑛 → ((𝜑𝑥 ∈ (𝑀...𝑁)) ↔ (𝜑𝑛 ∈ (𝑀...𝑁))))
12 fveq2 6673 . . . . . . 7 (𝑥 = 𝑛 → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛))
13 fveq2 6673 . . . . . . . 8 (𝑥 = 𝑛 → ((𝑥𝐵𝑋)‘𝑥) = ((𝑥𝐵𝑋)‘𝑛))
1413mpteq2dv 5165 . . . . . . 7 (𝑥 = 𝑛 → (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑥)) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛)))
1512, 14eqeq12d 2840 . . . . . 6 (𝑥 = 𝑛 → (((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑥)) ↔ ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛))))
1611, 15imbi12d 347 . . . . 5 (𝑥 = 𝑛 → (((𝜑𝑥 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑥))) ↔ ((𝜑𝑛 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛)))))
17 seqof2.3 . . . . . . . 8 (𝜑 → (𝑀...𝑁) ⊆ 𝐵)
1817sselda 3970 . . . . . . 7 ((𝜑𝑥 ∈ (𝑀...𝑁)) → 𝑥𝐵)
191adantr 483 . . . . . . . 8 ((𝜑𝑥 ∈ (𝑀...𝑁)) → 𝐴𝑉)
2019mptexd 6990 . . . . . . 7 ((𝜑𝑥 ∈ (𝑀...𝑁)) → (𝑧𝐴𝑋) ∈ V)
21 eqid 2824 . . . . . . . 8 (𝑥𝐵 ↦ (𝑧𝐴𝑋)) = (𝑥𝐵 ↦ (𝑧𝐴𝑋))
2221fvmpt2 6782 . . . . . . 7 ((𝑥𝐵 ∧ (𝑧𝐴𝑋) ∈ V) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = (𝑧𝐴𝑋))
2318, 20, 22syl2anc 586 . . . . . 6 ((𝜑𝑥 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = (𝑧𝐴𝑋))
2418adantr 483 . . . . . . . 8 (((𝜑𝑥 ∈ (𝑀...𝑁)) ∧ 𝑧𝐴) → 𝑥𝐵)
25 simpll 765 . . . . . . . . 9 (((𝜑𝑥 ∈ (𝑀...𝑁)) ∧ 𝑧𝐴) → 𝜑)
26 simpr 487 . . . . . . . . 9 (((𝜑𝑥 ∈ (𝑀...𝑁)) ∧ 𝑧𝐴) → 𝑧𝐴)
27 seqof2.4 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐵𝑧𝐴)) → 𝑋𝑊)
2825, 24, 26, 27syl12anc 834 . . . . . . . 8 (((𝜑𝑥 ∈ (𝑀...𝑁)) ∧ 𝑧𝐴) → 𝑋𝑊)
29 eqid 2824 . . . . . . . . 9 (𝑥𝐵𝑋) = (𝑥𝐵𝑋)
3029fvmpt2 6782 . . . . . . . 8 ((𝑥𝐵𝑋𝑊) → ((𝑥𝐵𝑋)‘𝑥) = 𝑋)
3124, 28, 30syl2anc 586 . . . . . . 7 (((𝜑𝑥 ∈ (𝑀...𝑁)) ∧ 𝑧𝐴) → ((𝑥𝐵𝑋)‘𝑥) = 𝑋)
3231mpteq2dva 5164 . . . . . 6 ((𝜑𝑥 ∈ (𝑀...𝑁)) → (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑥)) = (𝑧𝐴𝑋))
3323, 32eqtr4d 2862 . . . . 5 ((𝜑𝑥 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑥)))
349, 16, 33chvarfv 2241 . . . 4 ((𝜑𝑛 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛)))
35 nfcv 2980 . . . . 5 𝑦((𝑥𝐵𝑋)‘𝑛)
36 nfcsb1v 3910 . . . . . 6 𝑧𝑦 / 𝑧(𝑥𝐵𝑋)
37 nfcv 2980 . . . . . 6 𝑧𝑛
3836, 37nffv 6683 . . . . 5 𝑧(𝑦 / 𝑧(𝑥𝐵𝑋)‘𝑛)
39 csbeq1a 3900 . . . . . 6 (𝑧 = 𝑦 → (𝑥𝐵𝑋) = 𝑦 / 𝑧(𝑥𝐵𝑋))
4039fveq1d 6675 . . . . 5 (𝑧 = 𝑦 → ((𝑥𝐵𝑋)‘𝑛) = (𝑦 / 𝑧(𝑥𝐵𝑋)‘𝑛))
4135, 38, 40cbvmpt 5170 . . . 4 (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛)) = (𝑦𝐴 ↦ (𝑦 / 𝑧(𝑥𝐵𝑋)‘𝑛))
4234, 41syl6eq 2875 . . 3 ((𝜑𝑛 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑦𝐴 ↦ (𝑦 / 𝑧(𝑥𝐵𝑋)‘𝑛)))
431, 2, 42seqof 13430 . 2 (𝜑 → (seq𝑀( ∘f + , (𝑥𝐵 ↦ (𝑧𝐴𝑋)))‘𝑁) = (𝑦𝐴 ↦ (seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋))‘𝑁)))
44 nfcv 2980 . . 3 𝑦(seq𝑀( + , (𝑥𝐵𝑋))‘𝑁)
45 nfcv 2980 . . . . 5 𝑧𝑀
46 nfcv 2980 . . . . 5 𝑧 +
4745, 46, 36nfseq 13382 . . . 4 𝑧seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋))
48 nfcv 2980 . . . 4 𝑧𝑁
4947, 48nffv 6683 . . 3 𝑧(seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋))‘𝑁)
5039seqeq3d 13380 . . . 4 (𝑧 = 𝑦 → seq𝑀( + , (𝑥𝐵𝑋)) = seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋)))
5150fveq1d 6675 . . 3 (𝑧 = 𝑦 → (seq𝑀( + , (𝑥𝐵𝑋))‘𝑁) = (seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋))‘𝑁))
5244, 49, 51cbvmpt 5170 . 2 (𝑧𝐴 ↦ (seq𝑀( + , (𝑥𝐵𝑋))‘𝑁)) = (𝑦𝐴 ↦ (seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋))‘𝑁))
5343, 52syl6eqr 2877 1 (𝜑 → (seq𝑀( ∘f + , (𝑥𝐵 ↦ (𝑧𝐴𝑋)))‘𝑁) = (𝑧𝐴 ↦ (seq𝑀( + , (𝑥𝐵𝑋))‘𝑁)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 398   = wceq 1536   ∈ wcel 2113  Vcvv 3497  ⦋csb 3886   ⊆ wss 3939   ↦ cmpt 5149  ‘cfv 6358  (class class class)co 7159   ∘f cof 7410  ℤ≥cuz 12246  ...cfz 12895  seqcseq 13372 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-rep 5193  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464  ax-cnex 10596  ax-resscn 10597  ax-1cn 10598  ax-icn 10599  ax-addcl 10600  ax-addrcl 10601  ax-mulcl 10602  ax-mulrcl 10603  ax-mulcom 10604  ax-addass 10605  ax-mulass 10606  ax-distr 10607  ax-i2m1 10608  ax-1ne0 10609  ax-1rid 10610  ax-rnegex 10611  ax-rrecex 10612  ax-cnre 10613  ax-pre-lttri 10614  ax-pre-lttrn 10615  ax-pre-ltadd 10616  ax-pre-mulgt0 10617 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-nel 3127  df-ral 3146  df-rex 3147  df-reu 3148  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-pss 3957  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-tp 4575  df-op 4577  df-uni 4842  df-iun 4924  df-br 5070  df-opab 5132  df-mpt 5150  df-tr 5176  df-id 5463  df-eprel 5468  df-po 5477  df-so 5478  df-fr 5517  df-we 5519  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-pred 6151  df-ord 6197  df-on 6198  df-lim 6199  df-suc 6200  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-riota 7117  df-ov 7162  df-oprab 7163  df-mpo 7164  df-of 7412  df-om 7584  df-1st 7692  df-2nd 7693  df-wrecs 7950  df-recs 8011  df-rdg 8049  df-er 8292  df-en 8513  df-dom 8514  df-sdom 8515  df-pnf 10680  df-mnf 10681  df-xr 10682  df-ltxr 10683  df-le 10684  df-sub 10875  df-neg 10876  df-nn 11642  df-n0 11901  df-z 11985  df-uz 12247  df-fz 12896  df-seq 13373 This theorem is referenced by:  mtestbdd  24996  lgamgulm2  25616  lgamcvglem  25620
 Copyright terms: Public domain W3C validator