Metamath Proof Explorer


Theorem flsqrt

Description: A condition equivalent to the floor of a square root. (Contributed by AV, 17-Aug-2021)

Ref Expression
Assertion flsqrt ⊢ A ∈ ℝ ∧ 0 ≤ A ∧ B ∈ ℕ 0 → A = B ↔ B 2 ≤ A ∧ A < B + 1 2

Proof

Step Hyp Ref Expression
1 resqrtcl ⊢ A ∈ ℝ ∧ 0 ≤ A → A ∈ ℝ
2 nn0z ⊢ B ∈ ℕ 0 → B ∈ ℤ
3 flbi ⊢ A ∈ ℝ ∧ B ∈ ℤ → A = B ↔ B ≤ A ∧ A < B + 1
4 1 2 3 syl2an ⊢ A ∈ ℝ ∧ 0 ≤ A ∧ B ∈ ℕ 0 → A = B ↔ B ≤ A ∧ A < B + 1
5 nn0re ⊢ B ∈ ℕ 0 → B ∈ ℝ
6 nn0ge0 ⊢ B ∈ ℕ 0 → 0 ≤ B
7 5 6 jca ⊢ B ∈ ℕ 0 → B ∈ ℝ ∧ 0 ≤ B
8 sqrtsq ⊢ B ∈ ℝ ∧ 0 ≤ B → B 2 = B
9 8 eqcomd ⊢ B ∈ ℝ ∧ 0 ≤ B → B = B 2
10 7 9 syl ⊢ B ∈ ℕ 0 → B = B 2
11 10 breq1d ⊢ B ∈ ℕ 0 → B ≤ A ↔ B 2 ≤ A
12 11 adantl ⊢ A ∈ ℝ ∧ 0 ≤ A ∧ B ∈ ℕ 0 → B ≤ A ↔ B 2 ≤ A
13 nn0sqcl ⊢ B ∈ ℕ 0 → B 2 ∈ ℕ 0
14 13 nn0red ⊢ B ∈ ℕ 0 → B 2 ∈ ℝ
15 5 sqge0d ⊢ B ∈ ℕ 0 → 0 ≤ B 2
16 14 15 jca ⊢ B ∈ ℕ 0 → B 2 ∈ ℝ ∧ 0 ≤ B 2
17 16 anim2i ⊢ A ∈ ℝ ∧ 0 ≤ A ∧ B ∈ ℕ 0 → A ∈ ℝ ∧ 0 ≤ A ∧ B 2 ∈ ℝ ∧ 0 ≤ B 2
18 17 ancomd ⊢ A ∈ ℝ ∧ 0 ≤ A ∧ B ∈ ℕ 0 → B 2 ∈ ℝ ∧ 0 ≤ B 2 ∧ A ∈ ℝ ∧ 0 ≤ A
19 sqrtle ⊢ B 2 ∈ ℝ ∧ 0 ≤ B 2 ∧ A ∈ ℝ ∧ 0 ≤ A → B 2 ≤ A ↔ B 2 ≤ A
20 18 19 syl ⊢ A ∈ ℝ ∧ 0 ≤ A ∧ B ∈ ℕ 0 → B 2 ≤ A ↔ B 2 ≤ A
21 12 20 bitr4d ⊢ A ∈ ℝ ∧ 0 ≤ A ∧ B ∈ ℕ 0 → B ≤ A ↔ B 2 ≤ A
22 peano2nn0 ⊢ B ∈ ℕ 0 → B + 1 ∈ ℕ 0
23 22 nn0red ⊢ B ∈ ℕ 0 → B + 1 ∈ ℝ
24 1red ⊢ B ∈ ℕ 0 → 1 ∈ ℝ
25 0le1 ⊢ 0 ≤ 1
26 25 a1i ⊢ B ∈ ℕ 0 → 0 ≤ 1
27 5 24 6 26 addge0d ⊢ B ∈ ℕ 0 → 0 ≤ B + 1
28 23 27 sqrtsqd ⊢ B ∈ ℕ 0 → B + 1 2 = B + 1
29 28 eqcomd ⊢ B ∈ ℕ 0 → B + 1 = B + 1 2
30 29 breq2d ⊢ B ∈ ℕ 0 → A < B + 1 ↔ A < B + 1 2
31 30 adantl ⊢ A ∈ ℝ ∧ 0 ≤ A ∧ B ∈ ℕ 0 → A < B + 1 ↔ A < B + 1 2
32 2nn0 ⊢ 2 ∈ ℕ 0
33 32 a1i ⊢ B ∈ ℕ 0 → 2 ∈ ℕ 0
34 22 33 nn0expcld ⊢ B ∈ ℕ 0 → B + 1 2 ∈ ℕ 0
35 34 nn0red ⊢ B ∈ ℕ 0 → B + 1 2 ∈ ℝ
36 23 sqge0d ⊢ B ∈ ℕ 0 → 0 ≤ B + 1 2
37 35 36 jca ⊢ B ∈ ℕ 0 → B + 1 2 ∈ ℝ ∧ 0 ≤ B + 1 2
38 sqrtlt ⊢ A ∈ ℝ ∧ 0 ≤ A ∧ B + 1 2 ∈ ℝ ∧ 0 ≤ B + 1 2 → A < B + 1 2 ↔ A < B + 1 2
39 37 38 sylan2 ⊢ A ∈ ℝ ∧ 0 ≤ A ∧ B ∈ ℕ 0 → A < B + 1 2 ↔ A < B + 1 2
40 31 39 bitr4d ⊢ A ∈ ℝ ∧ 0 ≤ A ∧ B ∈ ℕ 0 → A < B + 1 ↔ A < B + 1 2
41 21 40 anbi12d ⊢ A ∈ ℝ ∧ 0 ≤ A ∧ B ∈ ℕ 0 → B ≤ A ∧ A < B + 1 ↔ B 2 ≤ A ∧ A < B + 1 2
42 4 41 bitrd ⊢ A ∈ ℝ ∧ 0 ≤ A ∧ B ∈ ℕ 0 → A = B ↔ B 2 ≤ A ∧ A < B + 1 2