2ed025ade8
This PR marks the automatically generated `sizeOf` theorems as `grind` theorems. closes #11259 Note: Requested update stage0, we need it to be able to solve example in the issue above. ```lean example (a: Nat) (b: Nat): sizeOf a < sizeOf (a, b) := by grind ```
16 lines
425 B
Text
16 lines
425 B
Text
inductive Lst (α : Type u) where
|
||
| nil : Lst α
|
||
| cons (head : α) (tail : Lst α) : Lst α
|
||
|
||
structure Prd (α : Type u) (β : Type v) where
|
||
fst : α
|
||
snd : β
|
||
|
||
example : sizeOf (@Lst.nil Nat) < sizeOf (Lst.cons 10 .nil) := by
|
||
grind
|
||
|
||
example (a b : Nat) : sizeOf a < sizeOf { fst := a, snd := b : Prd _ _ } := by
|
||
grind
|
||
|
||
example (a : α) (b : β) : sizeOf a < sizeOf { fst := a, snd := b : Prd _ _ } := by
|
||
grind
|