remove empty code blocks

fredrik-bakke · May 27, 2023 · 3d53688 · 3d53688
1 parent 437056c
commit 3d53688
Show file tree

Hide file tree

Showing 4 changed files with 0 additions and 20 deletions.
diff --git a/src/group-theory/isomorphisms-concrete-groups.lagda.md b/src/group-theory/isomorphisms-concrete-groups.lagda.md
@@ -33,7 +33,3 @@ iso-Concrete-Group = iso-Large-Precategory Concrete-Group-Large-Precategory
 ## Properties
 
 ### Equivalences of concrete groups are isomorphisms of concrete groups
-
-```agda
-
-```
diff --git a/src/univalent-combinatorics/2-element-types.lagda.md b/src/univalent-combinatorics/2-element-types.lagda.md
@@ -840,18 +840,10 @@ module _
 
 This remains to be shown.
 
-```agda
-
-```
-
 ### A map between 2-element types is not an equivalence if and only if its image is a singleton subtype of the codomain
 
 This remains to be shown.
 
-```agda
-
-```
-
 ### Any map between 2-element types that is not an equivalence is constant
 
 This remains to be shown.

diff --git a/src/univalent-combinatorics/unlabeled-rooted-trees.lagda.md b/src/univalent-combinatorics/unlabeled-rooted-trees.lagda.md
@@ -17,7 +17,3 @@ module univalent-combinatorics.unlabeled-rooted-trees where
 An unlabelled rooted tree is an unlabelled tree equipped with a vertex.
 
 ## Definition
-
-```agda
-
-```
diff --git a/src/univalent-combinatorics/unlabeled-trees.lagda.md b/src/univalent-combinatorics/unlabeled-trees.lagda.md
@@ -18,7 +18,3 @@ An unlabelled tree is an undirected graph `G` such that any cycle in `G` must
 have length 1.
 
 ## Definition
-
-```agda
-
-```
-Original file line number
+Diff line change
@@ Expand Up @@
     ## Properties
     ### Equivalences of concrete groups are isomorphisms of concrete groups
-    ```agda
-    ```