Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ex-prmo | Structured version Visualization version GIF version |
Description: Example for df-prmo 16370: (#p‘10) = 2 · 3 · 5 · 7. (Contributed by AV, 6-Sep-2021.) |
Ref | Expression |
---|---|
ex-prmo | ⊢ (#p‘;10) = ;;210 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 10nn 12117 | . . . 4 ⊢ ;10 ∈ ℕ | |
2 | prmonn2 16377 | . . . 4 ⊢ (;10 ∈ ℕ → (#p‘;10) = if(;10 ∈ ℙ, ((#p‘(;10 − 1)) · ;10), (#p‘(;10 − 1)))) | |
3 | 1, 2 | ax-mp 5 | . . 3 ⊢ (#p‘;10) = if(;10 ∈ ℙ, ((#p‘(;10 − 1)) · ;10), (#p‘(;10 − 1))) |
4 | 10nprm 16449 | . . . 4 ⊢ ¬ ;10 ∈ ℙ | |
5 | 4 | iffalsei 4479 | . . 3 ⊢ if(;10 ∈ ℙ, ((#p‘(;10 − 1)) · ;10), (#p‘(;10 − 1))) = (#p‘(;10 − 1)) |
6 | 3, 5 | eqtri 2846 | . 2 ⊢ (#p‘;10) = (#p‘(;10 − 1)) |
7 | 10m1e9 12197 | . . 3 ⊢ (;10 − 1) = 9 | |
8 | 7 | fveq2i 6675 | . 2 ⊢ (#p‘(;10 − 1)) = (#p‘9) |
9 | 9nn 11738 | . . . . 5 ⊢ 9 ∈ ℕ | |
10 | prmonn2 16377 | . . . . 5 ⊢ (9 ∈ ℕ → (#p‘9) = if(9 ∈ ℙ, ((#p‘(9 − 1)) · 9), (#p‘(9 − 1)))) | |
11 | 9, 10 | ax-mp 5 | . . . 4 ⊢ (#p‘9) = if(9 ∈ ℙ, ((#p‘(9 − 1)) · 9), (#p‘(9 − 1))) |
12 | 9nprm 16448 | . . . . 5 ⊢ ¬ 9 ∈ ℙ | |
13 | 12 | iffalsei 4479 | . . . 4 ⊢ if(9 ∈ ℙ, ((#p‘(9 − 1)) · 9), (#p‘(9 − 1))) = (#p‘(9 − 1)) |
14 | 11, 13 | eqtri 2846 | . . 3 ⊢ (#p‘9) = (#p‘(9 − 1)) |
15 | 9m1e8 11774 | . . . 4 ⊢ (9 − 1) = 8 | |
16 | 15 | fveq2i 6675 | . . 3 ⊢ (#p‘(9 − 1)) = (#p‘8) |
17 | 8nn 11735 | . . . . . 6 ⊢ 8 ∈ ℕ | |
18 | prmonn2 16377 | . . . . . 6 ⊢ (8 ∈ ℕ → (#p‘8) = if(8 ∈ ℙ, ((#p‘(8 − 1)) · 8), (#p‘(8 − 1)))) | |
19 | 17, 18 | ax-mp 5 | . . . . 5 ⊢ (#p‘8) = if(8 ∈ ℙ, ((#p‘(8 − 1)) · 8), (#p‘(8 − 1))) |
20 | 8nprm 16447 | . . . . . 6 ⊢ ¬ 8 ∈ ℙ | |
21 | 20 | iffalsei 4479 | . . . . 5 ⊢ if(8 ∈ ℙ, ((#p‘(8 − 1)) · 8), (#p‘(8 − 1))) = (#p‘(8 − 1)) |
22 | 19, 21 | eqtri 2846 | . . . 4 ⊢ (#p‘8) = (#p‘(8 − 1)) |
23 | 8m1e7 11773 | . . . . 5 ⊢ (8 − 1) = 7 | |
24 | 23 | fveq2i 6675 | . . . 4 ⊢ (#p‘(8 − 1)) = (#p‘7) |
25 | 7nn 11732 | . . . . . 6 ⊢ 7 ∈ ℕ | |
26 | prmonn2 16377 | . . . . . 6 ⊢ (7 ∈ ℕ → (#p‘7) = if(7 ∈ ℙ, ((#p‘(7 − 1)) · 7), (#p‘(7 − 1)))) | |
27 | 25, 26 | ax-mp 5 | . . . . 5 ⊢ (#p‘7) = if(7 ∈ ℙ, ((#p‘(7 − 1)) · 7), (#p‘(7 − 1))) |
28 | 7prm 16446 | . . . . . 6 ⊢ 7 ∈ ℙ | |
29 | 28 | iftruei 4476 | . . . . 5 ⊢ if(7 ∈ ℙ, ((#p‘(7 − 1)) · 7), (#p‘(7 − 1))) = ((#p‘(7 − 1)) · 7) |
30 | 7nn0 11922 | . . . . . 6 ⊢ 7 ∈ ℕ0 | |
31 | 3nn0 11918 | . . . . . 6 ⊢ 3 ∈ ℕ0 | |
32 | 0nn0 11915 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
33 | 7m1e6 11772 | . . . . . . . 8 ⊢ (7 − 1) = 6 | |
34 | 33 | fveq2i 6675 | . . . . . . 7 ⊢ (#p‘(7 − 1)) = (#p‘6) |
35 | prmo6 16465 | . . . . . . 7 ⊢ (#p‘6) = ;30 | |
36 | 34, 35 | eqtri 2846 | . . . . . 6 ⊢ (#p‘(7 − 1)) = ;30 |
37 | 7cn 11734 | . . . . . . 7 ⊢ 7 ∈ ℂ | |
38 | 3cn 11721 | . . . . . . 7 ⊢ 3 ∈ ℂ | |
39 | 7t3e21 12211 | . . . . . . 7 ⊢ (7 · 3) = ;21 | |
40 | 37, 38, 39 | mulcomli 10652 | . . . . . 6 ⊢ (3 · 7) = ;21 |
41 | 37 | mul02i 10831 | . . . . . 6 ⊢ (0 · 7) = 0 |
42 | 30, 31, 32, 36, 40, 41 | decmul1 12165 | . . . . 5 ⊢ ((#p‘(7 − 1)) · 7) = ;;210 |
43 | 27, 29, 42 | 3eqtri 2850 | . . . 4 ⊢ (#p‘7) = ;;210 |
44 | 22, 24, 43 | 3eqtri 2850 | . . 3 ⊢ (#p‘8) = ;;210 |
45 | 14, 16, 44 | 3eqtri 2850 | . 2 ⊢ (#p‘9) = ;;210 |
46 | 6, 8, 45 | 3eqtri 2850 | 1 ⊢ (#p‘;10) = ;;210 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∈ wcel 2114 ifcif 4469 ‘cfv 6357 (class class class)co 7158 0cc0 10539 1c1 10540 · cmul 10544 − cmin 10872 ℕcn 11640 2c2 11695 3c3 11696 6c6 11699 7c7 11700 8c8 11701 9c9 11702 ;cdc 12101 ℙcprime 16017 #pcprmo 16369 |
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 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-inf2 9106 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617 |
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 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-se 5517 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-isom 6366 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-2o 8105 df-oadd 8108 df-er 8291 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-sup 8908 df-inf 8909 df-oi 8976 df-card 9370 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-div 11300 df-nn 11641 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-6 11707 df-7 11708 df-8 11709 df-9 11710 df-n0 11901 df-z 11985 df-dec 12102 df-uz 12247 df-rp 12393 df-fz 12896 df-fzo 13037 df-seq 13373 df-exp 13433 df-hash 13694 df-cj 14460 df-re 14461 df-im 14462 df-sqrt 14596 df-abs 14597 df-clim 14847 df-prod 15262 df-dvds 15610 df-prm 16018 df-prmo 16370 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |