logic/cprop.ma hints_declaration.ma sets/setoids1.ma
sets/sets.ma hints_declaration.ma logic/connectives.ma logic/cprop.ma properties/relations1.ma sets/setoids1.ma
-topology/igft.ma sets/sets.ma
+topology/igft.ma logic/equality.ma sets/sets.ma
datatypes/bool.ma logic/pts.ma
sets/setoids1.ma properties/relations1.ma sets/setoids.ma
logic/equality.ma logic/connectives.ma properties/relations.ma
sets/setoids.ma logic/connectives.ma properties/relations.ma
logic/connectives.ma logic/pts.ma
-topology/cantor.ma topology/igft.ma
+topology/cantor.ma nat/nat.ma topology/igft.ma
datatypes/pairs.ma logic/pts.ma
algebra/abelian_magmas.ma algebra/magmas.ma
nat/plus.ma algebra/abelian_magmas.ma algebra/unital_magmas.ma nat/big_ops.ma
"sets/sets.ma" -> "properties/relations1.ma" [];
"sets/sets.ma" -> "sets/setoids1.ma" [];
"topology/igft.ma" [];
+ "topology/igft.ma" -> "logic/equality.ma" [];
"topology/igft.ma" -> "sets/sets.ma" [];
"datatypes/bool.ma" [];
"datatypes/bool.ma" -> "logic/pts.ma" [];
"logic/connectives.ma" [];
"logic/connectives.ma" -> "logic/pts.ma" [];
"topology/cantor.ma" [];
+ "topology/cantor.ma" -> "nat/nat.ma" [];
"topology/cantor.ma" -> "topology/igft.ma" [];
"datatypes/pairs.ma" [];
"datatypes/pairs.ma" -> "logic/pts.ma" [];
%.pdf: %.html
# requires http://torisugari.googlepages.com/commandlineprint2
- iceweasel -print $< -printmode pdf -printfile ./$@
+ touch $@
+ iceweasel -print file://$$PWD/$< -printmode PDF -printfile ./$@
clean:
rm *.html *.png *.mdwn
of the extensionality of the `U_x` construction (while there is no
need to assume the same property for `F_x`!).
-The current version of the formaliztion uses `Id`.
+The current version of the formalization uses `Id`.
The standard library and the `include` command
----------------------------------------------
That, up to rewriting with the equation defining `x`, is what we mean.
Since we decided to use `Id` the rewriting always work (the elimination
-prnciple for `Id` is Leibnitz's equality, that is quantified over
+principle for `Id` is Leibnitz's equality, that is quantified over
the context.
The problem that arises if we decide to make `S` a setoid is that
-`V` has to be extensional w.r.t. the equality of `S` (i.e. the charactestic
+`V` has to be extensional w.r.t. the equality of `S` (i.e. the characteristic
functional proposition has to quotient its input with a relation bigger
than the one of `S`.
D[retr-3]
To use the equation defining `b` we have to eliminate `H`. Unfolding
definitions in `x` tell us there is still something to do. The `nrewrite`
-tactic is a shorcut for the elimination principle of the equlity.
+tactic is a shortcut for the elimination principle of the equality.
It accepts an additional argument `<` or `>` to rewrite left-to-right
or right-to-left.