Metamath Proof Explorer


Theorem fltoddsum

Description: The solution of the generalized FLT for an odd exponent can be assumed to be a solution of an equation with 3 integer summands. (Contributed by AV, 2-Nov-2026)

Ref Expression
Hypotheses fltoddsum.n
|- ( ph -> N e. NN )
fltoddsum.a
|- ( ph -> A e. ZZ )
fltoddsum.b
|- ( ph -> B e. ZZ )
fltoddsum.c
|- ( ph -> C e. ZZ )
fltoddsum.e
|- ( ph -> ( ( A ^ N ) + ( B ^ N ) ) = ( C ^ N ) )
fltoddsum.o
|- ( ph -> -. 2 || N )
Assertion fltoddsum
|- ( ph -> E. a e. ZZ E. b e. ZZ E. c e. ZZ ( ( ( a ^ N ) + ( b ^ N ) ) + ( c ^ N ) ) = 0 )

Proof

Step Hyp Ref Expression
1 fltoddsum.n
 |-  ( ph -> N e. NN )
2 fltoddsum.a
 |-  ( ph -> A e. ZZ )
3 fltoddsum.b
 |-  ( ph -> B e. ZZ )
4 fltoddsum.c
 |-  ( ph -> C e. ZZ )
5 fltoddsum.e
 |-  ( ph -> ( ( A ^ N ) + ( B ^ N ) ) = ( C ^ N ) )
6 fltoddsum.o
 |-  ( ph -> -. 2 || N )
7 oveq1
 |-  ( a = A -> ( a ^ N ) = ( A ^ N ) )
8 7 oveq1d
 |-  ( a = A -> ( ( a ^ N ) + ( b ^ N ) ) = ( ( A ^ N ) + ( b ^ N ) ) )
9 8 oveq1d
 |-  ( a = A -> ( ( ( a ^ N ) + ( b ^ N ) ) + ( c ^ N ) ) = ( ( ( A ^ N ) + ( b ^ N ) ) + ( c ^ N ) ) )
10 9 eqeq1d
 |-  ( a = A -> ( ( ( ( a ^ N ) + ( b ^ N ) ) + ( c ^ N ) ) = 0 <-> ( ( ( A ^ N ) + ( b ^ N ) ) + ( c ^ N ) ) = 0 ) )
11 oveq1
 |-  ( b = B -> ( b ^ N ) = ( B ^ N ) )
12 11 oveq2d
 |-  ( b = B -> ( ( A ^ N ) + ( b ^ N ) ) = ( ( A ^ N ) + ( B ^ N ) ) )
13 12 oveq1d
 |-  ( b = B -> ( ( ( A ^ N ) + ( b ^ N ) ) + ( c ^ N ) ) = ( ( ( A ^ N ) + ( B ^ N ) ) + ( c ^ N ) ) )
14 13 eqeq1d
 |-  ( b = B -> ( ( ( ( A ^ N ) + ( b ^ N ) ) + ( c ^ N ) ) = 0 <-> ( ( ( A ^ N ) + ( B ^ N ) ) + ( c ^ N ) ) = 0 ) )
15 oveq1
 |-  ( c = -u C -> ( c ^ N ) = ( -u C ^ N ) )
16 15 oveq2d
 |-  ( c = -u C -> ( ( ( A ^ N ) + ( B ^ N ) ) + ( c ^ N ) ) = ( ( ( A ^ N ) + ( B ^ N ) ) + ( -u C ^ N ) ) )
17 16 eqeq1d
 |-  ( c = -u C -> ( ( ( ( A ^ N ) + ( B ^ N ) ) + ( c ^ N ) ) = 0 <-> ( ( ( A ^ N ) + ( B ^ N ) ) + ( -u C ^ N ) ) = 0 ) )
18 4 znegcld
 |-  ( ph -> -u C e. ZZ )
19 1 nnnn0d
 |-  ( ph -> N e. NN0 )
20 2 19 zexpcld
 |-  ( ph -> ( A ^ N ) e. ZZ )
21 3 19 zexpcld
 |-  ( ph -> ( B ^ N ) e. ZZ )
22 20 21 zaddcld
 |-  ( ph -> ( ( A ^ N ) + ( B ^ N ) ) e. ZZ )
23 22 zcnd
 |-  ( ph -> ( ( A ^ N ) + ( B ^ N ) ) e. CC )
24 4 19 zexpcld
 |-  ( ph -> ( C ^ N ) e. ZZ )
25 24 zcnd
 |-  ( ph -> ( C ^ N ) e. CC )
26 23 25 negsubd
 |-  ( ph -> ( ( ( A ^ N ) + ( B ^ N ) ) + -u ( C ^ N ) ) = ( ( ( A ^ N ) + ( B ^ N ) ) - ( C ^ N ) ) )
27 26 eqeq1d
 |-  ( ph -> ( ( ( ( A ^ N ) + ( B ^ N ) ) + -u ( C ^ N ) ) = 0 <-> ( ( ( A ^ N ) + ( B ^ N ) ) - ( C ^ N ) ) = 0 ) )
28 23 25 subeq0ad
 |-  ( ph -> ( ( ( ( A ^ N ) + ( B ^ N ) ) - ( C ^ N ) ) = 0 <-> ( ( A ^ N ) + ( B ^ N ) ) = ( C ^ N ) ) )
29 27 28 bitrd
 |-  ( ph -> ( ( ( ( A ^ N ) + ( B ^ N ) ) + -u ( C ^ N ) ) = 0 <-> ( ( A ^ N ) + ( B ^ N ) ) = ( C ^ N ) ) )
30 4 zcnd
 |-  ( ph -> C e. CC )
31 oexpneg
 |-  ( ( C e. CC /\ N e. NN /\ -. 2 || N ) -> ( -u C ^ N ) = -u ( C ^ N ) )
32 30 1 6 31 syl3anc
 |-  ( ph -> ( -u C ^ N ) = -u ( C ^ N ) )
33 32 eqcomd
 |-  ( ph -> -u ( C ^ N ) = ( -u C ^ N ) )
34 33 oveq2d
 |-  ( ph -> ( ( ( A ^ N ) + ( B ^ N ) ) + -u ( C ^ N ) ) = ( ( ( A ^ N ) + ( B ^ N ) ) + ( -u C ^ N ) ) )
35 34 eqeq1d
 |-  ( ph -> ( ( ( ( A ^ N ) + ( B ^ N ) ) + -u ( C ^ N ) ) = 0 <-> ( ( ( A ^ N ) + ( B ^ N ) ) + ( -u C ^ N ) ) = 0 ) )
36 35 biimpd
 |-  ( ph -> ( ( ( ( A ^ N ) + ( B ^ N ) ) + -u ( C ^ N ) ) = 0 -> ( ( ( A ^ N ) + ( B ^ N ) ) + ( -u C ^ N ) ) = 0 ) )
37 29 36 sylbird
 |-  ( ph -> ( ( ( A ^ N ) + ( B ^ N ) ) = ( C ^ N ) -> ( ( ( A ^ N ) + ( B ^ N ) ) + ( -u C ^ N ) ) = 0 ) )
38 5 37 mpd
 |-  ( ph -> ( ( ( A ^ N ) + ( B ^ N ) ) + ( -u C ^ N ) ) = 0 )
39 10 14 17 2 3 18 38 3rspcedvdw
 |-  ( ph -> E. a e. ZZ E. b e. ZZ E. c e. ZZ ( ( ( a ^ N ) + ( b ^ N ) ) + ( c ^ N ) ) = 0 )