Added templates and some code done

0Trinitarianism/Preambles/P0.agda

@@ -0,0 +1,3 @@
+module 0Trinitarianism.Preambles.P0 where
+
+open import Cubical.Foundations.Prelude hiding (_∨_) public

0Trinitarianism/Preambles/P1.agda

@@ -0,0 +1,6 @@
+module 0Trinitarianism.Preambles.P1 where
+
+open import Cubical.Foundations.Prelude public
+open import Cubical.Data.Unit public renaming (Unit to ⊤)
+open import Cubical.Data.Empty public using (⊥)
+open import Cubical.Data.Nat public hiding (isEven)

0Trinitarianism/Preambles/P2.agda

@@ -0,0 +1,6 @@
+module 0Trinitarianism.Preambles.P2 where
+
+open import Cubical.Foundations.Prelude public
+open import Cubical.Data.Unit public renaming (Unit to ⊤)
+open import Cubical.Data.Empty public using (⊥)
+open import Cubical.Data.Nat public hiding (isEven)

0Trinitarianism/Preambles/P3.agda

@@ -0,0 +1,6 @@
+module 0Trinitarianism.Preambles.P3 where
+
+open import Cubical.Foundations.Prelude public
+open import Cubical.Data.Nat public hiding (_+_ ; isEven)
+open import 0Trinitarianism.Quest1 public
+open import Cubical.Data.Empty public using (⊥)

0Trinitarianism/Preambles/P4.agda

@@ -0,0 +1,5 @@
+module 0Trinitarianism.Preambles.P4 where
+
+open import Cubical.Foundations.Prelude using
+  ( Level ; Type ; _≡_ ; J ; JRefl ; refl ; i1 ; i0 ; I ; cong) public
+open import Cubical.Foundations.Isomorphism renaming (Iso to _≅_) public

0Trinitarianism/Preambles/P5.agda

@@ -0,0 +1,33 @@
+module 0Trinitarianism.Preambles.P5 where
+
+open import Cubical.Foundations.Prelude renaming
+  (funExt to libFunExt ;
+   sym to libSym ;
+   _∎ to lib_∎ ;
+   _∙_ to lib_∙_ ;
+   fst to libFst ;
+   snd to libSnd
+  ) hiding ( step-≡ ) public
+open import Cubical.HITs.S1 using ( S¹ ; base ; loop ) public
+open import Cubical.Foundations.Isomorphism renaming (Iso to _≅_) public
+open import Cubical.Foundations.Path public
+open import 0Trinitarianism.Quest4Solutions public
+open import 1FundamentalGroup.Quest0Solutions public
+open import Cubical.Data.Bool public
+
+pathToFun≡transport : {u : Level} {A B : Type u} (p : A ≡ B) (x : A)
+  → pathToFun p x ≡ transport p x
+pathToFun≡transport {u} {A} = J (λ B p → (x : A) → pathToFun p x ≡ transport p x)
+  λ x →
+      pathToFun refl x
+    ≡⟨ pathToFunReflx x ⟩
+      x
+    ≡⟨ sym (transportRefl x) ⟩
+      transport refl x ∎
+
+PathPIsoPathD : {u : Level} {A B : Type u} (p : A ≡ B) (x : A) (y : B) →
+  (PathP (λ i → p i) x y) ≅ (pathToFun p x ≡ y)
+PathPIsoPathD {u} {A} {B} p x =
+  subst (λ b → (y : B) → (PathP (λ i → p i) x y) ≅ (b ≡ y))
+    (sym (pathToFun≡transport p x))
+    (PathPIsoPath _ x)