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 ⊢ φ → N ∈ ℕ
fltgcdagcdc.z ⊢ Z = ℤ ∖ 0
fltgcdagcdc.a ⊢ φ → A ∈ Z
fltgcdagcdc.b ⊢ φ → B ∈ Z
fltgcdagcdc.c ⊢ φ → C ∈ Z
fltgcdagcdc.e ⊢ φ → A N + B N = C N
Assertion fltgcdbgcdc ⊢ φ → A gcd B = B gcd C

Proof

Step Hyp Ref Expression
1 fltgcdagcdc.n ⊢ φ → N ∈ ℕ
2 fltgcdagcdc.z ⊢ Z = ℤ ∖ 0
3 fltgcdagcdc.a ⊢ φ → A ∈ Z
4 fltgcdagcdc.b ⊢ φ → B ∈ Z
5 fltgcdagcdc.c ⊢ φ → C ∈ Z
6 fltgcdagcdc.e ⊢ φ → A N + B N = C N
7 2 eleq2i ⊢ A ∈ Z ↔ A ∈ ℤ ∖ 0
8 eldifsn ⊢ A ∈ ℤ ∖ 0 ↔ A ∈ ℤ ∧ A ≠ 0
9 7 8 bitri ⊢ A ∈ Z ↔ A ∈ ℤ ∧ A ≠ 0
10 9 simplbi ⊢ A ∈ Z → A ∈ ℤ
11 3 10 syl ⊢ φ → A ∈ ℤ
12 2 eleq2i ⊢ B ∈ Z ↔ B ∈ ℤ ∖ 0
13 eldifsn ⊢ B ∈ ℤ ∖ 0 ↔ B ∈ ℤ ∧ B ≠ 0
14 12 13 bitri ⊢ B ∈ Z ↔ B ∈ ℤ ∧ B ≠ 0
15 14 simplbi ⊢ B ∈ Z → B ∈ ℤ
16 4 15 syl ⊢ φ → B ∈ ℤ
17 11 16 gcdcomd ⊢ φ → A gcd B = B gcd A
18 1 nnnn0d ⊢ φ → N ∈ ℕ 0
19 11 18 zexpcld ⊢ φ → A N ∈ ℤ
20 19 zcnd ⊢ φ → A N ∈ ℂ
21 16 18 zexpcld ⊢ φ → B N ∈ ℤ
22 21 zcnd ⊢ φ → B N ∈ ℂ
23 20 22 addcomd ⊢ φ → A N + B N = B N + A N
24 23 6 eqtr3d ⊢ φ → B N + A N = C N
25 1 2 4 3 5 24 fltgcdagcdc ⊢ φ → B gcd A = B gcd C
26 17 25 eqtrd ⊢ φ → A gcd B = B gcd C