Metamath Proof Explorer


Theorem flt3lem5b

Description: Lemma for flt3lem5 : ( U gcd X ) = 1 or 3 . (Contributed by AV, 6-Nov-2026) Using more general gcdprime . (Revised by AV, 20-Nov-2026)

Ref Expression
Hypotheses flt3lemA.z ⊢ Z = ℤ ∖ 0
flt3lemA.e ⊢ φ → A 3 + B 3 + C 3 = 0
flt3lemA.a ⊢ φ → A ∈ Z
flt3lemA.b ⊢ φ → B ∈ Z
flt3lemA.c ⊢ φ → C ∈ Z
flt3lemC.a ⊢ φ → A gcd B = 1
flt3lemD.b ⊢ φ → B gcd C = 1
flt3lemD.c ⊢ φ → A gcd C = 1
flt3lemE.e ⊢ φ → 2 ∥ C
flt3lem1.u ⊢ U = A + B 2
flt3lem1.v ⊢ V = A − B 2
flt3lem4.x ⊢ X = U 2 + 3 ⁢ V 2
Assertion flt3lem5b ⊢ φ → U gcd X = 1 ∨ U gcd X = 3

Proof

Step Hyp Ref Expression
1 flt3lemA.z ⊢ Z = ℤ ∖ 0
2 flt3lemA.e ⊢ φ → A 3 + B 3 + C 3 = 0
3 flt3lemA.a ⊢ φ → A ∈ Z
4 flt3lemA.b ⊢ φ → B ∈ Z
5 flt3lemA.c ⊢ φ → C ∈ Z
6 flt3lemC.a ⊢ φ → A gcd B = 1
7 flt3lemD.b ⊢ φ → B gcd C = 1
8 flt3lemD.c ⊢ φ → A gcd C = 1
9 flt3lemE.e ⊢ φ → 2 ∥ C
10 flt3lem1.u ⊢ U = A + B 2
11 flt3lem1.v ⊢ V = A − B 2
12 flt3lem4.x ⊢ X = U 2 + 3 ⁢ V 2
13 1 2 3 4 5 6 7 8 9 10 11 12 flt3lem5a ⊢ φ → U gcd X = U gcd 3
14 1 2 3 4 5 6 7 8 9 10 11 flt3lem1 ⊢ φ → U ∈ Z ∧ V ∈ Z ∧ U ≠ V
15 1 eleq2i ⊢ U ∈ Z ↔ U ∈ ℤ ∖ 0
16 eldifsn ⊢ U ∈ ℤ ∖ 0 ↔ U ∈ ℤ ∧ U ≠ 0
17 15 16 bitri ⊢ U ∈ Z ↔ U ∈ ℤ ∧ U ≠ 0
18 17 simplbi ⊢ U ∈ Z → U ∈ ℤ
19 18 3ad2ant1 ⊢ U ∈ Z ∧ V ∈ Z ∧ U ≠ V → U ∈ ℤ
20 3prm ⊢ 3 ∈ ℙ
21 gcdprime ⊢ U ∈ ℤ ∧ 3 ∈ ℙ → U gcd 3 = 1 ∨ U gcd 3 = 3
22 20 21 mpan2 ⊢ U ∈ ℤ → U gcd 3 = 1 ∨ U gcd 3 = 3
23 14 19 22 3syl ⊢ φ → U gcd 3 = 1 ∨ U gcd 3 = 3
24 eqeq1 ⊢ U gcd X = U gcd 3 → U gcd X = 1 ↔ U gcd 3 = 1
25 eqeq1 ⊢ U gcd X = U gcd 3 → U gcd X = 3 ↔ U gcd 3 = 3
26 24 25 orbi12d ⊢ U gcd X = U gcd 3 → U gcd X = 1 ∨ U gcd X = 3 ↔ U gcd 3 = 1 ∨ U gcd 3 = 3
27 23 26 syl5ibrcom ⊢ φ → U gcd X = U gcd 3 → U gcd X = 1 ∨ U gcd X = 3
28 13 27 mpd ⊢ φ → U gcd X = 1 ∨ U gcd X = 3