Metamath Proof Explorer


Theorem fltgcdagcdc

Description: The greatest common divisor of the two first integers of a solution of the generalized FLT equals the greatest common divisor of the first and third integer. (Contributed by AV, 2-Nov-2026)

Ref Expression
Hypotheses fltgcdagcdc.n
|- ( ph -> N e. NN )
fltgcdagcdc.z
|- Z = ( ZZ \ { 0 } )
fltgcdagcdc.a
|- ( ph -> A e. Z )
fltgcdagcdc.b
|- ( ph -> B e. Z )
fltgcdagcdc.c
|- ( ph -> C e. Z )
fltgcdagcdc.e
|- ( ph -> ( ( A ^ N ) + ( B ^ N ) ) = ( C ^ N ) )
Assertion fltgcdagcdc
|- ( ph -> ( A gcd B ) = ( A gcd C ) )

Proof

Step Hyp Ref Expression
1 fltgcdagcdc.n
 |-  ( ph -> N e. NN )
2 fltgcdagcdc.z
 |-  Z = ( ZZ \ { 0 } )
3 fltgcdagcdc.a
 |-  ( ph -> A e. Z )
4 fltgcdagcdc.b
 |-  ( ph -> B e. Z )
5 fltgcdagcdc.c
 |-  ( ph -> C e. Z )
6 fltgcdagcdc.e
 |-  ( ph -> ( ( A ^ N ) + ( B ^ N ) ) = ( C ^ N ) )
7 2 eleq2i
 |-  ( A e. Z <-> A e. ( ZZ \ { 0 } ) )
8 eldifsn
 |-  ( A e. ( ZZ \ { 0 } ) <-> ( A e. ZZ /\ A =/= 0 ) )
9 7 8 bitri
 |-  ( A e. Z <-> ( A e. ZZ /\ A =/= 0 ) )
10 9 simplbi
 |-  ( A e. Z -> A e. ZZ )
11 3 10 syl
 |-  ( ph -> A e. ZZ )
12 2 eleq2i
 |-  ( B e. Z <-> B e. ( ZZ \ { 0 } ) )
13 eldifsn
 |-  ( B e. ( ZZ \ { 0 } ) <-> ( B e. ZZ /\ B =/= 0 ) )
14 12 13 bitri
 |-  ( B e. Z <-> ( B e. ZZ /\ B =/= 0 ) )
15 14 simplbi
 |-  ( B e. Z -> B e. ZZ )
16 4 15 syl
 |-  ( ph -> B e. ZZ )
17 9 simprbi
 |-  ( A e. Z -> A =/= 0 )
18 3 17 syl
 |-  ( ph -> A =/= 0 )
19 18 neneqd
 |-  ( ph -> -. A = 0 )
20 19 intnanrd
 |-  ( ph -> -. ( A = 0 /\ B = 0 ) )
21 gcdn0cl
 |-  ( ( ( A e. ZZ /\ B e. ZZ ) /\ -. ( A = 0 /\ B = 0 ) ) -> ( A gcd B ) e. NN )
22 11 16 20 21 syl21anc
 |-  ( ph -> ( A gcd B ) e. NN )
23 22 nnrpd
 |-  ( ph -> ( A gcd B ) e. RR+ )
24 2 eleq2i
 |-  ( C e. Z <-> C e. ( ZZ \ { 0 } ) )
25 eldifsn
 |-  ( C e. ( ZZ \ { 0 } ) <-> ( C e. ZZ /\ C =/= 0 ) )
26 24 25 bitri
 |-  ( C e. Z <-> ( C e. ZZ /\ C =/= 0 ) )
27 26 simplbi
 |-  ( C e. Z -> C e. ZZ )
28 5 27 syl
 |-  ( ph -> C e. ZZ )
29 19 intnanrd
 |-  ( ph -> -. ( A = 0 /\ C = 0 ) )
30 gcdn0cl
 |-  ( ( ( A e. ZZ /\ C e. ZZ ) /\ -. ( A = 0 /\ C = 0 ) ) -> ( A gcd C ) e. NN )
31 11 28 29 30 syl21anc
 |-  ( ph -> ( A gcd C ) e. NN )
32 31 nnrpd
 |-  ( ph -> ( A gcd C ) e. RR+ )
33 1 nnnn0d
 |-  ( ph -> N e. NN0 )
34 zexpgcd
 |-  ( ( A e. ZZ /\ B e. ZZ /\ N e. NN0 ) -> ( ( A gcd B ) ^ N ) = ( ( A ^ N ) gcd ( B ^ N ) ) )
35 11 16 33 34 syl3anc
 |-  ( ph -> ( ( A gcd B ) ^ N ) = ( ( A ^ N ) gcd ( B ^ N ) ) )
36 11 33 zexpcld
 |-  ( ph -> ( A ^ N ) e. ZZ )
37 36 zcnd
 |-  ( ph -> ( A ^ N ) e. CC )
38 16 33 zexpcld
 |-  ( ph -> ( B ^ N ) e. ZZ )
39 38 zcnd
 |-  ( ph -> ( B ^ N ) e. CC )
