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 ⊢ φ → 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 fltgcdagcdc ⊢ φ → A gcd B = A 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 9 simprbi ⊢ A ∈ Z → A ≠ 0
18 3 17 syl ⊢ φ → A ≠ 0
19 18 neneqd ⊢ φ → ¬ A = 0
20 19 intnanrd ⊢ φ → ¬ A = 0 ∧ B = 0
21 gcdn0cl ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ ¬ A = 0 ∧ B = 0 → A gcd B ∈ ℕ
22 11 16 20 21 syl21anc ⊢ φ → A gcd B ∈ ℕ
23 22 nnrpd ⊢ φ → A gcd B ∈ ℝ +
24 2 eleq2i ⊢ C ∈ Z ↔ C ∈ ℤ ∖ 0
25 eldifsn ⊢ C ∈ ℤ ∖ 0 ↔ C ∈ ℤ ∧ C ≠ 0
26 24 25 bitri ⊢ C ∈ Z ↔ C ∈ ℤ ∧ C ≠ 0
27 26 simplbi ⊢ C ∈ Z → C ∈ ℤ
28 5 27 syl ⊢ φ → C ∈ ℤ
29 19 intnanrd ⊢ φ → ¬ A = 0 ∧ C = 0
30 gcdn0cl ⊢ A ∈ ℤ ∧ C ∈ ℤ ∧ ¬ A = 0 ∧ C = 0 → A gcd C ∈ ℕ
31 11 28 29 30 syl21anc ⊢ φ → A gcd C ∈ ℕ
32 31 nnrpd ⊢ φ → A gcd C ∈ ℝ +
33 1 nnnn0d ⊢ φ → N ∈ ℕ 0
34 zexpgcd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ N ∈ ℕ 0 → A gcd B N = A N gcd B N
35 11 16 33 34 syl3anc ⊢ φ → A gcd B N = A N gcd B N
36 11 33 zexpcld ⊢ φ → A N ∈ ℤ
37 36 zcnd ⊢ φ → A N ∈ ℂ
38 16 33 zexpcld ⊢ φ → B N ∈ ℤ
39 38 zcnd ⊢ φ → B N ∈ ℂ
40 37 39 6 mvlladdd ⊢ φ → B N = C N − A N
41 28 33 zexpcld ⊢ φ → C N ∈ ℤ
42 41 zcnd ⊢ φ → C N ∈ ℂ
43 37 42 negsubdi2d ⊢ φ → − A N − C N = C N − A N
44 40 43 eqtr4d ⊢ φ → B N = − A N − C N
45 44 oveq2d ⊢ φ → A N gcd B N = A N gcd − A N − C N
46 36 41 zsubcld ⊢ φ → A N − C N ∈ ℤ
47 gcdneg ⊢ A N ∈ ℤ ∧ A N − C N ∈ ℤ → A N gcd − A N − C N = A N gcd A N − C N
48 36 46 47 syl2anc ⊢ φ → A N gcd − A N − C N = A N gcd A N − C N
49 41 znegcld ⊢ φ → − C N ∈ ℤ
50 49 zcnd ⊢ φ → − C N ∈ ℂ
51 37 42 negsubd ⊢ φ → A N + − C N = A N − C N
52 51 eqcomd ⊢ φ → A N − C N = A N + − C N
53 37 50 52 comraddd ⊢ φ → A N − C N = - C N + A N
54 53 oveq2d ⊢ φ → A N gcd A N − C N = A N gcd - C N + A N
55 gcdneg ⊢ A N ∈ ℤ ∧ C N ∈ ℤ → A N gcd − C N = A N gcd C N
56 36 41 55 syl2anc ⊢ φ → A N gcd − C N = A N gcd C N
57 gcdadd ⊢ A N ∈ ℤ ∧ − C N ∈ ℤ → A N gcd − C N = A N gcd - C N + A N
58 57 eqcomd ⊢ A N ∈ ℤ ∧ − C N ∈ ℤ → A N gcd - C N + A N = A N gcd − C N
59 36 49 58 syl2anc ⊢ φ → A N gcd - C N + A N = A N gcd − C N
60 zexpgcd ⊢ A ∈ ℤ ∧ C ∈ ℤ ∧ N ∈ ℕ 0 → A gcd C N = A N gcd C N
61 11 28 33 60 syl3anc ⊢ φ → A gcd C N = A N gcd C N
62 56 59 61 3eqtr4d ⊢ φ → A N gcd - C N + A N = A gcd C N
63 48 54 62 3eqtrd ⊢ φ → A N gcd − A N − C N = A gcd C N
64 35 45 63 3eqtrd ⊢ φ → A gcd B N = A gcd C N
65 23 32 1 64 exp11nnd ⊢ φ → A gcd B = A gcd C