Metamath Proof Explorer


Theorem fltaccoprm

Description: A counterexample to FLT with A , B coprime also has A , C coprime. (Contributed by SN, 20-Aug-2024)

Ref Expression
Hypotheses fltabcoprmex.a ⊢ φ → A ∈ ℕ
fltabcoprmex.b ⊢ φ → B ∈ ℕ
fltabcoprmex.c ⊢ φ → C ∈ ℕ
fltabcoprmex.n ⊢ φ → N ∈ ℕ 0
fltabcoprmex.1 ⊢ φ → A N + B N = C N
fltaccoprm.1 ⊢ φ → A gcd B = 1
Assertion fltaccoprm ⊢ φ → A gcd C = 1

Proof

Step Hyp Ref Expression
1 fltabcoprmex.a ⊢ φ → A ∈ ℕ
2 fltabcoprmex.b ⊢ φ → B ∈ ℕ
3 fltabcoprmex.c ⊢ φ → C ∈ ℕ
4 fltabcoprmex.n ⊢ φ → N ∈ ℕ 0
5 fltabcoprmex.1 ⊢ φ → A N + B N = C N
6 fltaccoprm.1 ⊢ φ → A gcd B = 1
7 coprmgcdb ⊢ A ∈ ℕ ∧ B ∈ ℕ → ∀ i ∈ ℕ i ∥ A ∧ i ∥ B → i = 1 ↔ A gcd B = 1
8 1 2 7 syl2anc ⊢ φ → ∀ i ∈ ℕ i ∥ A ∧ i ∥ B → i = 1 ↔ A gcd B = 1
9 6 8 mpbird ⊢ φ → ∀ i ∈ ℕ i ∥ A ∧ i ∥ B → i = 1
10 simprl ⊢ φ ∧ i ∈ ℕ ∧ i ∥ A ∧ i ∥ C → i ∥ A
11 simpr ⊢ φ ∧ i ∈ ℕ → i ∈ ℕ
12 11 nnzd ⊢ φ ∧ i ∈ ℕ → i ∈ ℤ
13 3 nnzd ⊢ φ → C ∈ ℤ
14 13 adantr ⊢ φ ∧ i ∈ ℕ → C ∈ ℤ
15 4 adantr ⊢ φ ∧ i ∈ ℕ → N ∈ ℕ 0
16 dvdsexpim ⊢ i ∈ ℤ ∧ C ∈ ℤ ∧ N ∈ ℕ 0 → i ∥ C → i N ∥ C N
17 12 14 15 16 syl3anc ⊢ φ ∧ i ∈ ℕ → i ∥ C → i N ∥ C N
18 1 nnzd ⊢ φ → A ∈ ℤ
19 18 adantr ⊢ φ ∧ i ∈ ℕ → A ∈ ℤ
20 dvdsexpim ⊢ i ∈ ℤ ∧ A ∈ ℤ ∧ N ∈ ℕ 0 → i ∥ A → i N ∥ A N
21 12 19 15 20 syl3anc ⊢ φ ∧ i ∈ ℕ → i ∥ A → i N ∥ A N
22 17 21 anim12d ⊢ φ ∧ i ∈ ℕ → i ∥ C ∧ i ∥ A → i N ∥ C N ∧ i N ∥ A N
23 22 ancomsd ⊢ φ ∧ i ∈ ℕ → i ∥ A ∧ i ∥ C → i N ∥ C N ∧ i N ∥ A N
24 23 imp ⊢ φ ∧ i ∈ ℕ ∧ i ∥ A ∧ i ∥ C → i N ∥ C N ∧ i N ∥ A N
25 11 15 nnexpcld ⊢ φ ∧ i ∈ ℕ → i N ∈ ℕ
26 25 nnzd ⊢ φ ∧ i ∈ ℕ → i N ∈ ℤ
27 26 adantr ⊢ φ ∧ i ∈ ℕ ∧ i ∥ A ∧ i ∥ C → i N ∈ ℤ
28 3 4 nnexpcld ⊢ φ → C N ∈ ℕ
29 28 nnzd ⊢ φ → C N ∈ ℤ
30 29 ad2antrr ⊢ φ ∧ i ∈ ℕ ∧ i ∥ A ∧ i ∥ C → C N ∈ ℤ
31 1 4 nnexpcld ⊢ φ → A N ∈ ℕ
32 31 nnzd ⊢ φ → A N ∈ ℤ
33 32 ad2antrr ⊢ φ ∧ i ∈ ℕ ∧ i ∥ A ∧ i ∥ C → A N ∈ ℤ
34 dvds2sub ⊢ i N ∈ ℤ ∧ C N ∈ ℤ ∧ A N ∈ ℤ → i N ∥ C N ∧ i N ∥ A N → i N ∥ C N − A N
35 27 30 33 34 syl3anc ⊢ φ ∧ i ∈ ℕ ∧ i ∥ A ∧ i ∥ C → i N ∥ C N ∧ i N ∥ A N → i N ∥ C N − A N
36 24 35 mpd ⊢ φ ∧ i ∈ ℕ ∧ i ∥ A ∧ i ∥ C → i N ∥ C N − A N
37 1 nncnd ⊢ φ → A ∈ ℂ
38 37 4 expcld ⊢ φ → A N ∈ ℂ
39 2 nncnd ⊢ φ → B ∈ ℂ
40 39 4 expcld ⊢ φ → B N ∈ ℂ
41 38 40 5 mvlladdcd ⊢ φ → C N − A N = B N
42 41 ad2antrr ⊢ φ ∧ i ∈ ℕ ∧ i ∥ A ∧ i ∥ C → C N − A N = B N
43 36 42 breqtrd ⊢ φ ∧ i ∈ ℕ ∧ i ∥ A ∧ i ∥ C → i N ∥ B N
44 simplr ⊢ φ ∧ i ∈ ℕ ∧ i ∥ A ∧ i ∥ C → i ∈ ℕ
45 2 ad2antrr ⊢ φ ∧ i ∈ ℕ ∧ i ∥ A ∧ i ∥ C → B ∈ ℕ
46 3 nncnd ⊢ φ → C ∈ ℂ
47 37 39 46 4 5 flt0 ⊢ φ → N ∈ ℕ
48 47 ad2antrr ⊢ φ ∧ i ∈ ℕ ∧ i ∥ A ∧ i ∥ C → N ∈ ℕ
49 dvdsexpnn ⊢ i ∈ ℕ ∧ B ∈ ℕ ∧ N ∈ ℕ → i ∥ B ↔ i N ∥ B N
50 44 45 48 49 syl3anc ⊢ φ ∧ i ∈ ℕ ∧ i ∥ A ∧ i ∥ C → i ∥ B ↔ i N ∥ B N
51 43 50 mpbird ⊢ φ ∧ i ∈ ℕ ∧ i ∥ A ∧ i ∥ C → i ∥ B
52 10 51 jca ⊢ φ ∧ i ∈ ℕ ∧ i ∥ A ∧ i ∥ C → i ∥ A ∧ i ∥ B
53 52 ex ⊢ φ ∧ i ∈ ℕ → i ∥ A ∧ i ∥ C → i ∥ A ∧ i ∥ B
54 53 imim1d ⊢ φ ∧ i ∈ ℕ → i ∥ A ∧ i ∥ B → i = 1 → i ∥ A ∧ i ∥ C → i = 1
55 54 ralimdva ⊢ φ → ∀ i ∈ ℕ i ∥ A ∧ i ∥ B → i = 1 → ∀ i ∈ ℕ i ∥ A ∧ i ∥ C → i = 1
56 9 55 mpd ⊢ φ → ∀ i ∈ ℕ i ∥ A ∧ i ∥ C → i = 1
57 coprmgcdb ⊢ A ∈ ℕ ∧ C ∈ ℕ → ∀ i ∈ ℕ i ∥ A ∧ i ∥ C → i = 1 ↔ A gcd C = 1
58 1 3 57 syl2anc ⊢ φ → ∀ i ∈ ℕ i ∥ A ∧ i ∥ C → i = 1 ↔ A gcd C = 1
59 56 58 mpbid ⊢ φ → A gcd C = 1