Skip to content

Commit ec65f5a

Browse files
committed
doc: fix misleading docstrings (leanprover-community#39121)
Fix a typo and update an outdated docstring.
1 parent 34d82a7 commit ec65f5a

1 file changed

Lines changed: 2 additions & 2 deletions

File tree

Mathlib/Tactic/GCongr/Core.lean

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -228,7 +228,7 @@ def getRel (e : Expr) : Option (Name × Expr × Expr) :=
228228
none
229229
| _ => none
230230

231-
/-- If `e` is of the form `r a b`, replace either `a` or `b` with `e`. -/
231+
/-- If `r` is of the form `rel a b`, replace either `a` or `b` with `e`. -/
232232
def updateRel (r e : Expr) (isLhs : Bool) : Expr :=
233233
match r with
234234
| .forallE _ d b _ => if isLhs then r.updateForallE! e b else r.updateForallE! d e
@@ -517,7 +517,7 @@ lemma rel_imp_rel (h₁ : r c a) (h₂ : r b d) : r a b → r c d :=
517517
Construct a `GCongrLemma` for `gcongr` goals of the form `a ≺ b → c ≺ d`.
518518
This will be tried if there is no other available `@[gcongr]` lemma.
519519
For example, the relation `a ≡ b [ZMOD n]` has an instance of `IsTrans`, so a congruence of the form
520-
`a ≡ b [ZMOD n] → c ≡ d [ZMOD n]` can be solved with `rel_imp_rel`, `rel_trans` or `rel_trans'`.
520+
`a ≡ b [ZMOD n] → c ≡ d [ZMOD n]` can be solved with `rel_imp_rel`.
521521
-/
522522
def relImpRelLemma (arity : Nat) : List GCongrLemma :=
523523
if arity < 2 then [] else [{

0 commit comments

Comments
 (0)