irrapxlem4 - Mathbox for Stefan O'Rear

	Mathbox for Stefan O'Rear		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > irrapxlem4		Structured version Visualization version GIF version

Theorem irrapxlem4 43274

Description: Lemma for irrapx1 43277. Eliminate ranges, use positivity of the input to force positivity of the output by increasing 𝐵 as needed. (Contributed by Stefan O'Rear, 13-Sep-2014.)

**Assertion**
Ref	Expression
irrapxlem4	⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) → ∃𝑥 ∈ ℕ ∃𝑦 ∈ ℕ (abs‘((𝐴 · 𝑥) − 𝑦)) < (1 / if(𝑥 ≤ 𝐵, 𝐵, 𝑥)))

Distinct variable groups: 𝑥,𝐴,𝑦 𝑥,𝐵,𝑦

Proof of Theorem irrapxlem4 Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elfznn 13501	. . . 4 ⊢ (𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵)) → 𝑎 ∈ ℕ)
2	1	ad3antlr 732	. . 3 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 𝑎 ∈ ℕ)
3		nn0z 12542	. . . . 5 ⊢ (𝑏 ∈ ℕ₀ → 𝑏 ∈ ℤ)
4	3	ad2antlr 728	. . . 4 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 𝑏 ∈ ℤ)
5		simpl 482	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) → 𝐴 ∈ ℝ⁺)
6	5	ad3antrrr 731	. . . . . . . . . . . . 13 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 𝐴 ∈ ℝ⁺)
7	6	rpred 12980	. . . . . . . . . . . 12 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 𝐴 ∈ ℝ)
8	2	nnred 12183	. . . . . . . . . . . 12 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 𝑎 ∈ ℝ)
9	7, 8	remulcld 11169	. . . . . . . . . . 11 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (𝐴 · 𝑎) ∈ ℝ)
10		nn0re 12440	. . . . . . . . . . . 12 ⊢ (𝑏 ∈ ℕ₀ → 𝑏 ∈ ℝ)
11	10	ad2antlr 728	. . . . . . . . . . 11 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 𝑏 ∈ ℝ)
12	9, 11	resubcld 11572	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → ((𝐴 · 𝑎) − 𝑏) ∈ ℝ)
13	12	recnd 11167	. . . . . . . . 9 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → ((𝐴 · 𝑎) − 𝑏) ∈ ℂ)
14	13	abscld 15395	. . . . . . . 8 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (abs‘((𝐴 · 𝑎) − 𝑏)) ∈ ℝ)
15	5	rpreccld 12990	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) → (1 / 𝐴) ∈ ℝ⁺)
16	15	rprege0d 12987	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) → ((1 / 𝐴) ∈ ℝ ∧ 0 ≤ (1 / 𝐴)))
17		flge0nn0 13773	. . . . . . . . . . . 12 ⊢ (((1 / 𝐴) ∈ ℝ ∧ 0 ≤ (1 / 𝐴)) → (⌊‘(1 / 𝐴)) ∈ ℕ₀)
18		nn0p1nn 12470	. . . . . . . . . . . 12 ⊢ ((⌊‘(1 / 𝐴)) ∈ ℕ₀ → ((⌊‘(1 / 𝐴)) + 1) ∈ ℕ)
19	16, 17, 18	3syl 18	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) → ((⌊‘(1 / 𝐴)) + 1) ∈ ℕ)
20	19	ad3antrrr 731	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → ((⌊‘(1 / 𝐴)) + 1) ∈ ℕ)
21		simpr 484	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) → 𝐵 ∈ ℕ)
22	21	ad3antrrr 731	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 𝐵 ∈ ℕ)
23	20, 22	ifcld 4514	. . . . . . . . 9 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵) ∈ ℕ)
24	23	nnrecred 12222	. . . . . . . 8 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵)) ∈ ℝ)
25		0red 11141	. . . . . . . . 9 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 0 ∈ ℝ)
26	9, 25	resubcld 11572	. . . . . . . 8 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → ((𝐴 · 𝑎) − 0) ∈ ℝ)
27		simpr 484	. . . . . . . 8 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵)))
28	20	nnrecred 12222	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (1 / ((⌊‘(1 / 𝐴)) + 1)) ∈ ℝ)
29	22	nnred 12183	. . . . . . . . . . . 12 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 𝐵 ∈ ℝ)
30	6	rprecred 12991	. . . . . . . . . . . . . . 15 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (1 / 𝐴) ∈ ℝ)
31	30	flcld 13751	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (⌊‘(1 / 𝐴)) ∈ ℤ)
32	31	zred 12627	. . . . . . . . . . . . 13 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (⌊‘(1 / 𝐴)) ∈ ℝ)
33		peano2re 11313	. . . . . . . . . . . . 13 ⊢ ((⌊‘(1 / 𝐴)) ∈ ℝ → ((⌊‘(1 / 𝐴)) + 1) ∈ ℝ)
34	32, 33	syl 17	. . . . . . . . . . . 12 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → ((⌊‘(1 / 𝐴)) + 1) ∈ ℝ)
35		max2 13133	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ ℝ ∧ ((⌊‘(1 / 𝐴)) + 1) ∈ ℝ) → ((⌊‘(1 / 𝐴)) + 1) ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))
36	29, 34, 35	syl2anc 585	. . . . . . . . . . 11 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → ((⌊‘(1 / 𝐴)) + 1) ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))
37	20	nngt0d 12220	. . . . . . . . . . . 12 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 0 < ((⌊‘(1 / 𝐴)) + 1))
38	23	nnred 12183	. . . . . . . . . . . 12 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵) ∈ ℝ)
39	23	nngt0d 12220	. . . . . . . . . . . 12 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 0 < if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))
40		lerec 12033	. . . . . . . . . . . 12 ⊢ (((((⌊‘(1 / 𝐴)) + 1) ∈ ℝ ∧ 0 < ((⌊‘(1 / 𝐴)) + 1)) ∧ (if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵) ∈ ℝ ∧ 0 < if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (((⌊‘(1 / 𝐴)) + 1) ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵) ↔ (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵)) ≤ (1 / ((⌊‘(1 / 𝐴)) + 1))))
41	34, 37, 38, 39, 40	syl22anc 839	. . . . . . . . . . 11 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (((⌊‘(1 / 𝐴)) + 1) ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵) ↔ (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵)) ≤ (1 / ((⌊‘(1 / 𝐴)) + 1))))
42	36, 41	mpbid 232	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵)) ≤ (1 / ((⌊‘(1 / 𝐴)) + 1)))
43		fllep1 13754	. . . . . . . . . . . . 13 ⊢ ((1 / 𝐴) ∈ ℝ → (1 / 𝐴) ≤ ((⌊‘(1 / 𝐴)) + 1))
44	30, 43	syl 17	. . . . . . . . . . . 12 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (1 / 𝐴) ≤ ((⌊‘(1 / 𝐴)) + 1))
45	20	nncnd 12184	. . . . . . . . . . . . 13 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → ((⌊‘(1 / 𝐴)) + 1) ∈ ℂ)
46	20	nnne0d 12221	. . . . . . . . . . . . 13 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → ((⌊‘(1 / 𝐴)) + 1) ≠ 0)
47	45, 46	recrecd 11922	. . . . . . . . . . . 12 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (1 / (1 / ((⌊‘(1 / 𝐴)) + 1))) = ((⌊‘(1 / 𝐴)) + 1))
48	44, 47	breqtrrd 5114	. . . . . . . . . . 11 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (1 / 𝐴) ≤ (1 / (1 / ((⌊‘(1 / 𝐴)) + 1))))
49	34, 37	recgt0d 12084	. . . . . . . . . . . 12 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 0 < (1 / ((⌊‘(1 / 𝐴)) + 1)))
50	6	rpgt0d 12983	. . . . . . . . . . . 12 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 0 < 𝐴)
51		lerec 12033	. . . . . . . . . . . 12 ⊢ ((((1 / ((⌊‘(1 / 𝐴)) + 1)) ∈ ℝ ∧ 0 < (1 / ((⌊‘(1 / 𝐴)) + 1))) ∧ (𝐴 ∈ ℝ ∧ 0 < 𝐴)) → ((1 / ((⌊‘(1 / 𝐴)) + 1)) ≤ 𝐴 ↔ (1 / 𝐴) ≤ (1 / (1 / ((⌊‘(1 / 𝐴)) + 1)))))
52	28, 49, 7, 50, 51	syl22anc 839	. . . . . . . . . . 11 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → ((1 / ((⌊‘(1 / 𝐴)) + 1)) ≤ 𝐴 ↔ (1 / 𝐴) ≤ (1 / (1 / ((⌊‘(1 / 𝐴)) + 1)))))
53	48, 52	mpbird 257	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (1 / ((⌊‘(1 / 𝐴)) + 1)) ≤ 𝐴)
54	24, 28, 7, 42, 53	letrd 11297	. . . . . . . . 9 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵)) ≤ 𝐴)
55	7	recnd 11167	. . . . . . . . . . . 12 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 𝐴 ∈ ℂ)
56	55	mulridd 11156	. . . . . . . . . . 11 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (𝐴 · 1) = 𝐴)
57	2	nnge1d 12219	. . . . . . . . . . . 12 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 1 ≤ 𝑎)
58		1red 11139	. . . . . . . . . . . . 13 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 1 ∈ ℝ)
59	58, 8, 6	lemul2d 13024	. . . . . . . . . . . 12 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (1 ≤ 𝑎 ↔ (𝐴 · 1) ≤ (𝐴 · 𝑎)))
60	57, 59	mpbid 232	. . . . . . . . . . 11 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (𝐴 · 1) ≤ (𝐴 · 𝑎))
61	56, 60	eqbrtrrd 5110	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 𝐴 ≤ (𝐴 · 𝑎))
62	9	recnd 11167	. . . . . . . . . . 11 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (𝐴 · 𝑎) ∈ ℂ)
63	62	subid1d 11488	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → ((𝐴 · 𝑎) − 0) = (𝐴 · 𝑎))
64	61, 63	breqtrrd 5114	. . . . . . . . 9 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 𝐴 ≤ ((𝐴 · 𝑎) − 0))
65	24, 7, 26, 54, 64	letrd 11297	. . . . . . . 8 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵)) ≤ ((𝐴 · 𝑎) − 0))
66	14, 24, 26, 27, 65	ltletrd 11300	. . . . . . 7 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (abs‘((𝐴 · 𝑎) − 𝑏)) < ((𝐴 · 𝑎) − 0))
67	12, 26	absltd 15388	. . . . . . 7 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → ((abs‘((𝐴 · 𝑎) − 𝑏)) < ((𝐴 · 𝑎) − 0) ↔ (-((𝐴 · 𝑎) − 0) < ((𝐴 · 𝑎) − 𝑏) ∧ ((𝐴 · 𝑎) − 𝑏) < ((𝐴 · 𝑎) − 0))))
68	66, 67	mpbid 232	. . . . . 6 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (-((𝐴 · 𝑎) − 0) < ((𝐴 · 𝑎) − 𝑏) ∧ ((𝐴 · 𝑎) − 𝑏) < ((𝐴 · 𝑎) − 0)))
69	68	simprd 495	. . . . 5 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → ((𝐴 · 𝑎) − 𝑏) < ((𝐴 · 𝑎) − 0))
70	25, 11, 9	ltsub2d 11754	. . . . 5 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (0 < 𝑏 ↔ ((𝐴 · 𝑎) − 𝑏) < ((𝐴 · 𝑎) − 0)))
71	69, 70	mpbird 257	. . . 4 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 0 < 𝑏)
72		elnnz 12528	. . . 4 ⊢ (𝑏 ∈ ℕ ↔ (𝑏 ∈ ℤ ∧ 0 < 𝑏))
73	4, 71, 72	sylanbrc 584	. . 3 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 𝑏 ∈ ℕ)
74	22, 2	ifcld 4514	. . . . 5 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → if(𝑎 ≤ 𝐵, 𝐵, 𝑎) ∈ ℕ)
75	74	nnrecred 12222	. . . 4 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (1 / if(𝑎 ≤ 𝐵, 𝐵, 𝑎)) ∈ ℝ)
76		elfzle2 13476	. . . . . . 7 ⊢ (𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵)) → 𝑎 ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))
77	76	ad3antlr 732	. . . . . 6 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 𝑎 ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))
78		max1 13131	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ ((⌊‘(1 / 𝐴)) + 1) ∈ ℝ) → 𝐵 ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))
79	29, 34, 78	syl2anc 585	. . . . . 6 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 𝐵 ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))
80		maxle 13137	. . . . . . 7 ⊢ ((𝑎 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵) ∈ ℝ) → (if(𝑎 ≤ 𝐵, 𝐵, 𝑎) ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵) ↔ (𝑎 ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵) ∧ 𝐵 ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))))
81	8, 29, 38, 80	syl3anc 1374	. . . . . 6 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (if(𝑎 ≤ 𝐵, 𝐵, 𝑎) ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵) ↔ (𝑎 ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵) ∧ 𝐵 ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))))
82	77, 79, 81	mpbir2and 714	. . . . 5 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → if(𝑎 ≤ 𝐵, 𝐵, 𝑎) ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))
83	29, 8	ifcld 4514	. . . . . 6 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → if(𝑎 ≤ 𝐵, 𝐵, 𝑎) ∈ ℝ)
84	22	nngt0d 12220	. . . . . . 7 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 0 < 𝐵)
85		max2 13133	. . . . . . . 8 ⊢ ((𝑎 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐵 ≤ if(𝑎 ≤ 𝐵, 𝐵, 𝑎))
86	8, 29, 85	syl2anc 585	. . . . . . 7 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 𝐵 ≤ if(𝑎 ≤ 𝐵, 𝐵, 𝑎))
87	25, 29, 83, 84, 86	ltletrd 11300	. . . . . 6 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → 0 < if(𝑎 ≤ 𝐵, 𝐵, 𝑎))
88		lerec 12033	. . . . . 6 ⊢ (((if(𝑎 ≤ 𝐵, 𝐵, 𝑎) ∈ ℝ ∧ 0 < if(𝑎 ≤ 𝐵, 𝐵, 𝑎)) ∧ (if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵) ∈ ℝ ∧ 0 < if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (if(𝑎 ≤ 𝐵, 𝐵, 𝑎) ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵) ↔ (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵)) ≤ (1 / if(𝑎 ≤ 𝐵, 𝐵, 𝑎))))
89	83, 87, 38, 39, 88	syl22anc 839	. . . . 5 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (if(𝑎 ≤ 𝐵, 𝐵, 𝑎) ≤ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵) ↔ (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵)) ≤ (1 / if(𝑎 ≤ 𝐵, 𝐵, 𝑎))))
90	82, 89	mpbid 232	. . . 4 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵)) ≤ (1 / if(𝑎 ≤ 𝐵, 𝐵, 𝑎)))
91	14, 24, 75, 27, 90	ltletrd 11300	. . 3 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝑎 ≤ 𝐵, 𝐵, 𝑎)))
92		oveq2 7369	. . . . . 6 ⊢ (𝑥 = 𝑎 → (𝐴 · 𝑥) = (𝐴 · 𝑎))
93	92	fvoveq1d 7383	. . . . 5 ⊢ (𝑥 = 𝑎 → (abs‘((𝐴 · 𝑥) − 𝑦)) = (abs‘((𝐴 · 𝑎) − 𝑦)))
94		breq1 5089	. . . . . . 7 ⊢ (𝑥 = 𝑎 → (𝑥 ≤ 𝐵 ↔ 𝑎 ≤ 𝐵))
95		id 22	. . . . . . 7 ⊢ (𝑥 = 𝑎 → 𝑥 = 𝑎)
96	94, 95	ifbieq2d 4494	. . . . . 6 ⊢ (𝑥 = 𝑎 → if(𝑥 ≤ 𝐵, 𝐵, 𝑥) = if(𝑎 ≤ 𝐵, 𝐵, 𝑎))
97	96	oveq2d 7377	. . . . 5 ⊢ (𝑥 = 𝑎 → (1 / if(𝑥 ≤ 𝐵, 𝐵, 𝑥)) = (1 / if(𝑎 ≤ 𝐵, 𝐵, 𝑎)))
98	93, 97	breq12d 5099	. . . 4 ⊢ (𝑥 = 𝑎 → ((abs‘((𝐴 · 𝑥) − 𝑦)) < (1 / if(𝑥 ≤ 𝐵, 𝐵, 𝑥)) ↔ (abs‘((𝐴 · 𝑎) − 𝑦)) < (1 / if(𝑎 ≤ 𝐵, 𝐵, 𝑎))))
99		oveq2 7369	. . . . . 6 ⊢ (𝑦 = 𝑏 → ((𝐴 · 𝑎) − 𝑦) = ((𝐴 · 𝑎) − 𝑏))
100	99	fveq2d 6839	. . . . 5 ⊢ (𝑦 = 𝑏 → (abs‘((𝐴 · 𝑎) − 𝑦)) = (abs‘((𝐴 · 𝑎) − 𝑏)))
101	100	breq1d 5096	. . . 4 ⊢ (𝑦 = 𝑏 → ((abs‘((𝐴 · 𝑎) − 𝑦)) < (1 / if(𝑎 ≤ 𝐵, 𝐵, 𝑎)) ↔ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝑎 ≤ 𝐵, 𝐵, 𝑎))))
102	98, 101	rspc2ev 3578	. . 3 ⊢ ((𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝑎 ≤ 𝐵, 𝐵, 𝑎))) → ∃𝑥 ∈ ℕ ∃𝑦 ∈ ℕ (abs‘((𝐴 · 𝑥) − 𝑦)) < (1 / if(𝑥 ≤ 𝐵, 𝐵, 𝑥)))
103	2, 73, 91, 102	syl3anc 1374	. 2 ⊢ (((((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) ∧ 𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) ∧ 𝑏 ∈ ℕ₀) ∧ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))) → ∃𝑥 ∈ ℕ ∃𝑦 ∈ ℕ (abs‘((𝐴 · 𝑥) − 𝑦)) < (1 / if(𝑥 ≤ 𝐵, 𝐵, 𝑥)))
104	19, 21	ifcld 4514	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) → if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵) ∈ ℕ)
105		irrapxlem3 43273	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵) ∈ ℕ) → ∃𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))∃𝑏 ∈ ℕ₀ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵)))
106	5, 104, 105	syl2anc 585	. 2 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) → ∃𝑎 ∈ (1...if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵))∃𝑏 ∈ ℕ₀ (abs‘((𝐴 · 𝑎) − 𝑏)) < (1 / if(𝐵 ≤ ((⌊‘(1 / 𝐴)) + 1), ((⌊‘(1 / 𝐴)) + 1), 𝐵)))
107	103, 106	r19.29vva 3198	1 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐵 ∈ ℕ) → ∃𝑥 ∈ ℕ ∃𝑦 ∈ ℕ (abs‘((𝐴 · 𝑥) − 𝑦)) < (1 / if(𝑥 ≤ 𝐵, 𝐵, 𝑥)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2114 ∃wrex 3062 ifcif 4467 class class class wbr 5086 ‘cfv 6493 (class class class)co 7361 ℝcr 11031 0cc0 11032 1c1 11033 + caddc 11035 · cmul 11037 < clt 11173 ≤ cle 11174 − cmin 11371 -cneg 11372 / cdiv 11801 ℕcn 12168 ℕ₀cn0 12431 ℤcz 12518 ℝ⁺crp 12936 ...cfz 13455 ⌊cfl 13743 abscabs 15190

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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109 ax-pre-sup 11110

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-1st 7936 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-oadd 8403 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-sup 9349 df-inf 9350 df-card 9857 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-div 11802 df-nn 12169 df-2 12238 df-3 12239 df-n0 12432 df-xnn0 12505 df-z 12519 df-uz 12783 df-rp 12937 df-ico 13298 df-fz 13456 df-fl 13745 df-mod 13823 df-seq 13958 df-exp 14018 df-hash 14287 df-cj 15055 df-re 15056 df-im 15057 df-sqrt 15191 df-abs 15192

This theorem is referenced by: irrapxlem5 43275

W3C validator