Jakob von Raumer
|
aa5e188179
|
feat(hott): add symmetry of pushouts and pointed pushouts
|
2016-01-24 16:30:26 -08:00 |
|
Jakob von Raumer
|
664132b845
|
feat(hott): add calc lemmas for pointed equivalences, make pinl and pinr constructors
|
2016-01-24 16:30:16 -08:00 |
|
Leonardo de Moura
|
66a722ff5a
|
feat(library/unifier): remove "eager delta hack", use is_def_eq when delta-constraint does not have metavariables anymore
The "eager-delta hack" was added to minimize problems in the interaction
between coercions and delta-constraints.
|
2016-01-03 12:39:32 -08:00 |
|
Ulrik Buchholtz
|
f3b2c7010f
|
feat(hott): functoriality of quotients
|
2015-12-28 09:06:13 -08:00 |
|
Floris van Doorn
|
c852f7bc71
|
feat(hott): use the induction tactic for trunc at some places
|
2015-12-17 12:46:16 -08:00 |
|
Floris van Doorn
|
da5f10ce63
|
feat(hott): minor fixes. allow the usage of numerals for trunc_index
|
2015-12-17 12:46:16 -08:00 |
|
Sebastian Ullrich
|
2185ee7e95
|
feat(library/tactic): make let tactic transparent, introduce new opaque note tactic
The new let tactic is semantically equivalent to let terms, while `note`
preserves its old opaque behavior.
|
2015-12-14 10:14:02 -08:00 |
|
Floris van Doorn
|
4ef58f1ba5
|
chore(hott): more cleanup.
Make zero and one reducible (see algebra/port.md)
Change some theorems which need to compute into definitions
|
2015-12-10 10:42:16 -08:00 |
|
Floris van Doorn
|
c968f920ba
|
chore(hott): cleanup
|
2015-12-10 10:42:16 -08:00 |
|
Floris van Doorn
|
65c93b180d
|
fix(types.md): add num
|
2015-12-09 12:36:11 -08:00 |
|
Floris van Doorn
|
2325d23f68
|
feat(hott): port nat and int from the standard library
|
2015-12-09 12:36:11 -08:00 |
|
Floris van Doorn
|
377755e5ab
|
feat(types/sigma): add lemma
|
2015-12-09 12:34:06 -08:00 |
|
Leonardo de Moura
|
6404c3c014
|
chore(hott/types/nat/order): remove occurrence of "migrate" command
|
2015-12-08 15:37:13 -08:00 |
|
Floris van Doorn
|
ae92e8c94d
|
feat(hit/two_quotient): give dependent eliminator for two_quotients
|
2015-11-22 18:29:37 -08:00 |
|
Floris van Doorn
|
0537ef2bd9
|
chore(*): add me as author to files where I made nontrivial contributions
|
2015-11-22 14:21:26 -08:00 |
|
Floris van Doorn
|
74aff044ef
|
feat(group): port three more theorems from the standard library
|
2015-11-22 14:21:26 -08:00 |
|
Floris van Doorn
|
482c68b387
|
feat(*/list): add some computation rules for lists in both libraries
|
2015-11-22 14:21:26 -08:00 |
|
Floris van Doorn
|
93283a4cf8
|
feat(list): also port part of list.comb
|
2015-11-22 14:21:26 -08:00 |
|
Floris van Doorn
|
5abc450fad
|
feat(list): port list.basic from the standard library
|
2015-11-22 14:21:26 -08:00 |
|
Floris van Doorn
|
88a62f8e74
|
feat(algebra|types): small additions
add to markdown file for algebra, and add some definitions in types/
|
2015-11-22 14:21:25 -08:00 |
|
Floris van Doorn
|
45d808ce7f
|
feat(homotopy/circle): give all higher homotopy groups of the circle
|
2015-11-22 14:21:25 -08:00 |
|
Floris van Doorn
|
810a399699
|
style(homotopy/circle): clean-up encode-decode proof
|
2015-11-22 14:21:25 -08:00 |
|
Floris van Doorn
|
206bcd4b2a
|
feat(algebra/homotopy_group): define homotopy groups
|
2015-11-16 21:32:09 -08:00 |
|
Floris van Doorn
|
47be1e3a15
|
feat(types/pointed): change definition of loop space
|
2015-11-16 21:32:09 -08:00 |
|
Floris van Doorn
|
d402b67d25
|
feat(hott/function): show that a function is embedding iff it has propositional fibers
|
2015-11-16 21:32:09 -08:00 |
|
Ulrik Buchholtz
|
aebb88d42b
|
feat(hott/homotopy): connectedness, including HoTT Thm 8.2.1
|
2015-11-08 14:21:16 -08:00 |
|
Floris van Doorn
|
a99a99f047
|
feat(hit/quotient): prove the flattening lemma
|
2015-11-08 14:04:59 -08:00 |
|
Floris van Doorn
|
aa9f32a3bd
|
fix(init/equiv): make transport not an instance
|
2015-11-08 14:04:59 -08:00 |
|
Floris van Doorn
|
f2d07ca23c
|
feat(category): various small changes in category theory
|
2015-11-08 14:04:59 -08:00 |
|
Floris van Doorn
|
de1c47eda9
|
feat(categories): add exponential laws for categories
also give nicer rules to construct equalities between (pre)categories
|
2015-11-08 14:04:59 -08:00 |
|
Leonardo de Moura
|
744d1cba3d
|
feat(library,hott,frontends/lean): avoid keywords with hyphen
|
2015-11-08 14:04:54 -08:00 |
|
Floris van Doorn
|
115dedbd1c
|
fix(hott): notation spacing and markdown files
|
2015-10-02 16:26:10 -07:00 |
|
Leonardo de Moura
|
ede23a3267
|
feat(hott,library): add additional spacing hints
|
2015-09-30 17:41:44 -07:00 |
|
Floris van Doorn
|
aac13a2ee7
|
fix(hott): minor changes to merge ulrik and my commits
|
2015-09-28 09:09:22 -07:00 |
|
Floris van Doorn
|
51edd0ad1d
|
feat(category.constructions.hset): prove that the category of sets is complete
|
2015-09-28 09:09:22 -07:00 |
|
Floris van Doorn
|
f82d1bd566
|
feat(category): add limits in a category
|
2015-09-28 09:09:22 -07:00 |
|
Floris van Doorn
|
3c4c722afd
|
feat(hott): port more from chapters 4 and 6 of the book
|
2015-09-28 09:09:21 -07:00 |
|
Ulrik Buchholtz
|
c6f3f6f3f4
|
feat(hott): prove HoTT book 7.5.4 and 7.5.5
|
2015-09-28 09:09:21 -07:00 |
|
Ulrik Buchholtz
|
25ed9d6e5a
|
feat(hott): prove HoTT book Theorem 4.7.7
|
2015-09-28 09:09:21 -07:00 |
|
Ulrik Buchholtz
|
ed1029641a
|
fix(hott/*): update book.md and clean up homotopy.connectedness
|
2015-09-28 09:09:21 -07:00 |
|
Ulrik Buchholtz
|
2c22501084
|
feat(hott): prove HoTT book Theorem 4.7.6
|
2015-09-28 09:09:21 -07:00 |
|
Ulrik Buchholtz
|
384a366e0f
|
refactor(hott): move homotopy hits to new homotopy folder
|
2015-09-24 22:52:33 -04:00 |
|
Floris van Doorn
|
732897340d
|
fix(types): change some definitions to theorems
|
2015-09-11 23:35:21 -07:00 |
|
Floris van Doorn
|
fb364f8bc7
|
feat(types): add more equivalences between combinations of type constructors
|
2015-09-11 23:35:21 -07:00 |
|
Floris van Doorn
|
e84b22864f
|
feat(hott): various changes in the HoTT library
|
2015-09-11 23:35:21 -07:00 |
|
Floris van Doorn
|
bd3aa9cf54
|
feat(category): prove Theorem 9.5.9 from the HoTT book
|
2015-09-11 23:35:21 -07:00 |
|
Floris van Doorn
|
7e52c49dce
|
feat(hott): many changes is the HoTT library
Prove that 'is_left_adjoint F' is a mere proposition, although this proof is commented out because it takes ~10 seconds
|
2015-09-01 15:17:46 -07:00 |
|
Floris van Doorn
|
f555120428
|
feat(types/eq): add general encode-decode method
|
2015-09-01 15:17:46 -07:00 |
|
Floris van Doorn
|
f4892db432
|
feat(types.trunc): prove the principle of unique choice
|
2015-09-01 15:17:46 -07:00 |
|
Floris van Doorn
|
c24fd508b6
|
feat(hott/types): add more about pathovers in type constructors, prove that double negation elimination doesn't hold universally
|
2015-09-01 15:17:46 -07:00 |
|