changed transport to pathToFun

1FundamentalGroup/Preambles/P0.agda

@@ -3,7 +3,10 @@ module 1FundamentalGroup.Preambles.P0 where
 open import Cubical.Data.Empty using (⊥) public
 open import Cubical.Data.Unit renaming ( Unit to ⊤ ) public
 open import Cubical.Data.Bool public
-open import Cubical.Foundations.Prelude renaming ( subst to endPt ) public
+open import Cubical.Foundations.Prelude
+     renaming ( subst to endPt
+              ; transport to pathToFun
+              ) public
 open import Cubical.Foundations.Isomorphism renaming ( Iso to _≅_ ) public
 open import Cubical.Foundations.Path public
 open import Cubical.HITs.S1 public

1FundamentalGroup/Preambles/P1.agda

@@ -4,6 +4,9 @@ open import Cubical.HITs.S1 using (S¹ ; base ; loop) public
 open import Cubical.Data.Nat using (ℕ ; suc ; zero) public
 open import Cubical.Data.Int using (ℤ ; pos ; negsuc ; -_) public
 open import Cubical.Data.Empty public
-open import Cubical.Foundations.Prelude renaming (subst to endPt) public
+open import Cubical.Foundations.Prelude
+     renaming ( subst to endPt
+              ; transport to pathToFun
+              ) public
 open import Cubical.Foundations.Isomorphism renaming (Iso to _≅_) public
 open import 1FundamentalGroup.Quest0Solutions using ( Refl ; Refl≢loop ) public

1FundamentalGroup/Preambles/P2.agda

@@ -3,6 +3,9 @@ module 1FundamentalGroup.Preambles.P2 where
 open import Cubical.Data.Nat public
 open import Cubical.Data.Int using (ℤ ; pos ; negsuc ; -_) public
 open import Cubical.Foundations.Isomorphism renaming (Iso to _≅_) public
-open import Cubical.Foundations.Prelude renaming (subst to endPt) public
+open import Cubical.Foundations.Prelude
+     renaming ( subst to endPt
+              ; transport to pathToFun
+              ) public
 open import Cubical.HITs.S1 using (S¹ ; base ; loop) public
 open import 1FundamentalGroup.Quest1Solutions public

1FundamentalGroup/Quest0Solutions.agda

@@ -61,12 +61,12 @@ isoEmpty→pathEmpty : (A : Type) → isoEmpty A → pathEmpty A
 isoEmpty→pathEmpty A = isoToPath
 
 pathEmpty→toEmpty : (A : Type) → pathEmpty A → toEmpty A
-pathEmpty→toEmpty A p x = transport p x
+pathEmpty→toEmpty A p x = pathToFun p x
 
 ------------------- Side Quests - true≢false --------------------
 
 true≢false' : true ≡ false → ⊥
-true≢false' h = transport ⊤≡⊥ tt where
+true≢false' h = pathToFun ⊤≡⊥ tt where
 
   propify : Bool → Type
   propify false = ⊥

1FundamentalGroup/Quest2Solutions.agda

@@ -2,40 +2,40 @@
 module 1FundamentalGroup.Quest2Solutions where
 open import 1FundamentalGroup.Preambles.P2
 
-sucℤ : ℤ → ℤ
+-- sucℤ : ℤ → ℤ
-sucℤ (pos n) = pos (suc n)
+-- sucℤ (pos n) = pos (suc n)
-sucℤ (negsuc zero) = pos zero
+-- sucℤ (negsuc zero) = pos zero
-sucℤ (negsuc (suc n)) = negsuc n
+-- sucℤ (negsuc (suc n)) = negsuc n
 
-predℤ : ℤ → ℤ
+-- predℤ : ℤ → ℤ
-predℤ (pos zero) = negsuc zero
+-- predℤ (pos zero) = negsuc zero
-predℤ (pos (suc n)) = pos n
+-- predℤ (pos (suc n)) = pos n
-predℤ (negsuc n) = negsuc (suc n)
+-- predℤ (negsuc n) = negsuc (suc n)
 
-sucℤIso : ℤ ≅ ℤ
+-- sucℤIso : ℤ ≅ ℤ
-sucℤIso = iso sucℤ predℤ s r where
+-- sucℤIso = iso sucℤ predℤ s r where
 
-  s : section sucℤ predℤ
+--   s : section sucℤ predℤ
-  s (pos zero) = refl
+--   s (pos zero) = refl
-  s (pos (suc n)) = refl
+--   s (pos (suc n)) = refl
-  s (negsuc zero) = refl
+--   s (negsuc zero) = refl
-  s (negsuc (suc n)) = refl
+--   s (negsuc (suc n)) = refl
 
-  r : retract sucℤ predℤ
+--   r : retract sucℤ predℤ
-  r (pos zero) = refl
+--   r (pos zero) = refl
-  r (pos (suc n)) = refl
+--   r (pos (suc n)) = refl
-  r (negsuc zero) = refl
+--   r (negsuc zero) = refl
-  r (negsuc (suc n)) = refl
+--   r (negsuc (suc n)) = refl
 
-sucℤPath : ℤ ≡ ℤ
+-- sucℤPath : ℤ ≡ ℤ
-sucℤPath = isoToPath sucℤIso
+-- sucℤPath = isoToPath sucℤIso
 
-helix : S¹ → Type
+-- helix : S¹ → Type
-helix base = ℤ
+-- helix base = ℤ
-helix (loop i) = sucℤPath i
+-- helix (loop i) = sucℤPath i
 
-windingNumberBase : base ≡ base → ℤ
+-- windingNumberBase : base ≡ base → ℤ
-windingNumberBase p = endPt helix p (pos zero)
+-- windingNumberBase p = endPt helix p (pos zero)
 
-windingNumber : (x : S¹) → base ≡ x → helix x
+-- windingNumber : (x : S¹) → base ≡ x → helix x
-windingNumber x p = endPt helix p (pos zero)
+-- windingNumber x p = endPt helix p (pos zero)