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

Theorem seqof2 12721
Description: Distribute function operation through a sequence. Maps-to notation version of seqof 12720. (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 1830 . . . . . 6 𝑥(𝜑𝑛 ∈ (𝑀...𝑁))
4 nffvmpt1 6111 . . . . . . 7 𝑥((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛)
5 nfcv 2751 . . . . . . . 8 𝑥𝐴
6 nffvmpt1 6111 . . . . . . . 8 𝑥((𝑥𝐵𝑋)‘𝑛)
75, 6nfmpt 4674 . . . . . . 7 𝑥(𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛))
84, 7nfeq 2762 . . . . . 6 𝑥((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛))
93, 8nfim 1813 . . . . 5 𝑥((𝜑𝑛 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛)))
10 eleq1 2676 . . . . . . 7 (𝑥 = 𝑛 → (𝑥 ∈ (𝑀...𝑁) ↔ 𝑛 ∈ (𝑀...𝑁)))
1110anbi2d 736 . . . . . 6 (𝑥 = 𝑛 → ((𝜑𝑥 ∈ (𝑀...𝑁)) ↔ (𝜑𝑛 ∈ (𝑀...𝑁))))
12 fveq2 6103 . . . . . . 7 (𝑥 = 𝑛 → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛))
13 fveq2 6103 . . . . . . . 8 (𝑥 = 𝑛 → ((𝑥𝐵𝑋)‘𝑥) = ((𝑥𝐵𝑋)‘𝑛))
1413mpteq2dv 4673 . . . . . . 7 (𝑥 = 𝑛 → (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑥)) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛)))
1512, 14eqeq12d 2625 . . . . . 6 (𝑥 = 𝑛 → (((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑥)) ↔ ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛))))
1611, 15imbi12d 333 . . . . 5 (𝑥 = 𝑛 → (((𝜑𝑥 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑥))) ↔ ((𝜑𝑛 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛)))))
17 seqof2.3 . . . . . . . 8 (𝜑 → (𝑀...𝑁) ⊆ 𝐵)
1817sselda 3568 . . . . . . 7 ((𝜑𝑥 ∈ (𝑀...𝑁)) → 𝑥𝐵)
191adantr 480 . . . . . . . 8 ((𝜑𝑥 ∈ (𝑀...𝑁)) → 𝐴𝑉)
20 mptexg 6389 . . . . . . . 8 (𝐴𝑉 → (𝑧𝐴𝑋) ∈ V)
2119, 20syl 17 . . . . . . 7 ((𝜑𝑥 ∈ (𝑀...𝑁)) → (𝑧𝐴𝑋) ∈ V)
22 eqid 2610 . . . . . . . 8 (𝑥𝐵 ↦ (𝑧𝐴𝑋)) = (𝑥𝐵 ↦ (𝑧𝐴𝑋))
2322fvmpt2 6200 . . . . . . 7 ((𝑥𝐵 ∧ (𝑧𝐴𝑋) ∈ V) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = (𝑧𝐴𝑋))
2418, 21, 23syl2anc 691 . . . . . 6 ((𝜑𝑥 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = (𝑧𝐴𝑋))
2518adantr 480 . . . . . . . 8 (((𝜑𝑥 ∈ (𝑀...𝑁)) ∧ 𝑧𝐴) → 𝑥𝐵)
26 simpll 786 . . . . . . . . 9 (((𝜑𝑥 ∈ (𝑀...𝑁)) ∧ 𝑧𝐴) → 𝜑)
27 simpr 476 . . . . . . . . 9 (((𝜑𝑥 ∈ (𝑀...𝑁)) ∧ 𝑧𝐴) → 𝑧𝐴)
28 seqof2.4 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐵𝑧𝐴)) → 𝑋𝑊)
2926, 25, 27, 28syl12anc 1316 . . . . . . . 8 (((𝜑𝑥 ∈ (𝑀...𝑁)) ∧ 𝑧𝐴) → 𝑋𝑊)
30 eqid 2610 . . . . . . . . 9 (𝑥𝐵𝑋) = (𝑥𝐵𝑋)
3130fvmpt2 6200 . . . . . . . 8 ((𝑥𝐵𝑋𝑊) → ((𝑥𝐵𝑋)‘𝑥) = 𝑋)
3225, 29, 31syl2anc 691 . . . . . . 7 (((𝜑𝑥 ∈ (𝑀...𝑁)) ∧ 𝑧𝐴) → ((𝑥𝐵𝑋)‘𝑥) = 𝑋)
3332mpteq2dva 4672 . . . . . 6 ((𝜑𝑥 ∈ (𝑀...𝑁)) → (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑥)) = (𝑧𝐴𝑋))
3424, 33eqtr4d 2647 . . . . 5 ((𝜑𝑥 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑥) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑥)))
359, 16, 34chvar 2250 . . . 4 ((𝜑𝑛 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛)))
36 nfcv 2751 . . . . 5 𝑦((𝑥𝐵𝑋)‘𝑛)
37 nfcsb1v 3515 . . . . . 6 𝑧𝑦 / 𝑧(𝑥𝐵𝑋)
38 nfcv 2751 . . . . . 6 𝑧𝑛
3937, 38nffv 6110 . . . . 5 𝑧(𝑦 / 𝑧(𝑥𝐵𝑋)‘𝑛)
40 csbeq1a 3508 . . . . . 6 (𝑧 = 𝑦 → (𝑥𝐵𝑋) = 𝑦 / 𝑧(𝑥𝐵𝑋))
4140fveq1d 6105 . . . . 5 (𝑧 = 𝑦 → ((𝑥𝐵𝑋)‘𝑛) = (𝑦 / 𝑧(𝑥𝐵𝑋)‘𝑛))
4236, 39, 41cbvmpt 4677 . . . 4 (𝑧𝐴 ↦ ((𝑥𝐵𝑋)‘𝑛)) = (𝑦𝐴 ↦ (𝑦 / 𝑧(𝑥𝐵𝑋)‘𝑛))
4335, 42syl6eq 2660 . . 3 ((𝜑𝑛 ∈ (𝑀...𝑁)) → ((𝑥𝐵 ↦ (𝑧𝐴𝑋))‘𝑛) = (𝑦𝐴 ↦ (𝑦 / 𝑧(𝑥𝐵𝑋)‘𝑛)))
441, 2, 43seqof 12720 . 2 (𝜑 → (seq𝑀( ∘𝑓 + , (𝑥𝐵 ↦ (𝑧𝐴𝑋)))‘𝑁) = (𝑦𝐴 ↦ (seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋))‘𝑁)))
45 nfcv 2751 . . 3 𝑦(seq𝑀( + , (𝑥𝐵𝑋))‘𝑁)
46 nfcv 2751 . . . . 5 𝑧𝑀
47 nfcv 2751 . . . . 5 𝑧 +
4846, 47, 37nfseq 12673 . . . 4 𝑧seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋))
49 nfcv 2751 . . . 4 𝑧𝑁
5048, 49nffv 6110 . . 3 𝑧(seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋))‘𝑁)
5140seqeq3d 12671 . . . 4 (𝑧 = 𝑦 → seq𝑀( + , (𝑥𝐵𝑋)) = seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋)))
5251fveq1d 6105 . . 3 (𝑧 = 𝑦 → (seq𝑀( + , (𝑥𝐵𝑋))‘𝑁) = (seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋))‘𝑁))
5345, 50, 52cbvmpt 4677 . 2 (𝑧𝐴 ↦ (seq𝑀( + , (𝑥𝐵𝑋))‘𝑁)) = (𝑦𝐴 ↦ (seq𝑀( + , 𝑦 / 𝑧(𝑥𝐵𝑋))‘𝑁))
5444, 53syl6eqr 2662 1 (𝜑 → (seq𝑀( ∘𝑓 + , (𝑥𝐵 ↦ (𝑧𝐴𝑋)))‘𝑁) = (𝑧𝐴 ↦ (seq𝑀( + , (𝑥𝐵𝑋))‘𝑁)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1475  wcel 1977  Vcvv 3173  csb 3499  wss 3540  cmpt 4643  cfv 5804  (class class class)co 6549  𝑓 cof 6793  cuz 11563  ...cfz 12197  seqcseq 12663
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-of 6795  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-n0 11170  df-z 11255  df-uz 11564  df-fz 12198  df-seq 12664
This theorem is referenced by:  mtestbdd  23963  lgamgulm2  24562  lgamcvglem  24566
  Copyright terms: Public domain W3C validator