![]() |
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 11699 | . . . . 5 ⊢ 2 ∈ ℝ | |
2 | lenlt 10708 | . . . . 5 ⊢ ((2 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (2 ≤ 𝐴 ↔ ¬ 𝐴 < 2)) | |
3 | 1, 2 | mpan 689 | . . . 4 ⊢ (𝐴 ∈ ℝ → (2 ≤ 𝐴 ↔ ¬ 𝐴 < 2)) |
4 | ppinncl 25759 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 2 ≤ 𝐴) → (π‘𝐴) ∈ ℕ) | |
5 | 4 | nnne0d 11675 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 2 ≤ 𝐴) → (π‘𝐴) ≠ 0) |
6 | 5 | ex 416 | . . . 4 ⊢ (𝐴 ∈ ℝ → (2 ≤ 𝐴 → (π‘𝐴) ≠ 0)) |
7 | 3, 6 | sylbird 263 | . . 3 ⊢ (𝐴 ∈ ℝ → (¬ 𝐴 < 2 → (π‘𝐴) ≠ 0)) |
8 | 7 | necon4bd 3007 | . 2 ⊢ (𝐴 ∈ ℝ → ((π‘𝐴) = 0 → 𝐴 < 2)) |
9 | reflcl 13161 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ∈ ℝ) | |
10 | 9 | adantr 484 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (⌊‘𝐴) ∈ ℝ) |
11 | 1red 10631 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → 1 ∈ ℝ) | |
12 | 2z 12002 | . . . . . . . . . 10 ⊢ 2 ∈ ℤ | |
13 | fllt 13171 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 2 ∈ ℤ) → (𝐴 < 2 ↔ (⌊‘𝐴) < 2)) | |
14 | 12, 13 | mpan2 690 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (𝐴 < 2 ↔ (⌊‘𝐴) < 2)) |
15 | 14 | biimpa 480 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (⌊‘𝐴) < 2) |
16 | df-2 11688 | . . . . . . . 8 ⊢ 2 = (1 + 1) | |
17 | 15, 16 | breqtrdi 5071 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (⌊‘𝐴) < (1 + 1)) |
18 | flcl 13160 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ∈ ℤ) | |
19 | 18 | adantr 484 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (⌊‘𝐴) ∈ ℤ) |
20 | 1z 12000 | . . . . . . . 8 ⊢ 1 ∈ ℤ | |
21 | zleltp1 12021 | . . . . . . . 8 ⊢ (((⌊‘𝐴) ∈ ℤ ∧ 1 ∈ ℤ) → ((⌊‘𝐴) ≤ 1 ↔ (⌊‘𝐴) < (1 + 1))) | |
22 | 19, 20, 21 | sylancl 589 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → ((⌊‘𝐴) ≤ 1 ↔ (⌊‘𝐴) < (1 + 1))) |
23 | 17, 22 | mpbird 260 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (⌊‘𝐴) ≤ 1) |
24 | ppiwordi 25747 | . . . . . 6 ⊢ (((⌊‘𝐴) ∈ ℝ ∧ 1 ∈ ℝ ∧ (⌊‘𝐴) ≤ 1) → (π‘(⌊‘𝐴)) ≤ (π‘1)) | |
25 | 10, 11, 23, 24 | syl3anc 1368 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (π‘(⌊‘𝐴)) ≤ (π‘1)) |
26 | ppifl 25745 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (π‘(⌊‘𝐴)) = (π‘𝐴)) | |
27 | 26 | adantr 484 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (π‘(⌊‘𝐴)) = (π‘𝐴)) |
28 | ppi1 25749 | . . . . . 6 ⊢ (π‘1) = 0 | |
29 | 28 | a1i 11 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (π‘1) = 0) |
30 | 25, 27, 29 | 3brtr3d 5061 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (π‘𝐴) ≤ 0) |
31 | ppicl 25716 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (π‘𝐴) ∈ ℕ0) | |
32 | 31 | adantr 484 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (π‘𝐴) ∈ ℕ0) |
33 | nn0le0eq0 11913 | . . . . 5 ⊢ ((π‘𝐴) ∈ ℕ0 → ((π‘𝐴) ≤ 0 ↔ (π‘𝐴) = 0)) | |
34 | 32, 33 | syl 17 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → ((π‘𝐴) ≤ 0 ↔ (π‘𝐴) = 0)) |
35 | 30, 34 | mpbid 235 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 2) → (π‘𝐴) = 0) |
36 | 35 | ex 416 | . 2 ⊢ (𝐴 ∈ ℝ → (𝐴 < 2 → (π‘𝐴) = 0)) |
37 | 8, 36 | impbid 215 | 1 ⊢ (𝐴 ∈ ℝ → ((π‘𝐴) = 0 ↔ 𝐴 < 2)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 class class class wbr 5030 ‘cfv 6324 (class class class)co 7135 ℝcr 10525 0cc0 10526 1c1 10527 + caddc 10529 < clt 10664 ≤ cle 10665 2c2 11680 ℕ0cn0 11885 ℤcz 11969 ⌊cfl 13155 πcppi 25679 |
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-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 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-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-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-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-dju 9314 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-n0 11886 df-xnn0 11956 df-z 11970 df-uz 12232 df-rp 12378 df-icc 12733 df-fz 12886 df-fl 13157 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-dvds 15600 df-prm 16006 df-ppi 25685 |
This theorem is referenced by: ppiltx 25762 |
Copyright terms: Public domain | W3C validator |