set E = F_Complex ;
set F = F_Real ;
defpred S1[ object , object ] means ( ( $1 = 0 & $2 = id F_Complex ) or ( $1 = 1 & $2 = *' ) );
A2: INT.Group 2 = multMagma(# (Segm 2),(addint 2) #) by GR_CY_1:def 5;
A: now :: thesis: for x1 being object st x1 in the carrier of (INT.Group 2) holds
ex y being object st
( y in the carrier of (Aut (F_Complex,F_Real)) & S1[x1,y] )
let x1 be object ; :: thesis: ( x1 in the carrier of (INT.Group 2) implies ex y being object st
( y in the carrier of (Aut (F_Complex,F_Real)) & S1[x1,y] ) )

assume A1: x1 in the carrier of (INT.Group 2) ; :: thesis: ex y being object st
( y in the carrier of (Aut (F_Complex,F_Real)) & S1[x1,y] )

then reconsider x = x1 as natural Number by A2;
x in Segm (1 + 1) by A1, A2;
then B: not not x = 0 & ... & not x = 1 by NAT_1:61;
thus ex y being object st
( y in the carrier of (Aut (F_Complex,F_Real)) & S1[x1,y] ) :: thesis: verum
proof
per cases ( x = 0 or x = 1 ) by B;
suppose C: x = 0 ; :: thesis: ex y being object st
( y in the carrier of (Aut (F_Complex,F_Real)) & S1[x1,y] )

end;
suppose C: x = 1 ; :: thesis: ex y being object st
( y in the carrier of (Aut (F_Complex,F_Real)) & S1[x1,y] )

take *' ; :: thesis: ( *' in the carrier of (Aut (F_Complex,F_Real)) & S1[x1, *' ] )
thus ( *' in the carrier of (Aut (F_Complex,F_Real)) & S1[x1, *' ] ) by C; :: thesis: verum
end;
end;
end;
end;
consider f being Function of the carrier of (INT.Group 2), the carrier of (Aut (F_Complex,F_Real)) such that
B: for x being object st x in the carrier of (INT.Group 2) holds
S1[x,f . x] from FUNCT_2:sch 1(A);
reconsider f = f as Function of (INT.Group 2),(Aut (F_Complex,F_Real)) ;
H: id F_Complex <> *'
proof
reconsider c = <i> as Complex ;
A: <i> *' = - <i> by COMPLEX1:31;
*' . <i> = - <i> by A, di;
hence id F_Complex <> *' ; :: thesis: verum
end;
reconsider g = id F_Complex as Element of the carrier of (Aut (F_Complex,F_Real)) by U1, TARSKI:def 2;
reconsider g = g as F_Real -fixing Automorphism of F_Complex ;
now :: thesis: for x, y being Element of (INT.Group 2) holds f . (x * y) = (f . x) * (f . y)
let x, y be Element of (INT.Group 2); :: thesis: f . (b1 * b2) = (f . b1) * (f . b2)
reconsider n = x, m = y as Element of Segm 2 by A2;
dom f = Segm 2 by A2, FUNCT_2:def 1;
then ( f . m in rng f & rng f c= the carrier of (Aut (F_Complex,F_Real)) ) by FUNCT_1:3, RELAT_1:def 19;
then reconsider g1 = f . m as Element of the carrier of (Aut (F_Complex,F_Real)) ;
reconsider g1 = g1 as F_Real -fixing Automorphism of F_Complex ;
J: [g,g1] in [:(Auts (F_Complex,F_Real)),(Auts (F_Complex,F_Real)):] by ZFMISC_1:def 2;
n in Segm (1 + 1) ;
then not not n = 0 & ... & not n = 1 by NAT_1:61;
per cases then ( n = 0 or n = 1 ) ;
suppose D: n = 0 ; :: thesis: f . (b1 * b2) = (f . b1) * (f . b2)
then (addint 2) . (n,m) = (0 + m) mod 2 by GR_CY_1:def 4
.= m by NAT_1:44, NAT_D:24 ;
hence f . (x * y) = (id F_Complex) * g1 by A2, FUNCT_2:17
.= (AutComp F_Complex) . (g,g1) by defMult
.= (AutComp (F_Complex,F_Real)) . (g,g1) by J, FUNCT_1:49
.= (f . x) * (f . y) by B, D ;
:: thesis: verum
end;
suppose D: n = 1 ; :: thesis: f . (b1 * b2) = (f . b1) * (f . b2)
dom f = Segm 2 by A2, FUNCT_2:def 1;
then ( f . n in rng f & rng f c= the carrier of (Aut (F_Complex,F_Real)) ) by FUNCT_1:3, RELAT_1:def 19;
then reconsider g2 = f . n as Element of the carrier of (Aut (F_Complex,F_Real)) ;
reconsider g2 = g2 as F_Real -fixing Automorphism of F_Complex ;
J: [g2,g] in [:(Auts (F_Complex,F_Real)),(Auts (F_Complex,F_Real)):] by ZFMISC_1:def 2;
m in Segm (1 + 1) ;
then not not m = 0 & ... & not m = 1 by NAT_1:61;
per cases then ( m = 0 or m = 1 ) ;
suppose D1: m = 0 ; :: thesis: f . (b1 * b2) = (f . b1) * (f . b2)
then (addint 2) . (n,m) = (n + 0) mod 2 by GR_CY_1:def 4
.= n by NAT_1:44, NAT_D:24 ;
hence f . (x * y) = g2 * (id F_Complex) by A2, FUNCT_2:17
.= (AutComp F_Complex) . (g2,g) by defMult
.= (AutComp (F_Complex,F_Real)) . (g2,g) by J, FUNCT_1:49
.= (f . x) * (f . y) by B, D1 ;
:: thesis: verum
end;
suppose D1: m = 1 ; :: thesis: f . (b1 * b2) = (f . b1) * (f . b2)
then D2: (addint 2) . (n,m) = (1 + 1) mod 2 by D, GR_CY_1:def 4
.= 0 by NAT_D:25 ;
D3: ( f . m = *' & f . n = *' ) by D1, D, B;
J: [*',*'] in [:(Auts (F_Complex,F_Real)),(Auts (F_Complex,F_Real)):] by ZFMISC_1:def 2;
reconsider g3 = *' as F_Real -fixing Automorphism of F_Complex ;
K: g3 * g3 = id F_Complex
proof
set h = g3 * g3;
now :: thesis: for o being object st o in the carrier of F_Complex holds
(g3 * g3) . o = (id F_Complex) . o
let o be object ; :: thesis: ( o in the carrier of F_Complex implies (g3 * g3) . o = (id F_Complex) . o )
assume o in the carrier of F_Complex ; :: thesis: (g3 * g3) . o = (id F_Complex) . o
then reconsider a = o as Element of the carrier of F_Complex ;
dom g3 = the carrier of F_Complex by FUNCT_2:def 1;
then ( a in dom g3 & g3 . a in dom g3 ) ;
then a in dom (g3 * g3) by FUNCT_1:11;
then (g3 * g3) . a = g3 . (g3 . a) by FUNCT_1:12
.= g3 . (a *') by di
.= (a *') *' by di
.= (id F_Complex) . a ;
hence (g3 * g3) . o = (id F_Complex) . o ; :: thesis: verum
end;
hence g3 * g3 = id F_Complex ; :: thesis: verum
end;
thus f . (x * y) = id F_Complex by A2, B, D2
.= (AutComp F_Complex) . (g3,g3) by K, defMult
.= (f . x) * (f . y) by D3, J, FUNCT_1:49 ; :: thesis: verum
end;
end;
end;
end;
end;
then reconsider f = f as Homomorphism of (INT.Group 2),(Aut (F_Complex,F_Real)) by GROUP_6:def 6;
C: card the carrier of (INT.Group 2) = card the carrier of (Aut (F_Complex,F_Real)) by U3, A2, ORDINAL1:def 17;
now :: thesis: for x1, x2 being object st x1 in the carrier of (INT.Group 2) & x2 in the carrier of (INT.Group 2) & f . x1 = f . x2 holds
x1 = x2
let x1, x2 be object ; :: thesis: ( x1 in the carrier of (INT.Group 2) & x2 in the carrier of (INT.Group 2) & f . x1 = f . x2 implies b1 = b2 )
assume C: ( x1 in the carrier of (INT.Group 2) & x2 in the carrier of (INT.Group 2) & f . x1 = f . x2 ) ; :: thesis: b1 = b2
then reconsider n = x1, m = x2 as natural Number by A2;
n in Segm (1 + 1) by C, A2;
then not not n = 0 & ... & not n = 1 by NAT_1:61;
per cases then ( n = 0 or n = 1 ) ;
suppose D: n = 0 ; :: thesis: b1 = b2
then f . n = id F_Complex by C, B;
hence x1 = x2 by C, H, B, D; :: thesis: verum
end;
suppose D: n = 1 ; :: thesis: b1 = b2
then f . n = *' by C, B;
hence x1 = x2 by C, H, B, D; :: thesis: verum
end;
end;
end;
then D: f is one-to-one by FUNCT_2:19;
then f is onto by C, FINSEQ_4:63;
hence Aut (F_Complex,F_Real), INT.Group 2 are_isomorphic by D, GROUP_6:def 11; :: thesis: verum