Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 1arithlem4 | Structured version Visualization version GIF version |
Description: Lemma for 1arith 16246. (Contributed by Mario Carneiro, 30-May-2014.) |
Ref | Expression |
---|---|
1arith.1 | ⊢ 𝑀 = (𝑛 ∈ ℕ ↦ (𝑝 ∈ ℙ ↦ (𝑝 pCnt 𝑛))) |
1arithlem4.2 | ⊢ 𝐺 = (𝑦 ∈ ℕ ↦ if(𝑦 ∈ ℙ, (𝑦↑(𝐹‘𝑦)), 1)) |
1arithlem4.3 | ⊢ (𝜑 → 𝐹:ℙ⟶ℕ0) |
1arithlem4.4 | ⊢ (𝜑 → 𝑁 ∈ ℕ) |
1arithlem4.5 | ⊢ ((𝜑 ∧ (𝑞 ∈ ℙ ∧ 𝑁 ≤ 𝑞)) → (𝐹‘𝑞) = 0) |
Ref | Expression |
---|---|
1arithlem4 | ⊢ (𝜑 → ∃𝑥 ∈ ℕ 𝐹 = (𝑀‘𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1arithlem4.2 | . . . . 5 ⊢ 𝐺 = (𝑦 ∈ ℕ ↦ if(𝑦 ∈ ℙ, (𝑦↑(𝐹‘𝑦)), 1)) | |
2 | 1arithlem4.3 | . . . . . . 7 ⊢ (𝜑 → 𝐹:ℙ⟶ℕ0) | |
3 | 2 | ffvelrnda 6837 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℙ) → (𝐹‘𝑦) ∈ ℕ0) |
4 | 3 | ralrimiva 3182 | . . . . 5 ⊢ (𝜑 → ∀𝑦 ∈ ℙ (𝐹‘𝑦) ∈ ℕ0) |
5 | 1, 4 | pcmptcl 16210 | . . . 4 ⊢ (𝜑 → (𝐺:ℕ⟶ℕ ∧ seq1( · , 𝐺):ℕ⟶ℕ)) |
6 | 5 | simprd 498 | . . 3 ⊢ (𝜑 → seq1( · , 𝐺):ℕ⟶ℕ) |
7 | 1arithlem4.4 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
8 | 6, 7 | ffvelrnd 6838 | . 2 ⊢ (𝜑 → (seq1( · , 𝐺)‘𝑁) ∈ ℕ) |
9 | 1arith.1 | . . . . . . 7 ⊢ 𝑀 = (𝑛 ∈ ℕ ↦ (𝑝 ∈ ℙ ↦ (𝑝 pCnt 𝑛))) | |
10 | 9 | 1arithlem2 16243 | . . . . . 6 ⊢ (((seq1( · , 𝐺)‘𝑁) ∈ ℕ ∧ 𝑞 ∈ ℙ) → ((𝑀‘(seq1( · , 𝐺)‘𝑁))‘𝑞) = (𝑞 pCnt (seq1( · , 𝐺)‘𝑁))) |
11 | 8, 10 | sylan 582 | . . . . 5 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → ((𝑀‘(seq1( · , 𝐺)‘𝑁))‘𝑞) = (𝑞 pCnt (seq1( · , 𝐺)‘𝑁))) |
12 | 4 | adantr 483 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → ∀𝑦 ∈ ℙ (𝐹‘𝑦) ∈ ℕ0) |
13 | 7 | adantr 483 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → 𝑁 ∈ ℕ) |
14 | simpr 487 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → 𝑞 ∈ ℙ) | |
15 | fveq2 6656 | . . . . . 6 ⊢ (𝑦 = 𝑞 → (𝐹‘𝑦) = (𝐹‘𝑞)) | |
16 | 1, 12, 13, 14, 15 | pcmpt 16211 | . . . . 5 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (𝑞 pCnt (seq1( · , 𝐺)‘𝑁)) = if(𝑞 ≤ 𝑁, (𝐹‘𝑞), 0)) |
17 | 13 | nnred 11639 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → 𝑁 ∈ ℝ) |
18 | prmz 16002 | . . . . . . . 8 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℤ) | |
19 | 18 | zred 12074 | . . . . . . 7 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℝ) |
20 | 19 | adantl 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → 𝑞 ∈ ℝ) |
21 | ifid 4492 | . . . . . . 7 ⊢ if(𝑞 ≤ 𝑁, (𝐹‘𝑞), (𝐹‘𝑞)) = (𝐹‘𝑞) | |
22 | 1arithlem4.5 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑞 ∈ ℙ ∧ 𝑁 ≤ 𝑞)) → (𝐹‘𝑞) = 0) | |
23 | 22 | anassrs 470 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑁 ≤ 𝑞) → (𝐹‘𝑞) = 0) |
24 | 23 | ifeq2d 4472 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑁 ≤ 𝑞) → if(𝑞 ≤ 𝑁, (𝐹‘𝑞), (𝐹‘𝑞)) = if(𝑞 ≤ 𝑁, (𝐹‘𝑞), 0)) |
25 | 21, 24 | syl5reqr 2871 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑁 ≤ 𝑞) → if(𝑞 ≤ 𝑁, (𝐹‘𝑞), 0) = (𝐹‘𝑞)) |
26 | iftrue 4459 | . . . . . . 7 ⊢ (𝑞 ≤ 𝑁 → if(𝑞 ≤ 𝑁, (𝐹‘𝑞), 0) = (𝐹‘𝑞)) | |
27 | 26 | adantl 484 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ≤ 𝑁) → if(𝑞 ≤ 𝑁, (𝐹‘𝑞), 0) = (𝐹‘𝑞)) |
28 | 17, 20, 25, 27 | lecasei 10732 | . . . . 5 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → if(𝑞 ≤ 𝑁, (𝐹‘𝑞), 0) = (𝐹‘𝑞)) |
29 | 11, 16, 28 | 3eqtrrd 2861 | . . . 4 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (𝐹‘𝑞) = ((𝑀‘(seq1( · , 𝐺)‘𝑁))‘𝑞)) |
30 | 29 | ralrimiva 3182 | . . 3 ⊢ (𝜑 → ∀𝑞 ∈ ℙ (𝐹‘𝑞) = ((𝑀‘(seq1( · , 𝐺)‘𝑁))‘𝑞)) |
31 | 9 | 1arithlem3 16244 | . . . . 5 ⊢ ((seq1( · , 𝐺)‘𝑁) ∈ ℕ → (𝑀‘(seq1( · , 𝐺)‘𝑁)):ℙ⟶ℕ0) |
32 | 8, 31 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑀‘(seq1( · , 𝐺)‘𝑁)):ℙ⟶ℕ0) |
33 | ffn 6500 | . . . . 5 ⊢ (𝐹:ℙ⟶ℕ0 → 𝐹 Fn ℙ) | |
34 | ffn 6500 | . . . . 5 ⊢ ((𝑀‘(seq1( · , 𝐺)‘𝑁)):ℙ⟶ℕ0 → (𝑀‘(seq1( · , 𝐺)‘𝑁)) Fn ℙ) | |
35 | eqfnfv 6788 | . . . . 5 ⊢ ((𝐹 Fn ℙ ∧ (𝑀‘(seq1( · , 𝐺)‘𝑁)) Fn ℙ) → (𝐹 = (𝑀‘(seq1( · , 𝐺)‘𝑁)) ↔ ∀𝑞 ∈ ℙ (𝐹‘𝑞) = ((𝑀‘(seq1( · , 𝐺)‘𝑁))‘𝑞))) | |
36 | 33, 34, 35 | syl2an 597 | . . . 4 ⊢ ((𝐹:ℙ⟶ℕ0 ∧ (𝑀‘(seq1( · , 𝐺)‘𝑁)):ℙ⟶ℕ0) → (𝐹 = (𝑀‘(seq1( · , 𝐺)‘𝑁)) ↔ ∀𝑞 ∈ ℙ (𝐹‘𝑞) = ((𝑀‘(seq1( · , 𝐺)‘𝑁))‘𝑞))) |
37 | 2, 32, 36 | syl2anc 586 | . . 3 ⊢ (𝜑 → (𝐹 = (𝑀‘(seq1( · , 𝐺)‘𝑁)) ↔ ∀𝑞 ∈ ℙ (𝐹‘𝑞) = ((𝑀‘(seq1( · , 𝐺)‘𝑁))‘𝑞))) |
38 | 30, 37 | mpbird 259 | . 2 ⊢ (𝜑 → 𝐹 = (𝑀‘(seq1( · , 𝐺)‘𝑁))) |
39 | fveq2 6656 | . . 3 ⊢ (𝑥 = (seq1( · , 𝐺)‘𝑁) → (𝑀‘𝑥) = (𝑀‘(seq1( · , 𝐺)‘𝑁))) | |
40 | 39 | rspceeqv 3630 | . 2 ⊢ (((seq1( · , 𝐺)‘𝑁) ∈ ℕ ∧ 𝐹 = (𝑀‘(seq1( · , 𝐺)‘𝑁))) → ∃𝑥 ∈ ℕ 𝐹 = (𝑀‘𝑥)) |
41 | 8, 38, 40 | syl2anc 586 | 1 ⊢ (𝜑 → ∃𝑥 ∈ ℕ 𝐹 = (𝑀‘𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∀wral 3138 ∃wrex 3139 ifcif 4453 class class class wbr 5052 ↦ cmpt 5132 Fn wfn 6336 ⟶wf 6337 ‘cfv 6341 (class class class)co 7142 ℝcr 10522 0cc0 10523 1c1 10524 · cmul 10528 ≤ cle 10662 ℕcn 11624 ℕ0cn0 11884 seqcseq 13359 ↑cexp 13419 ℙcprime 15998 pCnt cpc 16156 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5176 ax-sep 5189 ax-nul 5196 ax-pow 5252 ax-pr 5316 ax-un 7447 ax-cnex 10579 ax-resscn 10580 ax-1cn 10581 ax-icn 10582 ax-addcl 10583 ax-addrcl 10584 ax-mulcl 10585 ax-mulrcl 10586 ax-mulcom 10587 ax-addass 10588 ax-mulass 10589 ax-distr 10590 ax-i2m1 10591 ax-1ne0 10592 ax-1rid 10593 ax-rnegex 10594 ax-rrecex 10595 ax-cnre 10596 ax-pre-lttri 10597 ax-pre-lttrn 10598 ax-pre-ltadd 10599 ax-pre-mulgt0 10600 ax-pre-sup 10601 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-fal 1550 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3488 df-sbc 3764 df-csb 3872 df-dif 3927 df-un 3929 df-in 3931 df-ss 3940 df-pss 3942 df-nul 4280 df-if 4454 df-pw 4527 df-sn 4554 df-pr 4556 df-tp 4558 df-op 4560 df-uni 4825 df-iun 4907 df-br 5053 df-opab 5115 df-mpt 5133 df-tr 5159 df-id 5446 df-eprel 5451 df-po 5460 df-so 5461 df-fr 5500 df-we 5502 df-xp 5547 df-rel 5548 df-cnv 5549 df-co 5550 df-dm 5551 df-rn 5552 df-res 5553 df-ima 5554 df-pred 6134 df-ord 6180 df-on 6181 df-lim 6182 df-suc 6183 df-iota 6300 df-fun 6343 df-fn 6344 df-f 6345 df-f1 6346 df-fo 6347 df-f1o 6348 df-fv 6349 df-riota 7100 df-ov 7145 df-oprab 7146 df-mpo 7147 df-om 7567 df-1st 7675 df-2nd 7676 df-wrecs 7933 df-recs 7994 df-rdg 8032 df-1o 8088 df-2o 8089 df-er 8275 df-en 8496 df-dom 8497 df-sdom 8498 df-fin 8499 df-sup 8892 df-inf 8893 df-pnf 10663 df-mnf 10664 df-xr 10665 df-ltxr 10666 df-le 10667 df-sub 10858 df-neg 10859 df-div 11284 df-nn 11625 df-2 11687 df-3 11688 df-n0 11885 df-z 11969 df-uz 12231 df-q 12336 df-rp 12377 df-fz 12883 df-fl 13152 df-mod 13228 df-seq 13360 df-exp 13420 df-cj 14443 df-re 14444 df-im 14445 df-sqrt 14579 df-abs 14580 df-dvds 15593 df-gcd 15827 df-prm 15999 df-pc 16157 |
This theorem is referenced by: 1arith 16246 |
Copyright terms: Public domain | W3C validator |