40 37 39 6 mvlladdd
 |-  ( ph -> ( B ^ N ) = ( ( C ^ N ) - ( A ^ N ) ) )
41 28 33 zexpcld
 |-  ( ph -> ( C ^ N ) e. ZZ )
42 41 zcnd
 |-  ( ph -> ( C ^ N ) e. CC )
43 37 42 negsubdi2d
 |-  ( ph -> -u ( ( A ^ N ) - ( C ^ N ) ) = ( ( C ^ N ) - ( A ^ N ) ) )
44 40 43 eqtr4d
 |-  ( ph -> ( B ^ N ) = -u ( ( A ^ N ) - ( C ^ N ) ) )
45 44 oveq2d
 |-  ( ph -> ( ( A ^ N ) gcd ( B ^ N ) ) = ( ( A ^ N ) gcd -u ( ( A ^ N ) - ( C ^ N ) ) ) )
46 36 41 zsubcld
 |-  ( ph -> ( ( A ^ N ) - ( C ^ N ) ) e. ZZ )
47 gcdneg
 |-  ( ( ( A ^ N ) e. ZZ /\ ( ( A ^ N ) - ( C ^ N ) ) e. ZZ ) -> ( ( A ^ N ) gcd -u ( ( A ^ N ) - ( C ^ N ) ) ) = ( ( A ^ N ) gcd ( ( A ^ N ) - ( C ^ N ) ) ) )
48 36 46 47 syl2anc
 |-  ( ph -> ( ( A ^ N ) gcd -u ( ( A ^ N ) - ( C ^ N ) ) ) = ( ( A ^ N ) gcd ( ( A ^ N ) - ( C ^ N ) ) ) )
49 41 znegcld
 |-  ( ph -> -u ( C ^ N ) e. ZZ )
50 49 zcnd
 |-  ( ph -> -u ( C ^ N ) e. CC )
51 37 42 negsubd
 |-  ( ph -> ( ( A ^ N ) + -u ( C ^ N ) ) = ( ( A ^ N ) - ( C ^ N ) ) )
52 51 eqcomd
 |-  ( ph -> ( ( A ^ N ) - ( C ^ N ) ) = ( ( A ^ N ) + -u ( C ^ N ) ) )
53 37 50 52 comraddd
 |-  ( ph -> ( ( A ^ N ) - ( C ^ N ) ) = ( -u ( C ^ N ) + ( A ^ N ) ) )
54 53 oveq2d
 |-  ( ph -> ( ( A ^ N ) gcd ( ( A ^ N ) - ( C ^ N ) ) ) = ( ( A ^ N ) gcd ( -u ( C ^ N ) + ( A ^ N ) ) ) )
55 gcdneg
 |-  ( ( ( A ^ N ) e. ZZ /\ ( C ^ N ) e. ZZ ) -> ( ( A ^ N ) gcd -u ( C ^ N ) ) = ( ( A ^ N ) gcd ( C ^ N ) ) )
56 36 41 55 syl2anc
 |-  ( ph -> ( ( A ^ N ) gcd -u ( C ^ N ) ) = ( ( A ^ N ) gcd ( C ^ N ) ) )
57 gcdadd
 |-  ( ( ( A ^ N ) e. ZZ /\ -u ( C ^ N ) e. ZZ ) -> ( ( A ^ N ) gcd -u ( C ^ N ) ) = ( ( A ^ N ) gcd ( -u ( C ^ N ) + ( A ^ N ) ) ) )
58 57 eqcomd
 |-  ( ( ( A ^ N ) e. ZZ /\ -u ( C ^ N ) e. ZZ ) -> ( ( A ^ N ) gcd ( -u ( C ^ N ) + ( A ^ N ) ) ) = ( ( A ^ N ) gcd -u ( C ^ N ) ) )
59 36 49 58 syl2anc
 |-  ( ph -> ( ( A ^ N ) gcd ( -u ( C ^ N ) + ( A ^ N ) ) ) = ( ( A ^ N ) gcd -u ( C ^ N ) ) )
60 zexpgcd
 |-  ( ( A e. ZZ /\ C e. ZZ /\ N e. NN0 ) -> ( ( A gcd C ) ^ N ) = ( ( A ^ N ) gcd ( C ^ N ) ) )
61 11 28 33 60 syl3anc
 |-  ( ph -> ( ( A gcd C ) ^ N ) = ( ( A ^ N ) gcd ( C ^ N ) ) )
62 56 59 61 3eqtr4d
 |-  ( ph -> ( ( A ^ N ) gcd ( -u ( C ^ N ) + ( A ^ N ) ) ) = ( ( A gcd C ) ^ N ) )
63 48 54 62 3eqtrd
 |-  ( ph -> ( ( A ^ N ) gcd -u ( ( A ^ N ) - ( C ^ N ) ) ) = ( ( A gcd C ) ^ N ) )
64 35 45 63 3eqtrd
 |-  ( ph -> ( ( A gcd B ) ^ N ) = ( ( A gcd C ) ^ N ) )
65 23 32 1 64 exp11nnd
 |-  ( ph -> ( A gcd B ) = ( A gcd C ) )