| 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 17242: (#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 12864 | . . . 4 ⊢ ;10 ∈ ℕ | |
| 2 | prmonn2 17249 | . . . 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 17323 | . . . 4 ⊢ ¬ ;10 ∈ ℙ | |
| 5 | 4 | iffalsei 4495 | . . 3 ⊢ if(;10 ∈ ℙ, ((#p‘(;10 − 1)) · ;10), (#p‘(;10 − 1))) = (#p‘(;10 − 1)) |
| 6 | 3, 5 | eqtri 2786 | . 2 ⊢ (#p‘;10) = (#p‘(;10 − 1)) |
| 7 | 10m1e9 12945 | . . 3 ⊢ (;10 − 1) = 9 | |
| 8 | 7 | fveq2i 6914 | . 2 ⊢ (#p‘(;10 − 1)) = (#p‘9) |
| 9 | 9nn 12471 | . . . . 5 ⊢ 9 ∈ ℕ | |
| 10 | prmonn2 17249 | . . . . 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 17322 | . . . . 5 ⊢ ¬ 9 ∈ ℙ | |
| 13 | 12 | iffalsei 4495 | . . . 4 ⊢ if(9 ∈ ℙ, ((#p‘(9 − 1)) · 9), (#p‘(9 − 1))) = (#p‘(9 − 1)) |
| 14 | 11, 13 | eqtri 2786 | . . 3 ⊢ (#p‘9) = (#p‘(9 − 1)) |
| 15 | 9m1e8 12506 | . . . 4 ⊢ (9 − 1) = 8 | |
| 16 | 15 | fveq2i 6914 | . . 3 ⊢ (#p‘(9 − 1)) = (#p‘8) |
| 17 | 8nn 12468 | . . . . . 6 ⊢ 8 ∈ ℕ | |
| 18 | prmonn2 17249 | . . . . . 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 17321 | . . . . . 6 ⊢ ¬ 8 ∈ ℙ | |
| 21 | 20 | iffalsei 4495 | . . . . 5 ⊢ if(8 ∈ ℙ, ((#p‘(8 − 1)) · 8), (#p‘(8 − 1))) = (#p‘(8 − 1)) |
| 22 | 19, 21 | eqtri 2786 | . . . 4 ⊢ (#p‘8) = (#p‘(8 − 1)) |
| 23 | 8m1e7 12505 | . . . . 5 ⊢ (8 − 1) = 7 | |
| 24 | 23 | fveq2i 6914 | . . . 4 ⊢ (#p‘(8 − 1)) = (#p‘7) |
| 25 | 7nn 12465 | . . . . . 6 ⊢ 7 ∈ ℕ | |
| 26 | prmonn2 17249 | . . . . . 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 17320 | . . . . . 6 ⊢ 7 ∈ ℙ | |
| 29 | 28 | iftruei 4492 | . . . . 5 ⊢ if(7 ∈ ℙ, ((#p‘(7 − 1)) · 7), (#p‘(7 − 1))) = ((#p‘(7 − 1)) · 7) |
| 30 | 7nn0 12658 | . . . . . 6 ⊢ 7 ∈ ℕ0 | |
| 31 | 3nn0 12654 | . . . . . 6 ⊢ 3 ∈ ℕ0 | |
| 32 | 0nn0 12651 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 33 | 7m1e6 12504 | . . . . . . . 8 ⊢ (7 − 1) = 6 | |
| 34 | 33 | fveq2i 6914 | . . . . . . 7 ⊢ (#p‘(7 − 1)) = (#p‘6) |
| 35 | prmo6 17340 | . . . . . . 7 ⊢ (#p‘6) = ;30 | |
| 36 | 34, 35 | eqtri 2786 | . . . . . 6 ⊢ (#p‘(7 − 1)) = ;30 |
| 37 | 7cn 12467 | . . . . . . 7 ⊢ 7 ∈ ℂ | |
| 38 | 3cn 12454 | . . . . . . 7 ⊢ 3 ∈ ℂ | |
| 39 | 7t3e21 12959 | . . . . . . 7 ⊢ (7 · 3) = ;21 | |
| 40 | 37, 38, 39 | mulcomli 11348 | . . . . . 6 ⊢ (3 · 7) = ;21 |
| 41 | 37 | mul02i 11529 | . . . . . 6 ⊢ (0 · 7) = 0 |
| 42 | 30, 31, 32, 36, 40, 41 | decmul1 12913 | . . . . 5 ⊢ ((#p‘(7 − 1)) · 7) = ;;210 |
| 43 | 27, 29, 42 | 3eqtri 2790 | . . . 4 ⊢ (#p‘7) = ;;210 |
| 44 | 22, 24, 43 | 3eqtri 2790 | . . 3 ⊢ (#p‘8) = ;;210 |
| 45 | 14, 16, 44 | 3eqtri 2790 | . 2 ⊢ (#p‘9) = ;;210 |
| 46 | 6, 8, 45 | 3eqtri 2790 | 1 ⊢ (#p‘;10) = ;;210 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2147 ifcif 4485 ‘cfv 6561 (class class class)co 7446 0cc0 11230 1c1 11231 · cmul 11235 − cmin 11571 ℕcn 12365 2c2 12427 3c3 12428 6c6 12431 7c7 12432 8c8 12433 9c9 12434 ;cdc 12844 ℙcprime 16878 #pcprmo 17241 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-inf2 9672 ax-cnex 11286 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 ax-pre-sup 11308 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-se 5610 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-isom 6570 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-om 7905 df-1st 8028 df-2nd 8029 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-1o 8507 df-2o 8508 df-er 8748 df-en 9005 df-dom 9006 df-sdom 9007 df-fin 9008 df-sup 9464 df-inf 9465 df-oi 9534 df-card 10050 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-div 12004 df-nn 12366 df-2 12435 df-3 12436 df-4 12437 df-5 12438 df-6 12439 df-7 12440 df-8 12441 df-9 12442 df-n0 12637 df-z 12724 df-dec 12845 df-uz 12996 df-rp 13151 df-fz 13670 df-fzo 13819 df-seq 14175 df-exp 14235 df-hash 14505 df-cj 15298 df-re 15299 df-im 15300 df-sqrt 15434 df-abs 15435 df-clim 15687 df-prod 16105 df-dvds 16455 df-prm 16879 df-prmo 17242 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |