Theorem nneoor 9549

Description: A positive integer is even or odd. (Contributed by Jim Kingdon, 15-Mar-2020.)

Assertion

Ref	Expression
nneoor	⊢ (𝑁 ∈ ℕ → ((𝑁 / 2) ∈ ℕ ∨ ((𝑁 + 1) / 2) ∈ ℕ))

Proof of Theorem nneoor

Dummy variables 𝑗 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq1 6008	. . . . . 6 ⊢ (𝑗 = 1 → (𝑗 + 1) = (1 + 1))
2	1	oveq1d 6016	. . . . 5 ⊢ (𝑗 = 1 → ((𝑗 + 1) / 2) = ((1 + 1) / 2))
3	2	eleq1d 2298	. . . 4 ⊢ (𝑗 = 1 → (((𝑗 + 1) / 2) ∈ ℕ ↔ ((1 + 1) / 2) ∈ ℕ))
4		oveq1 6008	. . . . 5 ⊢ (𝑗 = 1 → (𝑗 / 2) = (1 / 2))
5	4	eleq1d 2298	. . . 4 ⊢ (𝑗 = 1 → ((𝑗 / 2) ∈ ℕ ↔ (1 / 2) ∈ ℕ))
6	3, 5	orbi12d 798	. . 3 ⊢ (𝑗 = 1 → ((((𝑗 + 1) / 2) ∈ ℕ ∨ (𝑗 / 2) ∈ ℕ) ↔ (((1 + 1) / 2) ∈ ℕ ∨ (1 / 2) ∈ ℕ)))
7		oveq1 6008	. . . . . 6 ⊢ (𝑗 = 𝑘 → (𝑗 + 1) = (𝑘 + 1))
8	7	oveq1d 6016	. . . . 5 ⊢ (𝑗 = 𝑘 → ((𝑗 + 1) / 2) = ((𝑘 + 1) / 2))
9	8	eleq1d 2298	. . . 4 ⊢ (𝑗 = 𝑘 → (((𝑗 + 1) / 2) ∈ ℕ ↔ ((𝑘 + 1) / 2) ∈ ℕ))
10		oveq1 6008	. . . . 5 ⊢ (𝑗 = 𝑘 → (𝑗 / 2) = (𝑘 / 2))
11	10	eleq1d 2298	. . . 4 ⊢ (𝑗 = 𝑘 → ((𝑗 / 2) ∈ ℕ ↔ (𝑘 / 2) ∈ ℕ))
12	9, 11	orbi12d 798	. . 3 ⊢ (𝑗 = 𝑘 → ((((𝑗 + 1) / 2) ∈ ℕ ∨ (𝑗 / 2) ∈ ℕ) ↔ (((𝑘 + 1) / 2) ∈ ℕ ∨ (𝑘 / 2) ∈ ℕ)))
13		oveq1 6008	. . . . . 6 ⊢ (𝑗 = (𝑘 + 1) → (𝑗 + 1) = ((𝑘 + 1) + 1))
14	13	oveq1d 6016	. . . . 5 ⊢ (𝑗 = (𝑘 + 1) → ((𝑗 + 1) / 2) = (((𝑘 + 1) + 1) / 2))
15	14	eleq1d 2298	. . . 4 ⊢ (𝑗 = (𝑘 + 1) → (((𝑗 + 1) / 2) ∈ ℕ ↔ (((𝑘 + 1) + 1) / 2) ∈ ℕ))
16		oveq1 6008	. . . . 5 ⊢ (𝑗 = (𝑘 + 1) → (𝑗 / 2) = ((𝑘 + 1) / 2))
17	16	eleq1d 2298	. . . 4 ⊢ (𝑗 = (𝑘 + 1) → ((𝑗 / 2) ∈ ℕ ↔ ((𝑘 + 1) / 2) ∈ ℕ))
18	15, 17	orbi12d 798	. . 3 ⊢ (𝑗 = (𝑘 + 1) → ((((𝑗 + 1) / 2) ∈ ℕ ∨ (𝑗 / 2) ∈ ℕ) ↔ ((((𝑘 + 1) + 1) / 2) ∈ ℕ ∨ ((𝑘 + 1) / 2) ∈ ℕ)))
19		oveq1 6008	. . . . . 6 ⊢ (𝑗 = 𝑁 → (𝑗 + 1) = (𝑁 + 1))
20	19	oveq1d 6016	. . . . 5 ⊢ (𝑗 = 𝑁 → ((𝑗 + 1) / 2) = ((𝑁 + 1) / 2))
21	20	eleq1d 2298	. . . 4 ⊢ (𝑗 = 𝑁 → (((𝑗 + 1) / 2) ∈ ℕ ↔ ((𝑁 + 1) / 2) ∈ ℕ))
22		oveq1 6008	. . . . 5 ⊢ (𝑗 = 𝑁 → (𝑗 / 2) = (𝑁 / 2))
23	22	eleq1d 2298	. . . 4 ⊢ (𝑗 = 𝑁 → ((𝑗 / 2) ∈ ℕ ↔ (𝑁 / 2) ∈ ℕ))
24	21, 23	orbi12d 798	. . 3 ⊢ (𝑗 = 𝑁 → ((((𝑗 + 1) / 2) ∈ ℕ ∨ (𝑗 / 2) ∈ ℕ) ↔ (((𝑁 + 1) / 2) ∈ ℕ ∨ (𝑁 / 2) ∈ ℕ)))
25		df-2 9169	. . . . . . 7 ⊢ 2 = (1 + 1)
26	25	oveq1i 6011	. . . . . 6 ⊢ (2 / 2) = ((1 + 1) / 2)
27		2div2e1 9243	. . . . . 6 ⊢ (2 / 2) = 1
28	26, 27	eqtr3i 2252	. . . . 5 ⊢ ((1 + 1) / 2) = 1
29		1nn 9121	. . . . 5 ⊢ 1 ∈ ℕ
30	28, 29	eqeltri 2302	. . . 4 ⊢ ((1 + 1) / 2) ∈ ℕ
31	30	orci 736	. . 3 ⊢ (((1 + 1) / 2) ∈ ℕ ∨ (1 / 2) ∈ ℕ)
32		peano2nn 9122	. . . . . 6 ⊢ ((𝑘 / 2) ∈ ℕ → ((𝑘 / 2) + 1) ∈ ℕ)
33		nncn 9118	. . . . . . . 8 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℂ)
34		add1p1 9361	. . . . . . . . . 10 ⊢ (𝑘 ∈ ℂ → ((𝑘 + 1) + 1) = (𝑘 + 2))
35	34	oveq1d 6016	. . . . . . . . 9 ⊢ (𝑘 ∈ ℂ → (((𝑘 + 1) + 1) / 2) = ((𝑘 + 2) / 2))
36		2cn 9181	. . . . . . . . . . 11 ⊢ 2 ∈ ℂ
37		2ap0 9203	. . . . . . . . . . . 12 ⊢ 2 # 0
38	36, 37	pm3.2i 272	. . . . . . . . . . 11 ⊢ (2 ∈ ℂ ∧ 2 # 0)
39		divdirap 8844	. . . . . . . . . . 11 ⊢ ((𝑘 ∈ ℂ ∧ 2 ∈ ℂ ∧ (2 ∈ ℂ ∧ 2 # 0)) → ((𝑘 + 2) / 2) = ((𝑘 / 2) + (2 / 2)))
40	36, 38, 39	mp3an23 1363	. . . . . . . . . 10 ⊢ (𝑘 ∈ ℂ → ((𝑘 + 2) / 2) = ((𝑘 / 2) + (2 / 2)))
41	27	oveq2i 6012	. . . . . . . . . 10 ⊢ ((𝑘 / 2) + (2 / 2)) = ((𝑘 / 2) + 1)
42	40, 41	eqtrdi 2278	. . . . . . . . 9 ⊢ (𝑘 ∈ ℂ → ((𝑘 + 2) / 2) = ((𝑘 / 2) + 1))
43	35, 42	eqtrd 2262	. . . . . . . 8 ⊢ (𝑘 ∈ ℂ → (((𝑘 + 1) + 1) / 2) = ((𝑘 / 2) + 1))
44	33, 43	syl 14	. . . . . . 7 ⊢ (𝑘 ∈ ℕ → (((𝑘 + 1) + 1) / 2) = ((𝑘 / 2) + 1))
45	44	eleq1d 2298	. . . . . 6 ⊢ (𝑘 ∈ ℕ → ((((𝑘 + 1) + 1) / 2) ∈ ℕ ↔ ((𝑘 / 2) + 1) ∈ ℕ))
46	32, 45	imbitrrid 156	. . . . 5 ⊢ (𝑘 ∈ ℕ → ((𝑘 / 2) ∈ ℕ → (((𝑘 + 1) + 1) / 2) ∈ ℕ))
47	46	orim2d 793	. . . 4 ⊢ (𝑘 ∈ ℕ → ((((𝑘 + 1) / 2) ∈ ℕ ∨ (𝑘 / 2) ∈ ℕ) → (((𝑘 + 1) / 2) ∈ ℕ ∨ (((𝑘 + 1) + 1) / 2) ∈ ℕ)))
48		orcom 733	. . . 4 ⊢ ((((𝑘 + 1) / 2) ∈ ℕ ∨ (((𝑘 + 1) + 1) / 2) ∈ ℕ) ↔ ((((𝑘 + 1) + 1) / 2) ∈ ℕ ∨ ((𝑘 + 1) / 2) ∈ ℕ))
49	47, 48	imbitrdi 161	. . 3 ⊢ (𝑘 ∈ ℕ → ((((𝑘 + 1) / 2) ∈ ℕ ∨ (𝑘 / 2) ∈ ℕ) → ((((𝑘 + 1) + 1) / 2) ∈ ℕ ∨ ((𝑘 + 1) / 2) ∈ ℕ)))
50	6, 12, 18, 24, 31, 49	nnind 9126	. 2 ⊢ (𝑁 ∈ ℕ → (((𝑁 + 1) / 2) ∈ ℕ ∨ (𝑁 / 2) ∈ ℕ))
51	50	orcomd 734	1 ⊢ (𝑁 ∈ ℕ → ((𝑁 / 2) ∈ ℕ ∨ ((𝑁 + 1) / 2) ∈ ℕ))

Syntax hints:   → wi 4   ∧ wa 104   ∨ wo 713   = wceq 1395   ∈ wcel 2200   class class class wbr 4083  (class class class)co 6001  ℂcc 7997  0cc0 7999  1c1 8000   + caddc 8002   # cap 8728   / cdiv 8819  ℕcn 9110  2c2 9161

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-mulrcl 8098  ax-addcom 8099  ax-mulcom 8100  ax-addass 8101  ax-mulass 8102  ax-distr 8103  ax-i2m1 8104  ax-0lt1 8105  ax-1rid 8106  ax-0id 8107  ax-rnegex 8108  ax-precex 8109  ax-cnre 8110  ax-pre-ltirr 8111  ax-pre-ltwlin 8112  ax-pre-lttrn 8113  ax-pre-apti 8114  ax-pre-ltadd 8115  ax-pre-mulgt0 8116  ax-pre-mulext 8117

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-id 4384  df-po 4387  df-iso 4388  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-iota 5278  df-fun 5320  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187  df-sub 8319  df-neg 8320  df-reap 8722  df-ap 8729  df-div 8820  df-inn 9111  df-2 9169

This theorem is referenced by:  nneo  9550  zeo  9552