Step * 2 1 1 of Lemma reg-seq-list-add_functionality_wrt_permutation

.....subterm..... T:t
1:n
1. : ℝ List
2. L' : ℝ List
3. permutation(ℝ;L;L')
4. ¬(||L|| 0 ∈ ℤ)
5. : ℕ+
⊢ l_sum(map(λx.(x n);L)) l_sum(map(λx.(x n);L')) ∈ ℤ
BY
(BLemma `l_sum_functionality_wrt_permutation` THEN EAuto 1) }


Latex:


Latex:
.....subterm.....  T:t
1:n
1.  L  :  \mBbbR{}  List
2.  L'  :  \mBbbR{}  List
3.  permutation(\mBbbR{};L;L')
4.  \mneg{}(||L||  =  0)
5.  n  :  \mBbbN{}\msupplus{}
\mvdash{}  l\_sum(map(\mlambda{}x.(x  n);L))  =  l\_sum(map(\mlambda{}x.(x  n);L'))


By


Latex:
(BLemma  `l\_sum\_functionality\_wrt\_permutation`  THEN  EAuto  1)




Home Index