Matthew Robert Ballard
Matthew Robert Ballard
Lean can figure these out and if inferred instance of `Mul` (or `Add`) contains non-reducible terms, it will block unification. --- - [ ] depends on: #11521 [](https://gitpod.io/from-referrer/)
### Prerequisites * [X] Put an X between the brackets on this line if you have done all of the following: * Check that your issue is not already [filed](https://github.com/leanprover/lean4/issues)....
Currently there is the following in `Lean.Meta.SynthInstance` ```lean /- TODO: use a configuration option instead of the hard-coded limit `1`. -/ if (← read).synthPendingDepth > 1 then trace[Meta.synthPending] "too many...
These are wrappers around the constructor and projection for `Opposite Quiver.Hom _ _`. The projection itself is reducible and with structure eta built in to defeq it seems like we...
change
--- [](https://gitpod.io/from-referrer/)
test
:wq --- [](https://gitpod.io/from-referrer/)
When we need algebra structures on `PUnit`, we should be more surgical about what we are importing. --- [](https://gitpod.io/from-referrer/)
We split `Algebra.Order.Nonneg.Ring` into `Algebra.Order.Nonneg.Ring` which uses unbundled ordered algebra typeclasses, eg `CovariantClass`, and `Algebra.Order.Nonneg.OrderedRing` which uses bundled class, eg `OrderedAddComm`. Using this we can avoid importing bundled ordered algebra...
We should be able to use these results about unbundled ordered algebra without importing the heavy machinery of the bundled typeclasses. --- - [ ] depends on: #14393 [![Open in...
In principle, `Fintype.univ_ofSubsingleton` could be a `simp` theorem but it applies to any occurence of `univ` and requires unification of the (possibly very complex) `Fintype` instances. It appears to not...