Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > isodd | Structured version Visualization version GIF version |
Description: The predicate "is an odd number". An odd number is an integer which is not divisible by 2, i.e. the result of dividing the odd integer increased by 1 and then divided by 2 is still an integer. (Contributed by AV, 14-Jun-2020.) |
Ref | Expression |
---|---|
isodd | ⊢ (𝑍 ∈ Odd ↔ (𝑍 ∈ ℤ ∧ ((𝑍 + 1) / 2) ∈ ℤ)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq1 7163 | . . . 4 ⊢ (𝑧 = 𝑍 → (𝑧 + 1) = (𝑍 + 1)) | |
2 | 1 | oveq1d 7171 | . . 3 ⊢ (𝑧 = 𝑍 → ((𝑧 + 1) / 2) = ((𝑍 + 1) / 2)) |
3 | 2 | eleq1d 2897 | . 2 ⊢ (𝑧 = 𝑍 → (((𝑧 + 1) / 2) ∈ ℤ ↔ ((𝑍 + 1) / 2) ∈ ℤ)) |
4 | df-odd 43812 | . 2 ⊢ Odd = {𝑧 ∈ ℤ ∣ ((𝑧 + 1) / 2) ∈ ℤ} | |
5 | 3, 4 | elrab2 3683 | 1 ⊢ (𝑍 ∈ Odd ↔ (𝑍 ∈ ℤ ∧ ((𝑍 + 1) / 2) ∈ ℤ)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 (class class class)co 7156 1c1 10538 + caddc 10540 / cdiv 11297 2c2 11693 ℤcz 11982 Odd codd 43810 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rab 3147 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-iota 6314 df-fv 6363 df-ov 7159 df-odd 43812 |
This theorem is referenced by: oddz 43816 oddp1div2z 43818 isodd2 43820 evenm1odd 43824 evennodd 43828 oddneven 43829 onego 43831 zeoALTV 43855 oddp1evenALTV 43861 1oddALTV 43875 |
Copyright terms: Public domain | W3C validator |