AFTD Auto-Formalizing Theoretical Domains

Language.mul_sub_one

theoremverifiedformalizationimported Lean

Language.mul_sub_one

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set List in
open scoped Computability in
variable {α : Type*} {l m : Language α} in
@[scoped grind =]
theorem Language.mul_sub_one : l * (l - 1) = l * l - 1
Formalizes
CSLib, `Language.mul_sub_one`
Lean proof
By Ching-Tsun Chou, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Ching-Tsun Chou. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Set List inopen scoped Computability invariable {α : Type*} {l m : Language α} in@[scoped grind =]theorem Language.mul_sub_one : l * (l - 1) = l * l - 1 := by  calc    _ = (l * (l - 1)).reverse.reverse := by rw [reverse_reverse]    _ = ((l.reverse - 1) * l.reverse).reverse := by rw [reverse_mul, reverse_sub, reverse_one]    _ = (l.reverse * l.reverse - 1).reverse := by rw [sub_one_mul]    _ = _ := by rw [reverse_sub, reverse_one, reverse_mul, reverse_reverse]
See it in the graphDiscuss this resultChallenge it