Theorem dvdsppwf1o 16109

Description: A bijection between the divisors of a prime power and the integers less than or equal to the exponent. (Contributed by Mario Carneiro, 5-May-2016.)

Hypothesis

Ref	Expression
dvdsppwf1o.f	|- F = ( n e. ( 0 ... A ) |-> ( P ^ n ) )

Assertion

Ref	Expression
dvdsppwf1o	|- ( ( P e. Prime /\ A e. NN0 ) -> F : ( 0 ... A ) -1-1-onto-> { x e. NN | x || ( P ^ A ) } )

Distinct variable groups:   x, n, A   P, n, x

Allowed substitution hints:   F( x, n)

Proof of Theorem dvdsppwf1o

Dummy variable m is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dvdsppwf1o.f	. 2 |- F = ( n e. ( 0 ... A ) |-> ( P ^ n ) )
2		breq1 4133	. . 3 |- ( x = ( P ^ n ) -> ( x || ( P ^ A ) <-> ( P ^ n ) || ( P ^ A ) ) )
3		prmnn 12890	. . . . 5 |- ( P e. Prime -> P e. NN )
4	3	adantr 276	. . . 4 |- ( ( P e. Prime /\ A e. NN0 ) -> P e. NN )
5		elfznn0 10523	. . . 4 |- ( n e. ( 0 ... A ) -> n e. NN0 )
6		nnexpcl 10991	. . . 4 |- ( ( P e. NN /\ n e. NN0 ) -> ( P ^ n ) e. NN )
7	4, 5, 6	syl2an 289	. . 3 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ n e. ( 0 ... A ) ) -> ( P ^ n ) e. NN )
8		prmz 12891	. . . . 5 |- ( P e. Prime -> P e. ZZ )
9	8	ad2antrr 492	. . . 4 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ n e. ( 0 ... A ) ) -> P e. ZZ )
10	5	adantl 277	. . . 4 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ n e. ( 0 ... A ) ) -> n e. NN0 )
11		elfzuz3 10427	. . . . 5 |- ( n e. ( 0 ... A ) -> A e. ( ZZ>= ` n ) )
12	11	adantl 277	. . . 4 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ n e. ( 0 ... A ) ) -> A e. ( ZZ>= ` n ) )
13		dvdsexp 12630	. . . 4 |- ( ( P e. ZZ /\ n e. NN0 /\ A e. ( ZZ>= ` n ) ) -> ( P ^ n ) || ( P ^ A ) )
14	9, 10, 12, 13	syl3anc 1278	. . 3 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ n e. ( 0 ... A ) ) -> ( P ^ n ) || ( P ^ A ) )
15	2, 7, 14	elrabd 2984	. 2 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ n e. ( 0 ... A ) ) -> ( P ^ n ) e. { x e. NN | x || ( P ^ A ) } )
16		simpl 109	. . . 4 |- ( ( P e. Prime /\ A e. NN0 ) -> P e. Prime )
17		elrabi 2979	. . . 4 |- ( m e. { x e. NN | x || ( P ^ A ) } -> m e. NN )
18		pccl 13080	. . . 4 |- ( ( P e. Prime /\ m e. NN ) -> ( P pCnt m ) e. NN0 )
19	16, 17, 18	syl2an 289	. . 3 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ m e. { x e. NN | x || ( P ^ A ) } ) -> ( P pCnt m ) e. NN0 )
20	16	adantr 276	. . . . 5 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ m e. { x e. NN | x || ( P ^ A ) } ) -> P e. Prime )
21	17	adantl 277	. . . . . 6 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ m e. { x e. NN | x || ( P ^ A ) } ) -> m e. NN )
22	21	nnzd 9769	. . . . 5 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ m e. { x e. NN | x || ( P ^ A ) } ) -> m e. ZZ )
23	8	ad2antrr 492	. . . . . 6 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ m e. { x e. NN | x || ( P ^ A ) } ) -> P e. ZZ )
24		simplr 533	. . . . . 6 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ m e. { x e. NN | x || ( P ^ A ) } ) -> A e. NN0 )
25		zexpcl 10993	. . . . . 6 |- ( ( P e. ZZ /\ A e. NN0 ) -> ( P ^ A ) e. ZZ )
26	23, 24, 25	syl2anc 415	. . . . 5 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ m e. { x e. NN | x || ( P ^ A ) } ) -> ( P ^ A ) e. ZZ )
27		breq1 4133	. . . . . . . 8 |- ( x = m -> ( x || ( P ^ A ) <-> m || ( P ^ A ) ) )
28	27	elrab 2982	. . . . . . 7 |- ( m e. { x e. NN | x || ( P ^ A ) } <-> ( m e. NN /\ m || ( P ^ A ) ) )
29	28	simprbi 275	. . . . . 6 |- ( m e. { x e. NN | x || ( P ^ A ) } -> m || ( P ^ A ) )
30	29	adantl 277	. . . . 5 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ m e. { x e. NN | x || ( P ^ A ) } ) -> m || ( P ^ A ) )
31		pcdvdstr 13108	. . . . 5 |- ( ( P e. Prime /\ ( m e. ZZ /\ ( P ^ A ) e. ZZ /\ m || ( P ^ A ) ) ) -> ( P pCnt m ) <_ ( P pCnt ( P ^ A ) ) )
32	20, 22, 26, 30, 31	syl13anc 1280	. . . 4 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ m e. { x e. NN | x || ( P ^ A ) } ) -> ( P pCnt m ) <_ ( P pCnt ( P ^ A ) ) )
33		pcidlem 13104	. . . . 5 |- ( ( P e. Prime /\ A e. NN0 ) -> ( P pCnt ( P ^ A ) ) = A )
34	33	adantr 276	. . . 4 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ m e. { x e. NN | x || ( P ^ A ) } ) -> ( P pCnt ( P ^ A ) ) = A )
35	32, 34	breqtrd 4156	. . 3 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ m e. { x e. NN | x || ( P ^ A ) } ) -> ( P pCnt m ) <_ A )
36		fznn0 10522	. . . 4 |- ( A e. NN0 -> ( ( P pCnt m ) e. ( 0 ... A ) <-> ( ( P pCnt m ) e. NN0 /\ ( P pCnt m ) <_ A ) ) )
37	24, 36	syl 14	. . 3 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ m e. { x e. NN | x || ( P ^ A ) } ) -> ( ( P pCnt m ) e. ( 0 ... A ) <-> ( ( P pCnt m ) e. NN0 /\ ( P pCnt m ) <_ A ) ) )
38	19, 35, 37	mpbir2and 957	. 2 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ m e. { x e. NN | x || ( P ^ A ) } ) -> ( P pCnt m ) e. ( 0 ... A ) )
39		oveq2 6093	. . . . . . . . 9 |- ( n = A -> ( P ^ n ) = ( P ^ A ) )
40	39	breq2d 4142	. . . . . . . 8 |- ( n = A -> ( m || ( P ^ n ) <-> m || ( P ^ A ) ) )
41	40	rspcev 2929	. . . . . . 7 |- ( ( A e. NN0 /\ m || ( P ^ A ) ) -> E. n e. NN0 m || ( P ^ n ) )
42	24, 30, 41	syl2anc 415	. . . . . 6 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ m e. { x e. NN | x || ( P ^ A ) } ) -> E. n e. NN0 m || ( P ^ n ) )
43		pcprmpw2 13114	. . . . . . 7 |- ( ( P e. Prime /\ m e. NN ) -> ( E. n e. NN0 m || ( P ^ n ) <-> m = ( P ^ ( P pCnt m ) ) ) )
44	16, 17, 43	syl2an 289	. . . . . 6 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ m e. { x e. NN | x || ( P ^ A ) } ) -> ( E. n e. NN0 m || ( P ^ n ) <-> m = ( P ^ ( P pCnt m ) ) ) )
45	42, 44	mpbid 147	. . . . 5 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ m e. { x e. NN | x || ( P ^ A ) } ) -> m = ( P ^ ( P pCnt m ) ) )
46	45	adantrl 482	. . . 4 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ ( n e. ( 0 ... A ) /\ m e. { x e. NN | x || ( P ^ A ) } ) ) -> m = ( P ^ ( P pCnt m ) ) )
47		oveq2 6093	. . . . 5 |- ( n = ( P pCnt m ) -> ( P ^ n ) = ( P ^ ( P pCnt m ) ) )
48	47	eqeq2d 2250	. . . 4 |- ( n = ( P pCnt m ) -> ( m = ( P ^ n ) <-> m = ( P ^ ( P pCnt m ) ) ) )
49	46, 48	syl5ibrcom 157	. . 3 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ ( n e. ( 0 ... A ) /\ m e. { x e. NN | x || ( P ^ A ) } ) ) -> ( n = ( P pCnt m ) -> m = ( P ^ n ) ) )
50		elfzelz 10430	. . . . . . 7 |- ( n e. ( 0 ... A ) -> n e. ZZ )
51		pcid 13105	. . . . . . 7 |- ( ( P e. Prime /\ n e. ZZ ) -> ( P pCnt ( P ^ n ) ) = n )
52	16, 50, 51	syl2an 289	. . . . . 6 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ n e. ( 0 ... A ) ) -> ( P pCnt ( P ^ n ) ) = n )
53	52	eqcomd 2244	. . . . 5 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ n e. ( 0 ... A ) ) -> n = ( P pCnt ( P ^ n ) ) )
54	53	adantrr 483	. . . 4 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ ( n e. ( 0 ... A ) /\ m e. { x e. NN | x || ( P ^ A ) } ) ) -> n = ( P pCnt ( P ^ n ) ) )
55		oveq2 6093	. . . . 5 |- ( m = ( P ^ n ) -> ( P pCnt m ) = ( P pCnt ( P ^ n ) ) )
56	55	eqeq2d 2250	. . . 4 |- ( m = ( P ^ n ) -> ( n = ( P pCnt m ) <-> n = ( P pCnt ( P ^ n ) ) ) )
57	54, 56	syl5ibrcom 157	. . 3 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ ( n e. ( 0 ... A ) /\ m e. { x e. NN | x || ( P ^ A ) } ) ) -> ( m = ( P ^ n ) -> n = ( P pCnt m ) ) )
58	49, 57	impbid 129	. 2 |- ( ( ( P e. Prime /\ A e. NN0 ) /\ ( n e. ( 0 ... A ) /\ m e. { x e. NN | x || ( P ^ A ) } ) ) -> ( n = ( P pCnt m ) <-> m = ( P ^ n ) ) )
59	1, 15, 38, 58	f1o2d 6295	1 |- ( ( P e. Prime /\ A e. NN0 ) -> F : ( 0 ... A ) -1-1-onto-> { x e. NN | x || ( P ^ A ) } )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   E.wrex 2529   {crab 2532   class class class wbr 4130   |-> cmpt 4192   -1-1-onto->wf1o 5376   ` cfv 5377  (class class class)co 6085   0cc0 8179   <_ cle 8361   NNcn 9305   NN0cn0 9565   ZZcz 9646   ZZ>=cuz 9923   ...cfz 10413   ^cexp 10977   || cdvds 12556   Primecprime 12887   pCnt cpc 13065

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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298  ax-caucvg 8299

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 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-isom 5386  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-1o 6687  df-2o 6688  df-er 6807  df-en 7023  df-sup 7324  df-inf 7325  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8904  df-ap 8911  df-div 9004  df-inn 9306  df-2 9364  df-3 9365  df-4 9366  df-n0 9566  df-xnn0 9633  df-z 9647  df-uz 9924  df-q 10022  df-rp 10057  df-fz 10414  df-fzo 10552  df-fl 10707  df-mod 10762  df-seqfrec 10887  df-exp 10978  df-cj 11609  df-re 11610  df-im 11611  df-rsqrt 11766  df-abs 11767  df-dvds 12557  df-gcd 12733  df-prm 12888  df-pc 13066

This theorem is used by:  sgmppw  16112  0sgmppw  16113