Theorem 1arithlem4 12938

Description: Lemma for 1arith 12939. (Contributed by Mario Carneiro, 30-May-2014.)

Hypotheses

Ref	Expression
1arith.1	|- M = ( n e. NN |-> ( p e. Prime |-> ( p pCnt n ) ) )
1arithlem4.2	|- G = ( y e. NN |-> if ( y e. Prime , ( y ^ ( F ` y ) ) , 1 ) )
1arithlem4.3	|- ( ph -> F : Prime --> NN0 )
1arithlem4.4	|- ( ph -> N e. NN )
1arithlem4.5	|- ( ( ph /\ ( q e. Prime /\ N <_ q ) ) -> ( F ` q ) = 0 )

Assertion

Ref	Expression
1arithlem4	|- ( ph -> E. x e. NN F = ( M ` x ) )

Distinct variable groups:   n, p, q, x, y   F, q, x, y   M, q, x, y   ph, q, y   n, G, p, q, x   n, N, p, q, x

Allowed substitution hints:   ph( x, n, p)   F( n, p)   G( y)   M( n, p)   N( y)

Proof of Theorem 1arithlem4

Step	Hyp	Ref	Expression
1		1arithlem4.2	. . . . 5 |- G = ( y e. NN |-> if ( y e. Prime , ( y ^ ( F ` y ) ) , 1 ) )
2		1arithlem4.3	. . . . . . 7 |- ( ph -> F : Prime --> NN0 )
3	2	ffvelcdmda 5782	. . . . . 6 |- ( ( ph /\ y e. Prime ) -> ( F ` y ) e. NN0 )
4	3	ralrimiva 2605	. . . . 5 |- ( ph -> A. y e. Prime ( F ` y ) e. NN0 )
5	1, 4	pcmptcl 12914	. . . 4 |- ( ph -> ( G : NN --> NN /\ seq 1 ( x. , G ) : NN --> NN ) )
6	5	simprd 114	. . 3 |- ( ph -> seq 1 ( x. , G ) : NN --> NN )
7		1arithlem4.4	. . 3 |- ( ph -> N e. NN )
8	6, 7	ffvelcdmd 5783	. 2 |- ( ph -> ( seq 1 ( x. , G ) ` N ) e. NN )
9		1arith.1	. . . . . . 7 |- M = ( n e. NN |-> ( p e. Prime |-> ( p pCnt n ) ) )
10	9	1arithlem2 12936	. . . . . 6 |- ( ( ( seq 1 ( x. , G ) ` N ) e. NN /\ q e. Prime ) -> ( ( M ` ( seq 1 ( x. , G ) ` N ) ) ` q ) = ( q pCnt ( seq 1 ( x. , G ) ` N ) ) )
11	8, 10	sylan 283	. . . . 5 |- ( ( ph /\ q e. Prime ) -> ( ( M ` ( seq 1 ( x. , G ) ` N ) ) ` q ) = ( q pCnt ( seq 1 ( x. , G ) ` N ) ) )
12	4	adantr 276	. . . . . 6 |- ( ( ph /\ q e. Prime ) -> A. y e. Prime ( F ` y ) e. NN0 )
13	7	adantr 276	. . . . . 6 |- ( ( ph /\ q e. Prime ) -> N e. NN )
14		simpr 110	. . . . . 6 |- ( ( ph /\ q e. Prime ) -> q e. Prime )
15		fveq2 5639	. . . . . 6 |- ( y = q -> ( F ` y ) = ( F ` q ) )
16	1, 12, 13, 14, 15	pcmpt 12915	. . . . 5 |- ( ( ph /\ q e. Prime ) -> ( q pCnt ( seq 1 ( x. , G ) ` N ) ) = if ( q <_ N , ( F ` q ) , 0 ) )
17		1arithlem4.5	. . . . . . . . 9 |- ( ( ph /\ ( q e. Prime /\ N <_ q ) ) -> ( F ` q ) = 0 )
18	17	anassrs 400	. . . . . . . 8 |- ( ( ( ph /\ q e. Prime ) /\ N <_ q ) -> ( F ` q ) = 0 )
19	18	ifeq2d 3624	. . . . . . 7 |- ( ( ( ph /\ q e. Prime ) /\ N <_ q ) -> if ( q <_ N , ( F ` q ) , ( F ` q ) ) = if ( q <_ N , ( F ` q ) , 0 ) )
20		prmz 12682	. . . . . . . . . . 11 |- ( q e. Prime -> q e. ZZ )
21	20	adantl 277	. . . . . . . . . 10 |- ( ( ph /\ q e. Prime ) -> q e. ZZ )
22	13	nnzd 9600	. . . . . . . . . 10 |- ( ( ph /\ q e. Prime ) -> N e. ZZ )
23		zdcle 9555	. . . . . . . . . 10 |- ( ( q e. ZZ /\ N e. ZZ ) -> DECID q <_ N )
24	21, 22, 23	syl2anc 411	. . . . . . . . 9 |- ( ( ph /\ q e. Prime ) -> DECID q <_ N )
25		ifiddc 3641	. . . . . . . . 9 |- (DECID q <_ N -> if ( q <_ N , ( F ` q ) , ( F ` q ) ) = ( F ` q ) )
26	24, 25	syl 14	. . . . . . . 8 |- ( ( ph /\ q e. Prime ) -> if ( q <_ N , ( F ` q ) , ( F ` q ) ) = ( F ` q ) )
27	26	adantr 276	. . . . . . 7 |- ( ( ( ph /\ q e. Prime ) /\ N <_ q ) -> if ( q <_ N , ( F ` q ) , ( F ` q ) ) = ( F ` q ) )
28	19, 27	eqtr3d 2266	. . . . . 6 |- ( ( ( ph /\ q e. Prime ) /\ N <_ q ) -> if ( q <_ N , ( F ` q ) , 0 ) = ( F ` q ) )
29		iftrue 3610	. . . . . . 7 |- ( q <_ N -> if ( q <_ N , ( F ` q ) , 0 ) = ( F ` q ) )
30	29	adantl 277	. . . . . 6 |- ( ( ( ph /\ q e. Prime ) /\ q <_ N ) -> if ( q <_ N , ( F ` q ) , 0 ) = ( F ` q ) )
31		zletric 9522	. . . . . . 7 |- ( ( N e. ZZ /\ q e. ZZ ) -> ( N <_ q \/ q <_ N ) )
32	22, 21, 31	syl2anc 411	. . . . . 6 |- ( ( ph /\ q e. Prime ) -> ( N <_ q \/ q <_ N ) )
33	28, 30, 32	mpjaodan 805	. . . . 5 |- ( ( ph /\ q e. Prime ) -> if ( q <_ N , ( F ` q ) , 0 ) = ( F ` q ) )
34	11, 16, 33	3eqtrrd 2269	. . . 4 |- ( ( ph /\ q e. Prime ) -> ( F ` q ) = ( ( M ` ( seq 1 ( x. , G ) ` N ) ) ` q ) )
35	34	ralrimiva 2605	. . 3 |- ( ph -> A. q e. Prime ( F ` q ) = ( ( M ` ( seq 1 ( x. , G ) ` N ) ) ` q ) )
36	9	1arithlem3 12937	. . . . 5 |- ( ( seq 1 ( x. , G ) ` N ) e. NN -> ( M ` ( seq 1 ( x. , G ) ` N ) ) : Prime --> NN0 )
37	8, 36	syl 14	. . . 4 |- ( ph -> ( M ` ( seq 1 ( x. , G ) ` N ) ) : Prime --> NN0 )
38		ffn 5482	. . . . 5 |- ( F : Prime --> NN0 -> F Fn Prime )
39		ffn 5482	. . . . 5 |- ( ( M ` ( seq 1 ( x. , G ) ` N ) ) : Prime --> NN0 -> ( M ` ( seq 1 ( x. , G ) ` N ) ) Fn Prime )
40		eqfnfv 5744	. . . . 5 |- ( ( F Fn Prime /\ ( M ` ( seq 1 ( x. , G ) ` N ) ) Fn Prime ) -> ( F = ( M ` ( seq 1 ( x. , G ) ` N ) ) <-> A. q e. Prime ( F ` q ) = ( ( M ` ( seq 1 ( x. , G ) ` N ) ) ` q ) ) )
41	38, 39, 40	syl2an 289	. . . 4 |- ( ( F : Prime --> NN0 /\ ( M ` ( seq 1 ( x. , G ) ` N ) ) : Prime --> NN0 ) -> ( F = ( M ` ( seq 1 ( x. , G ) ` N ) ) <-> A. q e. Prime ( F ` q ) = ( ( M ` ( seq 1 ( x. , G ) ` N ) ) ` q ) ) )
42	2, 37, 41	syl2anc 411	. . 3 |- ( ph -> ( F = ( M ` ( seq 1 ( x. , G ) ` N ) ) <-> A. q e. Prime ( F ` q ) = ( ( M ` ( seq 1 ( x. , G ) ` N ) ) ` q ) ) )
43	35, 42	mpbird 167	. 2 |- ( ph -> F = ( M ` ( seq 1 ( x. , G ) ` N ) ) )
44		fveq2 5639	. . 3 |- ( x = ( seq 1 ( x. , G ) ` N ) -> ( M ` x ) = ( M ` ( seq 1 ( x. , G ) ` N ) ) )
45	44	rspceeqv 2928	. 2 |- ( ( ( seq 1 ( x. , G ) ` N ) e. NN /\ F = ( M ` ( seq 1 ( x. , G ) ` N ) ) ) -> E. x e. NN F = ( M ` x ) )
46	8, 43, 45	syl2anc 411	1 |- ( ph -> E. x e. NN F = ( M ` x ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 715  DECID wdc 841   = wceq 1397   e. wcel 2202   A.wral 2510   E.wrex 2511   ifcif 3605   class class class wbr 4088   |-> cmpt 4150   Fn wfn 5321   -->wf 5322   ` cfv 5326  (class class class)co 6017   0cc0 8031   1c1 8032   x. cmul 8036   <_ cle 8214   NNcn 9142   NN0cn0 9401   ZZcz 9478   seqcseq 10708   ^cexp 10799   Primecprime 12678   pCnt cpc 12856

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148  ax-pre-mulext 8149  ax-arch 8150  ax-caucvg 8151

This theorem depends on definitions:  df-bi 117  df-stab 838  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-isom 5335  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-frec 6556  df-1o 6581  df-2o 6582  df-er 6701  df-en 6909  df-fin 6911  df-sup 7182  df-inf 7183  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-reap 8754  df-ap 8761  df-div 8852  df-inn 9143  df-2 9201  df-3 9202  df-4 9203  df-n0 9402  df-z 9479  df-uz 9755  df-q 9853  df-rp 9888  df-fz 10243  df-fzo 10377  df-fl 10529  df-mod 10584  df-seqfrec 10709  df-exp 10800  df-cj 11402  df-re 11403  df-im 11404  df-rsqrt 11558  df-abs 11559  df-dvds 12348  df-gcd 12524  df-prm 12679  df-pc 12857

This theorem is referenced by:  1arith  12939