Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ppieq0 | Structured version Visualization version GIF version |
Description: The prime-counting function π is zero iff its argument is less than 2. (Contributed by Mario Carneiro, 22-Sep-2014.) |
Ref | Expression |
---|---|
ppieq0 | ⊢ (𝐴 ∈ ℝ → ((π‘𝐴) = 0 ↔ 𝐴 < 2)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2re 12047 | . . . . 5 ⊢ 2 ∈ ℝ | |
2 | lenlt 11053 | . . . . 5 ⊢ ((2 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (2 ≤ 𝐴 ↔ ¬ 𝐴 < 2)) | |
3 | 1, 2 | mpan 687 | . . . 4 ⊢ (𝐴 ∈ ℝ → (2 ≤ 𝐴 ↔ ¬ 𝐴 < 2)) |
4 | ppinncl 26323 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 2 ≤ 𝐴) → (π‘𝐴) ∈ ℕ) | |
5 | 4 | nnne0d 12023 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 2 ≤ 𝐴) → (π‘𝐴) ≠ 0) |
6 | 5 | ex 413 | . . . 4 ⊢ (𝐴 ∈ ℝ → (2 ≤ 𝐴 → (π‘𝐴) ≠ 0)) |
7 | 3, 6 | sylbird 259 | . . 3 ⊢ (𝐴 ∈ ℝ → (¬ 𝐴 < 2 → (π‘𝐴) ≠ 0)) |
8 | 7 | necon4bd 2963 | . 2 ⊢ (𝐴 ∈ ℝ → ((π‘𝐴) = 0 → 𝐴 < 2)) |
9 | reflcl 13516 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ∈ ℝ) | |
10 | 9 | adantr 481 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (⌊‘𝐴) ∈ ℝ) |
11 | 1red 10976 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → 1 ∈ ℝ) | |
12 | 2z 12352 | . . . . . . . . . 10 ⊢ 2 ∈ ℤ | |
13 | fllt 13526 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 2 ∈ ℤ) → (𝐴 < 2 ↔ (⌊‘𝐴) < 2)) | |
14 | 12, 13 | mpan2 688 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (𝐴 < 2 ↔ (⌊‘𝐴) < 2)) |
15 | 14 | biimpa 477 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (⌊‘𝐴) < 2) |
16 | df-2 12036 | . . . . . . . 8 ⊢ 2 = (1 + 1) | |
17 | 15, 16 | breqtrdi 5115 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (⌊‘𝐴) < (1 + 1)) |
18 | flcl 13515 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ∈ ℤ) | |
19 | 18 | adantr 481 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (⌊‘𝐴) ∈ ℤ) |
20 | 1z 12350 | . . . . . . . 8 ⊢ 1 ∈ ℤ | |
21 | zleltp1 12371 | . . . . . . . 8 ⊢ (((⌊‘𝐴) ∈ ℤ ∧ 1 ∈ ℤ) → ((⌊‘𝐴) ≤ 1 ↔ (⌊‘𝐴) < (1 + 1))) | |
22 | 19, 20, 21 | sylancl 586 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → ((⌊‘𝐴) ≤ 1 ↔ (⌊‘𝐴) < (1 + 1))) |
23 | 17, 22 | mpbird 256 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (⌊‘𝐴) ≤ 1) |
24 | ppiwordi 26311 | . . . . . 6 ⊢ (((⌊‘𝐴) ∈ ℝ ∧ 1 ∈ ℝ ∧ (⌊‘𝐴) ≤ 1) → (π‘(⌊‘𝐴)) ≤ (π‘1)) | |
25 | 10, 11, 23, 24 | syl3anc 1370 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (π‘(⌊‘𝐴)) ≤ (π‘1)) |
26 | ppifl 26309 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (π‘(⌊‘𝐴)) = (π‘𝐴)) | |
27 | 26 | adantr 481 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (π‘(⌊‘𝐴)) = (π‘𝐴)) |
28 | ppi1 26313 | . . . . . 6 ⊢ (π‘1) = 0 | |
29 | 28 | a1i 11 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (π‘1) = 0) |
30 | 25, 27, 29 | 3brtr3d 5105 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (π‘𝐴) ≤ 0) |
31 | ppicl 26280 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (π‘𝐴) ∈ ℕ0) | |
32 | 31 | adantr 481 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (π‘𝐴) ∈ ℕ0) |
33 | nn0le0eq0 12261 | . . . . 5 ⊢ ((π‘𝐴) ∈ ℕ0 → ((π‘𝐴) ≤ 0 ↔ (π‘𝐴) = 0)) | |
34 | 32, 33 | syl 17 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → ((π‘𝐴) ≤ 0 ↔ (π‘𝐴) = 0)) |
35 | 30, 34 | mpbid 231 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (π‘𝐴) = 0) |
36 | 35 | ex 413 | . 2 ⊢ (𝐴 ∈ ℝ → (𝐴 < 2 → (π‘𝐴) = 0)) |
37 | 8, 36 | impbid 211 | 1 ⊢ (𝐴 ∈ ℝ → ((π‘𝐴) = 0 ↔ 𝐴 < 2)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 class class class wbr 5074 ‘cfv 6433 (class class class)co 7275 ℝcr 10870 0cc0 10871 1c1 10872 + caddc 10874 < clt 11009 ≤ cle 11010 2c2 12028 ℕ0cn0 12233 ℤcz 12319 ⌊cfl 13510 πcppi 26243 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-pre-sup 10949 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-2o 8298 df-oadd 8301 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-sup 9201 df-inf 9202 df-dju 9659 df-card 9697 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-2 12036 df-3 12037 df-n0 12234 df-xnn0 12306 df-z 12320 df-uz 12583 df-rp 12731 df-icc 13086 df-fz 13240 df-fl 13512 df-seq 13722 df-exp 13783 df-hash 14045 df-cj 14810 df-re 14811 df-im 14812 df-sqrt 14946 df-abs 14947 df-dvds 15964 df-prm 16377 df-ppi 26249 |
This theorem is referenced by: ppiltx 26326 |
Copyright terms: Public domain | W3C validator |