:: BINOM semantic presentation
:: deftheorem Def1 BINOM:def 1 :
canceled;
:: deftheorem Def2 BINOM:def 2 :
canceled;
:: deftheorem Def3 defines add-cancelable BINOM:def 3 :
theorem Th1: :: BINOM:1
theorem Th2: :: BINOM:2
theorem Th3: :: BINOM:3
theorem Th4: :: BINOM:4
theorem Th5: :: BINOM:5
theorem Th6: :: BINOM:6
:: deftheorem Def4 defines + BINOM:def 4 :
theorem Th7: :: BINOM:7
:: deftheorem Def5 defines |^ BINOM:def 5 :
theorem Th8: :: BINOM:8
theorem Th9: :: BINOM:9
theorem Th10: :: BINOM:10
theorem Th11: :: BINOM:11
theorem Th12: :: BINOM:12
definition
let R be non
empty LoopStr ;
func Nat-mult-left c1 -> Function of
[:NAT ,the carrier of a1:],the
carrier of
a1 means :
Def6:
:: BINOM:def 6
for
a being
Element of
R holds
(
it . 0,
a = 0. R & ( for
n being
Element of
NAT holds
it . (n + 1),
a = a + (it . n,a) ) );
existence
ex b1 being Function of [:NAT ,the carrier of R:],the carrier of R st
for a being Element of R holds
( b1 . 0,a = 0. R & ( for n being Element of NAT holds b1 . (n + 1),a = a + (b1 . n,a) ) )
uniqueness
for b1, b2 being Function of [:NAT ,the carrier of R:],the carrier of R st ( for a being Element of R holds
( b1 . 0,a = 0. R & ( for n being Element of NAT holds b1 . (n + 1),a = a + (b1 . n,a) ) ) ) & ( for a being Element of R holds
( b2 . 0,a = 0. R & ( for n being Element of NAT holds b2 . (n + 1),a = a + (b2 . n,a) ) ) ) holds
b1 = b2
func Nat-mult-right c1 -> Function of
[:the carrier of a1,NAT :],the
carrier of
a1 means :
Def7:
:: BINOM:def 7
for
a being
Element of
R holds
(
it . a,0
= 0. R & ( for
n being
Element of
NAT holds
it . a,
(n + 1) = (it . a,n) + a ) );
existence
ex b1 being Function of [:the carrier of R,NAT :],the carrier of R st
for a being Element of R holds
( b1 . a,0 = 0. R & ( for n being Element of NAT holds b1 . a,(n + 1) = (b1 . a,n) + a ) )
uniqueness
for b1, b2 being Function of [:the carrier of R,NAT :],the carrier of R st ( for a being Element of R holds
( b1 . a,0 = 0. R & ( for n being Element of NAT holds b1 . a,(n + 1) = (b1 . a,n) + a ) ) ) & ( for a being Element of R holds
( b2 . a,0 = 0. R & ( for n being Element of NAT holds b2 . a,(n + 1) = (b2 . a,n) + a ) ) ) holds
b1 = b2
end;
:: deftheorem Def6 defines Nat-mult-left BINOM:def 6 :
:: deftheorem Def7 defines Nat-mult-right BINOM:def 7 :
:: deftheorem Def8 defines * BINOM:def 8 :
:: deftheorem Def9 defines * BINOM:def 9 :
theorem Th13: :: BINOM:13
theorem Th14: :: BINOM:14
theorem Th15: :: BINOM:15
Lemma139:
for R being non empty LoopStr
for a being Element of R
for n being Element of NAT holds (n + 1) * a = a + (n * a)
by ;
Lemma140:
for R being non empty LoopStr
for a being Element of R
for n being Element of NAT holds a * (n + 1) = (a * n) + a
by ;
theorem Th16: :: BINOM:16
theorem Th17: :: BINOM:17
theorem Th18: :: BINOM:18
theorem Th19: :: BINOM:19
theorem Th20: :: BINOM:20
theorem Th21: :: BINOM:21
theorem Th22: :: BINOM:22
definition
let R be non
empty unital doubleLoopStr ;
let a be
Element of
R,
b be
Element of
R;
let n be
Element of
NAT ;
func c2,
c3 In_Power c4 -> FinSequence of the
carrier of
a1 means :
Def10:
:: BINOM:def 10
(
len it = n + 1 & ( for
i,
l,
m being
Element of
NAT st
i in dom it &
m = i - 1 &
l = n - m holds
it /. i = ((n choose m) * (a |^ l)) * (b |^ m) ) );
existence
ex b1 being FinSequence of the carrier of R st
( len b1 = n + 1 & ( for i, l, m being Element of NAT st i in dom b1 & m = i - 1 & l = n - m holds
b1 /. i = ((n choose m) * (a |^ l)) * (b |^ m) ) )
uniqueness
for b1, b2 being FinSequence of the carrier of R st len b1 = n + 1 & ( for i, l, m being Element of NAT st i in dom b1 & m = i - 1 & l = n - m holds
b1 /. i = ((n choose m) * (a |^ l)) * (b |^ m) ) & len b2 = n + 1 & ( for i, l, m being Element of NAT st i in dom b2 & m = i - 1 & l = n - m holds
b2 /. i = ((n choose m) * (a |^ l)) * (b |^ m) ) holds
b1 = b2
end;
:: deftheorem Def10 defines In_Power BINOM:def 10 :
theorem Th23: :: BINOM:23
theorem Th24: :: BINOM:24
theorem Th25: :: BINOM:25
theorem Th26: :: BINOM:26