Metamath Proof Explorer


Theorem nrt2irr

Description: The N -th root of 2 is irrational for N greater than 2 . For N = 2 , see sqrt2irr . This short and rather elegant proof has the minor disadvantage that it refers to ax-flt , which is still to be formalized. For a proof not requiring ax-flt , see rtprmirr . (Contributed by Prof. Loof Lirpa, 1-Apr-2025) (Proof modification is discouraged.)

Ref Expression
Assertion nrt2irr ⊢ N ∈ ℤ ≥ 3 → ¬ 2 1 N ∈ ℚ

Proof

Step Hyp Ref Expression
1 2cnd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 2 ∈ ℂ
2 simprr ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → q ∈ ℕ
3 2 nncnd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → q ∈ ℂ
4 eluz3nn ⊢ N ∈ ℤ ≥ 3 → N ∈ ℕ
5 4 adantr ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → N ∈ ℕ
6 5 nnnn0d ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → N ∈ ℕ 0
7 3 6 expcld ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → q N ∈ ℂ
8 2 nnne0d ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → q ≠ 0
9 5 nnzd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → N ∈ ℤ
10 3 8 9 expne0d ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → q N ≠ 0
11 1 7 10 divcan4d ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 2 ⁢ q N q N = 2
12 7 2timesd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 2 ⁢ q N = q N + q N
13 simpl ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → N ∈ ℤ ≥ 3
14 simprl ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p ∈ ℕ
15 ax-flt ⊢ N ∈ ℤ ≥ 3 ∧ q ∈ ℕ ∧ q ∈ ℕ ∧ p ∈ ℕ → q N + q N ≠ p N
16 13 2 2 14 15 syl13anc ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → q N + q N ≠ p N
17 12 16 eqnetrd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 2 ⁢ q N ≠ p N
18 1 7 mulcld ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 2 ⁢ q N ∈ ℂ
19 14 nncnd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p ∈ ℂ
20 19 6 expcld ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p N ∈ ℂ
21 div11 ⊢ 2 ⁢ q N ∈ ℂ ∧ p N ∈ ℂ ∧ q N ∈ ℂ ∧ q N ≠ 0 → 2 ⁢ q N q N = p N q N ↔ 2 ⁢ q N = p N
22 18 20 7 10 21 syl112anc ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 2 ⁢ q N q N = p N q N ↔ 2 ⁢ q N = p N
23 22 necon3bid ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 2 ⁢ q N q N ≠ p N q N ↔ 2 ⁢ q N ≠ p N
24 17 23 mpbird ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 2 ⁢ q N q N ≠ p N q N
25 11 24 eqnetrrd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 2 ≠ p N q N
26 19 3 8 6 expdivd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p q N = p N q N
27 25 26 neeqtrrd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 2 ≠ p q N
28 19 3 8 divcld ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p q ∈ ℂ
29 14 nnne0d ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p ≠ 0
30 19 3 29 8 divne0d ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p q ≠ 0
31 28 30 9 cxpexpzd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p q N = p q N
32 27 31 neeqtrrd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 2 ≠ p q N
33 2re ⊢ 2 ∈ ℝ
34 33 a1i ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 2 ∈ ℝ
35 0le2 ⊢ 0 ≤ 2
36 35 a1i ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 0 ≤ 2
37 14 nnrpd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p ∈ ℝ +
38 2 nnrpd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → q ∈ ℝ +
39 37 38 rpdivcld ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p q ∈ ℝ +
40 39 rpred ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p q ∈ ℝ
41 39 rpge0d ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 0 ≤ p q
42 5 nnred ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → N ∈ ℝ
43 40 41 42 recxpcld ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p q N ∈ ℝ
44 40 41 42 cxpge0d ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 0 ≤ p q N
45 5 nnrpd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → N ∈ ℝ +
46 45 rpreccld ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 1 N ∈ ℝ +
47 34 36 43 44 46 recxpf1lem ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 2 = p q N ↔ 2 1 N = p q N 1 N
48 47 necon3bid ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 2 ≠ p q N ↔ 2 1 N ≠ p q N 1 N
49 32 48 mpbid ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 2 1 N ≠ p q N 1 N
50 5 nnrecred ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 1 N ∈ ℝ
51 50 recnd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 1 N ∈ ℂ
52 28 51 cxpcld ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p q 1 N ∈ ℂ
53 28 30 51 cxpne0d ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p q 1 N ≠ 0
54 52 53 9 cxpexpzd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p q 1 N N = p q 1 N N
55 cxpcom ⊢ p q ∈ ℝ + ∧ 1 N ∈ ℝ ∧ N ∈ ℝ → p q 1 N N = p q N 1 N
56 39 50 42 55 syl3anc ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p q 1 N N = p q N 1 N
57 cxproot ⊢ p q ∈ ℂ ∧ N ∈ ℕ → p q 1 N N = p q
58 28 5 57 syl2anc ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p q 1 N N = p q
59 54 56 58 3eqtr3d ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → p q N 1 N = p q
60 49 59 neeqtrd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → 2 1 N ≠ p q
61 60 neneqd ⊢ N ∈ ℤ ≥ 3 ∧ p ∈ ℕ ∧ q ∈ ℕ → ¬ 2 1 N = p q
62 61 ralrimivva ⊢ N ∈ ℤ ≥ 3 → ∀ p ∈ ℕ ∀ q ∈ ℕ ¬ 2 1 N = p q
63 ralnex2 ⊢ ∀ p ∈ ℕ ∀ q ∈ ℕ ¬ 2 1 N = p q ↔ ¬ ∃ p ∈ ℕ ∃ q ∈ ℕ 2 1 N = p q
64 62 63 sylib ⊢ N ∈ ℤ ≥ 3 → ¬ ∃ p ∈ ℕ ∃ q ∈ ℕ 2 1 N = p q
65 2rp ⊢ 2 ∈ ℝ +
66 65 a1i ⊢ N ∈ ℤ ≥ 3 → 2 ∈ ℝ +
67 4 nnrecred ⊢ N ∈ ℤ ≥ 3 → 1 N ∈ ℝ
68 66 67 cxpgt0d ⊢ N ∈ ℤ ≥ 3 → 0 < 2 1 N
69 68 biantrud ⊢ N ∈ ℤ ≥ 3 → 2 1 N ∈ ℚ ↔ 2 1 N ∈ ℚ ∧ 0 < 2 1 N
70 elpqb ⊢ 2 1 N ∈ ℚ ∧ 0 < 2 1 N ↔ ∃ p ∈ ℕ ∃ q ∈ ℕ 2 1 N = p q
71 69 70 bitrdi ⊢ N ∈ ℤ ≥ 3 → 2 1 N ∈ ℚ ↔ ∃ p ∈ ℕ ∃ q ∈ ℕ 2 1 N = p q
72 64 71 mtbird ⊢ N ∈ ℤ ≥ 3 → ¬ 2 1 N ∈ ℚ