ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  expnprm Unicode version
Theorem expnprm 13161
Description: A second or higher power of a rational number is not a prime number. Or by contraposition, the n-th root of a prime number is not rational. Suggested by Norm Megill. (Contributed by Mario Carneiro, 10-Aug-2015.)
Assertion
Ref Expression
expnprm |- ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) -> -. ( A ^ N ) e. Prime )
Proof of Theorem expnprm
StepHypRef Expression
1 eluz2b3 10020 . . . 4 |- ( N e. ( ZZ>= ` 2 ) <-> ( N e. NN /\ N =/= 1 ) )
21simprbi 275 . . 3 |- ( N e. ( ZZ>= ` 2 ) -> N =/= 1 )
32adantl 277 . 2 |- ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) -> N =/= 1 )
4 eluzelz 9947 . . . . . . . 8 |- ( N e. ( ZZ>= ` 2 ) -> N e. ZZ )
54ad2antlr 493 . . . . . . 7 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> N e. ZZ )
6 simpr 110 . . . . . . . 8 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> ( A ^ N ) e. Prime )
7 simpll 531 . . . . . . . 8 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> A e. QQ )
8 prmnn 12913 . . . . . . . . . . . 12 |- ( ( A ^ N ) e. Prime -> ( A ^ N ) e. NN )
98adantl 277 . . . . . . . . . . 11 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> ( A ^ N ) e. NN )
109nnne0d 9358 . . . . . . . . . 10 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> ( A ^ N ) =/= 0 )
11 eluz2nn 9982 . . . . . . . . . . . 12 |- ( N e. ( ZZ>= ` 2 ) -> N e. NN )
1211ad2antlr 493 . . . . . . . . . . 11 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> N e. NN )
13120expd 11148 . . . . . . . . . 10 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> ( 0 ^ N ) = 0 )
1410, 13neeqtrrd 2450 . . . . . . . . 9 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> ( A ^ N ) =/= ( 0 ^ N ) )
15 oveq1 6095 . . . . . . . . . 10 |- ( A = 0 -> ( A ^ N ) = ( 0 ^ N ) )
1615necon3i 2468 . . . . . . . . 9 |- ( ( A ^ N ) =/= ( 0 ^ N ) -> A =/= 0 )
1714, 16syl 14 . . . . . . . 8 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> A =/= 0 )
18 pcqcl 13114 . . . . . . . 8 |- ( ( ( A ^ N ) e. Prime /\ ( A e. QQ /\ A =/= 0 ) ) -> ( ( A ^ N ) pCnt A ) e. ZZ )
196, 7, 17, 18syl12anc 1276 . . . . . . 7 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> ( ( A ^ N ) pCnt A ) e. ZZ )
20 dvdsmul1 12605 . . . . . . 7 |- ( ( N e. ZZ /\ ( ( A ^ N ) pCnt A ) e. ZZ ) -> N || ( N x. ( ( A ^ N ) pCnt A ) ) )
215, 19, 20syl2anc 415 . . . . . 6 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> N || ( N x. ( ( A ^ N ) pCnt A ) ) )
229nncnd 9327 . . . . . . . . 9 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> ( A ^ N ) e. CC )
2322exp1d 11127 . . . . . . . 8 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> ( ( A ^ N ) ^ 1 ) = ( A ^ N ) )
2423oveq2d 6104 . . . . . . 7 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> ( ( A ^ N ) pCnt ( ( A ^ N ) ^ 1 ) ) = ( ( A ^ N ) pCnt ( A ^ N ) ) )
25 1z 9681 . . . . . . . 8 |- 1 e. ZZ
26 pcid 13132 . . . . . . . 8 |- ( ( ( A ^ N ) e. Prime /\ 1 e. ZZ ) -> ( ( A ^ N ) pCnt ( ( A ^ N ) ^ 1 ) ) = 1 )
276, 25, 26sylancl 417 . . . . . . 7 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> ( ( A ^ N ) pCnt ( ( A ^ N ) ^ 1 ) ) = 1 )
28 pcexp 13117 . . . . . . . 8 |- ( ( ( A ^ N ) e. Prime /\ ( A e. QQ /\ A =/= 0 ) /\ N e. ZZ ) -> ( ( A ^ N ) pCnt ( A ^ N ) ) = ( N x. ( ( A ^ N ) pCnt A ) ) )
296, 7, 17, 5, 28syl121anc 1283 . . . . . . 7 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> ( ( A ^ N ) pCnt ( A ^ N ) ) = ( N x. ( ( A ^ N ) pCnt A ) ) )
3024, 27, 293eqtr3rd 2280 . . . . . 6 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> ( N x. ( ( A ^ N ) pCnt A ) ) = 1 )
3121, 30breqtrd 4157 . . . . 5 |- ( ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) /\ ( A ^ N ) e. Prime ) -> N || 1 )
3231ex 115 . . . 4 |- ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) -> ( ( A ^ N ) e. Prime -> N || 1 ) )
3311adantl 277 . . . . . 6 |- ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) -> N e. NN )
3433nnnn0d 9631 . . . . 5 |- ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) -> N e. NN0 )
35 dvds1 12645 . . . . 5 |- ( N e. NN0 -> ( N || 1 <-> N = 1 ) )
3634, 35syl 14 . . . 4 |- ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) -> ( N || 1 <-> N = 1 ) )
3732, 36sylibd 149 . . 3 |- ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) -> ( ( A ^ N ) e. Prime -> N = 1 ) )
3837necon3ad 2462 . 2 |- ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) -> ( N =/= 1 -> -. ( A ^ N ) e. Prime ) )
393, 38mpd 13 1 |- ( ( A e. QQ /\ N e. ( ZZ>= ` 2 ) ) -> -. ( A ^ N ) e. Prime )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   =/= wne 2420   class class class wbr 4131   ` cfv 5380  (class class class)co 6088   0cc0 8185   1c1 8186   x. cmul 8190   NNcn 9313   2c2 9364   NN0cn0 9574   ZZcz 9655   ZZ>=cuz 9937   QQcq 10035   ^cexp 10996   || cdvds 12579   Primecprime 12910   pCnt cpc 13092
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302  ax-pre-mulext 8303  ax-arch 8304  ax-caucvg 8305
This proof depends on definitions:  df-bi 117  df-stab 843  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-isom 5389  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-1o 6691  df-2o 6692  df-er 6811  df-en 7027  df-sup 7330  df-inf 7331  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918  df-div 9011  df-inn 9314  df-2 9372  df-3 9373  df-4 9374  df-n0 9575  df-z 9656  df-uz 9938  df-q 10036  df-rp 10072  df-fz 10429  df-fzo 10567  df-fl 10722  df-mod 10781  df-seqfrec 10906  df-exp 10997  df-cj 11629  df-re 11630  df-im 11631  df-rsqrt 11786  df-abs 11787  df-dvds 12580  df-gcd 12756  df-prm 12911  df-pc 13093
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator