diff --git a/Concurrent Systems/notes/11 - LTSs and Bisimulation.md b/Concurrent Systems/notes/11 - LTSs and Bisimulation.md
index b26a90a..1df2007 100644
--- a/Concurrent Systems/notes/11 - LTSs and Bisimulation.md	
+++ b/Concurrent Systems/notes/11 - LTSs and Bisimulation.md	
@@ -99,7 +99,6 @@ So, (p', q') ∈ ∼
 **Theorem:** For every bisimulation S, it holds that S ⊆ ∼.
 *Proof:*
 Let (p,q) ∈ S. Then, there exists a bisimulation that contains the pair (p, q); thus, (p, q) ∈ ∼.
-
 ## La parte difficile
 
 ![](../../Pasted%20image%2020250414091521.png)