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 ⊢ 𝑍 = ( ℤ ∖ { 0 } )
flt3lemA.e ⊢ ( 𝜑 → ( ( ( 𝐴 ↑ 3 ) + ( 𝐵 ↑ 3 ) ) + ( 𝐶 ↑ 3 ) ) = 0 )
flt3lemA.a ⊢ ( 𝜑 → 𝐴 ∈ 𝑍 )
flt3lemA.b ⊢ ( 𝜑 → 𝐵 ∈ 𝑍 )
flt3lemA.c ⊢ ( 𝜑 → 𝐶 ∈ 𝑍 )
flt3lemC.a ⊢ ( 𝜑 → ( 𝐴 gcd 𝐵 ) = 1 )
flt3lemD.b ⊢ ( 𝜑 → ( 𝐵 gcd 𝐶 ) = 1 )
flt3lemD.c ⊢ ( 𝜑 → ( 𝐴 gcd 𝐶 ) = 1 )
flt3lemE.e ⊢ ( 𝜑 → 2 ∥ 𝐶 )
flt3lem1.u ⊢ 𝑈 = ( ( 𝐴 + 𝐵 ) / 2 )
flt3lem1.v ⊢ 𝑉 = ( ( 𝐴 − 𝐵 ) / 2 )
flt3lem4.x ⊢ 𝑋 = ( ( 𝑈 ↑ 2 ) + ( 3 · ( 𝑉 ↑ 2 ) ) )
Assertion flt3lem5b ( 𝜑 → ( ( 𝑈 gcd 𝑋 ) = 1 ∨ ( 𝑈 gcd 𝑋 ) = 3 ) )

Proof

Step Hyp Ref Expression
1 flt3lemA.z ⊢ 𝑍 = ( ℤ ∖ { 0 } )
2 flt3lemA.e ⊢ ( 𝜑 → ( ( ( 𝐴 ↑ 3 ) + ( 𝐵 ↑ 3 ) ) + ( 𝐶 ↑ 3 ) ) = 0 )
3 flt3lemA.a ⊢ ( 𝜑 → 𝐴 ∈ 𝑍 )
4 flt3lemA.b ⊢ ( 𝜑 → 𝐵 ∈ 𝑍 )
5 flt3lemA.c ⊢ ( 𝜑 → 𝐶 ∈ 𝑍 )
6 flt3lemC.a ⊢ ( 𝜑 → ( 𝐴 gcd 𝐵 ) = 1 )
7 flt3lemD.b ⊢ ( 𝜑 → ( 𝐵 gcd 𝐶 ) = 1 )
8 flt3lemD.c ⊢ ( 𝜑 → ( 𝐴 gcd 𝐶 ) = 1 )
9 flt3lemE.e ⊢ ( 𝜑 → 2 ∥ 𝐶 )
10 flt3lem1.u ⊢ 𝑈 = ( ( 𝐴 + 𝐵 ) / 2 )
11 flt3lem1.v ⊢ 𝑉 = ( ( 𝐴 − 𝐵 ) / 2 )
12 flt3lem4.x ⊢ 𝑋 = ( ( 𝑈 ↑ 2 ) + ( 3 · ( 𝑉 ↑ 2 ) ) )
13 1 2 3 4 5 6 7 8 9 10 11 12 flt3lem5a ⊢ ( 𝜑 → ( 𝑈 gcd 𝑋 ) = ( 𝑈 gcd 3 ) )
14 1 2 3 4 5 6 7 8 9 10 11 flt3lem1 ⊢ ( 𝜑 → ( 𝑈 ∈ 𝑍 ∧ 𝑉 ∈ 𝑍 ∧ 𝑈 ≠ 𝑉 ) )
15 1 eleq2i ⊢ ( 𝑈 ∈ 𝑍 ↔ 𝑈 ∈ ( ℤ ∖ { 0 } ) )
16 eldifsn ⊢ ( 𝑈 ∈ ( ℤ ∖ { 0 } ) ↔ ( 𝑈 ∈ ℤ ∧ 𝑈 ≠ 0 ) )
17 15 16 bitri ⊢ ( 𝑈 ∈ 𝑍 ↔ ( 𝑈 ∈ ℤ ∧ 𝑈 ≠ 0 ) )
18 17 simplbi ⊢ ( 𝑈 ∈ 𝑍 → 𝑈 ∈ ℤ )
19 18 3ad2ant1 ⊢ ( ( 𝑈 ∈ 𝑍 ∧ 𝑉 ∈ 𝑍 ∧ 𝑈 ≠ 𝑉 ) → 𝑈 ∈ ℤ )
20 3prm ⊢ 3 ∈ ℙ
21 gcdprime ⊢ ( ( 𝑈 ∈ ℤ ∧ 3 ∈ ℙ ) → ( ( 𝑈 gcd 3 ) = 1 ∨ ( 𝑈 gcd 3 ) = 3 ) )
22 20 21 mpan2 ⊢ ( 𝑈 ∈ ℤ → ( ( 𝑈 gcd 3 ) = 1 ∨ ( 𝑈 gcd 3 ) = 3 ) )
23 14 19 22 3syl ⊢ ( 𝜑 → ( ( 𝑈 gcd 3 ) = 1 ∨ ( 𝑈 gcd 3 ) = 3 ) )
24 eqeq1 ⊢ ( ( 𝑈 gcd 𝑋 ) = ( 𝑈 gcd 3 ) → ( ( 𝑈 gcd 𝑋 ) = 1 ↔ ( 𝑈 gcd 3 ) = 1 ) )
25 eqeq1 ⊢ ( ( 𝑈 gcd 𝑋 ) = ( 𝑈 gcd 3 ) → ( ( 𝑈 gcd 𝑋 ) = 3 ↔ ( 𝑈 gcd 3 ) = 3 ) )
26 24 25 orbi12d ⊢ ( ( 𝑈 gcd 𝑋 ) = ( 𝑈 gcd 3 ) → ( ( ( 𝑈 gcd 𝑋 ) = 1 ∨ ( 𝑈 gcd 𝑋 ) = 3 ) ↔ ( ( 𝑈 gcd 3 ) = 1 ∨ ( 𝑈 gcd 3 ) = 3 ) ) )
27 23 26 syl5ibrcom ⊢ ( 𝜑 → ( ( 𝑈 gcd 𝑋 ) = ( 𝑈 gcd 3 ) → ( ( 𝑈 gcd 𝑋 ) = 1 ∨ ( 𝑈 gcd 𝑋 ) = 3 ) ) )
28 13 27 mpd ⊢ ( 𝜑 → ( ( 𝑈 gcd 𝑋 ) = 1 ∨ ( 𝑈 gcd 𝑋 ) = 3 ) )