| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > modqge0 | GIF version | ||
| Description: The modulo operation is nonnegative. (Contributed by Jim Kingdon, 18-Oct-2021.) |
| Ref | Expression |
|---|---|
| modqge0 | ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 0 < 𝐵) → 0 ≤ (𝐴 mod 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp3 1026 | . . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 0 < 𝐵) → 0 < 𝐵) | |
| 2 | 1 | gt0ne0d 8782 | . . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 0 < 𝐵) → 𝐵 ≠ 0) |
| 3 | qdivcl 9971 | . . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → (𝐴 / 𝐵) ∈ ℚ) | |
| 4 | 2, 3 | syld3an3 1319 | . . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 0 < 𝐵) → (𝐴 / 𝐵) ∈ ℚ) |
| 5 | flqle 10634 | . . . . 5 ⊢ ((𝐴 / 𝐵) ∈ ℚ → (⌊‘(𝐴 / 𝐵)) ≤ (𝐴 / 𝐵)) | |
| 6 | 4, 5 | syl 14 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 0 < 𝐵) → (⌊‘(𝐴 / 𝐵)) ≤ (𝐴 / 𝐵)) |
| 7 | 4 | flqcld 10633 | . . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 0 < 𝐵) → (⌊‘(𝐴 / 𝐵)) ∈ ℤ) |
| 8 | 7 | zred 9696 | . . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 0 < 𝐵) → (⌊‘(𝐴 / 𝐵)) ∈ ℝ) |
| 9 | qre 9953 | . . . . . 6 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℝ) | |
| 10 | 9 | 3ad2ant1 1045 | . . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 0 < 𝐵) → 𝐴 ∈ ℝ) |
| 11 | qre 9953 | . . . . . 6 ⊢ (𝐵 ∈ ℚ → 𝐵 ∈ ℝ) | |
| 12 | 11 | 3ad2ant2 1046 | . . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 0 < 𝐵) → 𝐵 ∈ ℝ) |
| 13 | lemuldiv2 9152 | . . . . 5 ⊢ (((⌊‘(𝐴 / 𝐵)) ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∧ 0 < 𝐵)) → ((𝐵 · (⌊‘(𝐴 / 𝐵))) ≤ 𝐴 ↔ (⌊‘(𝐴 / 𝐵)) ≤ (𝐴 / 𝐵))) | |
| 14 | 8, 10, 12, 1, 13 | syl112anc 1278 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 0 < 𝐵) → ((𝐵 · (⌊‘(𝐴 / 𝐵))) ≤ 𝐴 ↔ (⌊‘(𝐴 / 𝐵)) ≤ (𝐴 / 𝐵))) |
| 15 | 6, 14 | mpbird 167 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 0 < 𝐵) → (𝐵 · (⌊‘(𝐴 / 𝐵))) ≤ 𝐴) |
| 16 | 12, 8 | remulcld 8300 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 0 < 𝐵) → (𝐵 · (⌊‘(𝐴 / 𝐵))) ∈ ℝ) |
| 17 | 10, 16 | subge0d 8805 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 0 < 𝐵) → (0 ≤ (𝐴 − (𝐵 · (⌊‘(𝐴 / 𝐵)))) ↔ (𝐵 · (⌊‘(𝐴 / 𝐵))) ≤ 𝐴)) |
| 18 | 15, 17 | mpbird 167 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 0 < 𝐵) → 0 ≤ (𝐴 − (𝐵 · (⌊‘(𝐴 / 𝐵))))) |
| 19 | modqval 10682 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 0 < 𝐵) → (𝐴 mod 𝐵) = (𝐴 − (𝐵 · (⌊‘(𝐴 / 𝐵))))) | |
| 20 | 18, 19 | breqtrrd 4136 | 1 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 0 < 𝐵) → 0 ≤ (𝐴 mod 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∧ w3a 1005 ∈ wcel 2203 ≠ wne 2412 class class class wbr 4108 ‘cfv 5351 (class class class)co 6049 ℝcr 8122 0cc0 8123 · cmul 8128 < clt 8304 ≤ cle 8305 − cmin 8440 / cdiv 8942 ℚcq 9947 ⌊cfl 10624 mod cmo 10680 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-sep 4227 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-cnex 8214 ax-resscn 8215 ax-1cn 8216 ax-1re 8217 ax-icn 8218 ax-addcl 8219 ax-addrcl 8220 ax-mulcl 8221 ax-mulrcl 8222 ax-addcom 8223 ax-mulcom 8224 ax-addass 8225 ax-mulass 8226 ax-distr 8227 ax-i2m1 8228 ax-0lt1 8229 ax-1rid 8230 ax-0id 8231 ax-rnegex 8232 ax-precex 8233 ax-cnre 8234 ax-pre-ltirr 8235 ax-pre-ltwlin 8236 ax-pre-lttrn 8237 ax-pre-apti 8238 ax-pre-ltadd 8239 ax-pre-mulgt0 8240 ax-pre-mulext 8241 ax-arch 8242 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-id 4413 df-po 4416 df-iso 4417 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-2nd 6334 df-pnf 8306 df-mnf 8307 df-xr 8308 df-ltxr 8309 df-le 8310 df-sub 8442 df-neg 8443 df-reap 8845 df-ap 8852 df-div 8943 df-inn 9234 df-n0 9493 df-z 9574 df-q 9948 df-rp 9983 df-fl 10626 df-mod 10681 |
| This theorem is referenced by: modqelico 10692 zmodcl 10702 modqid2 10709 modqabs 10715 modqmuladdim 10725 modqltm1p1mod 10734 modqsubdir 10751 modqeqmodmin 10752 bitsinv1lem 12640 4sqlem6 13074 |
| Copyright terms: Public domain | W3C validator |