90a79a0b06
Now, `universe` may declare many universes. The goal is to make it consistent with the `variable` command
20 lines
408 B
Text
20 lines
408 B
Text
|
||
universe u
|
||
|
||
def f {α : Type u} [BEq α] (xs : List α) (y : α) : α := do
|
||
for x in xs do
|
||
if x == y then
|
||
return x
|
||
return y
|
||
|
||
structure S :=
|
||
(key val : Nat)
|
||
|
||
instance : BEq S :=
|
||
⟨fun a b => a.key == b.key⟩
|
||
|
||
theorem ex1 : f (α := S) [⟨1, 2⟩, ⟨3, 4⟩, ⟨5, 6⟩] ⟨3, 0⟩ = ⟨3, 4⟩ :=
|
||
rfl
|
||
|
||
theorem ex2 : f (α := S) [⟨1, 2⟩, ⟨3, 4⟩, ⟨5, 6⟩] ⟨4, 10⟩ = ⟨4, 10⟩ :=
|
||
rfl
|