c0df714935
This PR adds a finishing `decide_cbv` tactic, which applies `of_decide_eq_true` and then tries to discharge the remaining goal using `cbv`. Stacked on top of #12408. --------- Co-authored-by: Claude Sonnet 4.5 <noreply@anthropic.com>
33 lines
898 B
Text
33 lines
898 B
Text
import Std
|
||
|
||
example : 1 ∈ [1,2,3] := by decide_cbv
|
||
|
||
example : 123482349 < 293849023490238490 := by decide_cbv
|
||
|
||
example : 3 ∈ (Std.TreeSet.empty.insertMany [1,2,3,4,5] : Std.TreeSet Nat) := by decide_cbv
|
||
|
||
def minFacAux (n : Nat) : Nat → Nat
|
||
| k =>
|
||
if h : n < k * k then n
|
||
else
|
||
if h' : k ∣ n then k
|
||
else
|
||
have : k ≤ n := by have := Nat.le_mul_self k; omega
|
||
minFacAux n (k + 2)
|
||
termination_by k => n + 2 - k
|
||
|
||
def Nat.minFac (n : Nat) : Nat :=
|
||
if 2 ∣ n then 2 else minFacAux n 3
|
||
|
||
def Nat.log (b n : Nat) : Nat :=
|
||
if b ≤ 1 then 0 else (go b n).2 where
|
||
go : Nat → Nat → Nat × Nat
|
||
| _, 0 => (n, 0)
|
||
| b, fuel + 1 =>
|
||
if n < b then
|
||
(n, 0)
|
||
else
|
||
let (q, e) := go (b * b) fuel
|
||
if q < b then (q, 2 * e) else (q / b, 2 * e + 1)
|
||
|
||
example : ¬∃ k, k ≤ Nat.log 2 15 ∧ 0 < k ∧ 15 = Nat.minFac 15 ^ k := by decide_cbv
|