We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 1f367e9 commit 89f5529Copy full SHA for 89f5529
1 file changed
Mathlib/Combinatorics/SimpleGraph/Metric.lean
@@ -431,8 +431,7 @@ theorem ball_two : G.ball c 2 = insert c (G.neighborSet c) := by
431
/-- The ball of radius `⊤` is the connected component of the center. -/
432
theorem ball_top :
433
G.ball c ⊤ = (G.connectedComponentMk c).supp := by
434
- ext v
435
- simp [lt_top_iff_ne_top, edist_ne_top_iff_reachable]
+ simp [Set.ext_iff, lt_top_iff_ne_top, edist_ne_top_iff_reachable]
436
437
/-- A vertex is in the ball of radius `⊤` iff it is reachable from the center. -/
438
theorem mem_ball_top : v ∈ G.ball c ⊤ ↔ G.Reachable v c := by
0 commit comments