![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 1arithlem4 | Structured version Visualization version GIF version |
Description: Lemma for 1arith 16253. (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 6828 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℙ) → (𝐹‘𝑦) ∈ ℕ0) |
4 | 3 | ralrimiva 3149 | . . . . 5 ⊢ (𝜑 → ∀𝑦 ∈ ℙ (𝐹‘𝑦) ∈ ℕ0) |
5 | 1, 4 | pcmptcl 16217 | . . . 4 ⊢ (𝜑 → (𝐺:ℕ⟶ℕ ∧ seq1( · , 𝐺):ℕ⟶ℕ)) |
6 | 5 | simprd 499 | . . 3 ⊢ (𝜑 → seq1( · , 𝐺):ℕ⟶ℕ) |
7 | 1arithlem4.4 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
8 | 6, 7 | ffvelrnd 6829 | . 2 ⊢ (𝜑 → (seq1( · , 𝐺)‘𝑁) ∈ ℕ) |
9 | 1arith.1 | . . . . . . 7 ⊢ 𝑀 = (𝑛 ∈ ℕ ↦ (𝑝 ∈ ℙ ↦ (𝑝 pCnt 𝑛))) | |
10 | 9 | 1arithlem2 16250 | . . . . . 6 ⊢ (((seq1( · , 𝐺)‘𝑁) ∈ ℕ ∧ 𝑞 ∈ ℙ) → ((𝑀‘(seq1( · , 𝐺)‘𝑁))‘𝑞) = (𝑞 pCnt (seq1( · , 𝐺)‘𝑁))) |
11 | 8, 10 | sylan 583 | . . . . 5 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → ((𝑀‘(seq1( · , 𝐺)‘𝑁))‘𝑞) = (𝑞 pCnt (seq1( · , 𝐺)‘𝑁))) |
12 | 4 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → ∀𝑦 ∈ ℙ (𝐹‘𝑦) ∈ ℕ0) |
13 | 7 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → 𝑁 ∈ ℕ) |
14 | simpr 488 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → 𝑞 ∈ ℙ) | |
15 | fveq2 6645 | . . . . . 6 ⊢ (𝑦 = 𝑞 → (𝐹‘𝑦) = (𝐹‘𝑞)) | |
16 | 1, 12, 13, 14, 15 | pcmpt 16218 | . . . . 5 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (𝑞 pCnt (seq1( · , 𝐺)‘𝑁)) = if(𝑞 ≤ 𝑁, (𝐹‘𝑞), 0)) |
17 | 13 | nnred 11640 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → 𝑁 ∈ ℝ) |
18 | prmz 16009 | . . . . . . . 8 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℤ) | |
19 | 18 | zred 12075 | . . . . . . 7 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℝ) |
20 | 19 | adantl 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → 𝑞 ∈ ℝ) |
21 | ifid 4464 | . . . . . . 7 ⊢ if(𝑞 ≤ 𝑁, (𝐹‘𝑞), (𝐹‘𝑞)) = (𝐹‘𝑞) | |
22 | 1arithlem4.5 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑞 ∈ ℙ ∧ 𝑁 ≤ 𝑞)) → (𝐹‘𝑞) = 0) | |
23 | 22 | anassrs 471 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑁 ≤ 𝑞) → (𝐹‘𝑞) = 0) |
24 | 23 | ifeq2d 4444 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑁 ≤ 𝑞) → if(𝑞 ≤ 𝑁, (𝐹‘𝑞), (𝐹‘𝑞)) = if(𝑞 ≤ 𝑁, (𝐹‘𝑞), 0)) |
25 | 21, 24 | syl5reqr 2848 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑁 ≤ 𝑞) → if(𝑞 ≤ 𝑁, (𝐹‘𝑞), 0) = (𝐹‘𝑞)) |
26 | iftrue 4431 | . . . . . . 7 ⊢ (𝑞 ≤ 𝑁 → if(𝑞 ≤ 𝑁, (𝐹‘𝑞), 0) = (𝐹‘𝑞)) | |
27 | 26 | adantl 485 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ≤ 𝑁) → if(𝑞 ≤ 𝑁, (𝐹‘𝑞), 0) = (𝐹‘𝑞)) |
28 | 17, 20, 25, 27 | lecasei 10735 | . . . . 5 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → if(𝑞 ≤ 𝑁, (𝐹‘𝑞), 0) = (𝐹‘𝑞)) |
29 | 11, 16, 28 | 3eqtrrd 2838 | . . . 4 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (𝐹‘𝑞) = ((𝑀‘(seq1( · , 𝐺)‘𝑁))‘𝑞)) |
30 | 29 | ralrimiva 3149 | . . 3 ⊢ (𝜑 → ∀𝑞 ∈ ℙ (𝐹‘𝑞) = ((𝑀‘(seq1( · , 𝐺)‘𝑁))‘𝑞)) |
31 | 9 | 1arithlem3 16251 | . . . . 5 ⊢ ((seq1( · , 𝐺)‘𝑁) ∈ ℕ → (𝑀‘(seq1( · , 𝐺)‘𝑁)):ℙ⟶ℕ0) |
32 | 8, 31 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑀‘(seq1( · , 𝐺)‘𝑁)):ℙ⟶ℕ0) |
33 | ffn 6487 | . . . . 5 ⊢ (𝐹:ℙ⟶ℕ0 → 𝐹 Fn ℙ) | |
34 | ffn 6487 | . . . . 5 ⊢ ((𝑀‘(seq1( · , 𝐺)‘𝑁)):ℙ⟶ℕ0 → (𝑀‘(seq1( · , 𝐺)‘𝑁)) Fn ℙ) | |
35 | eqfnfv 6779 | . . . . 5 ⊢ ((𝐹 Fn ℙ ∧ (𝑀‘(seq1( · , 𝐺)‘𝑁)) Fn ℙ) → (𝐹 = (𝑀‘(seq1( · , 𝐺)‘𝑁)) ↔ ∀𝑞 ∈ ℙ (𝐹‘𝑞) = ((𝑀‘(seq1( · , 𝐺)‘𝑁))‘𝑞))) | |
36 | 33, 34, 35 | syl2an 598 | . . . 4 ⊢ ((𝐹:ℙ⟶ℕ0 ∧ (𝑀‘(seq1( · , 𝐺)‘𝑁)):ℙ⟶ℕ0) → (𝐹 = (𝑀‘(seq1( · , 𝐺)‘𝑁)) ↔ ∀𝑞 ∈ ℙ (𝐹‘𝑞) = ((𝑀‘(seq1( · , 𝐺)‘𝑁))‘𝑞))) |
37 | 2, 32, 36 | syl2anc 587 | . . 3 ⊢ (𝜑 → (𝐹 = (𝑀‘(seq1( · , 𝐺)‘𝑁)) ↔ ∀𝑞 ∈ ℙ (𝐹‘𝑞) = ((𝑀‘(seq1( · , 𝐺)‘𝑁))‘𝑞))) |
38 | 30, 37 | mpbird 260 | . 2 ⊢ (𝜑 → 𝐹 = (𝑀‘(seq1( · , 𝐺)‘𝑁))) |
39 | fveq2 6645 | . . 3 ⊢ (𝑥 = (seq1( · , 𝐺)‘𝑁) → (𝑀‘𝑥) = (𝑀‘(seq1( · , 𝐺)‘𝑁))) | |
40 | 39 | rspceeqv 3586 | . 2 ⊢ (((seq1( · , 𝐺)‘𝑁) ∈ ℕ ∧ 𝐹 = (𝑀‘(seq1( · , 𝐺)‘𝑁))) → ∃𝑥 ∈ ℕ 𝐹 = (𝑀‘𝑥)) |
41 | 8, 38, 40 | syl2anc 587 | 1 ⊢ (𝜑 → ∃𝑥 ∈ ℕ 𝐹 = (𝑀‘𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∀wral 3106 ∃wrex 3107 ifcif 4425 class class class wbr 5030 ↦ cmpt 5110 Fn wfn 6319 ⟶wf 6320 ‘cfv 6324 (class class class)co 7135 ℝcr 10525 0cc0 10526 1c1 10527 · cmul 10531 ≤ cle 10665 ℕcn 11625 ℕ0cn0 11885 seqcseq 13364 ↑cexp 13425 ℙcprime 16005 pCnt cpc 16163 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-2o 8086 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-sup 8890 df-inf 8891 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-2 11688 df-3 11689 df-n0 11886 df-z 11970 df-uz 12232 df-q 12337 df-rp 12378 df-fz 12886 df-fl 13157 df-mod 13233 df-seq 13365 df-exp 13426 df-cj 14450 df-re 14451 df-im 14452 df-sqrt 14586 df-abs 14587 df-dvds 15600 df-gcd 15834 df-prm 16006 df-pc 16164 |
This theorem is referenced by: 1arith 16253 |
Copyright terms: Public domain | W3C validator |