let L be non empty non degenerated right_complementable almost_left_invertible associative commutative well-unital distributive add-associative right_zeroed doubleLoopStr ; :: thesis: for p being Polynomial of L holds
( deg p = 1 iff ex x, z being Element of L st
( x <> 0. L & p = x * (rpoly 1,z) ) )
let p be Polynomial of L; :: thesis: ( deg p = 1 iff ex x, z being Element of L st
( x <> 0. L & p = x * (rpoly 1,z) ) )
now assume A3:
deg p = 1
;
:: thesis: ex x, z being Element of L st
( x <> 0. L & p = x * (rpoly 1,z) )then A4:
len p = 1
+ 1
;
set x =
p . 1;
set z =
(- (p . 0 )) * ((p . 1) " );
set f =
(p . 1) * (rpoly 1,((- (p . 0 )) * ((p . 1) " )));
A5:
p . 1
<> 0. L
by A4, ALGSEQ_1:25;
A6:
len ((p . 1) * (rpoly 1,((- (p . 0 )) * ((p . 1) " )))) =
(deg (rpoly 1,((- (p . 0 )) * ((p . 1) " )))) + 1
by A4, ALGSEQ_1:25, POLYNOM5:26
.=
1
+ 1
by Th27
.=
len p
by A3
;
then
p = (p . 1) * (rpoly 1,((- (p . 0 )) * ((p . 1) " )))
by A6, ALGSEQ_1:28;
hence
ex
x,
z being
Element of
L st
(
x <> 0. L &
p = x * (rpoly 1,z) )
by A4, ALGSEQ_1:25;
:: thesis: verum end;
hence
( deg p = 1 iff ex x, z being Element of L st
( x <> 0. L & p = x * (rpoly 1,z) ) )
by A1; :: thesis: verum