Metamath Proof Explorer


Theorem rtprmirr

Description: The root of a prime number is irrational. (Contributed by Steven Nguyen, 6-Apr-2023)

Ref Expression
Assertion rtprmirr ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P 1 N ∈ ℝ ∖ ℚ

Proof

Step Hyp Ref Expression
1 prmnn ⊢ P ∈ ℙ → P ∈ ℕ
2 1 adantr ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P ∈ ℕ
3 2 nnred ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P ∈ ℝ
4 0red ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → 0 ∈ ℝ
5 2 nngt0d ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → 0 < P
6 4 3 5 ltled ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → 0 ≤ P
7 eluzelre ⊢ N ∈ ℤ ≥ 2 → N ∈ ℝ
8 7 adantl ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → N ∈ ℝ
9 eluz2n0 ⊢ N ∈ ℤ ≥ 2 → N ≠ 0
10 9 adantl ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → N ≠ 0
11 8 10 rereccld ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → 1 N ∈ ℝ
12 3 6 11 recxpcld ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P 1 N ∈ ℝ
13 eluz2gt1 ⊢ N ∈ ℤ ≥ 2 → 1 < N
14 recgt1i ⊢ N ∈ ℝ ∧ 1 < N → 0 < 1 N ∧ 1 N < 1
15 7 13 14 syl2anc ⊢ N ∈ ℤ ≥ 2 → 0 < 1 N ∧ 1 N < 1
16 15 simprd ⊢ N ∈ ℤ ≥ 2 → 1 N < 1
17 16 adantl ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → 1 N < 1
18 prmgt1 ⊢ P ∈ ℙ → 1 < P
19 18 adantr ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → 1 < P
20 1red ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → 1 ∈ ℝ
21 3 19 11 20 cxpltd ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → 1 N < 1 ↔ P 1 N < P 1
22 17 21 mpbid ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P 1 N < P 1
23 2 nncnd ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P ∈ ℂ
24 23 cxp1d ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P 1 = P
25 22 24 breqtrd ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P 1 N < P
26 12 25 ltned ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P 1 N ≠ P
27 26 neneqd ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → ¬ P 1 N = P
28 27 adantr ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℕ → ¬ P 1 N = P
29 23 cxp0d ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P 0 = 1
30 15 simpld ⊢ N ∈ ℤ ≥ 2 → 0 < 1 N
31 30 adantl ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → 0 < 1 N
32 3 19 4 11 cxpltd ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → 0 < 1 N ↔ P 0 < P 1 N
33 31 32 mpbid ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P 0 < P 1 N
34 29 33 eqbrtrrd ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → 1 < P 1 N
35 20 34 gtned ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P 1 N ≠ 1
36 35 neneqd ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → ¬ P 1 N = 1
37 36 adantr ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℕ → ¬ P 1 N = 1
38 dvdsprime ⊢ P ∈ ℙ ∧ P 1 N ∈ ℕ → P 1 N ∥ P ↔ P 1 N = P ∨ P 1 N = 1
39 38 adantlr ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℕ → P 1 N ∥ P ↔ P 1 N = P ∨ P 1 N = 1
40 39 biimpd ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℕ → P 1 N ∥ P → P 1 N = P ∨ P 1 N = 1
41 28 37 40 mtord ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℕ → ¬ P 1 N ∥ P
42 nan ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → ¬ P 1 N ∈ ℕ ∧ P 1 N ∥ P ↔ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℕ → ¬ P 1 N ∥ P
43 41 42 mpbir ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → ¬ P 1 N ∈ ℕ ∧ P 1 N ∥ P
44 prmz ⊢ P ∈ ℙ → P ∈ ℤ
45 44 3ad2ant1 ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℕ → P ∈ ℤ
46 eluz2nn ⊢ N ∈ ℤ ≥ 2 → N ∈ ℕ
47 46 3ad2ant2 ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℕ → N ∈ ℕ
48 simp3 ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℕ → P 1 N ∈ ℕ
49 zrtdvds ⊢ P ∈ ℤ ∧ N ∈ ℕ ∧ P 1 N ∈ ℕ → P 1 N ∥ P
50 45 47 48 49 syl3anc ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℕ → P 1 N ∥ P
51 50 3expia ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P 1 N ∈ ℕ → P 1 N ∥ P
52 51 ancld ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P 1 N ∈ ℕ → P 1 N ∈ ℕ ∧ P 1 N ∥ P
53 43 52 mtod ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → ¬ P 1 N ∈ ℕ
54 1 nnrpd ⊢ P ∈ ℙ → P ∈ ℝ +
55 54 3ad2ant1 ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℤ → P ∈ ℝ +
56 7 3ad2ant2 ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℤ → N ∈ ℝ
57 9 3ad2ant2 ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℤ → N ≠ 0
58 56 57 rereccld ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℤ → 1 N ∈ ℝ
59 55 58 cxpgt0d ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℤ → 0 < P 1 N
60 59 3expia ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P 1 N ∈ ℤ → 0 < P 1 N
61 60 ancld ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P 1 N ∈ ℤ → P 1 N ∈ ℤ ∧ 0 < P 1 N
62 elnnz ⊢ P 1 N ∈ ℕ ↔ P 1 N ∈ ℤ ∧ 0 < P 1 N
63 61 62 imbitrrdi ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P 1 N ∈ ℤ → P 1 N ∈ ℕ
64 53 63 mtod ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → ¬ P 1 N ∈ ℤ
65 44 3ad2ant1 ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℚ → P ∈ ℤ
66 46 3ad2ant2 ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℚ → N ∈ ℕ
67 simp3 ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℚ → P 1 N ∈ ℚ
68 zrtelqelz ⊢ P ∈ ℤ ∧ N ∈ ℕ ∧ P 1 N ∈ ℚ → P 1 N ∈ ℤ
69 65 66 67 68 syl3anc ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ P 1 N ∈ ℚ → P 1 N ∈ ℤ
70 69 3expia ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P 1 N ∈ ℚ → P 1 N ∈ ℤ
71 64 70 mtod ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → ¬ P 1 N ∈ ℚ
72 12 71 eldifd ⊢ P ∈ ℙ ∧ N ∈ ℤ ≥ 2 → P 1 N ∈ ℝ ∖ ℚ