thus RAlgebra A is strict ; :: thesis: ( RAlgebra A is Abelian & RAlgebra A is add-associative & RAlgebra A is right_zeroed & RAlgebra A is right_complementable & RAlgebra A is commutative & RAlgebra A is associative & RAlgebra A is right_unital & RAlgebra A is right-distributive & RAlgebra A is vector-associative & RAlgebra A is scalar-associative & RAlgebra A is vector-distributive & RAlgebra A is scalar-distributive )
thus RAlgebra A is Abelian :: thesis: ( RAlgebra A is add-associative & RAlgebra A is right_zeroed & RAlgebra A is right_complementable & RAlgebra A is commutative & RAlgebra A is associative & RAlgebra A is right_unital & RAlgebra A is right-distributive & RAlgebra A is vector-associative & RAlgebra A is scalar-associative & RAlgebra A is vector-distributive & RAlgebra A is scalar-distributive )
proof
let x, y be Element of (RAlgebra A); :: according to RLVECT_1:def 2 :: thesis: x + y = y + x
thus x + y = y + x by Th16; :: thesis: verum
end;
thus RAlgebra A is add-associative :: thesis: ( RAlgebra A is right_zeroed & RAlgebra A is right_complementable & RAlgebra A is commutative & RAlgebra A is associative & RAlgebra A is right_unital & RAlgebra A is right-distributive & RAlgebra A is vector-associative & RAlgebra A is scalar-associative & RAlgebra A is vector-distributive & RAlgebra A is scalar-distributive )
proof
let x, y, z be Element of (RAlgebra A); :: according to RLVECT_1:def 3 :: thesis: (x + y) + z = x + (y + z)
thus (x + y) + z = x + (y + z) by Th17; :: thesis: verum
end;
thus RAlgebra A is right_zeroed :: thesis: ( RAlgebra A is right_complementable & RAlgebra A is commutative & RAlgebra A is associative & RAlgebra A is right_unital & RAlgebra A is right-distributive & RAlgebra A is vector-associative & RAlgebra A is scalar-associative & RAlgebra A is vector-distributive & RAlgebra A is scalar-distributive )
proof
let x be Element of (RAlgebra A); :: according to RLVECT_1:def 4 :: thesis: x + (0. (RAlgebra A)) = x
thus x + (0. (RAlgebra A)) = (RealFuncAdd A) . ((RealFuncZero A),x) by Th16
.= x by Th21 ; :: thesis: verum
end;
thus RAlgebra A is right_complementable :: thesis: ( RAlgebra A is commutative & RAlgebra A is associative & RAlgebra A is right_unital & RAlgebra A is right-distributive & RAlgebra A is vector-associative & RAlgebra A is scalar-associative & RAlgebra A is vector-distributive & RAlgebra A is scalar-distributive )
proof
let x be Element of (RAlgebra A); :: according to ALGSTR_0:def 16 :: thesis: x is right_complementable
reconsider f = x as Element of Funcs (A,REAL) ;
reconsider t = (RealFuncExtMult A) . [(- 1),f] as Element of (RAlgebra A) ;
take t ; :: according to ALGSTR_0:def 11 :: thesis: x + t = 0. (RAlgebra A)
thus x + t = 0. (RAlgebra A) by Th22; :: thesis: verum
end;
thus RAlgebra A is commutative :: thesis: ( RAlgebra A is associative & RAlgebra A is right_unital & RAlgebra A is right-distributive & RAlgebra A is vector-associative & RAlgebra A is scalar-associative & RAlgebra A is vector-distributive & RAlgebra A is scalar-distributive )
proof
let x, y be Element of (RAlgebra A); :: according to GROUP_1:def 12 :: thesis: x * y = y * x
thus x * y = y * x by Th18; :: thesis: verum
end;
thus RAlgebra A is associative :: thesis: ( RAlgebra A is right_unital & RAlgebra A is right-distributive & RAlgebra A is vector-associative & RAlgebra A is scalar-associative & RAlgebra A is vector-distributive & RAlgebra A is scalar-distributive )
proof
let x, y, z be Element of (RAlgebra A); :: according to GROUP_1:def 3 :: thesis: (x * y) * z = x * (y * z)
thus (x * y) * z = x * (y * z) by Th19; :: thesis: verum
end;
thus RAlgebra A is right_unital :: thesis: ( RAlgebra A is right-distributive & RAlgebra A is vector-associative & RAlgebra A is scalar-associative & RAlgebra A is vector-distributive & RAlgebra A is scalar-distributive )
proof
let x be Element of (RAlgebra A); :: according to VECTSP_1:def 4 :: thesis: x * (1. (RAlgebra A)) = x
thus x * (1. (RAlgebra A)) = (RealFuncMult A) . ((RealFuncUnit A),x) by Th18
.= x by Th20 ; :: thesis: verum
end;
thus RAlgebra A is right-distributive :: thesis: ( RAlgebra A is vector-associative & RAlgebra A is scalar-associative & RAlgebra A is vector-distributive & RAlgebra A is scalar-distributive )
proof
let x, y, z be Element of (RAlgebra A); :: according to VECTSP_1:def 2 :: thesis: x * (y + z) = (x * y) + (x * z)
thus x * (y + z) = (x * y) + (x * z) by Th26; :: thesis: verum
end;
thus RAlgebra A is vector-associative :: thesis: ( RAlgebra A is scalar-associative & RAlgebra A is vector-distributive & RAlgebra A is scalar-distributive )
proof
let x, y be Element of (RAlgebra A); :: according to FUNCSDOM:def 9 :: thesis: for a being Real holds a * (x * y) = (a * x) * y
let a be Real; :: thesis: a * (x * y) = (a * x) * y
thus (a * x) * y = a * (x * y) by Th27; :: thesis: verum
end;
thus RAlgebra A is scalar-associative :: thesis: ( RAlgebra A is vector-distributive & RAlgebra A is scalar-distributive )
proof
let a, b be real number ; :: according to RLVECT_1:def 7 :: thesis: for b1 being Element of the carrier of (RAlgebra A) holds (a * b) * b1 = a * (b * b1)
let x be Element of (RAlgebra A); :: thesis: (a * b) * x = a * (b * x)
reconsider a = a, b = b as Element of REAL by XREAL_0:def 1;
(a * b) * x = a * (b * x) by Th24;
hence (a * b) * x = a * (b * x) ; :: thesis: verum
end;
thus RAlgebra A is vector-distributive :: thesis: RAlgebra A is scalar-distributive
proof
let a be real number ; :: according to RLVECT_1:def 5 :: thesis: for b1, b2 being Element of the carrier of (RAlgebra A) holds a * (b1 + b2) = (a * b1) + (a * b2)
let v, w be Element of (RAlgebra A); :: thesis: a * (v + w) = (a * v) + (a * w)
reconsider a = a as Element of REAL by XREAL_0:def 1;
a * (v + w) = (a * v) + (a * w) by Lm2;
hence a * (v + w) = (a * v) + (a * w) ; :: thesis: verum
end;
let a, b be real number ; :: according to RLVECT_1:def 6 :: thesis: for b1 being Element of the carrier of (RAlgebra A) holds (a + b) * b1 = (a * b1) + (b * b1)
let v be Element of (RAlgebra A); :: thesis: (a + b) * v = (a * v) + (b * v)
reconsider a = a, b = b as Element of REAL by XREAL_0:def 1;
(a + b) * v = (a * v) + (b * v) by Th25;
hence (a + b) * v = (a * v) + (b * v) ; :: thesis: verum