let X be non empty set ; for V being ComplexAlgebra
for V1 being non empty Subset of V
for d1, d2 being Element of X
for A being BinOp of X
for M being Function of [:X,X:],X
for MR being Function of [:COMPLEX,X:],X st V1 = X & d1 = 0. V & d2 = 1. V & A = the addF of V || V1 & M = the multF of V || V1 & MR = the Mult of V | [:COMPLEX,V1:] & V1 is having-inverse holds
ComplexAlgebraStr(# X,M,A,MR,d2,d1 #) is ComplexSubAlgebra of V
let V be ComplexAlgebra; for V1 being non empty Subset of V
for d1, d2 being Element of X
for A being BinOp of X
for M being Function of [:X,X:],X
for MR being Function of [:COMPLEX,X:],X st V1 = X & d1 = 0. V & d2 = 1. V & A = the addF of V || V1 & M = the multF of V || V1 & MR = the Mult of V | [:COMPLEX,V1:] & V1 is having-inverse holds
ComplexAlgebraStr(# X,M,A,MR,d2,d1 #) is ComplexSubAlgebra of V
let V1 be non empty Subset of V; for d1, d2 being Element of X
for A being BinOp of X
for M being Function of [:X,X:],X
for MR being Function of [:COMPLEX,X:],X st V1 = X & d1 = 0. V & d2 = 1. V & A = the addF of V || V1 & M = the multF of V || V1 & MR = the Mult of V | [:COMPLEX,V1:] & V1 is having-inverse holds
ComplexAlgebraStr(# X,M,A,MR,d2,d1 #) is ComplexSubAlgebra of V
let d1, d2 be Element of X; for A being BinOp of X
for M being Function of [:X,X:],X
for MR being Function of [:COMPLEX,X:],X st V1 = X & d1 = 0. V & d2 = 1. V & A = the addF of V || V1 & M = the multF of V || V1 & MR = the Mult of V | [:COMPLEX,V1:] & V1 is having-inverse holds
ComplexAlgebraStr(# X,M,A,MR,d2,d1 #) is ComplexSubAlgebra of V
let A be BinOp of X; for M being Function of [:X,X:],X
for MR being Function of [:COMPLEX,X:],X st V1 = X & d1 = 0. V & d2 = 1. V & A = the addF of V || V1 & M = the multF of V || V1 & MR = the Mult of V | [:COMPLEX,V1:] & V1 is having-inverse holds
ComplexAlgebraStr(# X,M,A,MR,d2,d1 #) is ComplexSubAlgebra of V
let M be Function of [:X,X:],X; for MR being Function of [:COMPLEX,X:],X st V1 = X & d1 = 0. V & d2 = 1. V & A = the addF of V || V1 & M = the multF of V || V1 & MR = the Mult of V | [:COMPLEX,V1:] & V1 is having-inverse holds
ComplexAlgebraStr(# X,M,A,MR,d2,d1 #) is ComplexSubAlgebra of V
let MR be Function of [:COMPLEX,X:],X; ( V1 = X & d1 = 0. V & d2 = 1. V & A = the addF of V || V1 & M = the multF of V || V1 & MR = the Mult of V | [:COMPLEX,V1:] & V1 is having-inverse implies ComplexAlgebraStr(# X,M,A,MR,d2,d1 #) is ComplexSubAlgebra of V )
assume that
A1:
V1 = X
and
A2:
d1 = 0. V
and
A3:
d2 = 1. V
and
A4:
A = the addF of V || V1
and
A5:
M = the multF of V || V1
and
A6:
MR = the Mult of V | [:COMPLEX,V1:]
and
A7:
for v being Element of V st v in V1 holds
- v in V1
; C0SP1:def 1 ComplexAlgebraStr(# X,M,A,MR,d2,d1 #) is ComplexSubAlgebra of V
reconsider W = ComplexAlgebraStr(# X,M,A,MR,d2,d1 #) as non empty ComplexAlgebraStr ;
A10:
( W is Abelian & W is add-associative & W is right_zeroed & W is right_complementable & W is commutative & W is associative & W is right_unital & W is right-distributive & W is vector-distributive & W is scalar-distributive & W is scalar-associative & W is vector-associative )
proof
set Mv = the
multF of
V;
set MV = the
Mult of
V;
set Av = the
addF of
V;
thus
W is
right_complementable
( W is commutative & W is associative & W is right_unital & W is right-distributive & W is vector-distributive & W is scalar-distributive & W is scalar-associative & W is vector-associative )
thus
for
a being
Complex for
x,
y being
VECTOR of
W holds
a * (x + y) = (a * x) + (a * y)
CLVECT_1:def 2 ( W is scalar-distributive & W is scalar-associative & W is vector-associative )proof
let a be
Complex;
for x, y being VECTOR of W holds a * (x + y) = (a * x) + (a * y)let x,
y be
VECTOR of
W;
a * (x + y) = (a * x) + (a * y)
reconsider x1 =
x,
y1 =
y as
Element of
V by A1, TARSKI:def 3;
A15:
a * x = a * x1
by A1, A6, Lm1;
A16:
a * y = a * y1
by A1, A6, Lm1;
x + y = x1 + y1
by A8;
then
a * (x + y) = a * (x1 + y1)
by A1, A6, Lm1;
then
a * (x + y) = (a * x1) + (a * y1)
by CLVECT_1:def 2;
hence
a * (x + y) = (a * x) + (a * y)
by A8, A15, A16;
verum
end;
thus
for
a,
b being
Complex for
v being
VECTOR of
W holds
(a + b) * v = (a * v) + (b * v)
CLVECT_1:def 3 ( W is scalar-associative & W is vector-associative )proof
let a,
b be
Complex;
for v being VECTOR of W holds (a + b) * v = (a * v) + (b * v)let x be
Element of
W;
(a + b) * x = (a * x) + (b * x)
reconsider x1 =
x as
Element of
V by A1, TARSKI:def 3;
A17:
a * x = a * x1
by A1, A6, Lm1;
A18:
b * x = b * x1
by A1, A6, Lm1;
(a + b) * x = (a + b) * x1
by A1, A6, Lm1;
then
(a + b) * x = (a * x1) + (b * x1)
by CLVECT_1:def 3;
hence
(a + b) * x = (a * x) + (b * x)
by A8, A17, A18;
verum
end;
thus
for
a,
b being
Complex for
v being
VECTOR of
W holds
(a * b) * v = a * (b * v)
CLVECT_1:def 4 W is vector-associative proof
let a,
b be
Complex;
for v being VECTOR of W holds (a * b) * v = a * (b * v)let x be
Element of
W;
(a * b) * x = a * (b * x)
reconsider x1 =
x as
Element of
V by A1, TARSKI:def 3;
reconsider y =
b * x as
Element of
W ;
reconsider y1 =
b * x1 as
Element of
V ;
A19:
b * x = b * x1
by A1, A6, Lm1;
A20:
a * (b * x) = a * (b * x1)
by A1, A6, A19, Lm1;
(a * b) * x = (a * b) * x1
by A1, A6, Lm1;
hence
(a * b) * x = a * (b * x)
by A20, CLVECT_1:def 4;
verum
end;
thus
for
x,
y being
Element of
W for
a being
Complex holds
a * (x * y) = (a * x) * y
CFUNCDOM:def 9 verumproof
let x,
y be
Element of
W;
for a being Complex holds a * (x * y) = (a * x) * ylet a be
Complex;
a * (x * y) = (a * x) * y
reconsider x1 =
x,
y1 =
y as
Element of
V by A1, TARSKI:def 3;
A21:
a * x = a * x1
by A1, A6, Lm1;
A22:
a * (x * y) = a * (x1 * y1)
by A1, A6, Lm1, A9;
a * (x1 * y1) = (a * x1) * y1
by CFUNCDOM:def 9;
hence
a * (x * y) = (a * x) * y
by A9, A21, A22;
verum
end;
thus
verum
;
verum
end;
( 0. W = 0. V & 1. W = 1. V )
by A2, A3;
hence
ComplexAlgebraStr(# X,M,A,MR,d2,d1 #) is ComplexSubAlgebra of V
by A1, A4, A5, A6, A10, Def1; verum