{-# OPTIONS --lossy-unification #-}
open import Cat.Functor.Equivalence
open import Cat.Functor.Properties
open import Cat.Instances.Functor
open import Cat.Functor.Compose
open import Cat.Univalent
open import Cat.Prelude

import Cat.Functor.Reasoning.FullyFaithful as FfR
import Cat.Functor.Reasoning as FR
import Cat.Reasoning

open Functor
open _=>_

module Cat.Univalent.Rezk.Universal where

private variable
o β : Level
A B C CβΊ : Precategory o β

private module _ {o β} {C : Precategory o β} where
open Cat.Reasoning C using (_β_)
open _β_ public

-- Using β/Β·Β· over equational reasoning saves ~5k conversion checks


# Universal property of the Rezk completionπ

With the Rezk completion, we defined, for any precategory a univalent category together with a weak equivalence functor We also stated, but did not in that module prove, the universal property of the Rezk completion: The functor is the universal map from to categories. This module actually proves it, but be warned: the proof is very technical, and is mostly a calculation.

In generic terms, universality of the Rezk completion follows from univalent categories being the class of local objects for the weak equivalences1: A category is univalent precisely if any weak equivalence induces2 a proper equivalence of categories

The high-level overview of the proof is as follows:

• For any eso functor and for any all precategories, the functor is faithful. This is the least technical part of the proof, so we do it first.

• If is additionally full, then is fully faithful.

• If is a weak equivalence, and is univalent, then is essentially surjective. By the principle of unique choice, it is an equivalence, and thus3 an isomorphism.

## Faithfulnessπ

The argument here is almost elementary: Weβre given a witness that so all we have to do is manipulate the expression to something which has a subexpression. Since is eso, given we can find and an iso from which we can calculate:

esoβpre-faithful
: (H : Functor A B) {F G : Functor B C}
β is-eso H β (Ξ³ Ξ΄ : F => G)
β (β b β Ξ³ .Ξ· (H .Fβ b) β‘ Ξ΄ .Ξ· (H .Fβ b)) β Ξ³ β‘ Ξ΄
esoβpre-faithful {A = A} {B = B} {C = C} H {F} {G} h-eso Ξ³ Ξ΄ p = ext Ξ» b β
β₯-β₯-out (C.Hom-set _ _ _ _) do
(b' , m) β h-eso b
β₯_β₯.inc $Ξ³ .Ξ· b β‘β¨ C.intror (F-map-iso F m .invl) β©β‘ Ξ³ .Ξ· b C.β F.β (m .to) C.β F.β (m .from) β‘β¨ C.extendl (Ξ³ .is-natural _ _ _) β©β‘ G.β (m .to) C.β Ξ³ .Ξ· _ C.β F.β (m .from) β‘β¨ apβ C._β_ refl (apβ C._β_ (p b') refl) β©β‘ G.β (m .to) C.β Ξ΄ .Ξ· _ C.β F.β (m .from) β‘β¨ C.extendl (sym (Ξ΄ .is-natural _ _ _)) β©β‘ Ξ΄ .Ξ· b C.β F.β (m .to) C.β F.β (m .from) β‘β¨ C.elimr (F-map-iso F m .invl) β©β‘ Ξ΄ .Ξ· b β where module C = Cat.Reasoning C module F = Functor F module G = Functor G  The above is, unfortunately, the simplest result in this module. The next two proofs are both quite technical: thatβs because weβre given some mere4 data, from the assumption that is a weak equivalence, so to use it as proper data, we need to show that whatever we want lives in a contractible space, after which we are free to project only the data we are interested in, and forget about the coherences. It will turn out, however, that the coherence data necessary to make these types contractible is exactly the coherence data we need to show that we are indeed building functors, natural transformations, etc. So, not only do we need it to use unique choice, we also need it to show weβre doing category theory. ## Full-faithfulnessπ Let and be as before, except now assume that is full (in addition to eso). eso-fullβpre-ff : (H : Functor A B) β is-eso H β is-full H β is-fully-faithful {C = Cat[ B , C ]} (precompose H) eso-fullβpre-ff {A = A} {B = B} {C = C} H H-eso H-full = res where  We will show that, for every natural transformation and each there is a contractible type of βcomponent dataβ over These data consist of morphisms each equipped with a witness that acts naturally when faced with isomorphisms  module A = Cat.Reasoning A module B = Cat.Reasoning B module C = Cat.Reasoning C module H = FR H module _ (F G : Functor B C) (Ξ³ : F Fβ H => G Fβ H) where module F = FR F module FH = FR (F Fβ H) module G = FR G module GH = FR (G Fβ H) module Ξ³ = _=>_ Ξ³  In more detail, if weβre given an essential fibre of over we can use to βmatch upβ our component with the components of the natural transformation since weβve claimed to have a and someone has just handed us a then it darn well better be the case that is  T : B.Ob β Type _ T b = Ξ£ (C.Hom (F.β b) (G.β b)) Ξ» g β (a : A.Ob) (f : H.β a B.β b) β Ξ³.Ξ· a β‘ G.β (f .from) C.β g C.β F.β (f .to)  Weβll first show that components exist at all. Assume that we have some and an essential fibre of over it5. In this situation, guided by the compatibility condition (and isomorphisms being just the best), we can actually define the component to be βwhatever satisfies compatibility at β and a short calculation establishes that defining  module Mk (b : B.Ob) (aβ : A.Ob) (h : H.β aβ B.β b) where private module h = B._β _ h   g = G.β h.to C.β Ξ³.Ξ· aβ C.β F.β h.from  is indeed a possible choice. We present the formalisation below, but do not comment on the calculation, leaving it to the curious reader to load this file in Agda and poke around the proof.  lemma : (a : A.Ob) (f : H.β a B.β b) β Ξ³.Ξ· a β‘ G.β (f .from) C.β g C.β F.β (f .to) lemma a f = β₯-β₯-out (C.Hom-set _ _ _ _) do (k , p) β H-full (h.from B.β B.to f) (kβ»ΒΉ , q) β H-full (B.from f B.β h.to) β₯_β₯.inc$
C.intror (F.annihilate
(apβ B._β_ q p Β·Β· B.cancel-inner h.invl Β·Β· f .invr))
Β·Β· C.extendl (Ξ³.is-natural _ _ _)
Β·Β· apβ (Ξ» e e' β G.β e C.β Ξ³.Ξ· aβ C.β F.β e') q p
Β·Β· apβ (Ξ» e e' β e C.β Ξ³.Ξ· aβ C.β e') (G.F-β _ _) (F.F-β _ _)
Β·Β· C.pullr (ap (G.β h.to C.β_) (C.pulll refl) β C.pulll refl)


Anyway, because of how weβve phrased the coherence condition, if both satisfy it, then we have equal to both and 6 Since isomorphisms are both monic and epic, we can cancel and from these equations to conclude Since the coherence condition is a proposition, the type of component data over is a proposition.

    T-prop : β b β is-prop (T b)
T-prop b (g , coh) (g' , coh') = Ξ£-prop-path! $β₯-β₯-out! do (aβ , h) β H-eso b pure$ C.isoβepic (F-map-iso F h) _ _
(C.isoβmonic (F-map-iso G (h B.Isoβ»ΒΉ)) _ _
(sym (coh aβ h) β coh' aβ h))


Given any being eso means that we merely have an essential fibre of over But since the type of components over is a proposition, if weβre going to use it to construct a component over then we are granted the honour of actually getting hold of an pair.

    mkT' : β b β β₯ Essential-fibre H b β₯ β β₯ T b β₯
mkT' b he = do
(aβ , h) β he
β₯_β₯.inc (Mk.g b aβ h , Mk.lemma b aβ h)

mkT : β b β T b
mkT b = β₯-β₯-out (T-prop b) (mkT' b (H-eso b))


Another calculation shows that, since is full, given any pair of essential fibres over and over with a mediating map we can choose a map satisfying and since both the components at and βcome from β (which is natural), we get a naturality result for the transformation weβre defining, too.

That computation is a bit weirder, so itβs hidden in this <details> tag.
    module
_ {b b'} (f : B.Hom b b') (a a' : A.Ob)
(h : H.β a B.β b) (h' : H.β a' B.β b')
where
private
module h' = B._β_ h'
module h = B._β_ h

naturality : _
naturality = β₯-β₯-out (C.Hom-set _ _ _ _) do
(k , p) β H-full (h'.from B.β f B.β h.to)
pure $C.pullr (C.pullr (F.weave (sym (B.pushl p β apβ B._β_ refl (B.cancelr h.invl))))) Β·Β· apβ C._β_ refl (C.extendl (Ξ³.is-natural _ _ _)) Β·Β· C.extendl (G.weave (B.lswizzle p h'.invl))  Because of this naturality result, all the components weβve chosen piece together into a natural transformation. And since we defined parametrically over the choice of essential fibre, if weβre looking at some then we can choose the identity isomorphism, from which it falls out that Since we had already established that is faithful, and now weβve shown it is full, it is fully faithful.  Ξ΄ : F => G Ξ΄ .Ξ· b = mkT b .fst Ξ΄ .is-natural b b' f = β₯-β₯-elimβ {P = Ξ» Ξ± Ξ² β β₯-β₯-out (T-prop b') (mkT' b' Ξ±) .fst C.β F.β f β‘ G.β f C.β β₯-β₯-out (T-prop b) (mkT' b Ξ²) .fst} (Ξ» _ _ β C.Hom-set _ _ _ _) (Ξ» (a' , h') (a , h) β naturality f a a' h h') (H-eso b') (H-eso b) full : is-full (precompose H) full {x = x} {y = y} Ξ³ = pure (Ξ΄ _ _ Ξ³ , ext p) where p : β b β Ξ΄ _ _ Ξ³ .Ξ· (H.β b) β‘ Ξ³ .Ξ· b p b = subst (Ξ» e β β₯-β₯-out (T-prop _ _ Ξ³ (H.β b)) (mkT' _ _ Ξ³ (H.β b) e) .fst β‘ Ξ³ .Ξ· b) (squash (inc (b , B.id-iso)) (H-eso (H.β b))) (C.eliml (y .F-id) β C.elimr (x .F-id)) res : is-fully-faithful (precompose H) res = full+faithfulβff (precompose H) full Ξ» {F} {G} {Ξ³} {Ξ΄} p β esoβpre-faithful H H-eso Ξ³ Ξ΄ Ξ» b β p Ξ·β b  ## Essential surjectivityπ The rest of the proof proceeds in this same way: Define a type which characterises, up to a compatible space of choices, first the action on morphisms of a functor which inverts and in terms of this type, the action on morphisms. Itβs mostly the same trick as above, but a lot wilder. We do not comment on it too extensively: the curious reader, again, can load this file in Agda and play around. module _ {ao aβ bo bβ co cβ} {A : Precategory ao aβ} {B : Precategory bo bβ} {C : Precategory co cβ} (H : Functor A B) (H-eso : is-eso H) (H-ff : is-fully-faithful H) (c-cat : is-category C) where private module A = Cat.Reasoning A module B = Cat.Reasoning B module C = Cat.Reasoning C module H = FfR H H-ff  The type of object-candidates Obs is indexed by a and any object candidate must come with a family of isomorphisms giving, for every way of expressing as coming from a way of coming from To show this type is a proposition, we additionally require a naturality condition for these isomorphisms.  private module _ (F : Functor A C) where private module F = FR F Obs : B.Ob β Type _ Obs b = Ξ£ C.Ob Ξ» c β Ξ£ ((a : A.Ob) (h : H.β a B.β b) β F.β a C.β c) Ξ» k β ((a , h) (a' , h') : Essential-fibre H b) (f : A.Hom a a') β h' .to B.β H.β f β‘ h .to β k a' h' .to C.β F.β f β‘ k a h .to  Note that we can derive an object candidate over from a fibre of over Moreover, this choice is a center of contraction, so we can once more apply unique choice and the assumption that is eso to conclude that every has an object candidate over it.  obj' : β {b} β Essential-fibre H b β Obs b obj' (aβ , hβ) .fst = F.β aβ obj' (aβ , hβ) .snd .fst a h = F-map-iso F (H.iso.from (h B.βIso (hβ B.Isoβ»ΒΉ))) obj' (aβ , hβ) .snd .snd (a , h) (a' , h') f p = F.collapse (H.ipushr p) Obs-is-prop : β {b} (f : Essential-fibre H b) (c : Obs b) β obj' f β‘ c Obs-is-prop (aβ , hβ) (c' , k' , Ξ²) = Ξ£-pathp (Univalent.isoβpath c-cat cβ c')$
Ξ£-prop-pathp! $funextP Ξ» a β funextP Ξ» h β C.β -pathp _ _$
Univalent.Hom-pathp-reflr-iso c-cat {q = cβc'}
( C.pullr (F.eliml (H.from-id (hβ .invr)))
β Ξ² _ _ _ (H.Ξ΅-lswizzle (hβ .invl)))
where
ckΞ± = obj' (aβ , hβ)
c = ckΞ± .fst
k = ckΞ± .snd .fst
Ξ± = ckΞ± .snd .snd
cβc' = (k aβ hβ C.Isoβ»ΒΉ) C.βIso k' aβ hβ

    summon : β {b} β β₯ Essential-fibre H b β₯ β is-contr (Obs b)
summon f = β₯-β₯-out is-contr-is-prop do
f β f
pure $contr (obj' f) (Obs-is-prop f) Gβ : B.Ob β C.Ob Gβ b = summon {b = b} (H-eso b) .centre .fst k : β {b} a (h : H.β a B.β b) β F.β a C.β Gβ b k {b = b} a h = summon {b = b} (H-eso b) .centre .snd .fst a h kcomm : β {b} ((a , h) (a' , h') : Essential-fibre H b) (f : A.Hom a a') β h' .to B.β H.β f β‘ h .to β k a' h' .to C.β F.β f β‘ k a h .to kcomm {b} f1 f2 f w = summon {b = b} (H-eso b) .centre .snd .snd f1 f2 f w  We will write Gβ for the canonical choice of object candidate, and k for the associated family of isomorphisms. The type of morphism candidates over consists of maps which are compatible with the reindexing isomorphisms for any essential fibre over over and map satisfying  compat : β {b b'} (f : B.Hom b b') β C.Hom (Gβ b) (Gβ b') β Type _ compat {b} {b'} f g = β a (h : H.β a B.β b) a' (h' : H.β a' B.β b') (l : A.Hom a a') β h' .to B.β H.β l β‘ f B.β h .to β k a' h' .to C.β F.β l β‘ g C.β k a h .to Homs : β {b b'} (f : B.Hom b b') β Type _ Homs {b = b} {b'} f = Ξ£ (C.Hom (Gβ b) (Gβ b')) (compat f)  It will again turn out that any initial choice of fibre over and gives a morphism candidate over and the compatibility data is exactly what we need to show the type of morphism candidates is a proposition. This proof really isnβt commented. Iβm sorry.  module _ {b b'} (f : B.Hom b b') aβ (hβ : H.β aβ B.β b) aβ' (hβ' : H.β aβ' B.β b') where lβ : A.Hom aβ aβ' lβ = H.from (hβ' .from B.β f B.β hβ .to) p : hβ' .to B.β H.β lβ β‘ (f B.β hβ .to) p = H.Ξ΅-lswizzle (hβ' .invl) gβ : C.Hom (Gβ b) (Gβ b') gβ = k aβ' hβ' .to C.β F.β lβ C.β k aβ hβ .from module _ a (h : H.β a B.β b) a' (h' : H.β a' B.β b') (l : A.Hom a a') (w : h' .to B.β H.β l β‘ f B.β h .to) where m : aβ A.β a m = H.iso.from (hβ B.βIso (h B.Isoβ»ΒΉ)) m' : aβ' A.β a' m' = H.iso.from (hβ' B.βIso (h' B.Isoβ»ΒΉ)) Ξ± : k aβ hβ .from β‘ F.β (m .from) C.β k a h .from Ξ± = C.inverse-unique _ _ (k aβ hβ) (F-map-iso F m C.βIso k a h)$
sym (kcomm _ _ _ (H.Ξ΅-lswizzle (h .invl)))

Ξ³ : H.β (m' .to) B.β H.β lβ β‘ H.β l B.β H.β (m .to)
Ξ³ =  B.pushl (H.Ξ΅ _)
Β·Β· apβ B._β_ refl (p β
B.pushl (B.insertr (h .invl) β apβ B._β_ (sym w) refl))
Β·Β· B.deletel (h' .invr)
β apβ B._β_ refl (sym (H.Ξ΅ _))

Ξ³' : lβ A.β m .from β‘ m' .from A.β l
Ξ³' = A.isoβmonic m' _ _ $A.extendl (H.injective (H.swap Ξ³)) Β·Β· A.elimr (m .invl) Β·Β· A.insertl (m' .invl) Ξ΄ : gβ C.β k a h .to β‘ k a' h' .to C.β F.β l Ξ΄ = C.pullr ( C.pullr refl Β·Β· apβ C._β_ refl (C.pushl Ξ±) Β·Β· C.pulll refl β C.elimr (k a h .invr)) Β·Β· apβ C._β_ refl (F.weave Ξ³') Β·Β· C.pulll (C.pushl (sym (kcomm _ _ _ (H.Ξ΅-lswizzle (h' .invl)))) β C.elimr (F.annihilate (m' .invl))) Homs-pt : Homs f Homs-pt = gβ , Ξ» a h a' h' l w β sym (Ξ΄ a h a' h' l w) Homs-prop' : (h' : Homs f) β h' .fst β‘ gβ Homs-prop' (gβ , w) = C.isoβepic (k aβ hβ) _ _ (sym (Ξ΄ aβ hβ aβ' hβ' lβ p β w aβ hβ aβ' hβ' lβ p)) Homs-contr' : β {b b'} (f : B.Hom b b') β β₯ is-contr (Homs f) β₯ Homs-contr' {b = b} {b'} f = do (aβ , h) β H-eso b (aβ' , h') β H-eso b' inc (contr (Homs-pt f aβ h aβ' h') Ξ» h' β Ξ£-prop-path! (sym (Homs-prop' f _ _ _ _ h'))) Homs-contr : β {b b'} (f : B.Hom b b') β is-contr (Homs f) Homs-contr f = β₯-β₯-out! (Homs-contr' f) Gβ : β {b b'} β B.Hom b b' β C.Hom (Gβ b) (Gβ b') Gβ f = Homs-contr f .centre .fst  Using the compatibility condition, and choices of we can show that the assignment of morphism candidates does assemble into a functor.  module Gβ {x y z} (f : B.Hom y z) (g : B.Hom x y) {ax ay az} (hx : H.β ax B.β x) (hy : H.β ay B.β y) (hz : H.β az B.β z) where af : A.Hom ay az af = H.from (hz .from B.β f B.β hy .to) ag : A.Hom ax ay ag = H.from (hy .from B.β g B.β hx .to) h' : H.β (af A.β ag) β‘ hz .from B.β f B.β g B.β hx .to h' = H.Ξ΅-expand refl β B.pullr (B.cancel-inner (hy .invl)) commutes : Gβ (f B.β g) β‘ Gβ f C.β Gβ g commutes = C.isoβepic (k ax hx) _ _$
sym (Homs-contr (f B.β g) .centre .snd ax hx az hz (af A.β ag)
(apβ B._β_ refl h' Β·Β· B.cancell (hz .invl) Β·Β· B.pulll refl))
β sym ( C.pullr (sym (Homs-contr g .centre .snd ax hx ay hy ag
(H.Ξ΅-lswizzle (hy .invl))))
β C.pulll (sym (Homs-contr f .centre .snd ay hy az hz af
(H.Ξ΅-lswizzle (hz .invl))))
β F.pullr refl)


In this manner, the assignment of object candidates and morphism candidates fits together into a functor After finishing this, we have to show that But the compatibility data which we have used to uniquely characterise uniquely characterises after all, and it does so as composing with to give .

    G : Functor B C
G .Fβ b = Gβ b
G .Fβ f = Gβ f

G .F-id = ap fst $Homs-contr B.id .paths$ C.id , Ξ» a h a' h' l w β
sym (C.idl _ β sym (kcomm (a , h) (a' , h') l (w β B.idl _)))


Note that we proved7 that is functorial given choices of essential fibres of all three objects involved in the composition. Since weβre showing an equality in a set β a proposition β these choices donβt matter, so we can use essential surjectivity of

    G .F-β {x} {y} {z} f g = β₯-β₯-out! do
(ax , hx) β H-eso x
(ay , hy) β H-eso y
(az , hz) β H-eso z
inc (Gβ.commutes f g hx hy hz)


To use the unique charactersation of as βthe functor satisfying β, observe: for any the object can be made into an object candidate over and since the type of object candidates is a proposition, our candidate is identical to the value of Thatβs half of established right off the bat!

    module _ (x : A.Ob) where
hf-obs : Obs (H.β x)
hf-obs .fst = F.Fβ x
hf-obs .snd .fst a h = F-map-iso F (H.iso.from h)
hf-obs .snd .snd (a , h) (a' , h') f Ξ± = F.collapse (H.invβl Ξ±)

abstract
objp : Gβ (H.β x) β‘ F.β x
objp = ap fst $summon {H.β x} (H-eso _) .paths hf-obs   kp : (a : A.Ob) (h : H.β a B.β H.β x) β PathP (Ξ» i β F.β a C.β objp i) (k a h) (hf-obs .snd .fst a h) kp a h = ap (Ξ» e β e .snd .fst a h) (summon {H.β x} (H-eso (H.β x)) .paths hf-obs)  Over that identification, we can show that, for any in the value is also a candidate for the morphism so these are also identical. This proof is a bit hairier, because only has the right type if we adjust it by the proof that we have to transport and then as punishment for our hubris, invoke a lot of technical lemmas about the characterisation of PathP in the morphism spaces of (pre)categories.  module _ {x y} (f : A.Hom x y) where hom' : Homs (H.β f) hom' .fst = transport (Ξ» i β C.Hom (objp x (~ i)) (objp y (~ i))) (F.β f) hom' .snd a h a' h' l w = sym$
C.pushl (Hom-transport C (sym (objp x)) (sym (objp y)) (F.β f))
Β·Β· apβ C._β_ refl
( C.pullr (from-pathp-from C (objp x) (Ξ» i β kp x a h i .to))
β F.weave (H.Ξ΅-twist (sym w)))
Β·Β· C.pulll (from-pathp-to C (sym (objp y)) Ξ» i β kp y a' h' (~ i) .to)

homp : transport (Ξ» i β C.Hom (objp x (~ i)) (objp y (~ i))) (F.β f)
β‘ Homs-contr (H.β f) .centre .fst
homp = ap fst $sym$ Homs-contr (H.β f) .paths hom'

correct : G Fβ H β‘ F
correct = Functor-path objp Ξ» {x} {y} f β symP
{A = Ξ» i β C.Hom (objp x (~ i)) (objp y (~ i))} \$
to-pathp (homp f)


Since weβve shown that so in particular weβve now put together proofs that is fully faithful and, since the construction above works for any essentially surjective. Even better, since weβve actually constructed a functor weβve shown that is split essentially surjective! Since is univalent whenever is, the splitting would be automatic, but this is a nice strengthening.

  weak-equivβpre-equiv : is-equivalence {C = Cat[ B , C ]} (precompose H)
weak-equivβpre-equiv = ff+split-esoβis-equivalence {F = precompose H}
(eso-fullβpre-ff H H-eso Ξ» g β inc (H.from g , H.Ξ΅ g))
Ξ» F β G F , pathβiso (correct F)


And since a functor is an equivalence of categories iff. it is an isomorphism of categories, we also have that the rule sending to its is an equivalence of types.

  weak-equivβpre-iso : is-precat-iso {C = Cat[ B , C ]} (precompose H)
weak-equivβpre-iso = is-equivalenceβis-precat-iso (precompose H) weak-equivβpre-equiv
(Functor-is-category c-cat)
(Functor-is-category c-cat)


Restating the result that acts on objects as an equivalence of types, we have the following result: If is a weak equivalence (a fully faithful and essentially surjective functor), then for any category and functor there is a contractible space(!) of extensions which factor through

weak-equivβreflection
: (F : Functor C CβΊ) β is-eso F β is-fully-faithful F
β {D : Precategory o β} β is-category D
β (G : Functor C D)
β is-contr (Ξ£ (Functor CβΊ D) Ξ» H β H Fβ F β‘ G)
weak-equivβreflection F F-eso F-ff D-cat G =
weak-equivβpre-iso F F-eso F-ff D-cat
.is-precat-iso.has-is-iso .is-eqv G


Note that this is only half of the point of the Rezk completion: we would also like for to be univalent, but that is not necessary for to think that precomposition with is an isomorphism.

1. a weak equivalence is a fully faithful, essentially surjective functorβ©οΈ

2. since both its domain and codomain are univalentβ©οΈ

3. truncatedβ©οΈ

4. Donβt worry about actually getting your hands on an β©οΈ

5. Iβve implicitly used that is eso to cough up an over since weβre proving a propositionβ©οΈ

6. in the second <details> tag aboveβ©οΈ