Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > flqge | GIF version |
Description: The floor function value is the greatest integer less than or equal to its argument. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Ref | Expression |
---|---|
flqge | ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ 𝐴 ↔ 𝐵 ≤ (⌊‘𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | flqltp1 10228 | . . . . 5 ⊢ (𝐴 ∈ ℚ → 𝐴 < ((⌊‘𝐴) + 1)) | |
2 | 1 | adantr 274 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → 𝐴 < ((⌊‘𝐴) + 1)) |
3 | simpr 109 | . . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℤ) | |
4 | 3 | zred 9327 | . . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℝ) |
5 | qre 9577 | . . . . . 6 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℝ) | |
6 | 5 | adantr 274 | . . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℝ) |
7 | simpl 108 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℚ) | |
8 | 7 | flqcld 10226 | . . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → (⌊‘𝐴) ∈ ℤ) |
9 | 8 | peano2zd 9330 | . . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → ((⌊‘𝐴) + 1) ∈ ℤ) |
10 | 9 | zred 9327 | . . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → ((⌊‘𝐴) + 1) ∈ ℝ) |
11 | lelttr 8001 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ ((⌊‘𝐴) + 1) ∈ ℝ) → ((𝐵 ≤ 𝐴 ∧ 𝐴 < ((⌊‘𝐴) + 1)) → 𝐵 < ((⌊‘𝐴) + 1))) | |
12 | 4, 6, 10, 11 | syl3anc 1233 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → ((𝐵 ≤ 𝐴 ∧ 𝐴 < ((⌊‘𝐴) + 1)) → 𝐵 < ((⌊‘𝐴) + 1))) |
13 | 2, 12 | mpan2d 426 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ 𝐴 → 𝐵 < ((⌊‘𝐴) + 1))) |
14 | zleltp1 9260 | . . . 4 ⊢ ((𝐵 ∈ ℤ ∧ (⌊‘𝐴) ∈ ℤ) → (𝐵 ≤ (⌊‘𝐴) ↔ 𝐵 < ((⌊‘𝐴) + 1))) | |
15 | 3, 8, 14 | syl2anc 409 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ (⌊‘𝐴) ↔ 𝐵 < ((⌊‘𝐴) + 1))) |
16 | 13, 15 | sylibrd 168 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ 𝐴 → 𝐵 ≤ (⌊‘𝐴))) |
17 | flqle 10227 | . . . 4 ⊢ (𝐴 ∈ ℚ → (⌊‘𝐴) ≤ 𝐴) | |
18 | 17 | adantr 274 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → (⌊‘𝐴) ≤ 𝐴) |
19 | 8 | zred 9327 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → (⌊‘𝐴) ∈ ℝ) |
20 | letr 7995 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ (⌊‘𝐴) ∈ ℝ ∧ 𝐴 ∈ ℝ) → ((𝐵 ≤ (⌊‘𝐴) ∧ (⌊‘𝐴) ≤ 𝐴) → 𝐵 ≤ 𝐴)) | |
21 | 4, 19, 6, 20 | syl3anc 1233 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → ((𝐵 ≤ (⌊‘𝐴) ∧ (⌊‘𝐴) ≤ 𝐴) → 𝐵 ≤ 𝐴)) |
22 | 18, 21 | mpan2d 426 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ (⌊‘𝐴) → 𝐵 ≤ 𝐴)) |
23 | 16, 22 | impbid 128 | 1 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℤ) → (𝐵 ≤ 𝐴 ↔ 𝐵 ≤ (⌊‘𝐴))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∈ wcel 2141 class class class wbr 3987 ‘cfv 5196 (class class class)co 5851 ℝcr 7766 1c1 7768 + caddc 7770 < clt 7947 ≤ cle 7948 ℤcz 9205 ℚcq 9571 ⌊cfl 10217 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-sep 4105 ax-pow 4158 ax-pr 4192 ax-un 4416 ax-setind 4519 ax-cnex 7858 ax-resscn 7859 ax-1cn 7860 ax-1re 7861 ax-icn 7862 ax-addcl 7863 ax-addrcl 7864 ax-mulcl 7865 ax-mulrcl 7866 ax-addcom 7867 ax-mulcom 7868 ax-addass 7869 ax-mulass 7870 ax-distr 7871 ax-i2m1 7872 ax-0lt1 7873 ax-1rid 7874 ax-0id 7875 ax-rnegex 7876 ax-precex 7877 ax-cnre 7878 ax-pre-ltirr 7879 ax-pre-ltwlin 7880 ax-pre-lttrn 7881 ax-pre-apti 7882 ax-pre-ltadd 7883 ax-pre-mulgt0 7884 ax-pre-mulext 7885 ax-arch 7886 |
This theorem depends on definitions: df-bi 116 df-3or 974 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-nel 2436 df-ral 2453 df-rex 2454 df-reu 2455 df-rmo 2456 df-rab 2457 df-v 2732 df-sbc 2956 df-csb 3050 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-pw 3566 df-sn 3587 df-pr 3588 df-op 3590 df-uni 3795 df-int 3830 df-iun 3873 df-br 3988 df-opab 4049 df-mpt 4050 df-id 4276 df-po 4279 df-iso 4280 df-xp 4615 df-rel 4616 df-cnv 4617 df-co 4618 df-dm 4619 df-rn 4620 df-res 4621 df-ima 4622 df-iota 5158 df-fun 5198 df-fn 5199 df-f 5200 df-fv 5204 df-riota 5807 df-ov 5854 df-oprab 5855 df-mpo 5856 df-1st 6117 df-2nd 6118 df-pnf 7949 df-mnf 7950 df-xr 7951 df-ltxr 7952 df-le 7953 df-sub 8085 df-neg 8086 df-reap 8487 df-ap 8494 df-div 8583 df-inn 8872 df-n0 9129 df-z 9206 df-q 9572 df-rp 9604 df-fl 10219 |
This theorem is referenced by: flqlt 10232 flid 10233 flqwordi 10237 flqge0nn0 10242 flqge1nn 10243 flqmulnn0 10248 modqmuladdnn0 10317 hashdvds 12168 |
Copyright terms: Public domain | W3C validator |