Floris van Doorn
4895726c54
feat(connectedness): show that if f is n-connected, then trunc_functor k f is so, too
2016-04-11 09:45:59 -07:00
Floris van Doorn
b1ed69f621
feat(hott): small changes, mostly in pointed2
2016-04-11 09:45:59 -07:00
Jeremy Avigad
1f967695a8
feat(library/theories/measure_theory/sigma_algebra): add measurable and borel functions, from Jacob Gross
2016-04-06 17:44:09 -04:00
Jeremy Avigad
ef982d9ad6
refactor(library/theories/analysis/metric_space.lean): use new definition of continuous_at
2016-04-06 16:44:29 -04:00
Jeremy Avigad
c0720d69e3
feat(library/theories/topology/continuous.lean): add theorems about continuous functions (includes work by Jacob Gross)
2016-04-06 16:24:12 -04:00
Jeremy Avigad
73271ac2c9
feat(library/theories/move.lean): add facts to move in Lean 3
2016-04-06 16:14:14 -04:00
Leonardo de Moura
226f8bafeb
fix(library/tactic/rewrite_tactic): do not allow projections to be unfolded
...
fixes #1032
This is just a workaround. A better fix has been implemented in the
lean3 branch.
2016-03-28 13:02:57 -07:00
Jeremy Avigad
a8db8bc61a
feat(library/theories/topology/filterlim): add general theory of limits, based on filters
2016-03-13 15:52:18 -07:00
Leonardo de Moura
0c4a6d3c5e
chore(data/set): cleanup proofs to make them less dependent on unifier heuristics
2016-03-09 18:46:23 -08:00
Leonardo de Moura
5e14b4ebe8
fix(library,hott): avoid rewrite with patterns of the form (?M ...)
2016-03-09 15:39:17 -08:00
Floris van Doorn
e5d5ef9d55
feat(hott/library): various changes and additions.
...
Most notably:
Give le.refl the attribute [refl]. This simplifies tactic proofs in various places.
Redefine the order of trunc_index, and instantiate it as weak order.
Add more about pointed equivalences.
2016-03-03 10:13:20 -08:00
Floris van Doorn
bf403e124a
feat(nat/div): port to HoTT library
2016-03-03 10:13:20 -08:00
Jeremy Avigad
87252bbffe
fix(library/data/set/basic): add spaces in notation for bounded quantifiers
2016-03-03 11:50:40 -05:00
Jeremy Avigad
dc6cd71236
fix(library/algebra/monotone): fix theorem names
2016-03-02 22:54:51 -05:00
Jeremy Avigad
4050892889
refactor(library/*): rename 'compose' to 'comp'
2016-03-02 22:48:05 -05:00
Jeremy Avigad
ebb3e60096
feat(library/algebra/monotone): add properties of monotone functions
2016-03-02 22:01:35 -05:00
Jeremy Avigad
3d09144d73
feat(library/algebra/homomorphism): add homomorphisms between algebraic structures
2016-03-02 19:45:45 -05:00
Daniel Selsam
c23528b5d8
feat(library/blast/blast): use defeq_simplifier to normalize
2016-03-01 13:44:33 -08:00
Leonardo de Moura
fbe5188480
refactor(frontends/lean): remove 'by+' and 'begin+' tokens
2016-02-29 13:45:43 -08:00
Leonardo de Moura
79ba2638b7
fix(library/data/set/equinumerosity): add missing 'using'
2016-02-29 13:29:03 -08:00
Leonardo de Moura
faa0031d4e
refactor(library,hott): remove 'by+' and 'begin+'
2016-02-29 13:15:48 -08:00
Leonardo de Moura
b41c65f549
feat(frontends/lean): remove '[visible]' annotation, remove 'is_visible' tracking
2016-02-29 12:31:23 -08:00
Leonardo de Moura
3b73b5b207
fix(library/theories/group_theory): have-tactic
2016-02-29 12:13:53 -08:00
Leonardo de Moura
deb1b3dc79
refactor(library): replace assert-exprs with have-exprs
2016-02-29 11:53:26 -08:00
Leonardo de Moura
101cf1ec4c
feat(frontends/lean): remove difference between 'have' and 'assert'
2016-02-29 11:28:20 -08:00
Leonardo de Moura
5a4dd3f237
feat(library/reducible): remove [quasireducible] annotation
2016-02-25 17:42:44 -08:00
Leonardo de Moura
768ba1c363
refactor(library/hott): remove more unnecessary annotations
2016-02-25 14:30:00 -08:00
Leonardo de Moura
510168a387
refactor(library,hott): remove unnecessary annotations
2016-02-25 12:26:20 -08:00
Leonardo de Moura
146edde5b3
feat(library/class): mark instances as quasireducible by default
...
quasireducible are also known as lazyreducible.
There is a lot of work to be done.
We still need to revise blast, and add a normalizer for type class
instances. This commit worksaround that by eagerly unfolding
quasireducible.
2016-02-25 12:11:29 -08:00
Leonardo de Moura
c85d6d5a1e
fix(library/init/tactic): typo
2016-02-24 16:10:35 -08:00
Leonardo de Moura
1924b2884c
refactor(library/tactic): remove 'append' and 'interleave' tacticals
...
Preparation for major refactoring in the tactic framework.
2016-02-24 16:02:16 -08:00
Sebastian Ullrich
3de216d302
chore(*.md): fix/remove broken links
2016-02-23 10:11:24 -08:00
Jeremy Avigad
1546c04154
feat(library/theories/analysis/complex_norm): instantiate complex numbers as a real normed vector space
2016-02-22 11:25:24 -08:00
Jeremy Avigad
5246072e96
feat(library/theories/analysis/inner_product): add real inner product spaces
2016-02-22 11:25:24 -08:00
Jeremy Avigad
7f1eb76091
feat(library/theories/analysis/normed_space): add specializations to modules over the reals, to help the elaborator
2016-02-22 11:25:24 -08:00
Jeremy Avigad
ea42a76dc5
refactor/feat(library/theories/analysis/sqrt): break out sqrt, add properties
2016-02-22 11:25:23 -08:00
Jeremy Avigad
3c18f05cab
feat(library/algebra): add some useful facts
2016-02-22 11:25:23 -08:00
Jeremy Avigad
158acf878d
feat(library/data/set/filter): work in material from Jacob Gross
2016-02-22 11:25:23 -08:00
Jeremy Avigad
41342f53df
refactor(library/data/set/filter): get filters working with complete lattice notation
2016-02-22 11:25:23 -08:00
Jeremy Avigad
a08395b17e
refactor(library/algebra/complete_lattice): make complete lattices more usable
...
I addressed two problems. First, the theorem names and notation were all in
the namespace complete_lattice. The problem was that if you opened that
namespace, names (like "sup" and "inf") and notation clashed with global notation
for lattices.
The other problem was that if you defined a lattice using Sup, the Sup you got
was not the Sup you want; it was the Sup-construction from the Inf-construction
from the Sup.
Everything seems good now.
2016-02-22 11:25:23 -08:00
Jeremy Avigad
7fe71c972f
feat(library/data/set/basic): add theorems for bounded unions and intersections
2016-02-22 11:25:23 -08:00
Jeremy Avigad
518a77587a
refactor(library/data/{set,finset},library/*): use compl for set and finset complement
2016-02-22 11:25:23 -08:00
Jeremy Avigad
8f83c78bc9
fix(library/logic/identities,library/*): fix implicit arguments, add implications. Closes #1002 .
2016-02-22 11:25:23 -08:00
Jeremy Avigad
769ae6830d
feat(library/data/set/function): add facts about preimages
2016-02-22 11:25:23 -08:00
Jeremy Avigad
a72f6666e8
feat(library/data/set/basic): add two theorems
2016-02-22 11:25:23 -08:00
Jeremy Avigad
797905b803
feat(library/theories/topology/order_topology): add order_topology, from Jacob Gross
2016-02-22 11:25:23 -08:00
Jeremy Avigad
b8d3f34d14
feat(library/data/set/basic): add a couple of theorems
2016-02-22 11:25:23 -08:00
Jeremy Avigad
03cd2c0013
feat/refactor(library/algebra/interval): use i for infinite, add some theorems
2016-02-22 11:25:23 -08:00
Jeremy Avigad
e80559237a
fix(library/data/real): tinker with instances
...
Convert two instances of has_zero and has_one to local instance,
and change one "[instance]" to a "[trans_instance]". This (by
accident) fixed a problem Rob had a couple of weeks ago.
2016-02-22 11:25:23 -08:00
Jeremy Avigad
15c9ec12cf
fix(library/data/real/division): make temporary has_div only a local instance
2016-02-22 11:25:23 -08:00
