lean2/library/data/rat
Jeremy Avigad 7d72c9b6b5 refactor(library/algebra/{field,ordered_field}, library/*): more renaming, setting implicit arguments
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.
2015-09-01 14:47:19 -07:00
..
basic.lean refactor(library/algebra/{field,ordered_field}, library/*): more renaming, setting implicit arguments 2015-09-01 14:47:19 -07:00
bigops.lean feat(library/data/{int,rat,real}/bigops): add bigops for int, rat, real 2015-08-08 17:20:23 -04:00
countable.lean feat(library/data/rat): show that the rationals are encodable and countable 2015-08-12 21:31:24 -07:00
default.lean feat(library/data/{int,rat,real}/bigops): add bigops for int, rat, real 2015-08-08 17:20:23 -04:00
order.lean feat/refactor(library/theories/number_theory/irrational_roots,library/*): show nth roots irrational, and add lots of missing theorems 2015-08-16 23:23:23 -04:00
rat.md feat(library/data/{int,rat,real}/bigops): add bigops for int, rat, real 2015-08-08 17:20:23 -04:00