Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions Mathlib.lean
Original file line number Diff line number Diff line change
Expand Up @@ -4859,6 +4859,7 @@ public import Mathlib.Geometry.Euclidean.Volume.MeasureSimplex
public import Mathlib.Geometry.Euclidean.Volume.Triangle
public import Mathlib.Geometry.Group.Growth.LinearLowerBound
public import Mathlib.Geometry.Group.Growth.QuotientInter
public import Mathlib.Geometry.Group.InfiniteRegularTree
public import Mathlib.Geometry.Group.WordMetric
public import Mathlib.Geometry.Group.WordProd
public import Mathlib.Geometry.Manifold.Algebra.LeftInvariantDerivation
Expand Down
2 changes: 2 additions & 0 deletions Mathlib/Algebra/Order/Group/End.lean
Original file line number Diff line number Diff line change
Expand Up @@ -79,6 +79,8 @@ instance : Group (r ≃r r) where
mul_one _ := ext fun _ => rfl
inv_mul_cancel f := ext f.symm_apply_apply

lemma inv_eq_symm (e : r ≃r r) : e⁻¹ = e.symm := rfl

lemma one_def : (1 : r ≃r r) = .refl r := rfl
lemma mul_def (f g : r ≃r r) : (f * g) = g.trans f := rfl

Expand Down
5 changes: 5 additions & 0 deletions Mathlib/Data/List/Infix.lean
Original file line number Diff line number Diff line change
Expand Up @@ -174,6 +174,11 @@ protected theorem IsPrefix.nodup {l₁ l₂ : List α} (h : l₁ <+: l₂) (hn :
l₁.Nodup :=
hn.sublist h.sublist

/-- A proper prefix is strictly shorter. -/

Copy link
Copy Markdown
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
/-- A proper prefix is strictly shorter. -/

theorem length_lt_of_prefix_ne {l₁ l₂ : List α} (h : l₁ <+: l₂) (hne : l₁ ≠ l₂) :
l₁.length < l₂.length :=
Nat.lt_of_le_of_ne h.length_le fun H ↦ hne (h.eq_of_length H)

protected theorem IsInfix.nodup {l₁ l₂ : List α} (h : l₁ <:+: l₂) (hn : l₂.Nodup) :
l₁.Nodup :=
hn.sublist h.sublist
Expand Down
Loading