Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ppisval | Structured version Visualization version GIF version |
Description: The set of primes less than 𝐴 expressed using a finite set of integers. (Contributed by Mario Carneiro, 22-Sep-2014.) |
Ref | Expression |
---|---|
ppisval | ⊢ (𝐴 ∈ ℝ → ((0[,]𝐴) ∩ ℙ) = ((2...(⌊‘𝐴)) ∩ ℙ)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | inss2 3796 | . . . . . . . 8 ⊢ ((0[,]𝐴) ∩ ℙ) ⊆ ℙ | |
2 | simpr 476 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ((0[,]𝐴) ∩ ℙ)) → 𝑥 ∈ ((0[,]𝐴) ∩ ℙ)) | |
3 | 1, 2 | sseldi 3566 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ((0[,]𝐴) ∩ ℙ)) → 𝑥 ∈ ℙ) |
4 | prmuz2 15246 | . . . . . . 7 ⊢ (𝑥 ∈ ℙ → 𝑥 ∈ (ℤ≥‘2)) | |
5 | 3, 4 | syl 17 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ((0[,]𝐴) ∩ ℙ)) → 𝑥 ∈ (ℤ≥‘2)) |
6 | prmz 15227 | . . . . . . . 8 ⊢ (𝑥 ∈ ℙ → 𝑥 ∈ ℤ) | |
7 | 3, 6 | syl 17 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ((0[,]𝐴) ∩ ℙ)) → 𝑥 ∈ ℤ) |
8 | flcl 12458 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ∈ ℤ) | |
9 | 8 | adantr 480 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ((0[,]𝐴) ∩ ℙ)) → (⌊‘𝐴) ∈ ℤ) |
10 | inss1 3795 | . . . . . . . . . . 11 ⊢ ((0[,]𝐴) ∩ ℙ) ⊆ (0[,]𝐴) | |
11 | 10, 2 | sseldi 3566 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ((0[,]𝐴) ∩ ℙ)) → 𝑥 ∈ (0[,]𝐴)) |
12 | 0re 9919 | . . . . . . . . . . 11 ⊢ 0 ∈ ℝ | |
13 | simpl 472 | . . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ((0[,]𝐴) ∩ ℙ)) → 𝐴 ∈ ℝ) | |
14 | elicc2 12109 | . . . . . . . . . . 11 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝑥 ∈ (0[,]𝐴) ↔ (𝑥 ∈ ℝ ∧ 0 ≤ 𝑥 ∧ 𝑥 ≤ 𝐴))) | |
15 | 12, 13, 14 | sylancr 694 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ((0[,]𝐴) ∩ ℙ)) → (𝑥 ∈ (0[,]𝐴) ↔ (𝑥 ∈ ℝ ∧ 0 ≤ 𝑥 ∧ 𝑥 ≤ 𝐴))) |
16 | 11, 15 | mpbid 221 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ((0[,]𝐴) ∩ ℙ)) → (𝑥 ∈ ℝ ∧ 0 ≤ 𝑥 ∧ 𝑥 ≤ 𝐴)) |
17 | 16 | simp3d 1068 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ((0[,]𝐴) ∩ ℙ)) → 𝑥 ≤ 𝐴) |
18 | flge 12468 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℤ) → (𝑥 ≤ 𝐴 ↔ 𝑥 ≤ (⌊‘𝐴))) | |
19 | 7, 18 | syldan 486 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ((0[,]𝐴) ∩ ℙ)) → (𝑥 ≤ 𝐴 ↔ 𝑥 ≤ (⌊‘𝐴))) |
20 | 17, 19 | mpbid 221 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ((0[,]𝐴) ∩ ℙ)) → 𝑥 ≤ (⌊‘𝐴)) |
21 | eluz2 11569 | . . . . . . 7 ⊢ ((⌊‘𝐴) ∈ (ℤ≥‘𝑥) ↔ (𝑥 ∈ ℤ ∧ (⌊‘𝐴) ∈ ℤ ∧ 𝑥 ≤ (⌊‘𝐴))) | |
22 | 7, 9, 20, 21 | syl3anbrc 1239 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ((0[,]𝐴) ∩ ℙ)) → (⌊‘𝐴) ∈ (ℤ≥‘𝑥)) |
23 | elfzuzb 12207 | . . . . . 6 ⊢ (𝑥 ∈ (2...(⌊‘𝐴)) ↔ (𝑥 ∈ (ℤ≥‘2) ∧ (⌊‘𝐴) ∈ (ℤ≥‘𝑥))) | |
24 | 5, 22, 23 | sylanbrc 695 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ((0[,]𝐴) ∩ ℙ)) → 𝑥 ∈ (2...(⌊‘𝐴))) |
25 | 24, 3 | elind 3760 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ((0[,]𝐴) ∩ ℙ)) → 𝑥 ∈ ((2...(⌊‘𝐴)) ∩ ℙ)) |
26 | 25 | ex 449 | . . 3 ⊢ (𝐴 ∈ ℝ → (𝑥 ∈ ((0[,]𝐴) ∩ ℙ) → 𝑥 ∈ ((2...(⌊‘𝐴)) ∩ ℙ))) |
27 | 26 | ssrdv 3574 | . 2 ⊢ (𝐴 ∈ ℝ → ((0[,]𝐴) ∩ ℙ) ⊆ ((2...(⌊‘𝐴)) ∩ ℙ)) |
28 | 2z 11286 | . . . . 5 ⊢ 2 ∈ ℤ | |
29 | fzval2 12200 | . . . . 5 ⊢ ((2 ∈ ℤ ∧ (⌊‘𝐴) ∈ ℤ) → (2...(⌊‘𝐴)) = ((2[,](⌊‘𝐴)) ∩ ℤ)) | |
30 | 28, 8, 29 | sylancr 694 | . . . 4 ⊢ (𝐴 ∈ ℝ → (2...(⌊‘𝐴)) = ((2[,](⌊‘𝐴)) ∩ ℤ)) |
31 | inss1 3795 | . . . . 5 ⊢ ((2[,](⌊‘𝐴)) ∩ ℤ) ⊆ (2[,](⌊‘𝐴)) | |
32 | 12 | a1i 11 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → 0 ∈ ℝ) |
33 | id 22 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ) | |
34 | 0le2 10988 | . . . . . . 7 ⊢ 0 ≤ 2 | |
35 | 34 | a1i 11 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → 0 ≤ 2) |
36 | flle 12462 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ≤ 𝐴) | |
37 | iccss 12112 | . . . . . 6 ⊢ (((0 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ (0 ≤ 2 ∧ (⌊‘𝐴) ≤ 𝐴)) → (2[,](⌊‘𝐴)) ⊆ (0[,]𝐴)) | |
38 | 32, 33, 35, 36, 37 | syl22anc 1319 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (2[,](⌊‘𝐴)) ⊆ (0[,]𝐴)) |
39 | 31, 38 | syl5ss 3579 | . . . 4 ⊢ (𝐴 ∈ ℝ → ((2[,](⌊‘𝐴)) ∩ ℤ) ⊆ (0[,]𝐴)) |
40 | 30, 39 | eqsstrd 3602 | . . 3 ⊢ (𝐴 ∈ ℝ → (2...(⌊‘𝐴)) ⊆ (0[,]𝐴)) |
41 | ssrin 3800 | . . 3 ⊢ ((2...(⌊‘𝐴)) ⊆ (0[,]𝐴) → ((2...(⌊‘𝐴)) ∩ ℙ) ⊆ ((0[,]𝐴) ∩ ℙ)) | |
42 | 40, 41 | syl 17 | . 2 ⊢ (𝐴 ∈ ℝ → ((2...(⌊‘𝐴)) ∩ ℙ) ⊆ ((0[,]𝐴) ∩ ℙ)) |
43 | 27, 42 | eqssd 3585 | 1 ⊢ (𝐴 ∈ ℝ → ((0[,]𝐴) ∩ ℙ) = ((2...(⌊‘𝐴)) ∩ ℙ)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ∩ cin 3539 ⊆ wss 3540 class class class wbr 4583 ‘cfv 5804 (class class class)co 6549 ℝcr 9814 0cc0 9815 ≤ cle 9954 2c2 10947 ℤcz 11254 ℤ≥cuz 11563 [,]cicc 12049 ...cfz 12197 ⌊cfl 12453 ℙcprime 15223 |
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-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 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-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-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-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-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-n0 11170 df-z 11255 df-uz 11564 df-rp 11709 df-icc 12053 df-fz 12198 df-fl 12455 df-seq 12664 df-exp 12723 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824 df-dvds 14822 df-prm 15224 |
This theorem is referenced by: ppisval2 24631 ppifi 24632 ppival2 24654 chtfl 24675 chtprm 24679 chtnprm 24680 ppifl 24686 cht1 24691 chtlepsi 24731 chpval2 24743 chpub 24745 |
Copyright terms: Public domain | W3C validator |