Theorem qexpz 13109

Description: If a power of a rational number is an integer, then the number is an integer. (Contributed by Mario Carneiro, 10-Aug-2015.)

Assertion

Ref	Expression
qexpz	|- ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) -> A e. ZZ )

Proof of Theorem qexpz

Dummy variable p is distinct from all other variables.

Step	Hyp	Ref	Expression
1		0z 9634	. . . 4 |- 0 e. ZZ
2		eleq1 2301	. . . 4 |- ( A = 0 -> ( A e. ZZ <-> 0 e. ZZ ) )
3	1, 2	mpbiri 168	. . 3 |- ( A = 0 -> A e. ZZ )
4	3	adantl 277	. 2 |- ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A = 0 ) -> A e. ZZ )
5		simpll2 1068	. . . . . . . 8 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> N e. NN )
6	5	nncnd 9297	. . . . . . 7 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> N e. CC )
7	6	mul01d 8710	. . . . . 6 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> ( N x. 0 ) = 0 )
8		simpr 110	. . . . . . . . 9 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> p e. Prime )
9		simpll3 1069	. . . . . . . . 9 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> ( A ^ N ) e. ZZ )
10		simpll1 1067	. . . . . . . . . . . 12 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> A e. QQ )
11		qcn 10013	. . . . . . . . . . . 12 |- ( A e. QQ -> A e. CC )
12	10, 11	syl 14	. . . . . . . . . . 11 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> A e. CC )
13		simplr 533	. . . . . . . . . . . 12 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> A =/= 0 )
14		zq 10005	. . . . . . . . . . . . . 14 |- ( 0 e. ZZ -> 0 e. QQ )
15	1, 14	ax-mp 5	. . . . . . . . . . . . 13 |- 0 e. QQ
16		qapne 10018	. . . . . . . . . . . . 13 |- ( ( A e. QQ /\ 0 e. QQ ) -> ( A # 0 <-> A =/= 0 ) )
17	10, 15, 16	sylancl 417	. . . . . . . . . . . 12 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> ( A # 0 <-> A =/= 0 ) )
18	13, 17	mpbird 167	. . . . . . . . . . 11 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> A # 0 )
19	5	nnzd 9746	. . . . . . . . . . 11 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> N e. ZZ )
20	12, 18, 19	expap0d 11095	. . . . . . . . . 10 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> ( A ^ N ) # 0 )
21		0zd 9635	. . . . . . . . . . 11 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> 0 e. ZZ )
22		zapne 9698	. . . . . . . . . . 11 |- ( ( ( A ^ N ) e. ZZ /\ 0 e. ZZ ) -> ( ( A ^ N ) # 0 <-> ( A ^ N ) =/= 0 ) )
23	9, 21, 22	syl2anc 415	. . . . . . . . . 10 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> ( ( A ^ N ) # 0 <-> ( A ^ N ) =/= 0 ) )
24	20, 23	mpbid 147	. . . . . . . . 9 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> ( A ^ N ) =/= 0 )
25		pczcl 13055	. . . . . . . . 9 |- ( ( p e. Prime /\ ( ( A ^ N ) e. ZZ /\ ( A ^ N ) =/= 0 ) ) -> ( p pCnt ( A ^ N ) ) e. NN0 )
26	8, 9, 24, 25	syl12anc 1276	. . . . . . . 8 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> ( p pCnt ( A ^ N ) ) e. NN0 )
27	26	nn0ge0d 9602	. . . . . . 7 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> 0 <_ ( p pCnt ( A ^ N ) ) )
28		pcexp 13066	. . . . . . . 8 |- ( ( p e. Prime /\ ( A e. QQ /\ A =/= 0 ) /\ N e. ZZ ) -> ( p pCnt ( A ^ N ) ) = ( N x. ( p pCnt A ) ) )
29	8, 10, 13, 19, 28	syl121anc 1283	. . . . . . 7 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> ( p pCnt ( A ^ N ) ) = ( N x. ( p pCnt A ) ) )
30	27, 29	breqtrd 4151	. . . . . 6 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> 0 <_ ( N x. ( p pCnt A ) ) )
31	7, 30	eqbrtrd 4147	. . . . 5 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> ( N x. 0 ) <_ ( N x. ( p pCnt A ) ) )
32		0red 8317	. . . . . 6 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> 0 e. RR )
33		pcqcl 13063	. . . . . . . 8 |- ( ( p e. Prime /\ ( A e. QQ /\ A =/= 0 ) ) -> ( p pCnt A ) e. ZZ )
34	8, 10, 13, 33	syl12anc 1276	. . . . . . 7 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> ( p pCnt A ) e. ZZ )
35	34	zred 9747	. . . . . 6 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> ( p pCnt A ) e. RR )
36	5	nnred 9296	. . . . . 6 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> N e. RR )
37	5	nngt0d 9327	. . . . . 6 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> 0 < N )
38		lemul2 9177	. . . . . 6 |- ( ( 0 e. RR /\ ( p pCnt A ) e. RR /\ ( N e. RR /\ 0 < N ) ) -> ( 0 <_ ( p pCnt A ) <-> ( N x. 0 ) <_ ( N x. ( p pCnt A ) ) ) )
39	32, 35, 36, 37, 38	syl112anc 1282	. . . . 5 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> ( 0 <_ ( p pCnt A ) <-> ( N x. 0 ) <_ ( N x. ( p pCnt A ) ) ) )
40	31, 39	mpbird 167	. . . 4 |- ( ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) /\ p e. Prime ) -> 0 <_ ( p pCnt A ) )
41	40	ralrimiva 2623	. . 3 |- ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) -> A. p e. Prime 0 <_ ( p pCnt A ) )
42		simpl1 1031	. . . 4 |- ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) -> A e. QQ )
43		pcz 13089	. . . 4 |- ( A e. QQ -> ( A e. ZZ <-> A. p e. Prime 0 <_ ( p pCnt A ) ) )
44	42, 43	syl 14	. . 3 |- ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) -> ( A e. ZZ <-> A. p e. Prime 0 <_ ( p pCnt A ) ) )
45	41, 44	mpbird 167	. 2 |- ( ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) /\ A =/= 0 ) -> A e. ZZ )
46		simp1 1028	. . . 4 |- ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) -> A e. QQ )
47		qdceq 10657	. . . 4 |- ( ( A e. QQ /\ 0 e. QQ ) -> DECID A = 0 )
48	46, 15, 47	sylancl 417	. . 3 |- ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) -> DECID A = 0 )
49		dcne 2431	. . 3 |- (DECID A = 0 <-> ( A = 0 \/ A =/= 0 ) )
50	48, 49	sylib 122	. 2 |- ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) -> ( A = 0 \/ A =/= 0 ) )
51	4, 45, 50	mpjaodan 810	1 |- ( ( A e. QQ /\ N e. NN /\ ( A ^ N ) e. ZZ ) -> A e. ZZ )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720  DECID wdc 846   /\ w3a 1009   = wceq 1402   e. wcel 2209   =/= wne 2420   A.wral 2528   class class class wbr 4125  (class class class)co 6075   CCcc 8167   RRcr 8168   0cc0 8169   x. cmul 8174   < clt 8350   <_ cle 8351   # cap 8899   NNcn 9283   NN0cn0 9542   ZZcz 9623   QQcq 9998   ^cexp 10953   Primecprime 12863   pCnt cpc 13041

This theorem was proved from 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 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286  ax-pre-mulext 8287  ax-arch 8288  ax-caucvg 8289

This theorem 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 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-po 4436  df-iso 4437  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-isom 5381  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-1o 6677  df-2o 6678  df-er 6797  df-en 7013  df-sup 7314  df-inf 7315  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900  df-div 8993  df-inn 9284  df-2 9342  df-3 9343  df-4 9344  df-n0 9543  df-xnn0 9610  df-z 9624  df-uz 9901  df-q 9999  df-rp 10034  df-fz 10391  df-fzo 10528  df-fl 10683  df-mod 10738  df-seqfrec 10863  df-exp 10954  df-cj 11585  df-re 11586  df-im 11587  df-rsqrt 11742  df-abs 11743  df-dvds 12533  df-gcd 12709  df-prm 12864  df-pc 13042

This theorem is referenced by: (None)