Dataset Viewer
Auto-converted to Parquet Duplicate
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
End of preview. Expand in Data Studio

Agda-1Lab

Structured dataset from 1Lab β€” Cross-linked reference resource for HoTT.

Source

Schema

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

Statistics

  • Entries: 5,696
  • With proof: 4,758 (83.5%)
  • With docstring: 0 (0.0%)
  • Libraries: 164

By type

Type Count
function 5,264
record 311
data 116
postulate 5

Example

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) βˆ₯
  • type: function | symbolic_name: Axiom-of-choice | src/1Lab/Classical.lagda.md

Use

Each 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.

Citation

@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}
}
Downloads last month
19

Collection including phanerozoic/Agda-1Lab