Theorem rppwr 12728

Description: If A and B are relatively prime, then so are A ^ N and B ^ N. (Contributed by Scott Fenton, 12-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)

Assertion

Ref	Expression
rppwr	|- ( ( A e. NN /\ B e. NN /\ N e. NN ) -> ( ( A gcd B ) = 1 -> ( ( A ^ N ) gcd ( B ^ N ) ) = 1 ) )

Proof of Theorem rppwr

Step	Hyp	Ref	Expression
1		simpl1 1027	. . . 4 |- ( ( ( A e. NN /\ B e. NN /\ N e. NN ) /\ ( A gcd B ) = 1 ) -> A e. NN )
2		simpl2 1028	. . . . 5 |- ( ( ( A e. NN /\ B e. NN /\ N e. NN ) /\ ( A gcd B ) = 1 ) -> B e. NN )
3		simpl3 1029	. . . . . 6 |- ( ( ( A e. NN /\ B e. NN /\ N e. NN ) /\ ( A gcd B ) = 1 ) -> N e. NN )
4	3	nnnn0d 9555	. . . . 5 |- ( ( ( A e. NN /\ B e. NN /\ N e. NN ) /\ ( A gcd B ) = 1 ) -> N e. NN0 )
5	2, 4	nnexpcld 11061	. . . 4 |- ( ( ( A e. NN /\ B e. NN /\ N e. NN ) /\ ( A gcd B ) = 1 ) -> ( B ^ N ) e. NN )
6	1, 5, 3	3jca 1204	. . 3 |- ( ( ( A e. NN /\ B e. NN /\ N e. NN ) /\ ( A gcd B ) = 1 ) -> ( A e. NN /\ ( B ^ N ) e. NN /\ N e. NN ) )
7	1	nnzd 9702	. . . . 5 |- ( ( ( A e. NN /\ B e. NN /\ N e. NN ) /\ ( A gcd B ) = 1 ) -> A e. ZZ )
8	5	nnzd 9702	. . . . 5 |- ( ( ( A e. NN /\ B e. NN /\ N e. NN ) /\ ( A gcd B ) = 1 ) -> ( B ^ N ) e. ZZ )
9		gcdcom 12673	. . . . 5 |- ( ( A e. ZZ /\ ( B ^ N ) e. ZZ ) -> ( A gcd ( B ^ N ) ) = ( ( B ^ N ) gcd A ) )
10	7, 8, 9	syl2anc 411	. . . 4 |- ( ( ( A e. NN /\ B e. NN /\ N e. NN ) /\ ( A gcd B ) = 1 ) -> ( A gcd ( B ^ N ) ) = ( ( B ^ N ) gcd A ) )
11	2, 1, 3	3jca 1204	. . . . 5 |- ( ( ( A e. NN /\ B e. NN /\ N e. NN ) /\ ( A gcd B ) = 1 ) -> ( B e. NN /\ A e. NN /\ N e. NN ) )
12		nnz 9598	. . . . . . . . 9 |- ( A e. NN -> A e. ZZ )
13	12	3ad2ant1 1045	. . . . . . . 8 |- ( ( A e. NN /\ B e. NN /\ N e. NN ) -> A e. ZZ )
14		nnz 9598	. . . . . . . . 9 |- ( B e. NN -> B e. ZZ )
15	14	3ad2ant2 1046	. . . . . . . 8 |- ( ( A e. NN /\ B e. NN /\ N e. NN ) -> B e. ZZ )
16		gcdcom 12673	. . . . . . . 8 |- ( ( A e. ZZ /\ B e. ZZ ) -> ( A gcd B ) = ( B gcd A ) )
17	13, 15, 16	syl2anc 411	. . . . . . 7 |- ( ( A e. NN /\ B e. NN /\ N e. NN ) -> ( A gcd B ) = ( B gcd A ) )
18	17	eqeq1d 2243	. . . . . 6 |- ( ( A e. NN /\ B e. NN /\ N e. NN ) -> ( ( A gcd B ) = 1 <-> ( B gcd A ) = 1 ) )
19	18	biimpa 296	. . . . 5 |- ( ( ( A e. NN /\ B e. NN /\ N e. NN ) /\ ( A gcd B ) = 1 ) -> ( B gcd A ) = 1 )
20		rplpwr 12727	. . . . 5 |- ( ( B e. NN /\ A e. NN /\ N e. NN ) -> ( ( B gcd A ) = 1 -> ( ( B ^ N ) gcd A ) = 1 ) )
21	11, 19, 20	sylc 62	. . . 4 |- ( ( ( A e. NN /\ B e. NN /\ N e. NN ) /\ ( A gcd B ) = 1 ) -> ( ( B ^ N ) gcd A ) = 1 )
22	10, 21	eqtrd 2267	. . 3 |- ( ( ( A e. NN /\ B e. NN /\ N e. NN ) /\ ( A gcd B ) = 1 ) -> ( A gcd ( B ^ N ) ) = 1 )
23		rplpwr 12727	. . 3 |- ( ( A e. NN /\ ( B ^ N ) e. NN /\ N e. NN ) -> ( ( A gcd ( B ^ N ) ) = 1 -> ( ( A ^ N ) gcd ( B ^ N ) ) = 1 ) )
24	6, 22, 23	sylc 62	. 2 |- ( ( ( A e. NN /\ B e. NN /\ N e. NN ) /\ ( A gcd B ) = 1 ) -> ( ( A ^ N ) gcd ( B ^ N ) ) = 1 )
25	24	ex 115	1 |- ( ( A e. NN /\ B e. NN /\ N e. NN ) -> ( ( A gcd B ) = 1 -> ( ( A ^ N ) gcd ( B ^ N ) ) = 1 ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1005   = wceq 1398   e. wcel 2205  (class class class)co 6052   1c1 8130   NNcn 9239   ZZcz 9579   ^cexp 10904   gcd cgcd 12653

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-mulrcl 8228  ax-addcom 8229  ax-mulcom 8230  ax-addass 8231  ax-mulass 8232  ax-distr 8233  ax-i2m1 8234  ax-0lt1 8235  ax-1rid 8236  ax-0id 8237  ax-rnegex 8238  ax-precex 8239  ax-cnre 8240  ax-pre-ltirr 8241  ax-pre-ltwlin 8242  ax-pre-lttrn 8243  ax-pre-apti 8244  ax-pre-ltadd 8245  ax-pre-mulgt0 8246  ax-pre-mulext 8247  ax-arch 8248  ax-caucvg 8249

This theorem depends on definitions:  df-bi 117  df-stab 839  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-if 3623  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-id 4416  df-po 4419  df-iso 4420  df-iord 4489  df-on 4491  df-ilim 4492  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-frec 6624  df-sup 7277  df-pnf 8312  df-mnf 8313  df-xr 8314  df-ltxr 8315  df-le 8316  df-sub 8448  df-neg 8449  df-reap 8851  df-ap 8858  df-div 8949  df-inn 9240  df-2 9298  df-3 9299  df-4 9300  df-n0 9499  df-z 9580  df-uz 9857  df-q 9955  df-rp 9990  df-fz 10346  df-fzo 10481  df-fl 10634  df-mod 10689  df-seqfrec 10814  df-exp 10905  df-cj 11531  df-re 11532  df-im 11533  df-rsqrt 11687  df-abs 11688  df-dvds 12478  df-gcd 12654

This theorem is referenced by:  sqgcd  12729