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

Theorem seqof2 13073
 Description: Distribute function operation through a sequence. Maps-to notation version of seqof 13072. (Contributed by Mario Carneiro, 7-Jul-2017.)
Hypotheses
Ref Expression
seqof2.1 (𝜑𝐴𝑉)
seqof2.2 (𝜑𝑁 ∈ (ℤ𝑀))
seqof2.3 (𝜑 → (𝑀...𝑁) ⊆ 𝐵)
seqof2.4 ((𝜑 ∧ (𝑥𝐵𝑧𝐴)) → 𝑋𝑊)
Assertion
Ref Expression
seqof2 (𝜑 → (seq𝑀( ∘𝑓 + , (𝑥𝐵 ↦ (𝑧𝐴𝑋)))‘𝑁) = (𝑧𝐴 ↦ (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 1992 . . . . . 6 𝑥(𝜑𝑛 ∈ (𝑀...𝑁))
4 nffvmpt1 6361 . . . . . . 7 𝑥((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛)
5 nfcv 2902 . . . . . . . 8 𝑥𝐴
6 nffvmpt1 6361 . . . . . . . 8 𝑥((𝑥𝐵𝑋)‘𝑛)
75, 6nfmpt 4898 . . . . . . 7 𝑥(𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛))
84, 7nfeq 2914 . . . . . 6 𝑥((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛))
93, 8nfim 1974 . . . . 5 𝑥((𝜑𝑛 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛)))
10 eleq1w 2822 . . . . . . 7 (𝑥 = 𝑛 → (𝑥 ∈ (𝑀...𝑁) ↔ 𝑛 ∈ (𝑀...𝑁)))
1110anbi2d 742 . . . . . 6 (𝑥 = 𝑛 → ((𝜑𝑥 ∈ (𝑀...𝑁)) ↔ (𝜑𝑛 ∈ (𝑀...𝑁))))
12 fveq2 6353 . . . . . . 7 (𝑥 = 𝑛 → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛))
13 fveq2 6353 . . . . . . . 8 (𝑥 = 𝑛 → ((𝑥𝐵𝑋)‘𝑥) = ((𝑥𝐵𝑋)‘𝑛))
1413mpteq2dv 4897 . . . . . . 7 (𝑥 = 𝑛 → (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑥)) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛)))
1512, 14eqeq12d 2775 . . . . . 6 (𝑥 = 𝑛 → (((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑥)) ↔ ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛))))
1611, 15imbi12d 333 . . . . 5 (𝑥 = 𝑛 → (((𝜑𝑥 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑥))) ↔ ((𝜑𝑛 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛)))))
17 seqof2.3 . . . . . . . 8 (𝜑 → (𝑀...𝑁) ⊆ 𝐵)
1817sselda 3744 . . . . . . 7 ((𝜑𝑥 ∈ (𝑀...𝑁)) → 𝑥𝐵)
191adantr 472 . . . . . . . 8 ((𝜑𝑥 ∈ (𝑀...𝑁)) → 𝐴𝑉)
20 mptexg 6649 . . . . . . . 8 (𝐴𝑉 → (𝑧𝐴𝑋) ∈ V)
2119, 20syl 17 . . . . . . 7 ((𝜑𝑥 ∈ (𝑀...𝑁)) → (𝑧𝐴𝑋) ∈ V)
22 eqid 2760 . . . . . . . 8 (𝑥𝐵 ↦ (𝑧𝐴𝑋)) = (𝑥𝐵 ↦ (𝑧𝐴𝑋))
2322fvmpt2 6454 . . . . . . 7 ((𝑥𝐵 ∧ (𝑧𝐴𝑋) ∈ V) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = (𝑧𝐴𝑋))
2418, 21, 23syl2anc 696 . . . . . 6 ((𝜑𝑥 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = (𝑧𝐴𝑋))
2518adantr 472 . . . . . . . 8 (((𝜑𝑥 ∈ (𝑀...𝑁)) ∧ 𝑧𝐴) → 𝑥𝐵)
26 simpll 807 . . . . . . . . 9 (((𝜑𝑥 ∈ (𝑀...𝑁)) ∧ 𝑧𝐴) → 𝜑)
27 simpr 479 . . . . . . . . 9 (((𝜑𝑥 ∈ (𝑀...𝑁)) ∧ 𝑧𝐴) → 𝑧𝐴)
28 seqof2.4 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐵𝑧𝐴)) → 𝑋𝑊)
2926, 25, 27, 28syl12anc 1475 . . . . . . . 8 (((𝜑𝑥 ∈ (𝑀...𝑁)) ∧ 𝑧𝐴) → 𝑋𝑊)
30 eqid 2760 . . . . . . . . 9 (𝑥𝐵𝑋) = (𝑥𝐵𝑋)
3130fvmpt2 6454 . . . . . . . 8 ((𝑥𝐵𝑋𝑊) → ((𝑥𝐵𝑋)‘𝑥) = 𝑋)
3225, 29, 31syl2anc 696 . . . . . . 7 (((𝜑𝑥 ∈ (𝑀...𝑁)) ∧ 𝑧𝐴) → ((𝑥𝐵𝑋)‘𝑥) = 𝑋)
3332mpteq2dva 4896 . . . . . 6 ((𝜑𝑥 ∈ (𝑀...𝑁)) → (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑥)) = (𝑧𝐴𝑋))
3424, 33eqtr4d 2797 . . . . 5 ((𝜑𝑥 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑥)))
359, 16, 34chvar 2407 . . . 4 ((𝜑𝑛 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛)))
36 nfcv 2902 . . . . 5 𝑦((𝑥𝐵𝑋)‘𝑛)
37 nfcsb1v 3690 . . . . . 6 𝑧𝑦 / 𝑧(𝑥𝐵𝑋)
38 nfcv 2902 . . . . . 6 𝑧𝑛
3937, 38nffv 6360 . . . . 5 𝑧(𝑦 / 𝑧(𝑥𝐵𝑋)‘𝑛)
40 csbeq1a 3683 . . . . . 6 (𝑧 = 𝑦 → (𝑥𝐵𝑋) = 𝑦 / 𝑧(𝑥𝐵𝑋))
4140fveq1d 6355 . . . . 5 (𝑧 = 𝑦 → ((𝑥𝐵𝑋)‘𝑛) = (𝑦 / 𝑧(𝑥𝐵𝑋)‘𝑛))
4236, 39, 41cbvmpt 4901 . . . 4 (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛)) = (𝑦𝐴 ↦ (𝑦 / 𝑧(𝑥𝐵𝑋)‘𝑛))
4335, 42syl6eq 2810 . . 3 ((𝜑𝑛 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑦𝐴 ↦ (𝑦 / 𝑧(𝑥𝐵𝑋)‘𝑛)))
441, 2, 43seqof 13072 . 2 (𝜑 → (seq𝑀( ∘𝑓 + , (𝑥𝐵 ↦ (𝑧𝐴𝑋)))‘𝑁) = (𝑦𝐴 ↦ (seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋))‘𝑁)))
45 nfcv 2902 . . 3 𝑦(seq𝑀( + , (𝑥𝐵𝑋))‘𝑁)
46 nfcv 2902 . . . . 5 𝑧𝑀
47 nfcv 2902 . . . . 5 𝑧 +
4846, 47, 37nfseq 13025 . . . 4 𝑧seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋))
49 nfcv 2902 . . . 4 𝑧𝑁
5048, 49nffv 6360 . . 3 𝑧(seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋))‘𝑁)
5140seqeq3d 13023 . . . 4 (𝑧 = 𝑦 → seq𝑀( + , (𝑥𝐵𝑋)) = seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋)))
5251fveq1d 6355 . . 3 (𝑧 = 𝑦 → (seq𝑀( + , (𝑥𝐵𝑋))‘𝑁) = (seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋))‘𝑁))
5345, 50, 52cbvmpt 4901 . 2 (𝑧𝐴 ↦ (seq𝑀( + , (𝑥𝐵𝑋))‘𝑁)) = (𝑦𝐴 ↦ (seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋))‘𝑁))
5444, 53syl6eqr 2812 1 (𝜑 → (seq𝑀( ∘𝑓 + , (𝑥𝐵 ↦ (𝑧𝐴𝑋)))‘𝑁) = (𝑧𝐴 ↦ (seq𝑀( + , (𝑥𝐵𝑋))‘𝑁)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1632   ∈ wcel 2139  Vcvv 3340  ⦋csb 3674   ⊆ wss 3715   ↦ cmpt 4881  ‘cfv 6049  (class class class)co 6814   ∘𝑓 cof 7061  ℤ≥cuz 11899  ...cfz 12539  seqcseq 13015 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-rep 4923  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7115  ax-cnex 10204  ax-resscn 10205  ax-1cn 10206  ax-icn 10207  ax-addcl 10208  ax-addrcl 10209  ax-mulcl 10210  ax-mulrcl 10211  ax-mulcom 10212  ax-addass 10213  ax-mulass 10214  ax-distr 10215  ax-i2m1 10216  ax-1ne0 10217  ax-1rid 10218  ax-rnegex 10219  ax-rrecex 10220  ax-cnre 10221  ax-pre-lttri 10222  ax-pre-lttrn 10223  ax-pre-ltadd 10224  ax-pre-mulgt0 10225 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-nel 3036  df-ral 3055  df-rex 3056  df-reu 3057  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-pss 3731  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-tp 4326  df-op 4328  df-uni 4589  df-iun 4674  df-br 4805  df-opab 4865  df-mpt 4882  df-tr 4905  df-id 5174  df-eprel 5179  df-po 5187  df-so 5188  df-fr 5225  df-we 5227  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-pred 5841  df-ord 5887  df-on 5888  df-lim 5889  df-suc 5890  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-riota 6775  df-ov 6817  df-oprab 6818  df-mpt2 6819  df-of 7063  df-om 7232  df-1st 7334  df-2nd 7335  df-wrecs 7577  df-recs 7638  df-rdg 7676  df-er 7913  df-en 8124  df-dom 8125  df-sdom 8126  df-pnf 10288  df-mnf 10289  df-xr 10290  df-ltxr 10291  df-le 10292  df-sub 10480  df-neg 10481  df-nn 11233  df-n0 11505  df-z 11590  df-uz 11900  df-fz 12540  df-seq 13016 This theorem is referenced by:  mtestbdd  24378  lgamgulm2  24982  lgamcvglem  24986
 Copyright terms: Public domain W3C validator