Proof Assistant Projects
Collection
Digesting proof assistant libraries for AI ingestion. • 103 items • Updated • 3
statement stringlengths 1 3.35k | proof stringlengths 0 26.9k | type stringclasses 16
values | symbolic_name stringlengths 1 89 | library stringclasses 189
values | filename stringlengths 20 105 | imports listlengths 1 72 | deps listlengths 0 64 | docstring stringlengths 0 3.07k | source_url stringclasses 1
value | commit stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|
abgr : UU | := abelian_group_category. | Definition | abgr | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"UU",
"abelian_group_category"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
make_abgr (X : setwithbinop) (is : isabgrop (@op X)) : abgr | :=
X ,, is. | Definition | make_abgr | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"is",
"isabgrop",
"op",
"setwithbinop"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrconstr (X : abmonoid) (inv0 : X → X) (is : isinv (@op X) 0 inv0) : abgr. | Proof.
use make_abgr.
- exact X.
- use make_isabgrop.
+ use make_isgrop.
* apply (make_ismonoidop (assocax X)).
exact (make_isunital (unel X) (unax X)).
* exact (make_invstruct inv0 is).
+ exact (commax X).
Defined. | Definition | abgrconstr | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"abmonoid",
"assocax",
"commax",
"is",
"isinv",
"make_abgr",
"make_invstruct",
"make_isabgrop",
"make_isgrop",
"make_ismonoidop",
"make_isunital",
"op",
"unax",
"unel"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrtogr : abgr → gr | := λ X, make_gr (pr1 X) (pr1 (pr2 X)). | Definition | abgrtogr | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"gr",
"make_gr"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrtogr : abgr >-> gr. | Coercion | abgrtogr | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"gr"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | ||
abgrtoabmonoid : abgr → abmonoid | :=
λ X, make_abmonoid (pr1 X) (pr1 (pr1 (pr2 X)) ,, pr2 (pr2 X)). | Definition | abgrtoabmonoid | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"abmonoid",
"make_abmonoid"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrtoabmonoid : abgr >-> abmonoid. | Coercion | abgrtoabmonoid | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"abmonoid"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | ||
abgr_of_gr (X : gr) (H : iscomm (@op X)) : abgr | :=
make_abgr X (make_isabgrop (pr2 X) H). | Definition | abgr_of_gr | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"gr",
"iscomm",
"make_abgr",
"make_isabgrop",
"op"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
"x - y" | := (op x (grinv _ y)) : abgr. | Notation | x - y | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"grinv",
"op"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
"- y" | := (grinv _ y) : abgr. | Notation | - y | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"grinv"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abelian_group_morphism
(X Y : abgr)
: UU | := abelian_group_category⟦X, Y⟧%cat. | Definition | abelian_group_morphism | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"UU",
"abgr"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abelian_group_morphism_to_group_morphism
{X Y : abgr}
(f : abelian_group_morphism X Y)
: group_morphism X Y | := pr1 f ,, pr12 f. | Definition | abelian_group_morphism_to_group_morphism | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr",
"group_morphism"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abelian_group_morphism_to_group_morphism : abelian_group_morphism >-> group_morphism. | Coercion | abelian_group_morphism_to_group_morphism | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"group_morphism"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | ||
abelian_group_to_monoid_morphism
{X Y : abgr}
(f : abelian_group_morphism X Y)
: abelian_monoid_morphism X Y. | Proof.
use make_abelian_monoid_morphism.
- exact f.
- apply make_ismonoidfun.
+ apply binopfunisbinopfun.
+ exact (monoidfununel f).
Defined. | Definition | abelian_group_to_monoid_morphism | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abelian_monoid_morphism",
"abgr",
"binopfunisbinopfun",
"make_abelian_monoid_morphism",
"make_ismonoidfun",
"monoidfununel"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
make_abelian_group_morphism
{X Y : abgr}
(f : X → Y)
(H : isbinopfun f)
: abelian_group_morphism X Y | := (f ,, H) ,, (((tt ,, binopfun_preserves_unit f H) ,, binopfun_preserves_inv f H) ,, tt). | Definition | make_abelian_group_morphism | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr",
"binopfun_preserves_inv",
"binopfun_preserves_unit",
"isbinopfun"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
binopfun_to_abelian_group_morphism
{X Y : abgr}
(f : binopfun X Y)
: abelian_group_morphism X Y | := make_abelian_group_morphism f (binopfunisbinopfun f). | Definition | binopfun_to_abelian_group_morphism | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr",
"binopfun",
"binopfunisbinopfun",
"make_abelian_group_morphism"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abelian_group_morphism_paths
{X Y : abgr}
(f g : abelian_group_morphism X Y)
(H : (f : X → Y) = g)
: f = g. | Proof.
apply subtypePath.
{
refine (λ (h : magma_morphism _ _), _).
refine (isapropdirprod _ _ _ isapropunit).
apply (isapropdirprod _ (∏ x, (h (grinv X x) = grinv Y (h x)))).
- apply (isapropdirprod _ _ isapropunit).
apply setproperty.
- apply impred_isaprop.
intro.
apply setp... | Lemma | abelian_group_morphism_paths | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr",
"binopfun_paths",
"grinv",
"impred_isaprop",
"isapropdirprod",
"isapropunit",
"magma_morphism",
"setproperty",
"subtypePath"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abelian_group_morphism_eq
{X Y : abgr}
{f g : abelian_group_morphism X Y}
: (f = g) ≃ (∏ x, f x = g x). | Proof.
use weqimplimpl.
- intros e x.
exact (maponpaths (λ (f : abelian_group_morphism _ _), f x) e).
- intro e.
apply abelian_group_morphism_paths, funextfun.
exact e.
- abstract apply homset_property.
- abstract (
apply impred_isaprop;
intro;
apply setproperty
).
Defined. | Definition | abelian_group_morphism_eq | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abelian_group_morphism_paths",
"abgr",
"funextfun",
"homset_property",
"impred_isaprop",
"maponpaths",
"setproperty",
"weqimplimpl"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
identity_abelian_group_morphism
(X : abgr)
: abelian_group_morphism X X | := identity X. | Definition | identity_abelian_group_morphism | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr",
"identity"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
composite_abelian_group_morphism
{X Y Z : abgr}
(f : abelian_group_morphism X Y)
(g : abelian_group_morphism Y Z)
: abelian_group_morphism X Z | := (f · g)%cat. | Definition | composite_abelian_group_morphism | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
unitabgr_isabgrop : isabgrop (@op unitabmonoid). | Proof.
use make_isabgrop.
- exact unitgr_isgrop.
- abstract exact (commax unitabmonoid).
Defined. | Definition | unitabgr_isabgrop | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"commax",
"isabgrop",
"make_isabgrop",
"op",
"unitabmonoid",
"unitgr_isgrop"
] | *** Construction of the trivial abgr consisting of one element given by unit. | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 |
unitabgr : abgr | := make_abgr unitabmonoid unitabgr_isabgrop. | Definition | unitabgr | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"make_abgr",
"unitabgr_isabgrop",
"unitabmonoid"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
unel_abelian_group_morphism (X Y : abgr) : abelian_group_morphism X Y | :=
binopfun_to_abelian_group_morphism (unelmonoidfun X Y). | Definition | unel_abelian_group_morphism | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr",
"binopfun_to_abelian_group_morphism",
"unelmonoidfun"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrshombinop
{X Y : abgr} (f g : abelian_group_morphism X Y)
: abelian_group_morphism X Y. | Proof.
apply binopfun_to_abelian_group_morphism.
exact (abmonoidshombinop (X := X) (Y := Y) f g).
Defined. | Definition | abgrshombinop | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr",
"abmonoidshombinop",
"binopfun_to_abelian_group_morphism"
] | *** Abelian group structure on morphism between abelian groups | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 |
abgrshombinop_inv_isbinopfun {X Y : abgr} (f : abelian_group_morphism X Y) :
isbinopfun (λ x : X, grinv Y (f x)). | Proof.
apply make_isbinopfun. intros x x'. cbn.
rewrite (monoidfunmul f). rewrite (pr2 (pr2 Y)). apply (grinvop Y).
Qed. | Definition | abgrshombinop_inv_isbinopfun | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr",
"grinv",
"grinvop",
"isbinopfun",
"make_isbinopfun",
"monoidfunmul",
"x'"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrshombinop_inv {X Y : abgr} (f : abelian_group_morphism X Y) : abelian_group_morphism X Y | :=
make_abelian_group_morphism _ (abgrshombinop_inv_isbinopfun f). | Definition | abgrshombinop_inv | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr",
"abgrshombinop_inv_isbinopfun",
"make_abelian_group_morphism"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrshombinop_linvax {X Y : abgr} (f : abelian_group_morphism X Y) :
abgrshombinop (abgrshombinop_inv f) f = unel_abelian_group_morphism X Y. | Proof.
apply abelian_group_morphism_eq. intros x. apply (@grlinvax Y).
Qed. | Definition | abgrshombinop_linvax | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abelian_group_morphism_eq",
"abgr",
"abgrshombinop",
"abgrshombinop_inv",
"grlinvax",
"unel_abelian_group_morphism"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrshombinop_rinvax {X Y : abgr} (f : abelian_group_morphism X Y) :
abgrshombinop f (abgrshombinop_inv f) = unel_abelian_group_morphism X Y. | Proof.
apply abelian_group_morphism_eq. intros x. apply (grrinvax Y).
Qed. | Definition | abgrshombinop_rinvax | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abelian_group_morphism_eq",
"abgr",
"abgrshombinop",
"abgrshombinop_inv",
"grrinvax",
"unel_abelian_group_morphism"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrshomabgr_isabgrop (X Y : abgr) :
isabgrop (abgrshombinop (X := X) (Y := Y)). | Proof.
use make_isabgrop.
- use make_isgrop.
+ apply make_ismonoidop.
* abstract (
do 3 intro;
apply abelian_group_morphism_eq;
intro;
apply assocax
).
* apply (make_isunital (unel_abelian_group_morphism X Y));
abstract (
apply ma... | Lemma | abgrshomabgr_isabgrop | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism_eq",
"abgr",
"abgrshombinop",
"abgrshombinop_inv",
"abgrshombinop_linvax",
"abgrshombinop_rinvax",
"assocax",
"commax",
"isabgrop",
"lunax",
"make_invstruct",
"make_isabgrop",
"make_isgrop",
"make_isinv",
"make_ismonoidop",
"make_isunit",
"make_isunital",
"r... | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrshomabgr (X Y : abgr) : abgr. | Proof.
use make_abgr.
- exact (make_setwithbinop (homset X Y) abgrshombinop).
- exact (abgrshomabgr_isabgrop X Y).
Defined. | Definition | abgrshomabgr | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"abgrshomabgr_isabgrop",
"abgrshombinop",
"homset",
"make_abgr",
"make_setwithbinop"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
subabgr (X : abgr) | := subgr X. | Definition | subabgr | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"subgr"
] | * 2. Subobjects | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 |
isabgrcarrier {X : abgr} (A : subgr X) : isabgrop (@op A). | Proof.
exists (isgrcarrier A).
apply (pr2 (@isabmonoidcarrier X A)).
Defined. | Lemma | isabgrcarrier | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"isabgrop",
"isabmonoidcarrier",
"isgrcarrier",
"op",
"subgr"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
carrierofasubabgr {X : abgr} (A : subabgr X) : abgr. | Proof.
use make_abgr.
- exact A.
- apply isabgrcarrier.
Defined. | Definition | carrierofasubabgr | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"isabgrcarrier",
"make_abgr",
"subabgr"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
carrierofasubabgr : subabgr >-> abgr. | Coercion | carrierofasubabgr | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"subabgr"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | ||
subabgr_incl {X : abgr} (A : subabgr X) : abelian_group_morphism A X | :=
binopfun_to_abelian_group_morphism (X := A) (submonoid_incl A). | Definition | subabgr_incl | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr",
"binopfun_to_abelian_group_morphism",
"subabgr",
"submonoid_incl"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgr_kernel_hsubtype {A B : abgr} (f : abelian_group_morphism A B) : hsubtype A | :=
monoid_kernel_hsubtype f. | Definition | abgr_kernel_hsubtype | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr",
"hsubtype",
"monoid_kernel_hsubtype"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgr_image_hsubtype {A B : abgr} (f : abelian_group_morphism A B) : hsubtype B | :=
(λ y : B, ∃ x : A, (f x) = y). | Definition | abgr_image_hsubtype | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr",
"hsubtype"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgr_Kernel_subabgr_issubgr {A B : abgr} (f : abelian_group_morphism A B) :
issubgr (abgr_kernel_hsubtype f). | Proof.
apply make_issubgr.
- apply kernel_issubmonoid.
- intros x a.
apply (grrcan B (f x)).
refine (! (binopfunisbinopfun f (grinv A x) x) @ _).
refine (maponpaths (λ a : A, f a) (grlinvax A x) @ _).
refine (monoidfununel f @ !_).
refine (lunax B (f x) @ _).
exact a.
Defined. | Definition | abgr_Kernel_subabgr_issubgr | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr",
"abgr_kernel_hsubtype",
"binopfunisbinopfun",
"grinv",
"grlinvax",
"grrcan",
"issubgr",
"kernel_issubmonoid",
"lunax",
"make_issubgr",
"maponpaths",
"monoidfununel"
] | ** Kernel as abelian group | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 |
abgr_Kernel_subabgr {A B : abgr} (f : abelian_group_morphism A B) : @subabgr A | :=
subgrconstr (@abgr_kernel_hsubtype A B f) (abgr_Kernel_subabgr_issubgr f). | Definition | abgr_Kernel_subabgr | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr",
"abgr_Kernel_subabgr_issubgr",
"abgr_kernel_hsubtype",
"subabgr",
"subgrconstr"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgr_Kernel_abelian_group_morphism_isbinopfun {A B : abgr} (f : abelian_group_morphism A B) :
isbinopfun (X := abgr_Kernel_subabgr f)
(make_incl (pr1carrier (abgr_kernel_hsubtype f))
(isinclpr1carrier (abgr_kernel_hsubtype f))). | Proof.
apply make_isbinopfun. intros x x'. apply idpath.
Qed. | Definition | abgr_Kernel_abelian_group_morphism_isbinopfun | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr",
"abgr_Kernel_subabgr",
"abgr_kernel_hsubtype",
"idpath",
"isbinopfun",
"isinclpr1carrier",
"make_incl",
"make_isbinopfun",
"pr1carrier",
"x'"
] | ** The inclusion Kernel f --> X is a morphism of abelian groups | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 |
abgr_image_issubgr {A B : abgr} (f : abelian_group_morphism A B) : issubgr (abgr_image_hsubtype f). | Proof.
apply make_issubgr.
- apply make_issubmonoid.
+ intros a a'.
refine (hinhuniv _ (pr2 a)). intros ae.
refine (hinhuniv _ (pr2 a')). intros a'e.
apply hinhpr.
use tpair.
* exact (@op A (pr1 ae) (pr1 a'e)).
* refine (binopfunisbinopfun f (pr1 ae) (pr1 a'e) @ _).
u... | Definition | abgr_image_issubgr | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"a'",
"abelian_group_morphism",
"abgr",
"abgr_image_hsubtype",
"binopfunisbinopfun",
"grinv",
"group_morphism_inv",
"hinhpr",
"hinhuniv",
"issubgr",
"make_issubgr",
"make_issubmonoid",
"maponpaths",
"monoidfununel",
"op",
"two_arg_paths",
"unel"
] | ** Image of f is a subgroup | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 |
abgr_image {A B : abgr} (f : abelian_group_morphism A B) : @subabgr B | :=
@subgrconstr B (@abgr_image_hsubtype A B f) (abgr_image_issubgr f). | Definition | abgr_image | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abelian_group_morphism",
"abgr",
"abgr_image_hsubtype",
"abgr_image_issubgr",
"subabgr",
"subgrconstr"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
isabgrquot {X : abgr} (R : binopeqrel X) : isabgrop (@op (setwithbinopquot R)). | Proof.
exists (isgrquot R).
apply (pr2 (@isabmonoidquot X R)).
Defined. | Lemma | isabgrquot | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"binopeqrel",
"isabgrop",
"isabmonoidquot",
"isgrquot",
"op",
"setwithbinopquot"
] | * 4. Quotient objects | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 |
abgrquot {X : abgr} (R : binopeqrel X) : abgr. | Proof. exists (setwithbinopquot R). apply isabgrquot. Defined. | Definition | abgrquot | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"binopeqrel",
"isabgrquot",
"setwithbinopquot"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
isabgrdirprod (X Y : abgr) : isabgrop (@op (setwithbinopdirprod X Y)). | Proof.
exists (isgrdirprod X Y).
apply (pr2 (isabmonoiddirprod X Y)).
Defined. | Lemma | isabgrdirprod | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"isabgrop",
"isabmonoiddirprod",
"isgrdirprod",
"op",
"setwithbinopdirprod"
] | * 5. Direct products | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 |
abgrdirprod (X Y : abgr) : abgr. | Proof.
exists (setwithbinopdirprod X Y).
apply isabgrdirprod.
Defined. | Definition | abgrdirprod | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"isabgrdirprod",
"setwithbinopdirprod"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
hrelabgrdiff (X : abmonoid) : hrel (X × X) | :=
λ xa1 xa2, ∃ (x0 : X), (pr1 xa1 + pr2 xa2) + x0 = (pr1 xa2 + pr2 xa1) + x0. | Definition | hrelabgrdiff | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abmonoid",
"hrel"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrdiffphi (X : abmonoid) (xa : X × X) :
X × (totalsubtype X) | := pr1 xa ,, make_carrier (λ x : X, htrue) (pr2 xa) tt. | Definition | abgrdiffphi | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abmonoid",
"htrue",
"make_carrier",
"totalsubtype"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
hrelabgrdiff' (X : abmonoid) : hrel (X × X) | :=
λ xa1 xa2, eqrelabmonoidfrac X (totalsubmonoid X) (abgrdiffphi X xa1) (abgrdiffphi X xa2). | Definition | hrelabgrdiff' | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffphi",
"abmonoid",
"eqrelabmonoidfrac",
"hrel",
"totalsubmonoid"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
logeqhrelsabgrdiff (X : abmonoid) : hrellogeq (hrelabgrdiff' X) (hrelabgrdiff X). | Proof.
split. simpl. apply hinhfun. intro t2.
set (a0 := pr1 (pr1 t2)). exists a0. apply (pr2 t2). simpl.
apply hinhfun. intro t2. set (x0 := pr1 t2). exists (x0 ,, tt).
apply (pr2 t2).
Defined. | Lemma | logeqhrelsabgrdiff | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abmonoid",
"hinhfun",
"hrelabgrdiff",
"hrelabgrdiff'",
"hrellogeq",
"t2"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
iseqrelabgrdiff (X : abmonoid) : iseqrel (hrelabgrdiff X). | Proof.
apply (iseqrellogeqf (logeqhrelsabgrdiff X)).
apply (iseqrelconstr).
intros xx' xx'' xx'''.
intros r1 r2.
apply (eqreltrans (eqrelabmonoidfrac X (totalsubmonoid X)) _ _ _ r1 r2).
intro xx. apply (eqrelrefl (eqrelabmonoidfrac X (totalsubmonoid X)) _).
intros xx xx'. intro r.
apply (eqrelsymm (eqre... | Lemma | iseqrelabgrdiff | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abmonoid",
"eqrelabmonoidfrac",
"eqrelrefl",
"eqrelsymm",
"eqreltrans",
"hrelabgrdiff",
"iseqrel",
"iseqrelconstr",
"iseqrellogeqf",
"logeqhrelsabgrdiff",
"totalsubmonoid",
"xx"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
eqrelabgrdiff (X : abmonoid) : @eqrel (abmonoiddirprod X X) | :=
make_eqrel _ (iseqrelabgrdiff X). | Definition | eqrelabgrdiff | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abmonoid",
"abmonoiddirprod",
"eqrel",
"iseqrelabgrdiff",
"make_eqrel"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
isbinophrelabgrdiff (X : abmonoid) : @isbinophrel (abmonoiddirprod X X) (hrelabgrdiff X). | Proof.
apply (@isbinophrellogeqf (abmonoiddirprod X X) _ _ (logeqhrelsabgrdiff X)).
split. intros a b c r.
apply (pr1 (isbinophrelabmonoidfrac X (totalsubmonoid X)) _ _
(pr1 c ,, make_carrier (λ x : X, htrue) (pr2 c) tt)
r).
intros a b c r.
apply (pr2 (isbinophrelabmonoidfrac X (tota... | Lemma | isbinophrelabgrdiff | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abmonoid",
"abmonoiddirprod",
"hrelabgrdiff",
"htrue",
"isbinophrel",
"isbinophrelabmonoidfrac",
"isbinophrellogeqf",
"logeqhrelsabgrdiff",
"make_carrier",
"totalsubmonoid"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
binopeqrelabgrdiff (X : abmonoid) : binopeqrel (abmonoiddirprod X X) | :=
make_binopeqrel (eqrelabgrdiff X) (isbinophrelabgrdiff X). | Definition | binopeqrelabgrdiff | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abmonoid",
"abmonoiddirprod",
"binopeqrel",
"eqrelabgrdiff",
"isbinophrelabgrdiff",
"make_binopeqrel"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrdiffcarrier (X : abmonoid) : abmonoid | := @abmonoidquot (abmonoiddirprod X X)
(binopeqrelabgrdiff X). | Definition | abgrdiffcarrier | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abmonoid",
"abmonoiddirprod",
"abmonoidquot",
"binopeqrelabgrdiff"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrdiffinvint (X : abmonoid) : X × X → X × X | :=
λ xs, pr2 xs ,, pr1 xs. | Definition | abgrdiffinvint | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abmonoid"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrdiffinvcomp (X : abmonoid) :
iscomprelrelfun (hrelabgrdiff X) (eqrelabgrdiff X) (abgrdiffinvint X). | Proof.
unfold iscomprelrelfun. unfold eqrelabgrdiff. unfold hrelabgrdiff.
unfold eqrelabmonoidfrac. unfold hrelabmonoidfrac. simpl. intros xs xs'.
apply (hinhfun). intro tt0.
set (x := pr1 xs). set (s := pr2 xs).
set (x' := pr1 xs'). set (s' := pr2 xs').
exists (pr1 tt0).
induction tt0 as [ a eq ]. change... | Lemma | abgrdiffinvcomp | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffinvint",
"abmonoid",
"commax",
"eq",
"eqrelabgrdiff",
"eqrelabmonoidfrac",
"hinhfun",
"hrelabgrdiff",
"hrelabmonoidfrac",
"iscomprelrelfun",
"x'"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrdiffinv (X : abmonoid) : abgrdiffcarrier X → abgrdiffcarrier X | :=
setquotfun (hrelabgrdiff X) (eqrelabgrdiff X) (abgrdiffinvint X) (abgrdiffinvcomp X). | Definition | abgrdiffinv | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffcarrier",
"abgrdiffinvcomp",
"abgrdiffinvint",
"abmonoid",
"eqrelabgrdiff",
"hrelabgrdiff",
"setquotfun"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrdiffisinv (X : abmonoid) :
isinv (@op (abgrdiffcarrier X)) 0 (abgrdiffinv X). | Proof.
set (R := eqrelabgrdiff X).
assert (isl : islinv (@op (abgrdiffcarrier X)) 0 (abgrdiffinv X)).
{
unfold islinv.
apply (setquotunivprop R (λ x, _ = _)%logic).
intro xs.
set (x := pr1 xs). set (s := pr2 xs).
apply (iscompsetquotpr R (@op (abmonoiddirprod X X) (abgrdiffinvint X xs) xs) 0).... | Lemma | abgrdiffisinv | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffcarrier",
"abgrdiffinv",
"abgrdiffinvint",
"abmonoid",
"abmonoiddirprod",
"commax",
"eqrelabgrdiff",
"hinhpr",
"idpath",
"iscompsetquotpr",
"isinv",
"islinv",
"op",
"setquotunivprop",
"unel",
"weqlinvrinv"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrdiff (X : abmonoid) : abgr | := abgrconstr (abgrdiffcarrier X) (abgrdiffinv X) (abgrdiffisinv X). | Definition | abgrdiff | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgr",
"abgrconstr",
"abgrdiffcarrier",
"abgrdiffinv",
"abgrdiffisinv",
"abmonoid"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
prabgrdiff (X : abmonoid) : X → X → abgrdiff X | :=
λ x x' : X, setquotpr (eqrelabgrdiff X) (x ,, x'). | Definition | prabgrdiff | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiff",
"abmonoid",
"eqrelabgrdiff",
"setquotpr",
"x'"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
weqabgrdiffint (X : abmonoid) : weq (X × X) (X × totalsubtype X) | :=
weqdirprodf (idweq X) (invweq (weqtotalsubtype X)). | Definition | weqabgrdiffint | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abmonoid",
"idweq",
"invweq",
"totalsubtype",
"weq",
"weqdirprodf",
"weqtotalsubtype"
] | * 7. Abelian group of fractions and abelian monoid of fractions | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 |
weqabgrdiff (X : abmonoid) : weq (abgrdiff X) (abmonoidfrac X (totalsubmonoid X)). | Proof.
intros.
apply (weqsetquotweq (eqrelabgrdiff X)
(eqrelabmonoidfrac X (totalsubmonoid X)) (weqabgrdiffint X)).
- simpl. intros x x'. induction x as [ x1 x2 ]. induction x' as [ x1' x2' ].
simpl in *. apply hinhfun. intro tt0. induction tt0 as [ xx0 is0 ].
exists (make_carrier (... | Definition | weqabgrdiff | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiff",
"abmonoid",
"abmonoidfrac",
"eqrelabgrdiff",
"eqrelabmonoidfrac",
"hinhfun",
"htrue",
"make_carrier",
"totalsubmonoid",
"weq",
"weqabgrdiffint",
"weqsetquotweq",
"x'",
"x2"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
toabgrdiff (X : abmonoid) (x : X) : abgrdiff X | := setquotpr _ (x ,, 0). | Definition | toabgrdiff | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiff",
"abmonoid",
"setquotpr"
] | * 8. Canonical homomorphism to the abelian group of fractions | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 |
isbinopfuntoabgrdiff (X : abmonoid) : isbinopfun (toabgrdiff X). | Proof.
unfold isbinopfun. intros x1 x2.
change (setquotpr _ (x1 + x2 ,, 0) =
setquotpr (eqrelabgrdiff X) (x1 + x2 ,, 0 + 0)).
apply (maponpaths (setquotpr _)).
apply (@pathsdirprod X X).
- apply idpath.
- exact (!lunax X 0).
Defined. | Lemma | isbinopfuntoabgrdiff | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abmonoid",
"eqrelabgrdiff",
"idpath",
"isbinopfun",
"lunax",
"maponpaths",
"pathsdirprod",
"setquotpr",
"toabgrdiff",
"x2"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
isinclprabgrdiff (X : abmonoid) (iscanc : ∏ x : X, isrcancelable (@op X) x) :
∏ x' : X, isincl (λ x, prabgrdiff X x x'). | Proof.
intros.
set (int := isinclprabmonoidfrac X (totalsubmonoid X) (λ a : totalsubmonoid X, iscanc (pr1 a))
(make_carrier (λ x : X, htrue) x' tt)).
set (int1 := isinclcomp (make_incl _ int) (weqtoincl (invweq (weqabgrdiff X)))).
apply int1.
Defined. | Lemma | isinclprabgrdiff | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abmonoid",
"htrue",
"invweq",
"isincl",
"isinclcomp",
"isinclprabmonoidfrac",
"isrcancelable",
"make_carrier",
"make_incl",
"op",
"prabgrdiff",
"totalsubmonoid",
"weqabgrdiff",
"weqtoincl",
"x'"
] | * 9. Abelian group of fractions in the case when all elements are cancelable | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 |
isincltoabgrdiff (X : abmonoid) (iscanc : ∏ x : X, isrcancelable (@op X) x) :
isincl (toabgrdiff X) | := isinclprabgrdiff X iscanc 0. | Definition | isincltoabgrdiff | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abmonoid",
"isincl",
"isinclprabgrdiff",
"isrcancelable",
"op",
"toabgrdiff"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
isdeceqabgrdiff (X : abmonoid) (iscanc : ∏ x : X, isrcancelable (@op X) x) (is : isdeceq X) :
isdeceq (abgrdiff X). | Proof.
intros.
apply (isdeceqweqf (invweq (weqabgrdiff X))).
apply (isdeceqabmonoidfrac X (totalsubmonoid X) (λ a : totalsubmonoid X, iscanc (pr1 a)) is).
Defined. | Lemma | isdeceqabgrdiff | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiff",
"abmonoid",
"invweq",
"is",
"isdeceq",
"isdeceqabmonoidfrac",
"isdeceqweqf",
"isrcancelable",
"op",
"totalsubmonoid",
"weqabgrdiff"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrdiffrelint (X : abmonoid) (L : hrel X) : hrel (setwithbinopdirprod X X) | :=
λ xa yb, ∃ (c0 : X), L ((pr1 xa + pr2 yb) + c0) ((pr1 yb + pr2 xa) + c0). | Definition | abgrdiffrelint | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abmonoid",
"c0",
"hrel",
"setwithbinopdirprod"
] | * 10. Relations on the abelian group of fractions | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 |
abgrdiffrelint' (X : abmonoid) (L : hrel X) : hrel (setwithbinopdirprod X X) | :=
λ xa1 xa2, abmonoidfracrelint _ (totalsubmonoid X) L (abgrdiffphi X xa1) (abgrdiffphi X xa2). | Definition | abgrdiffrelint' | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffphi",
"abmonoid",
"abmonoidfracrelint",
"hrel",
"setwithbinopdirprod",
"totalsubmonoid"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
logeqabgrdiffrelints (X : abmonoid) (L : hrel X) :
hrellogeq (abgrdiffrelint' X L) (abgrdiffrelint X L). | Proof.
split. unfold abgrdiffrelint. unfold abgrdiffrelint'.
simpl. apply hinhfun. intro t2. set (a0 := pr1 (pr1 t2)).
exists a0. apply (pr2 t2). simpl. apply hinhfun.
intro t2. set (x0 := pr1 t2). exists (x0 ,, tt). apply (pr2 t2).
Defined. | Lemma | logeqabgrdiffrelints | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrelint",
"abgrdiffrelint'",
"abmonoid",
"hinhfun",
"hrel",
"hrellogeq",
"t2"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
iscomprelabgrdiffrelint (X : abmonoid) {L : hrel X} (is : isbinophrel L) :
iscomprelrel (eqrelabgrdiff X) (abgrdiffrelint X L). | Proof.
apply (iscomprelrellogeqf1 _ (logeqhrelsabgrdiff X)).
apply (iscomprelrellogeqf2 _ (logeqabgrdiffrelints X L)).
intros x x' x0 x0' r r0.
apply (iscomprelabmonoidfracrelint
_ (totalsubmonoid X) (isbinoptoispartbinop _ _ is) _ _ _ _ r r0).
Qed. | Lemma | iscomprelabgrdiffrelint | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrelint",
"abmonoid",
"eqrelabgrdiff",
"hrel",
"is",
"isbinophrel",
"isbinoptoispartbinop",
"iscomprelabmonoidfracrelint",
"iscomprelrel",
"iscomprelrellogeqf1",
"iscomprelrellogeqf2",
"logeqabgrdiffrelints",
"logeqhrelsabgrdiff",
"totalsubmonoid",
"x'"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrdiffrel (X : abmonoid) {L : hrel X} (is : isbinophrel L) | :=
quotrel (iscomprelabgrdiffrelint X is). | Definition | abgrdiffrel | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abmonoid",
"hrel",
"is",
"isbinophrel",
"iscomprelabgrdiffrelint",
"quotrel"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrdiffrel' (X : abmonoid) {L : hrel X} (is : isbinophrel L) : hrel (abgrdiff X) | :=
λ x x', abmonoidfracrel X (totalsubmonoid X) (isbinoptoispartbinop _ _ is)
(weqabgrdiff X x) (weqabgrdiff X x'). | Definition | abgrdiffrel' | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiff",
"abmonoid",
"abmonoidfracrel",
"hrel",
"is",
"isbinophrel",
"isbinoptoispartbinop",
"totalsubmonoid",
"weqabgrdiff",
"x'"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
logeqabgrdiffrels (X : abmonoid) {L : hrel X} (is : isbinophrel L) :
hrellogeq (abgrdiffrel' X is) (abgrdiffrel X is). | Proof.
intros x1 x2. split.
- assert (int : ∏ x x', isaprop (abgrdiffrel' X is x x' → abgrdiffrel X is x x')).
{
intros x x'.
apply impred. intro.
apply (pr2 _).
}
generalize x1 x2. clear x1 x2.
apply (setquotuniv2prop _ (λ x x', make_hProp _ (int x x'))).
intros x x'.
chan... | Definition | logeqabgrdiffrels | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrel",
"abgrdiffrel'",
"abgrdiffrelint",
"abgrdiffrelint'",
"abmonoid",
"hrel",
"hrellogeq",
"impred",
"is",
"isaprop",
"isbinophrel",
"logeqabgrdiffrelints",
"make_hProp",
"setquotuniv2prop",
"x'",
"x2"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
istransabgrdiffrelint (X : abmonoid) {L : hrel X} (is : isbinophrel L) (isl : istrans L) :
istrans (abgrdiffrelint X L). | Proof.
apply (istranslogeqf (logeqabgrdiffrelints X L)).
intros a b c rab rbc.
apply (istransabmonoidfracrelint
_ (totalsubmonoid X) (isbinoptoispartbinop _ _ is) isl _ _ _ rab rbc).
Qed. | Lemma | istransabgrdiffrelint | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrelint",
"abmonoid",
"hrel",
"is",
"isbinophrel",
"isbinoptoispartbinop",
"istrans",
"istransabmonoidfracrelint",
"istranslogeqf",
"logeqabgrdiffrelints",
"totalsubmonoid"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
istransabgrdiffrel (X : abmonoid) {L : hrel X} (is : isbinophrel L) (isl : istrans L) :
istrans (abgrdiffrel X is). | Proof.
refine (istransquotrel _ _). apply istransabgrdiffrelint.
- apply is.
- apply isl.
Defined. | Lemma | istransabgrdiffrel | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrel",
"abmonoid",
"hrel",
"is",
"isbinophrel",
"istrans",
"istransabgrdiffrelint",
"istransquotrel"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
issymmabgrdiffrelint (X : abmonoid) {L : hrel X} (is : isbinophrel L) (isl : issymm L) :
issymm (abgrdiffrelint X L). | Proof.
apply (issymmlogeqf (logeqabgrdiffrelints X L)).
intros a b rab.
apply (issymmabmonoidfracrelint _ (totalsubmonoid X) (isbinoptoispartbinop _ _ is) isl _ _ rab).
Qed. | Lemma | issymmabgrdiffrelint | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrelint",
"abmonoid",
"hrel",
"is",
"isbinophrel",
"isbinoptoispartbinop",
"issymm",
"issymmabmonoidfracrelint",
"issymmlogeqf",
"logeqabgrdiffrelints",
"totalsubmonoid"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
issymmabgrdiffrel (X : abmonoid) {L : hrel X} (is : isbinophrel L) (isl : issymm L) :
issymm (abgrdiffrel X is). | Proof.
refine (issymmquotrel _ _). apply issymmabgrdiffrelint.
- apply is.
- apply isl.
Defined. | Lemma | issymmabgrdiffrel | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrel",
"abmonoid",
"hrel",
"is",
"isbinophrel",
"issymm",
"issymmabgrdiffrelint",
"issymmquotrel"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
isreflabgrdiffrelint (X : abmonoid) {L : hrel X} (is : isbinophrel L) (isl : isrefl L) :
isrefl (abgrdiffrelint X L). | Proof.
intro xa. unfold abgrdiffrelint. simpl.
apply hinhpr. exists (unel X). apply (isl _).
Defined. | Lemma | isreflabgrdiffrelint | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrelint",
"abmonoid",
"hinhpr",
"hrel",
"is",
"isbinophrel",
"isrefl",
"unel"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
isreflabgrdiffrel (X : abmonoid) {L : hrel X} (is : isbinophrel L) (isl : isrefl L) :
isrefl (abgrdiffrel X is). | Proof.
refine (isreflquotrel _ _). apply isreflabgrdiffrelint.
- apply is.
- apply isl.
Defined. | Lemma | isreflabgrdiffrel | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrel",
"abmonoid",
"hrel",
"is",
"isbinophrel",
"isrefl",
"isreflabgrdiffrelint",
"isreflquotrel"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
ispoabgrdiffrelint (X : abmonoid) {L : hrel X} (is : isbinophrel L) (isl : ispreorder L) :
ispreorder (abgrdiffrelint X L). | Proof.
exists (istransabgrdiffrelint X is (pr1 isl)).
apply (isreflabgrdiffrelint X is (pr2 isl)).
Defined. | Lemma | ispoabgrdiffrelint | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrelint",
"abmonoid",
"hrel",
"is",
"isbinophrel",
"ispreorder",
"isreflabgrdiffrelint",
"istransabgrdiffrelint"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
ispoabgrdiffrel (X : abmonoid) {L : hrel X} (is : isbinophrel L) (isl : ispreorder L) :
ispreorder (abgrdiffrel X is). | Proof.
refine (ispoquotrel _ _). apply ispoabgrdiffrelint.
- apply is.
- apply isl.
Defined. | Lemma | ispoabgrdiffrel | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrel",
"abmonoid",
"hrel",
"is",
"isbinophrel",
"ispoabgrdiffrelint",
"ispoquotrel",
"ispreorder"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
iseqrelabgrdiffrelint (X : abmonoid) {L : hrel X} (is : isbinophrel L) (isl : iseqrel L) :
iseqrel (abgrdiffrelint X L). | Proof.
exists (ispoabgrdiffrelint X is (pr1 isl)).
apply (issymmabgrdiffrelint X is (pr2 isl)).
Defined. | Lemma | iseqrelabgrdiffrelint | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrelint",
"abmonoid",
"hrel",
"is",
"isbinophrel",
"iseqrel",
"ispoabgrdiffrelint",
"issymmabgrdiffrelint"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
iseqrelabgrdiffrel (X : abmonoid) {L : hrel X} (is : isbinophrel L) (isl : iseqrel L) :
iseqrel (abgrdiffrel X is). | Proof.
refine (iseqrelquotrel _ _). apply iseqrelabgrdiffrelint.
- apply is.
- apply isl.
Defined. | Lemma | iseqrelabgrdiffrel | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrel",
"abmonoid",
"hrel",
"is",
"isbinophrel",
"iseqrel",
"iseqrelabgrdiffrelint",
"iseqrelquotrel"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
isantisymmnegabgrdiffrel (X : abmonoid) {L : hrel X} (is : isbinophrel L)
(isl : isantisymmneg L) : isantisymmneg (abgrdiffrel X is). | Proof.
apply (isantisymmneglogeqf (logeqabgrdiffrels X is)).
intros a b rab rba.
set (int := isantisymmnegabmonoidfracrel _ (totalsubmonoid X) (isbinoptoispartbinop _ _ is)
isl (weqabgrdiff X a) (weqabgrdiff X b) rab rba).
apply (invmaponpathsweq _ _ _ int).
Defined. | Lemma | isantisymmnegabgrdiffrel | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrel",
"abmonoid",
"hrel",
"invmaponpathsweq",
"is",
"isantisymmneg",
"isantisymmnegabmonoidfracrel",
"isantisymmneglogeqf",
"isbinophrel",
"isbinoptoispartbinop",
"logeqabgrdiffrels",
"totalsubmonoid",
"weqabgrdiff"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
isantisymmabgrdiffrel (X : abmonoid) {L : hrel X} (is : isbinophrel L) (isl : isantisymm L) :
isantisymm (abgrdiffrel X is). | Proof.
apply (isantisymmlogeqf (logeqabgrdiffrels X is)).
intros a b rab rba.
set (int := isantisymmabmonoidfracrel _ (totalsubmonoid X) (isbinoptoispartbinop _ _ is)
isl (weqabgrdiff X a) (weqabgrdiff X b) rab rba).
apply (invmaponpathsweq _ _ _ int).
Qed. | Lemma | isantisymmabgrdiffrel | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrel",
"abmonoid",
"hrel",
"invmaponpathsweq",
"is",
"isantisymm",
"isantisymmabmonoidfracrel",
"isantisymmlogeqf",
"isbinophrel",
"isbinoptoispartbinop",
"logeqabgrdiffrels",
"totalsubmonoid",
"weqabgrdiff"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
isirreflabgrdiffrel (X : abmonoid) {L : hrel X} (is : isbinophrel L) (isl : isirrefl L) :
isirrefl (abgrdiffrel X is). | Proof.
apply (isirrefllogeqf (logeqabgrdiffrels X is)).
intros a raa.
apply (isirreflabmonoidfracrel _ (totalsubmonoid X) (isbinoptoispartbinop _ _ is)
isl (weqabgrdiff X a) raa).
Qed. | Lemma | isirreflabgrdiffrel | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrel",
"abmonoid",
"hrel",
"is",
"isbinophrel",
"isbinoptoispartbinop",
"isirrefl",
"isirreflabmonoidfracrel",
"isirrefllogeqf",
"logeqabgrdiffrels",
"totalsubmonoid",
"weqabgrdiff"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
isasymmabgrdiffrel (X : abmonoid) {L : hrel X} (is : isbinophrel L) (isl : isasymm L) :
isasymm (abgrdiffrel X is). | Proof.
apply (isasymmlogeqf (logeqabgrdiffrels X is)).
intros a b rab rba.
apply (isasymmabmonoidfracrel _ (totalsubmonoid X) (isbinoptoispartbinop _ _ is)
isl (weqabgrdiff X a) (weqabgrdiff X b) rab rba).
Qed. | Lemma | isasymmabgrdiffrel | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrel",
"abmonoid",
"hrel",
"is",
"isasymm",
"isasymmabmonoidfracrel",
"isasymmlogeqf",
"isbinophrel",
"isbinoptoispartbinop",
"logeqabgrdiffrels",
"totalsubmonoid",
"weqabgrdiff"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
iscoasymmabgrdiffrel (X : abmonoid) {L : hrel X} (is : isbinophrel L) (isl : iscoasymm L) :
iscoasymm (abgrdiffrel X is). | Proof.
apply (iscoasymmlogeqf (logeqabgrdiffrels X is)).
intros a b rab.
apply (iscoasymmabmonoidfracrel _ (totalsubmonoid X) (isbinoptoispartbinop _ _ is)
isl (weqabgrdiff X a) (weqabgrdiff X b) rab).
Qed. | Lemma | iscoasymmabgrdiffrel | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrel",
"abmonoid",
"hrel",
"is",
"isbinophrel",
"isbinoptoispartbinop",
"iscoasymm",
"iscoasymmabmonoidfracrel",
"iscoasymmlogeqf",
"logeqabgrdiffrels",
"totalsubmonoid",
"weqabgrdiff"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
istotalabgrdiffrel (X : abmonoid) {L : hrel X} (is : isbinophrel L) (isl : istotal L) :
istotal (abgrdiffrel X is). | Proof.
apply (istotallogeqf (logeqabgrdiffrels X is)).
intros a b.
apply (istotalabmonoidfracrel _ (totalsubmonoid X) (isbinoptoispartbinop _ _ is)
isl (weqabgrdiff X a) (weqabgrdiff X b)).
Qed. | Lemma | istotalabgrdiffrel | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrel",
"abmonoid",
"hrel",
"is",
"isbinophrel",
"isbinoptoispartbinop",
"istotal",
"istotalabmonoidfracrel",
"istotallogeqf",
"logeqabgrdiffrels",
"totalsubmonoid",
"weqabgrdiff"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
iscotransabgrdiffrel (X : abmonoid) {L : hrel X} (is : isbinophrel L) (isl : iscotrans L) :
iscotrans (abgrdiffrel X is). | Proof.
apply (iscotranslogeqf (logeqabgrdiffrels X is)).
intros a b c.
apply (iscotransabmonoidfracrel _ (totalsubmonoid X) (isbinoptoispartbinop _ _ is)
isl (weqabgrdiff X a) (weqabgrdiff X b) (weqabgrdiff X c)).
Qed. | Lemma | iscotransabgrdiffrel | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrel",
"abmonoid",
"hrel",
"is",
"isbinophrel",
"isbinoptoispartbinop",
"iscotrans",
"iscotransabmonoidfracrel",
"iscotranslogeqf",
"logeqabgrdiffrels",
"totalsubmonoid",
"weqabgrdiff"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
isStrongOrder_abgrdiff {X : abmonoid} (gt : hrel X)
(Hgt : isbinophrel gt) :
isStrongOrder gt → isStrongOrder (abgrdiffrel X Hgt). | Proof.
intros H.
repeat split.
- apply istransabgrdiffrel, (istrans_isStrongOrder H).
- apply iscotransabgrdiffrel, (iscotrans_isStrongOrder H).
- apply isirreflabgrdiffrel, (isirrefl_isStrongOrder H).
Qed. | Lemma | isStrongOrder_abgrdiff | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrel",
"abmonoid",
"hrel",
"isStrongOrder",
"isbinophrel",
"iscotrans_isStrongOrder",
"iscotransabgrdiffrel",
"isirrefl_isStrongOrder",
"isirreflabgrdiffrel",
"istrans_isStrongOrder",
"istransabgrdiffrel"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
StrongOrder_abgrdiff {X : abmonoid} (gt : StrongOrder X)
(Hgt : isbinophrel gt) : StrongOrder (abgrdiff X) | :=
abgrdiffrel X Hgt,, isStrongOrder_abgrdiff gt Hgt (pr2 gt). | Definition | StrongOrder_abgrdiff | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"StrongOrder",
"abgrdiff",
"abgrdiffrel",
"abmonoid",
"isStrongOrder_abgrdiff",
"isbinophrel"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrdiffrelimpl (X : abmonoid) {L L' : hrel X} (is : isbinophrel L) (is' : isbinophrel L')
(impl : ∏ x x', L x x' → L' x x') (x x' : abgrdiff X) (ql : abgrdiffrel X is x x') :
abgrdiffrel X is' x x'. | Proof.
generalize ql. refine (quotrelimpl _ _ _ _ _).
intros x0 x0'. simpl. apply hinhfun. intro t2. exists (pr1 t2).
apply (impl _ _ (pr2 t2)).
Qed. | Lemma | abgrdiffrelimpl | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"L'",
"abgrdiff",
"abgrdiffrel",
"abmonoid",
"hinhfun",
"hrel",
"impl",
"is",
"isbinophrel",
"ql",
"quotrelimpl",
"t2",
"x'"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
abgrdiffrellogeq (X : abmonoid) {L L' : hrel X} (is : isbinophrel L) (is' : isbinophrel L')
(lg : ∏ x x', L x x' <-> L' x x') (x x' : abgrdiff X) :
(abgrdiffrel X is x x') <-> (abgrdiffrel X is' x x'). | Proof.
refine (quotrellogeq _ _ _ _ _). intros x0 x0'. split.
- simpl. apply hinhfun. intro t2. exists (pr1 t2).
apply (pr1 (lg _ _) (pr2 t2)).
- simpl. apply hinhfun. intro t2. exists (pr1 t2).
apply (pr2 (lg _ _) (pr2 t2)).
Qed. | Lemma | abgrdiffrellogeq | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"L'",
"abgrdiff",
"abgrdiffrel",
"abmonoid",
"hinhfun",
"hrel",
"is",
"isbinophrel",
"quotrellogeq",
"t2",
"x'"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
isbinopabgrdiffrelint (X : abmonoid) {L : hrel X} (is : isbinophrel L) :
@isbinophrel (setwithbinopdirprod X X) (abgrdiffrelint X L). | Proof.
apply (isbinophrellogeqf (logeqabgrdiffrelints X L)). split.
- intros a b c lab.
apply (pr1 (ispartbinopabmonoidfracrelint _ (totalsubmonoid X) (isbinoptoispartbinop _ _ is))
(abgrdiffphi X a) (abgrdiffphi X b) (abgrdiffphi X c) tt lab).
- intros a b c lab.
apply (pr2 (ispartbinopabm... | Lemma | isbinopabgrdiffrelint | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffphi",
"abgrdiffrelint",
"abmonoid",
"hrel",
"is",
"isbinophrel",
"isbinophrellogeqf",
"isbinoptoispartbinop",
"ispartbinopabmonoidfracrelint",
"logeqabgrdiffrelints",
"setwithbinopdirprod",
"totalsubmonoid"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
isbinopabgrdiffrel (X : abmonoid) {L : hrel X} (is : isbinophrel L) :
@isbinophrel (abgrdiff X) (abgrdiffrel X is). | Proof.
intros.
apply (isbinopquotrel (binopeqrelabgrdiff X) (iscomprelabgrdiffrelint X is)).
apply (isbinopabgrdiffrelint X is).
Defined. | Lemma | isbinopabgrdiffrel | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiff",
"abgrdiffrel",
"abmonoid",
"binopeqrelabgrdiff",
"hrel",
"is",
"isbinopabgrdiffrelint",
"isbinophrel",
"isbinopquotrel",
"iscomprelabgrdiffrelint"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
isdecabgrdiffrelint (X : abmonoid) {L : hrel X}
(is : isinvbinophrel L) (isl : isdecrel L) : isdecrel (abgrdiffrelint X L). | Proof.
intros xa1 xa2.
set (x1 := pr1 xa1). set (a1 := pr2 xa1).
set (x2 := pr1 xa2). set (a2 := pr2 xa2).
assert (int : coprod (L (x1 + a2) (x2 + a1)) (neg (L (x1 + a2) (x2 + a1)))) by apply (isl _ _).
induction int as [ l | nl ].
- apply ii1. unfold abgrdiffrelint. apply hinhpr. exists 0.
rewrite (run... | Definition | isdecabgrdiffrelint | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrelint",
"abmonoid",
"coprod",
"hinhpr",
"hinhuniv",
"hrel",
"is",
"isdecrel",
"isinvbinophrel",
"make_hProp",
"neg",
"negf",
"runax",
"x2"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 | |
isdecabgrdiffrel (X : abmonoid) {L : hrel X} (is : isbinophrel L)
(isi : isinvbinophrel L) (isl : isdecrel L) : isdecrel (abgrdiffrel X is). | Proof.
refine (isdecquotrel _ _). apply isdecabgrdiffrelint.
- apply isi.
- apply isl.
Defined. | Definition | isdecabgrdiffrel | Algebra | UniMath/Algebra/AbelianGroups.v | [
"UniMath.MoreFoundations.Orders",
"UniMath.MoreFoundations.Subtypes",
"UniMath.CategoryTheory.Categories.Magma",
"UniMath.CategoryTheory.Core.Categories",
"UniMath.Algebra.Groups2",
"UniMath.Algebra.AbelianMonoids"
] | [
"abgrdiffrel",
"abmonoid",
"hrel",
"is",
"isbinophrel",
"isdecabgrdiffrelint",
"isdecquotrel",
"isdecrel",
"isinvbinophrel"
] | https://github.com/UniMath/UniMath | fa8f7d65ac96baddca8614f1c7bdfa73f043aef5 |
Structured dataset of formalizations from the UniMath library (Univalent Mathematics in Coq).
fa8f7d65ac96baddca8614f1c7bdfa73f043aef5| Column | Type | Description |
|---|---|---|
| statement | string | Declaration signature/claim with the leading keyword removed (verbatim slice); the full declaration minus its proof |
| proof | string | Verbatim proof/body, empty if the declaration has none |
| type | string | Declaration keyword |
| symbolic_name | string | Declaration identifier |
| library | string | Sub-library |
| filename | string | Repository-relative source path |
| imports | list[string] | File-level Require/Import modules |
| deps | list[string] | Intra-corpus identifiers referenced |
| docstring | string | Preceding documentation comment, empty if absent |
| source_url | string | Upstream repository |
| commit | string | Upstream commit extracted |
| Type | Count |
|---|---|
| Definition | 30,696 |
| Lemma | 10,022 |
| Proposition | 4,557 |
| Let | 2,476 |
| Coercion | 1,269 |
| Notation | 1,223 |
| Theorem | 356 |
| Ltac | 229 |
| Corollary | 179 |
| Ltac2 | 98 |
| Hypothesis | 49 |
| Fixpoint | 21 |
| Inductive | 7 |
| Example | 6 |
| Axiom | 5 |
| Record | 1 |
abgrconstr (X : abmonoid) (inv0 : X → X) (is : isinv (@op X) 0 inv0) : abgr.
Proof.
use make_abgr.
- exact X.
- use make_isabgrop.
+ use make_isgrop.
* apply (make_ismonoidop (assocax X)).
exact (make_isunital (unel X) (unax X)).
* exact (make_invstruct inv0 is).
+ exact (commax X).
Defined.
abgrconstr | UniMath/Algebra/AbelianGroups.vEach declaration is split into a statement (signature/claim) and a proof (body) that are disjoint
and together form the complete declaration, for proof modeling, autoformalization, retrieval, and
dependency analysis via deps.
@misc{coq_unimath_dataset,
title = {Coq-UniMath},
author = {Norton, Charles},
year = {2026},
note = {Extracted from https://github.com/UniMath/UniMath, commit fa8f7d65ac96},
url = {https://huggingface.co/datasets/phanerozoic/Coq-UniMath}
}