![]() |
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 16358: (#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 12102 | . . . 4 ⊢ ;10 ∈ ℕ | |
2 | prmonn2 16365 | . . . 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 16439 | . . . 4 ⊢ ¬ ;10 ∈ ℙ | |
5 | 4 | iffalsei 4435 | . . 3 ⊢ if(;10 ∈ ℙ, ((#p‘(;10 − 1)) · ;10), (#p‘(;10 − 1))) = (#p‘(;10 − 1)) |
6 | 3, 5 | eqtri 2821 | . 2 ⊢ (#p‘;10) = (#p‘(;10 − 1)) |
7 | 10m1e9 12182 | . . 3 ⊢ (;10 − 1) = 9 | |
8 | 7 | fveq2i 6648 | . 2 ⊢ (#p‘(;10 − 1)) = (#p‘9) |
9 | 9nn 11723 | . . . . 5 ⊢ 9 ∈ ℕ | |
10 | prmonn2 16365 | . . . . 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 16438 | . . . . 5 ⊢ ¬ 9 ∈ ℙ | |
13 | 12 | iffalsei 4435 | . . . 4 ⊢ if(9 ∈ ℙ, ((#p‘(9 − 1)) · 9), (#p‘(9 − 1))) = (#p‘(9 − 1)) |
14 | 11, 13 | eqtri 2821 | . . 3 ⊢ (#p‘9) = (#p‘(9 − 1)) |
15 | 9m1e8 11759 | . . . 4 ⊢ (9 − 1) = 8 | |
16 | 15 | fveq2i 6648 | . . 3 ⊢ (#p‘(9 − 1)) = (#p‘8) |
17 | 8nn 11720 | . . . . . 6 ⊢ 8 ∈ ℕ | |
18 | prmonn2 16365 | . . . . . 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 16437 | . . . . . 6 ⊢ ¬ 8 ∈ ℙ | |
21 | 20 | iffalsei 4435 | . . . . 5 ⊢ if(8 ∈ ℙ, ((#p‘(8 − 1)) · 8), (#p‘(8 − 1))) = (#p‘(8 − 1)) |
22 | 19, 21 | eqtri 2821 | . . . 4 ⊢ (#p‘8) = (#p‘(8 − 1)) |
23 | 8m1e7 11758 | . . . . 5 ⊢ (8 − 1) = 7 | |
24 | 23 | fveq2i 6648 | . . . 4 ⊢ (#p‘(8 − 1)) = (#p‘7) |
25 | 7nn 11717 | . . . . . 6 ⊢ 7 ∈ ℕ | |
26 | prmonn2 16365 | . . . . . 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 16436 | . . . . . 6 ⊢ 7 ∈ ℙ | |
29 | 28 | iftruei 4432 | . . . . 5 ⊢ if(7 ∈ ℙ, ((#p‘(7 − 1)) · 7), (#p‘(7 − 1))) = ((#p‘(7 − 1)) · 7) |
30 | 7nn0 11907 | . . . . . 6 ⊢ 7 ∈ ℕ0 | |
31 | 3nn0 11903 | . . . . . 6 ⊢ 3 ∈ ℕ0 | |
32 | 0nn0 11900 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
33 | 7m1e6 11757 | . . . . . . . 8 ⊢ (7 − 1) = 6 | |
34 | 33 | fveq2i 6648 | . . . . . . 7 ⊢ (#p‘(7 − 1)) = (#p‘6) |
35 | prmo6 16455 | . . . . . . 7 ⊢ (#p‘6) = ;30 | |
36 | 34, 35 | eqtri 2821 | . . . . . 6 ⊢ (#p‘(7 − 1)) = ;30 |
37 | 7cn 11719 | . . . . . . 7 ⊢ 7 ∈ ℂ | |
38 | 3cn 11706 | . . . . . . 7 ⊢ 3 ∈ ℂ | |
39 | 7t3e21 12196 | . . . . . . 7 ⊢ (7 · 3) = ;21 | |
40 | 37, 38, 39 | mulcomli 10639 | . . . . . 6 ⊢ (3 · 7) = ;21 |
41 | 37 | mul02i 10818 | . . . . . 6 ⊢ (0 · 7) = 0 |
42 | 30, 31, 32, 36, 40, 41 | decmul1 12150 | . . . . 5 ⊢ ((#p‘(7 − 1)) · 7) = ;;210 |
43 | 27, 29, 42 | 3eqtri 2825 | . . . 4 ⊢ (#p‘7) = ;;210 |
44 | 22, 24, 43 | 3eqtri 2825 | . . 3 ⊢ (#p‘8) = ;;210 |
45 | 14, 16, 44 | 3eqtri 2825 | . 2 ⊢ (#p‘9) = ;;210 |
46 | 6, 8, 45 | 3eqtri 2825 | 1 ⊢ (#p‘;10) = ;;210 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1538 ∈ wcel 2111 ifcif 4425 ‘cfv 6324 (class class class)co 7135 0cc0 10526 1c1 10527 · cmul 10531 − cmin 10859 ℕcn 11625 2c2 11680 3c3 11681 6c6 11684 7c7 11685 8c8 11686 9c9 11687 ;cdc 12086 ℙcprime 16005 #pcprmo 16357 |
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-inf2 9088 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-int 4839 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-se 5479 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-isom 6333 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-oadd 8089 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-sup 8890 df-inf 8891 df-oi 8958 df-card 9352 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-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-z 11970 df-dec 12087 df-uz 12232 df-rp 12378 df-fz 12886 df-fzo 13029 df-seq 13365 df-exp 13426 df-hash 13687 df-cj 14450 df-re 14451 df-im 14452 df-sqrt 14586 df-abs 14587 df-clim 14837 df-prod 15252 df-dvds 15600 df-prm 16006 df-prmo 16358 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |