![]() |
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 15574: (#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 11390 | . . . 4 ⊢ ;10 ∈ ℕ | |
2 | prmonn2 15581 | . . . 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 15658 | . . . 4 ⊢ ¬ ;10 ∈ ℙ | |
5 | 4 | iffalsei 4046 | . . 3 ⊢ if(;10 ∈ ℙ, ((#p‘(;10 − 1)) · ;10), (#p‘(;10 − 1))) = (#p‘(;10 − 1)) |
6 | 3, 5 | eqtri 2632 | . 2 ⊢ (#p‘;10) = (#p‘(;10 − 1)) |
7 | 10m1e9 11506 | . . 3 ⊢ (;10 − 1) = 9 | |
8 | 7 | fveq2i 6106 | . 2 ⊢ (#p‘(;10 − 1)) = (#p‘9) |
9 | 9nn 11069 | . . . . 5 ⊢ 9 ∈ ℕ | |
10 | prmonn2 15581 | . . . . 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 15657 | . . . . 5 ⊢ ¬ 9 ∈ ℙ | |
13 | 12 | iffalsei 4046 | . . . 4 ⊢ if(9 ∈ ℙ, ((#p‘(9 − 1)) · 9), (#p‘(9 − 1))) = (#p‘(9 − 1)) |
14 | 11, 13 | eqtri 2632 | . . 3 ⊢ (#p‘9) = (#p‘(9 − 1)) |
15 | 9m1e8 11020 | . . . 4 ⊢ (9 − 1) = 8 | |
16 | 15 | fveq2i 6106 | . . 3 ⊢ (#p‘(9 − 1)) = (#p‘8) |
17 | 8nn 11068 | . . . . . 6 ⊢ 8 ∈ ℕ | |
18 | prmonn2 15581 | . . . . . 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 15656 | . . . . . 6 ⊢ ¬ 8 ∈ ℙ | |
21 | 20 | iffalsei 4046 | . . . . 5 ⊢ if(8 ∈ ℙ, ((#p‘(8 − 1)) · 8), (#p‘(8 − 1))) = (#p‘(8 − 1)) |
22 | 19, 21 | eqtri 2632 | . . . 4 ⊢ (#p‘8) = (#p‘(8 − 1)) |
23 | 8m1e7 11019 | . . . . 5 ⊢ (8 − 1) = 7 | |
24 | 23 | fveq2i 6106 | . . . 4 ⊢ (#p‘(8 − 1)) = (#p‘7) |
25 | 7nn 11067 | . . . . . 6 ⊢ 7 ∈ ℕ | |
26 | prmonn2 15581 | . . . . . 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 15655 | . . . . . 6 ⊢ 7 ∈ ℙ | |
29 | 28 | iftruei 4043 | . . . . 5 ⊢ if(7 ∈ ℙ, ((#p‘(7 − 1)) · 7), (#p‘(7 − 1))) = ((#p‘(7 − 1)) · 7) |
30 | 7nn0 11191 | . . . . . 6 ⊢ 7 ∈ ℕ0 | |
31 | 3nn0 11187 | . . . . . 6 ⊢ 3 ∈ ℕ0 | |
32 | 0nn0 11184 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
33 | 7m1e6 11018 | . . . . . . . 8 ⊢ (7 − 1) = 6 | |
34 | 33 | fveq2i 6106 | . . . . . . 7 ⊢ (#p‘(7 − 1)) = (#p‘6) |
35 | prmo6 15675 | . . . . . . 7 ⊢ (#p‘6) = ;30 | |
36 | 34, 35 | eqtri 2632 | . . . . . 6 ⊢ (#p‘(7 − 1)) = ;30 |
37 | 7cn 10981 | . . . . . . 7 ⊢ 7 ∈ ℂ | |
38 | 3cn 10972 | . . . . . . 7 ⊢ 3 ∈ ℂ | |
39 | 7t3e21 11525 | . . . . . . 7 ⊢ (7 · 3) = ;21 | |
40 | 37, 38, 39 | mulcomli 9926 | . . . . . 6 ⊢ (3 · 7) = ;21 |
41 | 37 | mul02i 10104 | . . . . . 6 ⊢ (0 · 7) = 0 |
42 | 30, 31, 32, 36, 32, 40, 41 | decmul1 11461 | . . . . 5 ⊢ ((#p‘(7 − 1)) · 7) = ;;210 |
43 | 27, 29, 42 | 3eqtri 2636 | . . . 4 ⊢ (#p‘7) = ;;210 |
44 | 22, 24, 43 | 3eqtri 2636 | . . 3 ⊢ (#p‘8) = ;;210 |
45 | 14, 16, 44 | 3eqtri 2636 | . 2 ⊢ (#p‘9) = ;;210 |
46 | 6, 8, 45 | 3eqtri 2636 | 1 ⊢ (#p‘;10) = ;;210 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1475 ∈ wcel 1977 ifcif 4036 ‘cfv 5804 (class class class)co 6549 0cc0 9815 1c1 9816 · cmul 9820 − cmin 10145 ℕcn 10897 2c2 10947 3c3 10948 6c6 10951 7c7 10952 8c8 10953 9c9 10954 ;cdc 11369 ℙcprime 15223 #pcprmo 15573 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-inf2 8421 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-fal 1481 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-se 4998 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-isom 5813 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-2o 7448 df-oadd 7451 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-sup 8231 df-inf 8232 df-oi 8298 df-card 8648 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-3 10957 df-4 10958 df-5 10959 df-6 10960 df-7 10961 df-8 10962 df-9 10963 df-n0 11170 df-z 11255 df-dec 11370 df-uz 11564 df-rp 11709 df-fz 12198 df-fzo 12335 df-seq 12664 df-exp 12723 df-hash 12980 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824 df-clim 14067 df-prod 14475 df-dvds 14822 df-prm 15224 df-prmo 15574 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |