| .. |
|
Bitwise
|
feat: add Nat.[shiftLeft_or_distrib, shiftLeft_xor_distrib, shiftLeft_and_distrib, testBit_mul_two_pow, bitwise_mul_two_pow, shiftLeft_bitwise_distrib] (#6630)
|
2025-01-16 10:59:00 +00:00 |
|
Div
|
feat: BitVec.{toFin, toInt, msb}_umod (#6404)
|
2025-01-10 23:23:58 +00:00 |
|
Basic.lean
|
chore: rename Nat.not_eq_zero_of_lt (#6968)
|
2025-02-06 10:20:17 +00:00 |
|
Bitwise.lean
|
chore: update copyrights (#5449)
|
2024-09-24 05:27:53 +00:00 |
|
Compare.lean
|
chore: upstream Std.Data.Nat (#3634)
|
2024-03-08 17:00:46 +00:00 |
|
Control.lean
|
feat: Nat.(fold|foldRev|any|all)M? take a function which sees the upper bound (#6139)
|
2024-11-22 03:05:51 +00:00 |
|
Div.lean
|
feat: lemmas about Std.Range (#6396)
|
2024-12-16 03:16:46 +00:00 |
|
Dvd.lean
|
feat: simprocs for Int and Nat divides predicates (#7078)
|
2025-02-14 05:43:38 +00:00 |
|
Fold.lean
|
feat: relate Nat.fold/foldRev/any/all to List.finRange (#6235)
|
2024-11-27 05:38:18 +00:00 |
|
Gcd.lean
|
chore: variables appearing on both sides of an iff should be implicit (#5254)
|
2024-09-04 08:33:24 +00:00 |
|
Lcm.lean
|
fix: add instances to make ac_rfl work out of the box (#3942)
|
2024-04-24 06:12:36 +00:00 |
|
Lemmas.lean
|
chore: simp_arith has been deprecated (#7043)
|
2025-02-12 03:55:45 +00:00 |
|
Linear.lean
|
chore: remove dead code from Nat/Linear.lean (#7042)
|
2025-02-12 02:14:00 +00:00 |
|
Log2.lean
|
chore: don't use simp_arith when simp will do (#5256)
|
2024-09-04 07:56:25 +00:00 |
|
MinMax.lean
|
fix: add instances to make ac_rfl work out of the box (#3942)
|
2024-04-24 06:12:36 +00:00 |
|
Mod.lean
|
chore: remove unnecessary simp priorities (#6812)
|
2025-01-28 23:50:33 +00:00 |
|
Power2.lean
|
chore: simp_arith has been deprecated (#7043)
|
2025-02-12 03:55:45 +00:00 |
|
Simproc.lean
|
fix: replace unary Nat.succ simp rules with simprocs (#3808)
|
2024-04-04 23:15:26 +00:00 |
|
SOM.lean
|
|
|
