7d72c9b6b5
Many theorems for division rings and fields have stronger versions for discrete fields, where we assume x / 0 = 0. Before, we used primes to distinguish the versions, but that has the downside that e.g. for rat and real, all the theorems are equally present. Now, I qualified the weaker ones with division_ring.foo or field.foo. Maybe that is not ideal, but let's try it. I also set implicit arguments with the following convention: an argument to a theorem should be explicit unless it can be inferred from the other arguments and hypotheses. |
||
---|---|---|
.. | ||
basic.lean | ||
bigops.lean | ||
countable.lean | ||
default.lean | ||
order.lean | ||
rat.md |