Metamath Proof Explorer


Theorem fltgcdbgcdc

Description: The greatest common divisor of the two first integers of a solution of the generalized FLT equals the greatest common divisor of the second 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 fltgcdbgcdc
|- ( ph -> ( A gcd B ) = ( B 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 11 16 gcdcomd
 |-  ( ph -> ( A gcd B ) = ( B gcd A ) )
18 1 nnnn0d
 |-  ( ph -> N e. NN0 )
19 11 18 zexpcld
 |-  ( ph -> ( A ^ N ) e. ZZ )
20 19 zcnd
 |-  ( ph -> ( A ^ N ) e. CC )
21 16 18 zexpcld
 |-  ( ph -> ( B ^ N ) e. ZZ )
22 21 zcnd
 |-  ( ph -> ( B ^ N ) e. CC )
23 20 22 addcomd
 |-  ( ph -> ( ( A ^ N ) + ( B ^ N ) ) = ( ( B ^ N ) + ( A ^ N ) ) )
24 23 6 eqtr3d
 |-  ( ph -> ( ( B ^ N ) + ( A ^ N ) ) = ( C ^ N ) )
25 1 2 4 3 5 24 fltgcdagcdc
 |-  ( ph -> ( B gcd A ) = ( B gcd C ) )
26 17 25 eqtrd
 |-  ( ph -> ( A gcd B ) = ( B gcd C ) )