Proof Assistant Projects
Collection
Digesting proof assistant libraries for AI ingestion. β’ 103 items β’ Updated β’ 4
statement stringlengths 5 1.82k | proof stringlengths 0 5.57k | type stringclasses 4
values | symbolic_name stringlengths 1 58 | library stringclasses 164
values | filename stringclasses 562
values | imports listlengths 0 99 | deps listlengths 0 64 | docstring stringclasses 1
value | source_url stringclasses 1
value | commit stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|
_ = Precategory | _ = Functor
_ = is-strict
_ = Strict-cats
_ = Sets
_ = Groups
_ = posetβcategory
_ = Disc
_ = B
_ = Slice
_ = AbβͺSets
_ = Hom-from
_ = Const
_ = _=>_
_ = Cat[_,_]
_ = _β_
_ = β-interchange
_ = yo-is-equiv
_ = yo-naturalr
_ = yo-naturall
_ = constβΏ
_ = _^op
_ = Hom[-,-]
_ = γβ
_ = γ
_ = is-faithful
_ = is-full
_ = is-fu... | function | _ | Root | src/Borceux.lagda.md | [
"Algebra.Group.Cat.FinitelyComplete",
"Algebra.Monoid.Category",
"Algebra.Group.Cat.Base",
"Algebra.Group.Free",
"Algebra.Group.Ab",
"Cat.Morphism.Factorisation.Orthogonal",
"Cat.Diagram.Coequaliser.RegularEpi",
"Cat.Functor.Adjoint.Epireflective",
"Cat.Functor.Adjoint.Representable",
"Cat.Instanc... | [
"AbβͺSets",
"Cat[_,_]",
"Catβ¨_,_β©",
"Cocone",
"Curry",
"Disc",
"Disci",
"Discβ£Ξ",
"Dom",
"EqualiserβLimit",
"Free-category",
"Free-monoidβ£Forget",
"Functor",
"Functor-cat-is-complete",
"Graph",
"Graph-hom",
"Groups",
"Hom[-,-]",
"Hom[-,-]-is-fully-faithful",
"Indexed-product-uni... | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
_ = LR-isoβis-reflective | _ = crude-monadicity
_ = β«
_ = Karoubi-is-completion
_ = lambek
_ = Finitely-completeβis-finitely-complete
_ = with-equalisers
_ = with-pullbacks
_ = Subobject-weak-opfibration
_ = weak-cocartesian-liftβleft-adjoint
_ = is-extremal-epiβis-strong-epi
_ = Sub-regular
_ = is-strong-epiβis-regular-epi
_ = is-congruence
_ =... | function | _ | Root | src/Elephant.lagda.md | [
"Cat.Displayed.Instances.Subobjects",
"Cat.Instances.Elements.Covariant",
"Cat.Displayed.Cocartesian.Weak",
"Cat.Functor.Adjoint.Reflective",
"Cat.Site.Instances.Canonical",
"Cat.CartesianClosed.Locally",
"Cat.Functor.Monadic.Crude",
"Cat.Instances.Sheaf.Omega",
"Cat.Diagram.Limit.Finite",
"Cat.Di... | [
"Coverage",
"Karoubi-is-completion",
"Sh[]-omega",
"Subobject-weak-opfibration",
"crude-monadicity",
"is-colim",
"is-congruence",
"is-extremal-epiβis-strong-epi",
"is-universal-colim"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
_ = sym | _ = _β_
_ = β-idl
_ = β-idr
_ = β-invl
_ = β-invr
_ = β-assoc
_ = Ξ©βΏβΊΒ²-is-abelian
_ = Typeβ
_ = Ξ©βΏ
_ = ap
_ = ap-β
_ = subst
_ = Ξ£-pathp
_ = transport-refl
_ = subst-β
_ = homotopy-natural
_ = homotopy-invert
_ = is-iso
_ = transportβ»transport
_ = id-equiv
_ = Equiv.inverse
_ = _βe_
_ = Ξ£-pathpβ
_ = funext
_ = funext-d... | function | _ | Root | src/HoTT.lagda.md | [
"1Lab.Counterexamples.GlobalChoice",
"1Lab.Function.Surjection",
"1Lab.Function.Embedding",
"1Lab.Equiv.Biinv",
"1Lab.Classical",
"Algebra.Group.Homotopy",
"Algebra.Monoid",
"Algebra.Group",
"Cat.Instances.Sets.Congruences",
"Cat.Displayed.Univalence.Thin",
"Cat.Functor.Hom.Representable",
"Ca... | [
"Axiom-of-choice",
"Cat",
"Cat[_,_]",
"Category-identity-system",
"Cocone",
"Coeq",
"Coeq-univ",
"Curry",
"DNE",
"Dec",
"Disc",
"Discrete",
"Discrete-Nat",
"Discreteβis-set",
"Displayed",
"Fibre-equiv",
"Functor",
"Functor-is-category",
"Functor-path",
"Fβ-assoc",
"Group-on",... | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
_ : β {β} {A B : Type β} β is-equiv (pathβequiv {A = A} {B}) | _ = Precategory
_ = univalence | function | _ | Root | src/index.lagda.md | [
"1Lab.Univalence",
"1Lab.Equiv",
"1Lab.HLevel",
"1Lab.Type",
"1Lab.Path",
"Cat.Base",
"1Lab.Type",
"1Lab.Path",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Univalence",
"1Lab.Reflection.HLevel",
"1Lab.Extensionality",
"1Lab.Reflection.Induction",
"1Lab.Reflection.Induction.Examples",
"Cat.Base"... | [
"Precategory",
"is-equiv",
"pathβequiv",
"univalence"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
LEM : Type | LEM = β (P : Ξ©) β Dec β£ P β£ | function | LEM | 1Lab | src/1Lab/Classical.lagda.md | [
"1Lab.Prelude",
"Data.Bool",
"Data.Dec",
"Data.Sum",
"Homotopy.Space.Suspension.Properties",
"Homotopy.Space.Suspension",
"Meta.Invariant"
] | [
"Dec"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
DNE : Type | DNE = β (P : Ξ©) β Β¬ Β¬ β£ P β£ β β£ P β£ | function | DNE | 1Lab | src/1Lab/Classical.lagda.md | [
"1Lab.Prelude",
"Data.Bool",
"Data.Dec",
"Data.Sum",
"Homotopy.Space.Suspension.Properties",
"Homotopy.Space.Suspension",
"Meta.Invariant"
] | [] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
LEM-is-prop : is-prop LEM | LEM-is-prop = hlevel 1 | function | LEM-is-prop | 1Lab | src/1Lab/Classical.lagda.md | [
"1Lab.Prelude",
"Data.Bool",
"Data.Dec",
"Data.Sum",
"Homotopy.Space.Suspension.Properties",
"Homotopy.Space.Suspension",
"Meta.Invariant"
] | [
"LEM",
"hlevel",
"is-prop"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
DNE-is-prop : is-prop DNE | DNE-is-prop = hlevel 1 | function | DNE-is-prop | 1Lab | src/1Lab/Classical.lagda.md | [
"1Lab.Prelude",
"Data.Bool",
"Data.Dec",
"Data.Sum",
"Homotopy.Space.Suspension.Properties",
"Homotopy.Space.Suspension",
"Meta.Invariant"
] | [
"DNE",
"hlevel",
"is-prop"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
LEMβDNE : LEM β DNE | LEMβDNE lem P = Dec-elim _ (Ξ» p _ β p) (Ξ» Β¬p ¬¬p β absurd (¬¬p Β¬p)) (lem P) | function | LEMβDNE | 1Lab | src/1Lab/Classical.lagda.md | [
"1Lab.Prelude",
"Data.Bool",
"Data.Dec",
"Data.Sum",
"Homotopy.Space.Suspension.Properties",
"Homotopy.Space.Suspension",
"Meta.Invariant"
] | [
"DNE",
"Dec-elim",
"LEM",
"absurd",
"lem"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
DNEβLEM : DNE β LEM | DNEβLEM dne P = dne (el (Dec β£ P β£) (hlevel 1)) Ξ» k β k (no Ξ» p β k (yes p)) | function | DNEβLEM | 1Lab | src/1Lab/Classical.lagda.md | [
"1Lab.Prelude",
"Data.Bool",
"Data.Dec",
"Data.Sum",
"Homotopy.Space.Suspension.Properties",
"Homotopy.Space.Suspension",
"Meta.Invariant"
] | [
"DNE",
"Dec",
"LEM",
"hlevel"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
LEMβDNE : LEM β DNE | LEMβDNE = prop-ext LEM-is-prop DNE-is-prop LEMβDNE DNEβLEM | function | LEMβDNE | 1Lab | src/1Lab/Classical.lagda.md | [
"1Lab.Prelude",
"Data.Bool",
"Data.Dec",
"Data.Sum",
"Homotopy.Space.Suspension.Properties",
"Homotopy.Space.Suspension",
"Meta.Invariant"
] | [
"DNE",
"DNE-is-prop",
"DNEβLEM",
"LEM",
"LEM-is-prop",
"LEMβDNE"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
WLEM : Type | WLEM = β (P : Ξ©) β Dec (Β¬ β£ P β£) | function | WLEM | 1Lab | src/1Lab/Classical.lagda.md | [
"1Lab.Prelude",
"Data.Bool",
"Data.Dec",
"Data.Sum",
"Homotopy.Space.Suspension.Properties",
"Homotopy.Space.Suspension",
"Meta.Invariant"
] | [
"Dec"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
LEMβWLEM : LEM β WLEM | LEMβWLEM lem P = lem (P βΞ© β₯Ξ©) | function | LEMβWLEM | 1Lab | src/1Lab/Classical.lagda.md | [
"1Lab.Prelude",
"Data.Bool",
"Data.Dec",
"Data.Sum",
"Homotopy.Space.Suspension.Properties",
"Homotopy.Space.Suspension",
"Meta.Invariant"
] | [
"LEM",
"WLEM",
"lem",
"β₯Ξ©"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
WLEM-is-prop : is-prop WLEM | WLEM-is-prop = hlevel 1 | function | WLEM-is-prop | 1Lab | src/1Lab/Classical.lagda.md | [
"1Lab.Prelude",
"Data.Bool",
"Data.Dec",
"Data.Sum",
"Homotopy.Space.Suspension.Properties",
"Homotopy.Space.Suspension",
"Meta.Invariant"
] | [
"WLEM",
"hlevel",
"is-prop"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Axiom-of-choice : TypeΟ | Axiom-of-choice =
β {β β'} {B : Type β} {P : B β Type β'}
β is-set B β (β b β is-set (P b))
β (β b β β₯ P b β₯)
β β₯ (β b β P b) β₯ | function | Axiom-of-choice | 1Lab | src/1Lab/Classical.lagda.md | [
"1Lab.Prelude",
"Data.Bool",
"Data.Dec",
"Data.Sum",
"Homotopy.Space.Suspension.Properties",
"Homotopy.Space.Suspension",
"Meta.Invariant"
] | [
"is-set"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Surjections-split : TypeΟ | Surjections-split =
β {β β'} {A : Type β} {B : Type β'} β is-set A β is-set B
β (f : A β B)
β is-surjective f
β is-split-surjective f | function | Surjections-split | 1Lab | src/1Lab/Classical.lagda.md | [
"1Lab.Prelude",
"Data.Bool",
"Data.Dec",
"Data.Sum",
"Homotopy.Space.Suspension.Properties",
"Homotopy.Space.Suspension",
"Meta.Invariant"
] | [
"is-set",
"is-split-surjective",
"is-surjective"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
ACβSurjections-split : Axiom-of-choice β Surjections-split | ACβSurjections-split ac Aset Bset f =
ac Bset (fibre-is-hlevel 2 Aset Bset f) | function | ACβSurjections-split | 1Lab | src/1Lab/Classical.lagda.md | [
"1Lab.Prelude",
"Data.Bool",
"Data.Dec",
"Data.Sum",
"Homotopy.Space.Suspension.Properties",
"Homotopy.Space.Suspension",
"Meta.Invariant"
] | [
"Axiom-of-choice",
"Surjections-split",
"fibre-is-hlevel"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Surjections-splitβAC : Surjections-split β Axiom-of-choice | Surjections-splitβAC ss {P = P} Bset Pset h = β₯-β₯-map
(Equiv.to (Ξ -ap-cod (Fibre-equiv P)))
(ss (Ξ£-is-hlevel 2 Bset Pset) Bset fst Ξ» b β
β₯-β₯-map (Equiv.from (Fibre-equiv P b)) (h b)) | function | Surjections-splitβAC | 1Lab | src/1Lab/Classical.lagda.md | [
"1Lab.Prelude",
"Data.Bool",
"Data.Dec",
"Data.Sum",
"Homotopy.Space.Suspension.Properties",
"Homotopy.Space.Suspension",
"Meta.Invariant"
] | [
"Axiom-of-choice",
"Fibre-equiv",
"Surjections-split",
"Ξ -ap-cod",
"Ξ£-is-hlevel",
"β₯-β₯-map"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
_ = Fibration-equiv | function | _ | 1Lab | src/1Lab/Classical.lagda.md | [
"1Lab.Prelude",
"Data.Bool",
"Data.Dec",
"Data.Sum",
"Homotopy.Space.Suspension.Properties",
"Homotopy.Space.Suspension",
"Meta.Invariant"
] | [
"Fibration-equiv"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | ||
is-iso (f : A β B) : Type (level-of A β level-of B) where
no-eta-equality
constructor iso
field
from : B β A
rinv : is-right-inverse from f
linv : is-left-inverse from f | record | is-iso | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"is-left-inverse",
"is-right-inverse",
"level-of",
"linv",
"rinv"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | ||
is-equiv (f : A β B) : Type (level-of A β level-of B) where
no-eta-equality
field
is-eqv : (y : B) β is-contr (fibre f y) | record | is-equiv | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"fibre",
"is-contr",
"level-of"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | ||
is-left-inverse : (B β A) β (A β B) β Type _ | is-left-inverse g f = (x : _) β g (f x) β‘ x | function | is-left-inverse | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
is-right-inverse : (B β A) β (A β B) β Type _ | is-right-inverse g f = (x : _) β f (g x) β‘ x | function | is-right-inverse | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Iso : β {ββ ββ} β Type ββ β Type ββ β Type _ | Iso A B = Ξ£ (A β B) is-iso | function | Iso | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"is-iso"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
fibre : (A β B) β B β Type _ | fibre {A = A} f y = Ξ£[ x β A ] f x β‘ y | function | fibre | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
_β_ : β {ββ ββ} β Type ββ β Type ββ β Type _ | _β_ A B = Ξ£ (A β B) is-equiv | function | _β_ | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"is-equiv"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
id-equiv : is-equiv {A = A} id | id-equiv .is-eqv y .centre = y , refl
id-equiv .is-eqv y .paths (x , p) i = p (~ i) , Ξ» j β p (~ i β¨ j) | function | id-equiv | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"id",
"is-equiv",
"refl"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
strict-fibres : β {β β'} {A : Type β} {B : Type β'} {f : A β B} (g : B β A) (b : B)
β Ξ£[ t β fibre f (f (g b)) ]
((t' : fibre f b) β Path (fibre f (f (g b))) t
(g (f (t' .fst)) , ap (f β g) (t' .snd))) | strict-fibres {f = f} g b .fst = (g b , refl)
strict-fibres {f = f} g b .snd (a , p) i = (g (p (~ i)) , Ξ» j β f (g (p (~ i β¨ j))))
-- This is more efficient than using IsoβEquiv. When f (g x) is definitionally x,
-- the type reduces to essentially is-contr (fibre f b). | function | strict-fibres | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"Path",
"ap",
"fibre",
"refl"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
is-eqv' : β {a b} (A : Type a) (B : Type b)
β (w : A β B) (a : B)
β (Ο : I)
β (p : Partial Ο (fibre (w .fst) a))
β fibre (w .fst) a [ Ο β¦ p ] | is-eqv' A B (f , is-equiv) a Ο u0 = inS (
hcomp (β Ο) Ξ» where
i (Ο = i0) β c .centre
i (Ο = i1) β c .paths (u0 1=1) i
i (i = i0) β c .centre)
where c = is-equiv .is-eqv a
{-# BUILTIN EQUIVPROOF is-eqv' #-} | function | is-eqv' | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"fibre",
"hcomp",
"is-equiv"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
equiv-centre : (e : A β B) (y : B) β fibre (e .fst) y | equiv-centre e y = e .snd .is-eqv y .centre | function | equiv-centre | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"fibre"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
equiv-path : (e : A β B) (y : B) β
(v : fibre (e .fst) y) β Path _ (equiv-centre e y) v | equiv-path e y = e .snd .is-eqv y .paths | function | equiv-path | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"Path",
"equiv-centre",
"fibre"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
is-equiv-is-prop : (f : A β B) β is-prop (is-equiv f) | is-equiv-is-prop f x y i .is-eqv p = is-contr-is-prop (x .is-eqv p) (y .is-eqv p) i | function | is-equiv-is-prop | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"is-contr-is-prop",
"is-equiv",
"is-prop"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
equivβinverse : {f : A β B} β is-equiv f β B β A | equivβinverse eqv y = eqv .is-eqv y .centre .fst | function | equivβinverse | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"is-equiv"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
equivβcounit
: β {f : A β B} (eqv : is-equiv f) (y : B) β f (equivβinverse eqv y) β‘ y | equivβcounit eqv y = eqv .is-eqv y .centre .snd | function | equivβcounit | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"equivβinverse",
"is-equiv"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
equivβunit
: β {f : A β B} (eqv : is-equiv f) x β equivβinverse eqv (f x) β‘ x | equivβunit {f = f} eqv x i = eqv .is-eqv (f x) .paths (x , refl) i .fst | function | equivβunit | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"equivβinverse",
"is-equiv",
"refl"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
equivβsquare
: β {f : A β B} (eqv : is-equiv f) (x : A)
β Square (ap f (equivβunit eqv x)) (equivβcounit eqv (f x)) refl refl | equivβsquare {f = f} eqv x i j = eqv .is-eqv (f x) .paths (x , refl) i .snd j | function | equivβsquare | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"Square",
"ap",
"equivβcounit",
"equivβunit",
"is-equiv",
"refl"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
equivβzig
: β {f : A β B} (eqv : is-equiv f) x
β ap f (equivβunit eqv x) β‘ equivβcounit eqv (f x) | equivβzig {f = f} eqv x i j = hcomp (β i β¨ β j) Ξ» where
k (k = i0) β equivβsquare eqv x j i
k (i = i0) β f (equivβunit eqv x j)
k (i = i1) β equivβcounit eqv (f x) (j β¨ ~ k)
k (j = i0) β equivβcounit eqv (f x) (i β§ ~ k)
k (j = i1) β f x | function | equivβzig | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"ap",
"equivβcounit",
"equivβsquare",
"equivβunit",
"hcomp",
"is-equiv"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
equivβzag
: β {f : A β B} (eqv : is-equiv f) x
β ap (equivβinverse eqv) (equivβcounit eqv x)
β‘ equivβunit eqv (equivβinverse eqv x) | equivβzag {f = f} eqv b =
subst (Ξ» b β ap g (Ξ΅ b) β‘ Ξ· (g b)) (Ξ΅ b) (helper (g b)) where
g = equivβinverse eqv
Ξ΅ = equivβcounit eqv
Ξ· = equivβunit eqv
helper : β a β ap g (Ξ΅ (f a)) β‘ Ξ· (g (f a))
helper a i j = hcomp (β i β¨ β j) Ξ» where
k (i = i0) β g (Ξ΅ (f a) (j β¨ ~ k))
k (i = i1) β Ξ· (Ξ· a (~ k)) j
... | function | equivβzag | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"ap",
"equivβcounit",
"equivβinverse",
"equivβunit",
"equivβzig",
"hcomp",
"is-equiv",
"subst"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
is-equivβis-iso : {f : A β B} β is-equiv f β is-iso f | is-equivβis-iso eqv .is-iso.from = equivβinverse eqv
is-equivβis-iso eqv .is-iso.rinv = equivβcounit eqv
is-equivβis-iso eqv .is-iso.linv = equivβunit eqv | function | is-equivβis-iso | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"equivβcounit",
"equivβinverse",
"equivβunit",
"is-equiv",
"is-iso"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
IsoβEquiv : Iso A B β A β B
{-# INLINE IsoβEquiv #-} | IsoβEquiv (f , is-iso) = record { fst = f ; snd = is-isoβis-equiv is-iso } | function | IsoβEquiv | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"Iso",
"is-iso"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
inverse-is-equiv : {f : A β B} (eqv : is-equiv f) β is-equiv (equivβinverse eqv) | inverse-is-equiv {f = f} eqv .is-eqv x .centre = record
{ fst = f x ; snd = equivβunit eqv x }
inverse-is-equiv {A = A} {B = B} {f = f} eqv .is-eqv x .paths (y , p) = q where
g = equivβinverse eqv
Ξ· = equivβunit eqv
Ξ΅ = equivβcounit eqv
zag = equivβzag eqv
q : (f x , Ξ· x) β‘ (y , p)
q i .fst = (ap f (sym ... | function | inverse-is-equiv | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"ap",
"equivβcounit",
"equivβinverse",
"equivβunit",
"equivβzag",
"hcomp",
"is-equiv",
"sym",
"β-filler'"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
injectiveP
: β {β β'} {A : I β Type β} {B : I β Type β'} (f : β i β Iso (A i) (B i)) {x y}
β PathP (Ξ» i β B i) (f i0 .fst x) (f i1 .fst y)
β PathP (Ξ» i β A i) x y | injectiveP f {x} {y} p =
sym (Iso.linv (f i0) x) β apd (Ξ» i β Iso.from (f i)) p β· Iso.linv (f i1) y | function | injectiveP | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"Iso",
"apd",
"sym"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
is-contrβis-equiv : is-contr A β is-contr B β {f : A β B} β is-equiv f | is-contrβis-equiv cA cB = is-isoβis-equiv Ξ» where
.is-iso.from _ β cA .centre
.is-iso.linv _ β is-contrβis-prop cA _ _
.is-iso.rinv _ β is-contrβis-prop cB _ _ | function | is-contrβis-equiv | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"is-contr",
"is-contrβis-prop",
"is-equiv"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
is-contrββ : is-contr A β is-contr B β A β B | is-contrββ cA cB = (Ξ» _ β cB .centre) , is-contrβis-equiv cA cB | function | is-contrββ | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"is-contr",
"is-contrβis-equiv"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
is-contrβββ€ : is-contr A β A β β€ | is-contrβββ€ c = is-contrββ c β€-is-contr | function | is-contrβββ€ | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"is-contr",
"is-contrββ",
"β€-is-contr"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Β¬-is-equiv : (f : A β β₯) β is-equiv f | function | Β¬-is-equiv | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"is-equiv"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | ||
is-emptyβββ₯ : Β¬ A β A β β₯ | is-emptyβββ₯ Β¬a = _ , Β¬-is-equiv Β¬a | function | is-emptyβββ₯ | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"Β¬-is-equiv"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
sym-equiv : β {β} {A : Type β} {x y : A} β (x β‘ y) β (y β‘ x) | sym-equiv .fst = sym
sym-equiv .snd = is-isoβis-equiv (iso sym (Ξ» _ β refl) (Ξ» _ β refl)) | function | sym-equiv | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"refl",
"sym"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
β-pre-equiv : β {β} {A : Type β} {x y z : A} β x β‘ y β (y β‘ z) β (x β‘ z) | β-pre-equiv p .fst q = p β q
β-pre-equiv p .snd = is-isoβis-equiv Ξ» where
.is-iso.from q β sym p β q
.is-iso.rinv q β β-assoc p _ _ ββ ap (_β q) (β-invr p) ββ β-idl q
.is-iso.linv q β β-assoc (sym p) _ _ ββ ap (_β q) (β-invl p) ββ β-idl q | function | β-pre-equiv | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"ap",
"sym"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
β-post-equiv : β {β} {A : Type β} {x y z : A} β y β‘ z β (x β‘ y) β (x β‘ z) | β-post-equiv p .fst q = q β p
β-post-equiv p .snd = is-isoβis-equiv Ξ» where
.is-iso.from q β q β sym p
.is-iso.rinv q β sym (β-assoc q _ _) ββ ap (q β_) (β-invl p) ββ β-idr q
.is-iso.linv q β sym (β-assoc q _ _) ββ ap (q β_) (β-invr p) ββ β-idr q | function | β-post-equiv | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"ap",
"sym"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Lift-β : β {a β} {A : Type a} β Lift β A β A | Lift-β .fst (lift a) = a
Lift-β .snd .is-eqv a .centre = lift a , refl
Lift-β .snd .is-eqv a .paths (x , p) i .fst = lift (p (~ i))
Lift-β .snd .is-eqv a .paths (x , p) i .snd j = p (~ i β¨ j) | function | Lift-β | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"Lift",
"refl"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Lift-ap
: β {a b β β'} {A : Type a} {B : Type b}
β A β B β Lift β A β Lift β' B | Lift-ap (f , eqv) .fst (lift x) = lift (f x)
Lift-ap f .snd .is-eqv (lift y) .centre = lift (Equiv.from f y) , ap lift (Equiv.Ξ΅ f y)
Lift-ap f .snd .is-eqv (lift y) .paths (lift x , q) i = lift (p i .fst) , Ξ» j β lift (p i .snd j)
where p = f .snd .is-eqv y .paths (x , ap lower q) | function | Lift-ap | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"Lift",
"ap"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
is-involutiveβis-equiv : {f : A β A} β (β a β f (f a) β‘ a) β is-equiv f | is-involutiveβis-equiv inv = is-isoβis-equiv (iso _ inv inv) | function | is-involutiveβis-equiv | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"inv",
"is-equiv"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
_ : β-closed is-equiv | _ = β-is-equiv | function | _ | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"is-equiv",
"β-closed"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
left-inverseβequiv
: {f : A β B} {g : B β A}
β is-left-inverse g f β is-equiv f β is-equiv g | left-inverseβequiv linv ef = equiv-cancelr ef
(subst is-equiv (sym (funext linv)) id-equiv) | function | left-inverseβequiv | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"funext",
"id-equiv",
"is-equiv",
"is-left-inverse",
"linv",
"subst",
"sym"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
right-inverseβequiv
: {f : A β B} {g : B β A}
β is-right-inverse g f β is-equiv f β is-equiv g | right-inverseβequiv rinv ef = equiv-cancell ef
(subst is-equiv (sym (funext rinv)) id-equiv) | function | right-inverseβequiv | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"funext",
"id-equiv",
"is-equiv",
"is-right-inverse",
"rinv",
"subst",
"sym"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
idβ : β {β} {A : Type β} β A β A | idβ = id , id-equiv | function | idβ | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"id",
"id-equiv"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
_βe_ : A β B β B β C β A β C
{-# INLINE _βe_ #-} | _βe_ (f , ef) (g , eg) = record { fst = g β f ; snd = β-is-equiv eg ef } | function | _βe_ | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
_eβ»ΒΉ : A β B β B β A | function | _eβ»ΒΉ | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | ||
ββ¨β©-syntax : β {β ββ ββ} (A : Type β) {B : Type ββ} {C : Type ββ}
β B β C β A β B β A β C | ββ¨β©-syntax A g f = f βe g | function | ββ¨β©-syntax | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
_βΛβ¨_β©_ : β {β ββ ββ} (A : Type β) {B : Type ββ} {C : Type ββ}
β B β A β B β C β A β C | function | _βΛβ¨_β©_ | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | ||
_ββ¨β©_ : β {β ββ} (A : Type β) {B : Type ββ} β A β B β A β B | function | _ββ¨β©_ | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | ||
_ββ : β {β} (A : Type β) β A β A | function | _ββ | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | ||
substβ
: (x : A) β (Ξ£[ y β A ] (y β‘ x Γ P y)) β P x | substβ {A = A} {P = P} x = IsoβEquiv (to , iso from invr invl)
where
to : Ξ£[ y β A ] (y β‘ x Γ P y) β P x
to (y , y=x , py) = subst P y=x py
from : P x β Ξ£[ y β A ] (y β‘ x Γ P y)
from px = x , refl , px
invr : is-right-inverse from to
invr = transport-refl
invl : is-left-inverse from to
... | function | substβ | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"IsoβEquiv",
"is-left-inverse",
"is-right-inverse",
"refl",
"subst",
"transport-refl"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
is-equivβfibre-is-contr
: β {β β'} {A : Type β} {B : Type β'}
β {f : A β B}
β is-equiv f β (β x β is-contr (fibre f x)) | is-equivβfibre-is-contr {f = f} =
prop-ext
(is-equiv-is-prop f)
(Ξ» f g i x β is-contr-is-prop (f x) (g x) i)
is-eqv
(Ξ» fib-contr β record { is-eqv = fib-contr })
-- This ideally would go in 1Lab.HLevel, but we don't have equivalences
-- defined that early in the bootrapping process. | function | is-equivβfibre-is-contr | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"fibre",
"is-contr",
"is-contr-is-prop",
"is-equiv",
"is-equiv-is-prop"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
is-propβis-contr-iff-inhabited
: β {β} {A : Type β}
β is-prop A
β is-contr A β A | is-propβis-contr-iff-inhabited A-prop =
prop-ext is-contr-is-prop A-prop centre (is-propββis-contr A-prop) | function | is-propβis-contr-iff-inhabited | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"is-contr",
"is-contr-is-prop",
"is-prop",
"is-propββis-contr"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
lift-inj
: β {β β'} {A : Type β} {a b : A}
β lift {β = β'} a β‘ lift {β = β'} b β a β‘ b | lift-inj p = ap lower p
-- Fibres of composites are given by pairs of fibres. | function | lift-inj | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"ap"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
fibre-β-β
: β {β β' β''} {A : Type β} {B : Type β'} {C : Type β''}
β {f : B β C} {g : A β B}
β β c β fibre (f β g) c β (Ξ£[ (b , _) β fibre f c ] fibre g b) | fibre-β-β {f = f} {g = g} c .fst (a , p) = (g a , p) , a , refl
fibre-β-β {f = f} {g = g} c .snd = is-isoβis-equiv (iso bwd invl invr) where
fwd : fibre (f β g) c β Ξ£[ (b , _) β fibre f c ] fibre g b
fwd (a , p) = ((g a) , p) , (a , refl)
bwd : Ξ£[ (b , _) β fibre f c ] fibre g b β fibre (f β g) c
bwd ((b , p) ... | function | fibre-β-β | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"ap",
"fibre",
"hcomp",
"refl",
"β-filler"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
is-emptyββ : Β¬ A β Β¬ B β A β B | is-emptyββ Β¬a Β¬b = is-emptyβββ₯ Β¬a βe is-emptyβββ₯ Β¬b eβ»ΒΉ | function | is-emptyββ | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"is-emptyβββ₯"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
flip-equiv-square
: (e : A β A') (e' : B β B') (f : A β B) (f' : A' β B')
β Equiv.to e' β f β Equiv.from e β‘ f'
β f β‘ Equiv.from e' β f' β Equiv.to e | flip-equiv-square e e' f f' p = funext Ξ» z β
Equiv.injective e' (sym
( Equiv.Ξ΅ e' _
β happly (sym p) (e .fst z) β ap (e' .fst β f) (Equiv.Ξ· e _))) | function | flip-equiv-square | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"ap",
"f'",
"funext",
"happly",
"sym"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
is-equiv-join : (f : A β B) β (B β is-equiv f) β is-equiv f
{-# INLINE is-equiv-join #-} | is-equiv-join f fe = record { is-eqv = Ξ» y β fe y .is-eqv y } | function | is-equiv-join | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"is-equiv"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
((f , ef) eβ»ΒΉ) = equivβinverse ef , inverse-is-equiv ef | function | f | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"equivβinverse",
"inverse-is-equiv"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | ||
A βΛβ¨ f β© g = f eβ»ΒΉ βe g | function | A | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | ||
x ββ¨β© xβ‘y = xβ‘y | x ββ = idβ | function | x | 1Lab | src/1Lab/Equiv.lagda.md | [
"1Lab.Path.Reasoning",
"1Lab.Path.Groupoid",
"1Lab.HLevel",
"1Lab.Path",
"1Lab.Type"
] | [
"idβ"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Extensional (A : Type β) β-rel : Type (β β lsuc β-rel) where
no-eta-equality
field
Pathα΅ : A β A β Type β-rel
reflα΅ : β x β Pathα΅ x x
idsα΅ : is-identity-system Pathα΅ reflα΅
{-# INLINE Extensional.constructor #-} | record | Extensional | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"is-identity-system",
"lsuc"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | ||
Extensional-default : Extensional A (level-of A) | Extensional-default .Pathα΅ = _β‘_
Extensional-default .reflα΅ _ = refl
Extensional-default .idsα΅ = Path-identity-system
-- We can't mark this instance as OVERLAPPABLE because it's not
-- strictly less specific than most other instances (it fixes the
-- level of the relation to be that of the type).
{-# INCO... | function | Extensional-default | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"Path-identity-system",
"_β‘_",
"level-of",
"refl"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Extensional-Lift : β¦ Extensional A βr β¦ β Extensional (Lift β' A) βr | Extensional-Lift β¦ sa β¦ .Pathα΅ (lift x) (lift y) = sa .Pathα΅ x y
Extensional-Lift β¦ sa β¦ .reflα΅ (lift x) = sa .reflα΅ x
Extensional-Lift β¦ sa β¦ .idsα΅ .to-path p = ap lift (sa .idsα΅ .to-path p)
Extensional-Lift β¦ sa β¦ .idsα΅ .to-path-over p = sa .idsα΅ .to-path-over p | function | Extensional-Lift | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"Lift",
"ap"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Extensional-Ξ
: β¦ β {x} β Extensional (P x) βr β¦
β Extensional ((x : A) β P x) (level-of A β βr) | Extensional-Ξ β¦ sb β¦ .Pathα΅ f g = β x β Pathα΅ sb (f x) (g x)
Extensional-Ξ β¦ sb β¦ .reflα΅ f x = reflα΅ sb (f x)
Extensional-Ξ β¦ sb β¦ .idsα΅ .to-path h = funext Ξ» i β sb .idsα΅ .to-path (h i)
Extensional-Ξ β¦ sb β¦ .idsα΅ .to-path-over h = funextP Ξ» i β sb .idsα΅ .to-path-over (h i)
-- This instance is *very often* specialis... | function | Extensional-Ξ | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"funext",
"funextP",
"level-of"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Extensional-Ξ '
: β¦ β {x} β Extensional (P x) βr β¦
β Extensional ({x : A} β P x) (level-of A β βr) | Extensional-Ξ ' β¦ sb β¦ .Pathα΅ f g = β {x} β Pathα΅ (sb {x}) f g
Extensional-Ξ ' β¦ sb β¦ .reflα΅ f = reflα΅ sb f
Extensional-Ξ ' β¦ sb β¦ .idsα΅ .to-path h i = sb .idsα΅ .to-path h i
Extensional-Ξ ' β¦ sb β¦ .idsα΅ .to-path-over h i = sb .idsα΅ .to-path-over h i | function | Extensional-Ξ ' | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"level-of"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Extensional-Ξ ''
: β¦ β β¦ x β¦ β Extensional (P x) βr β¦
β Extensional (β¦ x : A β¦ β P x) (level-of A β βr) | Extensional-Ξ '' β¦ sb β¦ .Pathα΅ f g = β β¦ x β¦ β Pathα΅ (sb β¦ x β¦) f g
Extensional-Ξ '' β¦ sb β¦ .reflα΅ f = reflα΅ sb f
Extensional-Ξ '' β¦ sb β¦ .idsα΅ .to-path h i = sb .idsα΅ .to-path h i
Extensional-Ξ '' β¦ sb β¦ .idsα΅ .to-path-over h i = sb .idsα΅ .to-path-over h i
-- Some non-confluent "reduction rules" for extensionality are ... | function | Extensional-Ξ '' | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"level-of"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Extensional-uncurry
: β {β β' β'' βr} {A : Type β} {B : A β Type β'} {C : (x : A) β B x β Type β''}
β β¦ sb : Extensional ((x : A) (y : B x) β C x y) βr β¦
β Extensional ((p : Ξ£ A B) β C (p .fst) (p .snd)) βr | Extensional-uncurry β¦ sb β¦ .Pathα΅ f g = sb .Pathα΅ (curry f) (curry g)
Extensional-uncurry β¦ sb β¦ .reflα΅ f = sb .reflα΅ (curry f)
Extensional-uncurry β¦ sb = sb β¦ .idsα΅ .to-path h i (a , b) = sb .idsα΅ .to-path h i a b
Extensional-uncurry β¦ sb = sb β¦ .idsα΅ .to-path-over h = sb .idsα΅ .to-path-over h | function | Extensional-uncurry | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Extensional-lift-map
: β {β β' β'' βr} {A : Type β} {B : Lift β' A β Type β''}
β β¦ sa : Extensional ((x : A) β B (lift x)) βr β¦
β Extensional ((x : Lift β' A) β B x) βr | Extensional-lift-map β¦ sa = sa β¦ .Pathα΅ f g = sa .Pathα΅ (f β lift) (g β lift)
Extensional-lift-map β¦ sa = sa β¦ .reflα΅ x = sa .reflα΅ (x β lift)
Extensional-lift-map β¦ sa = sa β¦ .idsα΅ .to-path h i (lift x) = sa .idsα΅ .to-path h i x
Extensional-lift-map β¦ sa = sa β¦ .idsα΅ .to-path-over h = sa .idsα΅ .to-path-over h | function | Extensional-lift-map | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"Lift"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
ext
: β {β βr} {A : Type β} {x y : A} β¦ r : Extensional A βr β¦
β Pathα΅ r x y β x β‘ y | ext β¦ r β¦ p = r .idsα΅ .to-path p
{-
Using the extensionality tactic we can define a "more general refl",
where the terms being compared are not definitionally equal, but they
inhabit a type with a good identity system for which 'r x : R x y' type
checks.
The idea is to write a function wrapping
ext : β¦ r : Extensi... | function | ext | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
trivial-iso!
: β {β β' βr βs} {A : Type β} {B : Type β'}
β β¦ r : Extensional (A β A) βr β¦
β β¦ s : Extensional (B β B) βs β¦
β (f : A β B)
β (g : B β A)
β {@(tactic trivial-worker r (g β f) id) p : Pathα΅ r (g β f) id}
β {@(tactic trivial-worker s (f β g) id) q : Pathα΅ s (f β g) id}
β Iso A B | trivial-iso! β¦ r β¦ β¦ s β¦ f g {p = p} {q = q} =
f , iso g (happly (s .idsα΅ .to-path q)) (happly (r .idsα΅ .to-path p)) | function | trivial-iso! | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"Iso",
"happly",
"id"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
unext : β {β βr} {A : Type β} β¦ e : Extensional A βr β¦ {x y : A} β x β‘ y β e .Pathα΅ x y | unext β¦ e β¦ {x = x} p = transport (Ξ» i β e .Pathα΅ x (p i)) (e .reflα΅ x) | function | unext | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"transport"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
reext!
: β {β βr} {A : Type β} β¦ ea : Extensional A βr β¦ {x y : A}
β x β‘ y β Term β TC β€ | reext! p goal = do
`p β quoteTC p
unify goal (def (quote ext) [ argN (def (quote unext) [ argN `p ]) ]) | function | reext! | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"Term",
"argN",
"ext",
"unext"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Pathα΅-is-hlevel
: β {β βr} {A : Type β} n (sa : Extensional A βr)
β is-hlevel A (suc n)
β β {x y}
β is-hlevel (Pathα΅ sa x y) n | Pathα΅-is-hlevel n sa hl =
Equivβis-hlevel _ (identity-system-gives-path (sa .idsα΅)) (Path-is-hlevel' _ hl _ _)
-- Constructors for Extensional instances in terms of embeddings. The
-- extra coherence is required to make sure that we still have an
-- identity system by the end.
--
-- If the type you're reducing to is... | function | Pathα΅-is-hlevel | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Equivβis-hlevel",
"Extensional",
"Path-is-hlevel'",
"identity-system-gives-path",
"is-hlevel",
"suc"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
embeddingβextensional
: β {β β' βr} {A : Type β} {B : Type β'}
β (f : A βͺ B)
β Extensional B βr
β Extensional A βr
{-# INLINE embeddingβextensional #-} | embeddingβextensional f ext = record where
Pathα΅ x y = ext .Pathα΅ (f .fst x) (f .fst y)
reflα΅ x = ext .reflα΅ (f .fst x)
idsα΅ = pullback-identity-system (ext .idsα΅) f | function | embeddingβextensional | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"ext"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
isoβextensional
: β {β β' βr} {A : Type β} {B : Type β'}
β Iso A B
β Extensional B βr
β Extensional A βr
{-# INLINE isoβextensional #-} | isoβextensional f ext = embeddingβextensional (IsoβEmbedding f) ext | function | isoβextensional | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"Iso",
"IsoβEmbedding",
"embeddingβextensional",
"ext"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
injectionβextensional
: β {β β' βr} {A : Type β} {B : Type β'}
β is-set B
β {f : A β B}
β (β {x y} β f x β‘ f y β x β‘ y)
β Extensional B βr
β Extensional A βr
{-# INLINE injectionβextensional #-} | injectionβextensional b-set {f} inj ext = record where
Pathα΅ x y = ext .Pathα΅ (f x) (f y)
reflα΅ x = ext .reflα΅ (f x)
idsα΅ = record where
to-path x = inj (ext .idsα΅ .to-path x)
to-path-over p = is-propβpathp (Ξ» i β Pathα΅-is-hlevel 1 ext b-set) _ _ | function | injectionβextensional | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"Pathα΅-is-hlevel",
"ext",
"inj",
"is-propβpathp",
"is-set",
"to-path"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
injectionβextensional!
: β {β β' βr} {A : Type β} {B : Type β'}
β β¦ _ : H-Level B 2 β¦
β {f : A β B}
β (β {x y} β f x β‘ f y β x β‘ y)
β Extensional B βr
β Extensional A βr
{-# INLINE injectionβextensional! #-} | injectionβextensional! = injectionβextensional (hlevel 2) | function | injectionβextensional! | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"H-Level",
"hlevel",
"injectionβextensional"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Ξ£-prop-extensional
: β {β β' βr} {A : Type β} {B : A β Type β'}
β (β x β is-prop (B x))
β Extensional A βr
β Extensional (Ξ£ A B) βr
{-# INLINE Ξ£-prop-extensional #-} | Ξ£-prop-extensional bprop = embeddingβextensional (fst , Subset-proj-embedding bprop) | function | Ξ£-prop-extensional | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"Subset-proj-embedding",
"embeddingβextensional",
"is-prop"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Extensional-Ξ£-trunc
: β {β β' βr} {A : Type β} {B : A β Type β'}
β β¦ ea : Extensional A βr β¦ β Extensional (Ξ£ A Ξ» x β β₯ B x β₯) βr | Extensional-Ξ£-trunc β¦ ea β¦ = Ξ£-prop-extensional (Ξ» x β hlevel 1) ea | function | Extensional-Ξ£-trunc | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"hlevel",
"Ξ£-prop-extensional"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Extensional-equiv
: β {β β' βr} {A : Type β} {B : Type β'}
β β¦ ea : Extensional (A β B) βr β¦ β Extensional (A β B) βr | Extensional-equiv β¦ ea β¦ = Ξ£-prop-extensional (Ξ» x β hlevel 1) ea | function | Extensional-equiv | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"hlevel",
"Ξ£-prop-extensional"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Extensional-emb
: β {β β' βr} {A : Type β} {B : Type β'}
β β¦ ea : Extensional (A β B) βr β¦ β Extensional (A βͺ B) βr | Extensional-emb β¦ ea β¦ = Ξ£-prop-extensional (Ξ» x β hlevel 1) ea | function | Extensional-emb | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"hlevel",
"Ξ£-prop-extensional"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
Extensional-tr-map
: β {β β' βr} {A : Type β} {B : Type β'}
β β¦ bset : H-Level B 2 β¦
β β¦ ea : Extensional (A β B) βr β¦
β Extensional (β₯ A β₯ β B) βr | Extensional-tr-map β¦ ea = ea β¦ =
injectionβextensional! {f = Ξ» f β f β inc}
(Ξ» p β funext $ β₯-β₯-elim (Ξ» _ β hlevel 1) (happly p)) ea | function | Extensional-tr-map | 1Lab | src/1Lab/Extensionality.agda | [
"1Lab.Reflection.Signature",
"1Lab.Path.IdentitySystem",
"1Lab.Function.Embedding",
"1Lab.Reflection.HLevel",
"1Lab.Reflection.Subst",
"1Lab.HLevel.Closure",
"1Lab.Reflection",
"1Lab.Truncation",
"1Lab.Type.Sigma",
"1Lab.Type.Pi",
"1Lab.HLevel",
"1Lab.Equiv",
"1Lab.Path",
"1Lab.Type",
"D... | [
"Extensional",
"H-Level",
"funext",
"happly",
"hlevel",
"inc",
"injectionβextensional!",
"β₯-β₯-elim"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
is-contr {β} (A : Type β) : Type β where
constructor contr
field
centre : A
paths : (x : A) β centre β‘ x | record | is-contr | 1Lab | src/1Lab/HLevel.lagda.md | [
"1Lab.Path",
"1Lab.Type"
] | [] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | ||
[0,1] : Type where
ii0 : [0,1]
ii1 : [0,1]
seg : ii0 β‘ ii1 | data | [0,1] | 1Lab | src/1Lab/HLevel.lagda.md | [
"1Lab.Path",
"1Lab.Type"
] | [] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | ||
is-prop : β {β} β Type β β Type β | is-prop T = (x y : T) β x β‘ y | function | is-prop | 1Lab | src/1Lab/HLevel.lagda.md | [
"1Lab.Path",
"1Lab.Type"
] | [] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c | |
subst-prop : β {β β'} {A : Type β} {P : A β Type β'} β is-prop A β β a β P a β β b β P b | subst-prop {P = P} prop a pa b = subst P (prop a b) pa | function | subst-prop | 1Lab | src/1Lab/HLevel.lagda.md | [
"1Lab.Path",
"1Lab.Type"
] | [
"is-prop",
"subst"
] | https://github.com/plt-amy/1lab | e5a99a399a3c58922adef713f38314805810937c |
Structured dataset from 1Lab β Cross-linked reference resource for HoTT.
e5a99a399a3c58922adef713f38314805810937c| 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 |
|---|---|
| function | 5,264 |
| record | 311 |
| data | 116 |
| postulate | 5 |
Axiom-of-choice : TypeΟ
Axiom-of-choice =
β {β β'} {B : Type β} {P : B β Type β'}
β is-set B β (β b β is-set (P b))
β (β b β β₯ P b β₯)
β β₯ (β b β P b) β₯
Axiom-of-choice | src/1Lab/Classical.lagda.mdEach 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{agda_1lab_dataset,
title = {Agda-1Lab},
author = {Norton, Charles},
year = {2026},
note = {Extracted from https://github.com/plt-amy/1lab, commit e5a99a399a3c},
url = {https://huggingface.co/datasets/phanerozoic/Agda-1Lab}
}