fldiv4p1lem1div2 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > fldiv4p1lem1div2		GIF version

Theorem fldiv4p1lem1div2 10740

Description: The floor of an integer equal to 3 or greater than 4, increased by 1, is less than or equal to the half of the integer minus 1. (Contributed by AV, 8-Jul-2021.)

**Assertion**
Ref	Expression
fldiv4p1lem1div2	⊢ ((𝑁 = 3 ∨ 𝑁 ∈ (ℤ_≥‘5)) → ((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 − 1) / 2))

**Proof of Theorem fldiv4p1lem1div2**
Step	Hyp	Ref	Expression
1		1le1 8900	. . . 4 ⊢ 1 ≤ 1
2	1	a1i 9	. . 3 ⊢ (𝑁 = 3 → 1 ≤ 1)
3		oveq1 6092	. . . . . . 7 ⊢ (𝑁 = 3 → (𝑁 / 4) = (3 / 4))
4	3	fveq2d 5699	. . . . . 6 ⊢ (𝑁 = 3 → (⌊‘(𝑁 / 4)) = (⌊‘(3 / 4)))
5		3lt4 9477	. . . . . . 7 ⊢ 3 < 4
6		3nn0 9581	. . . . . . . 8 ⊢ 3 ∈ ℕ₀
7		4nn 9468	. . . . . . . 8 ⊢ 4 ∈ ℕ
8		divfl0 10731	. . . . . . . 8 ⊢ ((3 ∈ ℕ₀ ∧ 4 ∈ ℕ) → (3 < 4 ↔ (⌊‘(3 / 4)) = 0))
9	6, 7, 8	mp2an 430	. . . . . . 7 ⊢ (3 < 4 ↔ (⌊‘(3 / 4)) = 0)
10	5, 9	mpbi 145	. . . . . 6 ⊢ (⌊‘(3 / 4)) = 0
11	4, 10	eqtrdi 2287	. . . . 5 ⊢ (𝑁 = 3 → (⌊‘(𝑁 / 4)) = 0)
12	11	oveq1d 6100	. . . 4 ⊢ (𝑁 = 3 → ((⌊‘(𝑁 / 4)) + 1) = (0 + 1))
13		0p1e1 9418	. . . 4 ⊢ (0 + 1) = 1
14	12, 13	eqtrdi 2287	. . 3 ⊢ (𝑁 = 3 → ((⌊‘(𝑁 / 4)) + 1) = 1)
15		oveq1 6092	. . . . . 6 ⊢ (𝑁 = 3 → (𝑁 − 1) = (3 − 1))
16		3m1e2 9424	. . . . . 6 ⊢ (3 − 1) = 2
17	15, 16	eqtrdi 2287	. . . . 5 ⊢ (𝑁 = 3 → (𝑁 − 1) = 2)
18	17	oveq1d 6100	. . . 4 ⊢ (𝑁 = 3 → ((𝑁 − 1) / 2) = (2 / 2))
19		2div2e1 9437	. . . 4 ⊢ (2 / 2) = 1
20	18, 19	eqtrdi 2287	. . 3 ⊢ (𝑁 = 3 → ((𝑁 − 1) / 2) = 1)
21	2, 14, 20	3brtr4d 4162	. 2 ⊢ (𝑁 = 3 → ((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 − 1) / 2))
22		uzp1 9956	. . 3 ⊢ (𝑁 ∈ (ℤ_≥‘5) → (𝑁 = 5 ∨ 𝑁 ∈ (ℤ_≥‘(5 + 1))))
23		2re 9374	. . . . . . 7 ⊢ 2 ∈ ℝ
24	23	leidi 8813	. . . . . 6 ⊢ 2 ≤ 2
25	24	a1i 9	. . . . 5 ⊢ (𝑁 = 5 → 2 ≤ 2)
26		oveq1 6092	. . . . . . . . 9 ⊢ (𝑁 = 5 → (𝑁 / 4) = (5 / 4))
27	26	fveq2d 5699	. . . . . . . 8 ⊢ (𝑁 = 5 → (⌊‘(𝑁 / 4)) = (⌊‘(5 / 4)))
28		df-5 9366	. . . . . . . . . . . 12 ⊢ 5 = (4 + 1)
29	28	oveq1i 6095	. . . . . . . . . . 11 ⊢ (5 / 4) = ((4 + 1) / 4)
30		4cn 9382	. . . . . . . . . . . . 13 ⊢ 4 ∈ ℂ
31		ax-1cn 8272	. . . . . . . . . . . . 13 ⊢ 1 ∈ ℂ
32		4ap0 9403	. . . . . . . . . . . . 13 ⊢ 4 # 0
33	30, 31, 30, 32	divdirapi 9099	. . . . . . . . . . . 12 ⊢ ((4 + 1) / 4) = ((4 / 4) + (1 / 4))
34	30, 32	dividapi 9075	. . . . . . . . . . . . 13 ⊢ (4 / 4) = 1
35	34	oveq1i 6095	. . . . . . . . . . . 12 ⊢ ((4 / 4) + (1 / 4)) = (1 + (1 / 4))
36	33, 35	eqtri 2259	. . . . . . . . . . 11 ⊢ ((4 + 1) / 4) = (1 + (1 / 4))
37	29, 36	eqtri 2259	. . . . . . . . . 10 ⊢ (5 / 4) = (1 + (1 / 4))
38	37	fveq2i 5698	. . . . . . . . 9 ⊢ (⌊‘(5 / 4)) = (⌊‘(1 + (1 / 4)))
39		1re 8325	. . . . . . . . . . 11 ⊢ 1 ∈ ℝ
40		0le1 8809	. . . . . . . . . . 11 ⊢ 0 ≤ 1
41		4re 9381	. . . . . . . . . . 11 ⊢ 4 ∈ ℝ
42		4pos 9401	. . . . . . . . . . 11 ⊢ 0 < 4
43		divge0 9203	. . . . . . . . . . 11 ⊢ (((1 ∈ ℝ ∧ 0 ≤ 1) ∧ (4 ∈ ℝ ∧ 0 < 4)) → 0 ≤ (1 / 4))
44	39, 40, 41, 42, 43	mp4an 431	. . . . . . . . . 10 ⊢ 0 ≤ (1 / 4)
45		1lt4 9479	. . . . . . . . . . 11 ⊢ 1 < 4
46		recgt1 9227	. . . . . . . . . . . 12 ⊢ ((4 ∈ ℝ ∧ 0 < 4) → (1 < 4 ↔ (1 / 4) < 1))
47	41, 42, 46	mp2an 430	. . . . . . . . . . 11 ⊢ (1 < 4 ↔ (1 / 4) < 1)
48	45, 47	mpbi 145	. . . . . . . . . 10 ⊢ (1 / 4) < 1
49		1z 9670	. . . . . . . . . . 11 ⊢ 1 ∈ ℤ
50		znq 10024	. . . . . . . . . . . 12 ⊢ ((1 ∈ ℤ ∧ 4 ∈ ℕ) → (1 / 4) ∈ ℚ)
51	49, 7, 50	mp2an 430	. . . . . . . . . . 11 ⊢ (1 / 4) ∈ ℚ
52		flqbi2 10726	. . . . . . . . . . 11 ⊢ ((1 ∈ ℤ ∧ (1 / 4) ∈ ℚ) → ((⌊‘(1 + (1 / 4))) = 1 ↔ (0 ≤ (1 / 4) ∧ (1 / 4) < 1)))
53	49, 51, 52	mp2an 430	. . . . . . . . . 10 ⊢ ((⌊‘(1 + (1 / 4))) = 1 ↔ (0 ≤ (1 / 4) ∧ (1 / 4) < 1))
54	44, 48, 53	mpbir2an 955	. . . . . . . . 9 ⊢ (⌊‘(1 + (1 / 4))) = 1
55	38, 54	eqtri 2259	. . . . . . . 8 ⊢ (⌊‘(5 / 4)) = 1
56	27, 55	eqtrdi 2287	. . . . . . 7 ⊢ (𝑁 = 5 → (⌊‘(𝑁 / 4)) = 1)
57	56	oveq1d 6100	. . . . . 6 ⊢ (𝑁 = 5 → ((⌊‘(𝑁 / 4)) + 1) = (1 + 1))
58		1p1e2 9421	. . . . . 6 ⊢ (1 + 1) = 2
59	57, 58	eqtrdi 2287	. . . . 5 ⊢ (𝑁 = 5 → ((⌊‘(𝑁 / 4)) + 1) = 2)
60		oveq1 6092	. . . . . . . 8 ⊢ (𝑁 = 5 → (𝑁 − 1) = (5 − 1))
61	30, 31, 28	mvrraddi 8543	. . . . . . . 8 ⊢ (5 − 1) = 4
62	60, 61	eqtrdi 2287	. . . . . . 7 ⊢ (𝑁 = 5 → (𝑁 − 1) = 4)
63	62	oveq1d 6100	. . . . . 6 ⊢ (𝑁 = 5 → ((𝑁 − 1) / 2) = (4 / 2))
64		4d2e2 9465	. . . . . 6 ⊢ (4 / 2) = 2
65	63, 64	eqtrdi 2287	. . . . 5 ⊢ (𝑁 = 5 → ((𝑁 − 1) / 2) = 2)
66	25, 59, 65	3brtr4d 4162	. . . 4 ⊢ (𝑁 = 5 → ((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 − 1) / 2))
67		eluz2 9927	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘6) ↔ (6 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 6 ≤ 𝑁))
68		znq 10024	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℤ ∧ 4 ∈ ℕ) → (𝑁 / 4) ∈ ℚ)
69	7, 68	mpan2 429	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℤ → (𝑁 / 4) ∈ ℚ)
70		flqle 10713	. . . . . . . . . . 11 ⊢ ((𝑁 / 4) ∈ ℚ → (⌊‘(𝑁 / 4)) ≤ (𝑁 / 4))
71	69, 70	syl 14	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℤ → (⌊‘(𝑁 / 4)) ≤ (𝑁 / 4))
72	71	adantr 276	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ 6 ≤ 𝑁) → (⌊‘(𝑁 / 4)) ≤ (𝑁 / 4))
73	69	flqcld 10712	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℤ → (⌊‘(𝑁 / 4)) ∈ ℤ)
74	73	zred 9768	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℤ → (⌊‘(𝑁 / 4)) ∈ ℝ)
75		zre 9648	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ)
76		id 19	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ ℝ → 𝑁 ∈ ℝ)
77	41	a1i 9	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ ℝ → 4 ∈ ℝ)
78	32	a1i 9	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ ℝ → 4 # 0)
79	76, 77, 78	redivclapd 9165	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℝ → (𝑁 / 4) ∈ ℝ)
80	75, 79	syl 14	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℤ → (𝑁 / 4) ∈ ℝ)
81	39	a1i 9	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℤ → 1 ∈ ℝ)
82	74, 80, 81	3jca 1208	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℤ → ((⌊‘(𝑁 / 4)) ∈ ℝ ∧ (𝑁 / 4) ∈ ℝ ∧ 1 ∈ ℝ))
83	82	adantr 276	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℤ ∧ 6 ≤ 𝑁) → ((⌊‘(𝑁 / 4)) ∈ ℝ ∧ (𝑁 / 4) ∈ ℝ ∧ 1 ∈ ℝ))
84		leadd1 8758	. . . . . . . . . 10 ⊢ (((⌊‘(𝑁 / 4)) ∈ ℝ ∧ (𝑁 / 4) ∈ ℝ ∧ 1 ∈ ℝ) → ((⌊‘(𝑁 / 4)) ≤ (𝑁 / 4) ↔ ((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 / 4) + 1)))
85	83, 84	syl 14	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ 6 ≤ 𝑁) → ((⌊‘(𝑁 / 4)) ≤ (𝑁 / 4) ↔ ((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 / 4) + 1)))
86	72, 85	mpbid 147	. . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ 6 ≤ 𝑁) → ((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 / 4) + 1))
87		div4p1lem1div2 9559	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℝ ∧ 6 ≤ 𝑁) → ((𝑁 / 4) + 1) ≤ ((𝑁 − 1) / 2))
88	75, 87	sylan 283	. . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ 6 ≤ 𝑁) → ((𝑁 / 4) + 1) ≤ ((𝑁 − 1) / 2))
89		peano2re 8462	. . . . . . . . . . . 12 ⊢ ((⌊‘(𝑁 / 4)) ∈ ℝ → ((⌊‘(𝑁 / 4)) + 1) ∈ ℝ)
90	74, 89	syl 14	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℤ → ((⌊‘(𝑁 / 4)) + 1) ∈ ℝ)
91		peano2re 8462	. . . . . . . . . . . 12 ⊢ ((𝑁 / 4) ∈ ℝ → ((𝑁 / 4) + 1) ∈ ℝ)
92	80, 91	syl 14	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℤ → ((𝑁 / 4) + 1) ∈ ℝ)
93		peano2rem 8593	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℝ → (𝑁 − 1) ∈ ℝ)
94	93	rehalfcld 9552	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℝ → ((𝑁 − 1) / 2) ∈ ℝ)
95	75, 94	syl 14	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℤ → ((𝑁 − 1) / 2) ∈ ℝ)
96	90, 92, 95	3jca 1208	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℤ → (((⌊‘(𝑁 / 4)) + 1) ∈ ℝ ∧ ((𝑁 / 4) + 1) ∈ ℝ ∧ ((𝑁 − 1) / 2) ∈ ℝ))
97	96	adantr 276	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ 6 ≤ 𝑁) → (((⌊‘(𝑁 / 4)) + 1) ∈ ℝ ∧ ((𝑁 / 4) + 1) ∈ ℝ ∧ ((𝑁 − 1) / 2) ∈ ℝ))
98		letr 8408	. . . . . . . . 9 ⊢ ((((⌊‘(𝑁 / 4)) + 1) ∈ ℝ ∧ ((𝑁 / 4) + 1) ∈ ℝ ∧ ((𝑁 − 1) / 2) ∈ ℝ) → ((((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 / 4) + 1) ∧ ((𝑁 / 4) + 1) ≤ ((𝑁 − 1) / 2)) → ((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 − 1) / 2)))
99	97, 98	syl 14	. . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ 6 ≤ 𝑁) → ((((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 / 4) + 1) ∧ ((𝑁 / 4) + 1) ≤ ((𝑁 − 1) / 2)) → ((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 − 1) / 2)))
100	86, 88, 99	mp2and 437	. . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 6 ≤ 𝑁) → ((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 − 1) / 2))
101	100	3adant1 1046	. . . . . 6 ⊢ ((6 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 6 ≤ 𝑁) → ((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 − 1) / 2))
102	67, 101	sylbi 121	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘6) → ((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 − 1) / 2))
103		5p1e6 9442	. . . . . 6 ⊢ (5 + 1) = 6
104	103	fveq2i 5698	. . . . 5 ⊢ (ℤ_≥‘(5 + 1)) = (ℤ_≥‘6)
105	102, 104	eleq2s 2333	. . . 4 ⊢ (𝑁 ∈ (ℤ_≥‘(5 + 1)) → ((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 − 1) / 2))
106	66, 105	jaoi 728	. . 3 ⊢ ((𝑁 = 5 ∨ 𝑁 ∈ (ℤ_≥‘(5 + 1))) → ((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 − 1) / 2))
107	22, 106	syl 14	. 2 ⊢ (𝑁 ∈ (ℤ_≥‘5) → ((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 − 1) / 2))
108	21, 107	jaoi 728	1 ⊢ ((𝑁 = 3 ∨ 𝑁 ∈ (ℤ_≥‘5)) → ((⌊‘(𝑁 / 4)) + 1) ≤ ((𝑁 − 1) / 2))

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 720 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 class class class wbr 4130 ‘cfv 5377 (class class class)co 6085 ℝcr 8178 0cc0 8179 1c1 8180 + caddc 8182 < clt 8360 ≤ cle 8361 − cmin 8497 # cap 8909 / cdiv 9002 ℕcn 9304 2c2 9355 3c3 9356 4c4 9357 5c5 9358 6c6 9359 ℕ₀cn0 9563 ℤcz 9644 ℤ_≥cuz 9921 ℚcq 10019 ⌊cfl 10703

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-mulrcl 8278 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-precex 8289 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295 ax-pre-mulgt0 8296 ax-pre-mulext 8297 ax-arch 8298

This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-po 4441 df-iso 4442 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-reap 8903 df-ap 8910 df-div 9003 df-inn 9305 df-2 9363 df-3 9364 df-4 9365 df-5 9366 df-6 9367 df-n0 9564 df-z 9645 df-uz 9922 df-q 10020 df-rp 10055 df-fl 10705

This theorem is used by: gausslemma2dlem0f 16173

W3C validator