Metamath Proof Explorer


Theorem flt3lemA

Description: Lemma A for flt3 . The summands of a solution of FLT3 can be assumed to be coprime. Step 2 in LFP-1. (Contributed by AV, 3-Nov-2026)

Ref Expression
Hypotheses flt3lemA.z ⊢ 𝑍 = ( ℤ ∖ { 0 } )
flt3lemA.e ⊢ ( 𝜑 → ( ( ( 𝐴 ↑ 3 ) + ( 𝐵 ↑ 3 ) ) + ( 𝐶 ↑ 3 ) ) = 0 )
flt3lemA.a ⊢ ( 𝜑 → 𝐴 ∈ 𝑍 )
flt3lemA.b ⊢ ( 𝜑 → 𝐵 ∈ 𝑍 )
flt3lemA.c ⊢ ( 𝜑 → 𝐶 ∈ 𝑍 )
Assertion flt3lemA ( 𝜑 → ∃ 𝑎 ∈ 𝑍 ∃ 𝑏 ∈ 𝑍 ∃ 𝑐 ∈ 𝑍 ( ( ( ( 𝑎 ↑ 3 ) + ( 𝑏 ↑ 3 ) ) + ( 𝑐 ↑ 3 ) ) = 0 ∧ ( ( 𝑎 gcd 𝑏 ) = 1 ∧ ( 𝑎 gcd 𝑐 ) = 1 ∧ ( 𝑏 gcd 𝑐 ) = 1 ) ) )

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 3nn ⊢ 3 ∈ ℕ
7 6 a1i ⊢ ( 𝜑 → 3 ∈ ℕ )
8 n2dvds3 ⊢ ¬ 2 ∥ 3
9 8 a1i ⊢ ( 𝜑 → ¬ 2 ∥ 3 )
10 7 1 3 4 5 9 2 fltcoprmoddsum ⊢ ( 𝜑 → ∃ 𝑎 ∈ 𝑍 ∃ 𝑏 ∈ 𝑍 ∃ 𝑐 ∈ 𝑍 ( ( ( ( 𝑎 ↑ 3 ) + ( 𝑏 ↑ 3 ) ) + ( 𝑐 ↑ 3 ) ) = 0 ∧ ( ( 𝑎 gcd 𝑏 ) = 1 ∧ ( 𝑎 gcd 𝑐 ) = 1 ∧ ( 𝑏 gcd 𝑐 ) = 1 ) ) )