Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 2tnp1ge0ge0 | Structured version Visualization version GIF version |
Description: Two times an integer plus one is not negative iff the integer is not negative. (Contributed by AV, 19-Jun-2021.) (Proof shortened by AV, 10-Jul-2022.) |
Ref | Expression |
---|---|
2tnp1ge0ge0 | ⊢ (𝑁 ∈ ℤ → (0 ≤ ((2 · 𝑁) + 1) ↔ 0 ≤ 𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2z 12008 | . . . . . . 7 ⊢ 2 ∈ ℤ | |
2 | 1 | a1i 11 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 2 ∈ ℤ) |
3 | id 22 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℤ) | |
4 | 2, 3 | zmulcld 12087 | . . . . 5 ⊢ (𝑁 ∈ ℤ → (2 · 𝑁) ∈ ℤ) |
5 | 4 | peano2zd 12084 | . . . 4 ⊢ (𝑁 ∈ ℤ → ((2 · 𝑁) + 1) ∈ ℤ) |
6 | 5 | zred 12081 | . . 3 ⊢ (𝑁 ∈ ℤ → ((2 · 𝑁) + 1) ∈ ℝ) |
7 | 2rp 12388 | . . . 4 ⊢ 2 ∈ ℝ+ | |
8 | 7 | a1i 11 | . . 3 ⊢ (𝑁 ∈ ℤ → 2 ∈ ℝ+) |
9 | 6, 8 | ge0divd 12463 | . 2 ⊢ (𝑁 ∈ ℤ → (0 ≤ ((2 · 𝑁) + 1) ↔ 0 ≤ (((2 · 𝑁) + 1) / 2))) |
10 | 4 | zcnd 12082 | . . . . 5 ⊢ (𝑁 ∈ ℤ → (2 · 𝑁) ∈ ℂ) |
11 | 1cnd 10630 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 1 ∈ ℂ) | |
12 | 2cnne0 11841 | . . . . . 6 ⊢ (2 ∈ ℂ ∧ 2 ≠ 0) | |
13 | 12 | a1i 11 | . . . . 5 ⊢ (𝑁 ∈ ℤ → (2 ∈ ℂ ∧ 2 ≠ 0)) |
14 | divdir 11317 | . . . . 5 ⊢ (((2 · 𝑁) ∈ ℂ ∧ 1 ∈ ℂ ∧ (2 ∈ ℂ ∧ 2 ≠ 0)) → (((2 · 𝑁) + 1) / 2) = (((2 · 𝑁) / 2) + (1 / 2))) | |
15 | 10, 11, 13, 14 | syl3anc 1367 | . . . 4 ⊢ (𝑁 ∈ ℤ → (((2 · 𝑁) + 1) / 2) = (((2 · 𝑁) / 2) + (1 / 2))) |
16 | zcn 11980 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
17 | 2cnd 11709 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 2 ∈ ℂ) | |
18 | 2ne0 11735 | . . . . . . 7 ⊢ 2 ≠ 0 | |
19 | 18 | a1i 11 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 2 ≠ 0) |
20 | 16, 17, 19 | divcan3d 11415 | . . . . 5 ⊢ (𝑁 ∈ ℤ → ((2 · 𝑁) / 2) = 𝑁) |
21 | 20 | oveq1d 7165 | . . . 4 ⊢ (𝑁 ∈ ℤ → (((2 · 𝑁) / 2) + (1 / 2)) = (𝑁 + (1 / 2))) |
22 | 15, 21 | eqtrd 2856 | . . 3 ⊢ (𝑁 ∈ ℤ → (((2 · 𝑁) + 1) / 2) = (𝑁 + (1 / 2))) |
23 | 22 | breq2d 5070 | . 2 ⊢ (𝑁 ∈ ℤ → (0 ≤ (((2 · 𝑁) + 1) / 2) ↔ 0 ≤ (𝑁 + (1 / 2)))) |
24 | zre 11979 | . . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
25 | halfre 11845 | . . . . 5 ⊢ (1 / 2) ∈ ℝ | |
26 | 25 | a1i 11 | . . . 4 ⊢ (𝑁 ∈ ℤ → (1 / 2) ∈ ℝ) |
27 | 24, 26 | readdcld 10664 | . . 3 ⊢ (𝑁 ∈ ℤ → (𝑁 + (1 / 2)) ∈ ℝ) |
28 | halfge0 11848 | . . . 4 ⊢ 0 ≤ (1 / 2) | |
29 | 24, 26 | addge01d 11222 | . . . 4 ⊢ (𝑁 ∈ ℤ → (0 ≤ (1 / 2) ↔ 𝑁 ≤ (𝑁 + (1 / 2)))) |
30 | 28, 29 | mpbii 235 | . . 3 ⊢ (𝑁 ∈ ℤ → 𝑁 ≤ (𝑁 + (1 / 2))) |
31 | 1red 10636 | . . . 4 ⊢ (𝑁 ∈ ℤ → 1 ∈ ℝ) | |
32 | halflt1 11849 | . . . . 5 ⊢ (1 / 2) < 1 | |
33 | 32 | a1i 11 | . . . 4 ⊢ (𝑁 ∈ ℤ → (1 / 2) < 1) |
34 | 26, 31, 24, 33 | ltadd2dd 10793 | . . 3 ⊢ (𝑁 ∈ ℤ → (𝑁 + (1 / 2)) < (𝑁 + 1)) |
35 | btwnzge0 13192 | . . 3 ⊢ ((((𝑁 + (1 / 2)) ∈ ℝ ∧ 𝑁 ∈ ℤ) ∧ (𝑁 ≤ (𝑁 + (1 / 2)) ∧ (𝑁 + (1 / 2)) < (𝑁 + 1))) → (0 ≤ (𝑁 + (1 / 2)) ↔ 0 ≤ 𝑁)) | |
36 | 27, 3, 30, 34, 35 | syl22anc 836 | . 2 ⊢ (𝑁 ∈ ℤ → (0 ≤ (𝑁 + (1 / 2)) ↔ 0 ≤ 𝑁)) |
37 | 9, 23, 36 | 3bitrd 307 | 1 ⊢ (𝑁 ∈ ℤ → (0 ≤ ((2 · 𝑁) + 1) ↔ 0 ≤ 𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ≠ wne 3016 class class class wbr 5058 (class class class)co 7150 ℂcc 10529 ℝcr 10530 0cc0 10531 1c1 10532 + caddc 10534 · cmul 10536 < clt 10669 ≤ cle 10670 / cdiv 11291 2c2 11686 ℤcz 11975 ℝ+crp 12383 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 ax-pre-sup 10609 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-sup 8900 df-inf 8901 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-div 11292 df-nn 11633 df-2 11694 df-n0 11892 df-z 11976 df-uz 12238 df-rp 12384 df-fl 13156 |
This theorem is referenced by: oddnn02np1 15691 |
Copyright terms: Public domain | W3C validator |