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
2 changes: 2 additions & 0 deletions test-projects/tutorial-test/TutorialExample/Data.lean
Original file line number Diff line number Diff line change
Expand Up @@ -341,6 +341,8 @@ mutual
| succ : Even n → Odd (n + 1)
end

set_option linter.unusedVariables false

-- Trees with different node types
mutual
inductive TreeA (α : Type) where
Expand Down
4 changes: 2 additions & 2 deletions test-projects/tutorial-test/TutorialExample/RCases.lean
Original file line number Diff line number Diff line change
Expand Up @@ -487,8 +487,8 @@ example (h : ∃ n, P n) : True := by
trivial

-- Or just:
example (h : ∃ n, P n) : True := by
trivial -- h not needed at all
example (_ : ∃ n, P n) : True := by
trivial -- hypothesis not needed at all
end
```

Expand Down
4 changes: 2 additions & 2 deletions test-projects/website/DemoSite/Blog/Conditionals.lean
Original file line number Diff line number Diff line change
Expand Up @@ -153,7 +153,7 @@ Here's an inductive type and a structure:
```lean demo
inductive A where
| a1 | a2
| a3 (n : Nat)
| a3 : Nat → A
| a4 : (n : Nat) → n = 3 → A

structure S where
Expand Down Expand Up @@ -190,7 +190,7 @@ def quoted (str : String) : m Syntax := do
let s ← `(a b c #[x, $(quote str), z])
pure s

example : ¬(quoted (m := m) = fun x => pure .missing) := by
example : ¬(quoted (m := m) = fun _ => pure .missing) := by
unfold quoted
intro h
let g : String → m Syntax := fun str => do
Expand Down