let X be BCI-algebra; for a being Element of AtomSet X
for i being Integer holds a |^ i in AtomSet X
let a be Element of AtomSet X; for i being Integer holds a |^ i in AtomSet X
let i be Integer; a |^ i in AtomSet X
defpred S1[ Integer] means a |^ $1 in AtomSet X;
0. X in AtomSet X
;
then A1:
S1[ 0 ]
by Def1;
per cases
( i >= 0 or i <= 0 )
;
suppose A5:
i <= 0
;
a |^ i in AtomSet XA6:
for
i2 being
Integer st
i2 <= 0 &
S1[
i2] holds
S1[
i2 - 1]
proof
let i2 be
Integer;
( i2 <= 0 & S1[i2] implies S1[i2 - 1] )
assume A7:
i2 <= 0
;
( not S1[i2] or S1[i2 - 1] )
assume A8:
S1[
i2]
;
S1[i2 - 1]
per cases
( i2 = 0 or i2 < 0 )
by A7;
suppose A10:
i2 < 0
;
S1[i2 - 1]set j =
i2;
reconsider m =
- i2 as
Element of
NAT by A10, INT_1:3;
a |^ (i2 - 1) = (BCI-power X) . (
(a `),
|.(i2 - 1).|)
by A10, Def2;
then
a |^ (i2 - 1) = (BCI-power X) . (
(a `),
(- (i2 - 1)))
by A10, ABSVALUE:def 1;
then
a |^ (i2 - 1) = (a `) |^ (m + 1)
;
then
a |^ (i2 - 1) = (a `) \ (((a `) |^ m) `)
by Def1;
then
a |^ (i2 - 1) = (a `) \ ((a |^ (- (- i2))) `)
by Th10;
then
((a |^ (i2 - 1)) `) ` = (((a `) `) \ (((a |^ i2) `) `)) `
by BCIALG_1:9;
then
((a |^ (i2 - 1)) `) ` = (a \ (((a |^ i2) `) `)) `
by BCIALG_1:29;
then
((a |^ (i2 - 1)) `) ` = (a \ (a |^ i2)) `
by A8, BCIALG_1:29;
then
((a |^ (i2 - 1)) `) ` = (a `) \ ((a |^ (- m)) `)
by BCIALG_1:9;
then
((a |^ (i2 - 1)) `) ` = (a `) \ (((a `) |^ m) `)
by Th10;
then
((a |^ (i2 - 1)) `) ` = (a `) |^ (m + 1)
by Def1;
then
((a |^ (i2 - 1)) `) ` = (BCI-power X) . (
(a `),
(- (i2 - 1)))
;
then
((a |^ (i2 - 1)) `) ` = (BCI-power X) . (
(a `),
|.(i2 - 1).|)
by A10, ABSVALUE:def 1;
then
((a |^ (i2 - 1)) `) ` = a |^ (i2 - 1)
by A10, Def2;
hence
S1[
i2 - 1]
by BCIALG_1:29;
verum end; end;
end;
for
i being
Integer st
i <= 0 holds
S1[
i]
from INT_1:sch 3(A1, A6);
hence
a |^ i in AtomSet X
by A5;
verum end; end;