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 ⊢ ( 𝜑 → 𝑁 ∈ ℕ )
fltgcdagcdc.z ⊢ 𝑍 = ( ℤ ∖ { 0 } )
fltgcdagcdc.a ⊢ ( 𝜑 → 𝐴 ∈ 𝑍 )
fltgcdagcdc.b ⊢ ( 𝜑 → 𝐵 ∈ 𝑍 )
fltgcdagcdc.c ⊢ ( 𝜑 → 𝐶 ∈ 𝑍 )
fltgcdagcdc.e ⊢ ( 𝜑 → ( ( 𝐴 ↑ 𝑁 ) + ( 𝐵 ↑ 𝑁 ) ) = ( 𝐶 ↑ 𝑁 ) )
Assertion fltgcdbgcdc ( 𝜑 → ( 𝐴 gcd 𝐵 ) = ( 𝐵 gcd 𝐶 ) )

Proof

Step Hyp Ref Expression
1 fltgcdagcdc.n ⊢ ( 𝜑 → 𝑁 ∈ ℕ )
2 fltgcdagcdc.z ⊢ 𝑍 = ( ℤ ∖ { 0 } )
3 fltgcdagcdc.a ⊢ ( 𝜑 → 𝐴 ∈ 𝑍 )
4 fltgcdagcdc.b ⊢ ( 𝜑 → 𝐵 ∈ 𝑍 )
5 fltgcdagcdc.c ⊢ ( 𝜑 → 𝐶 ∈ 𝑍 )
6 fltgcdagcdc.e ⊢ ( 𝜑 → ( ( 𝐴 ↑ 𝑁 ) + ( 𝐵 ↑ 𝑁 ) ) = ( 𝐶 ↑ 𝑁 ) )
7 2 eleq2i ⊢ ( 𝐴 ∈ 𝑍 ↔ 𝐴 ∈ ( ℤ ∖ { 0 } ) )
8 eldifsn ⊢ ( 𝐴 ∈ ( ℤ ∖ { 0 } ) ↔ ( 𝐴 ∈ ℤ ∧ 𝐴 ≠ 0 ) )
9 7 8 bitri ⊢ ( 𝐴 ∈ 𝑍 ↔ ( 𝐴 ∈ ℤ ∧ 𝐴 ≠ 0 ) )
10 9 simplbi ⊢ ( 𝐴 ∈ 𝑍 → 𝐴 ∈ ℤ )
11 3 10 syl ⊢ ( 𝜑 → 𝐴 ∈ ℤ )
12 2 eleq2i ⊢ ( 𝐵 ∈ 𝑍 ↔ 𝐵 ∈ ( ℤ ∖ { 0 } ) )
13 eldifsn ⊢ ( 𝐵 ∈ ( ℤ ∖ { 0 } ) ↔ ( 𝐵 ∈ ℤ ∧ 𝐵 ≠ 0 ) )
14 12 13 bitri ⊢ ( 𝐵 ∈ 𝑍 ↔ ( 𝐵 ∈ ℤ ∧ 𝐵 ≠ 0 ) )
15 14 simplbi ⊢ ( 𝐵 ∈ 𝑍 → 𝐵 ∈ ℤ )
16 4 15 syl ⊢ ( 𝜑 → 𝐵 ∈ ℤ )
17 11 16 gcdcomd ⊢ ( 𝜑 → ( 𝐴 gcd 𝐵 ) = ( 𝐵 gcd 𝐴 ) )
18 1 nnnn0d ⊢ ( 𝜑 → 𝑁 ∈ ℕ0 )
19 11 18 zexpcld ⊢ ( 𝜑 → ( 𝐴 ↑ 𝑁 ) ∈ ℤ )
20 19 zcnd ⊢ ( 𝜑 → ( 𝐴 ↑ 𝑁 ) ∈ ℂ )
21 16 18 zexpcld ⊢ ( 𝜑 → ( 𝐵 ↑ 𝑁 ) ∈ ℤ )
22 21 zcnd ⊢ ( 𝜑 → ( 𝐵 ↑ 𝑁 ) ∈ ℂ )
23 20 22 addcomd ⊢ ( 𝜑 → ( ( 𝐴 ↑ 𝑁 ) + ( 𝐵 ↑ 𝑁 ) ) = ( ( 𝐵 ↑ 𝑁 ) + ( 𝐴 ↑ 𝑁 ) ) )
24 23 6 eqtr3d ⊢ ( 𝜑 → ( ( 𝐵 ↑ 𝑁 ) + ( 𝐴 ↑ 𝑁 ) ) = ( 𝐶 ↑ 𝑁 ) )
25 1 2 4 3 5 24 fltgcdagcdc ⊢ ( 𝜑 → ( 𝐵 gcd 𝐴 ) = ( 𝐵 gcd 𝐶 ) )
26 17 25 eqtrd ⊢ ( 𝜑 → ( 𝐴 gcd 𝐵 ) = ( 𝐵 gcd 𝐶 ) )