Floris van Doorn
d4a991ef84
feat(hott): define cubes and cubeovers
2015-06-04 20:13:53 -04:00
Floris van Doorn
96a4a015d9
fix(hit): make the nondependent eliminator standard for hits
2015-05-26 21:37:02 -07:00
Floris van Doorn
43bcdd7994
feat(hott): remove sorry's in circle.hlean, characterize pathovers in degenerate pi's
2015-05-26 21:37:01 -07:00
Floris van Doorn
0b12d51b25
feat(hott): use pathovers in all the recursors of hits
...
move pathover file to the init folder
2015-05-26 21:37:01 -07:00
Floris van Doorn
40d5f83851
feat(hit): start using induction tactic
2015-05-26 21:37:01 -07:00
Floris van Doorn
50290fb81c
feat(hott): add recursor attribute to hits
...
recursor attribute is added to both the dependent and nondependent elimination, is such a way that the dependent elimination is used by default
2015-05-26 21:37:01 -07:00
Jeremy Avigad
33214f0895
refactor(hott/*): remove 'Module:' lines
2015-05-23 20:52:58 +10:00
Leonardo de Moura
e1c2340db2
fix(frontends/lean): consistent behavior for protected declarations
...
see https://github.com/leanprover/lean/issues/604#issuecomment-103265608
closes #609
2015-05-18 22:35:18 -07:00
Floris van Doorn
2144036cdb
feat(hott.circle): prove that the fundamental group of the circle is equal to the integers, as groups
...
Also many minor fixes at various places
2015-05-18 15:59:55 -07:00
Floris van Doorn
c2c7c4f79f
feat(hit.circle): finish proof that (base = base) is equivalent to int
2015-05-07 16:39:04 -07:00
Floris van Doorn
111c8e1529
feat(hott): add [unfold-c] and [constructor] attributes for HITs
2015-05-07 16:39:04 -07:00
Floris van Doorn
9893de6194
feat(hit/circle): prove partly that the fundamental group of the circle is int
...
Also add markdown files for nat and int
2015-05-07 16:39:04 -07:00
Floris van Doorn
90f1a691fd
feat(hott): change notation of transport to correspond with standard library
2015-05-07 16:39:03 -07:00
Floris van Doorn
43fb334914
feat(circle): prove loop != base
2015-05-07 16:39:03 -07:00
Floris van Doorn
297d50378d
feat(hott): add definitions using truncations and theorems about them
...
define embedding, (split) surjection, retraction, existential quantifier, 'or' connective
also add a whole bunch of theorems about these definitions
still has two sorry's which can be solved after #564 is closed
2015-04-29 10:04:07 -07:00
Floris van Doorn
15c2ee289f
feat(hott): make some fibrations in path.hlean implicit, and a bit of renaming in init
2015-04-29 10:04:07 -07:00
Floris van Doorn
dbdb8e6050
feat(circle): prove the path computation rule for the circle
2015-04-29 10:04:07 -07:00
Floris van Doorn
c23e707874
feat(circle): define circle as sphere 1, remove all but 1 sorry
2015-04-29 10:04:07 -07:00
Floris van Doorn
6c061991cc
feat(hit): prove path computation rules for all hits except the circle
2015-04-29 10:04:07 -07:00
Floris van Doorn
70a2f6534c
feat(hit): derive path computation rule for elim and elim_type for every hit
...
also make argument of eq_of_rel implicit
also remove most sorry's for hits
path computation rule for rec still needs to be done for all hits
2015-04-29 10:04:07 -07:00
Floris van Doorn
e769fdd9dc
feat(hott): make some arguments in init.path implicit and rename apD to apd
2015-04-29 10:04:06 -07:00
Floris van Doorn
591a563be3
feat(hit): For all hits, add the elimination to the universe (using ua)
2015-04-23 14:29:04 -07:00
Floris van Doorn
51e87213d0
feat(hit): define nondependent recursors for all hits, sequential colimit, and elaborate on spheres
...
squash
2015-04-23 14:29:04 -07:00
