AFTD Auto-Formalizing Theoretical Domains

Language.sub_one_mul

theoremverifiedformalizationimported Lean

A grind regression found moving to nightly-2026-03-31 (changes from lean#13166)

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.sub_one_mul : (l - 1) * l = l * l - 1
Formalizes
CSLib, `Language.sub_one_mul`
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 1
Used by 1

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/-- A grind regression found moving to nightly-2026-03-31 (changes from lean#13166) -/@[scoped grind =]theorem Language.sub_one_mul : (l - 1) * l = l * l - 1 := by  ext x; constructor  · rintro ⟨u, h_u, v, h_v, rfl⟩    constructor    · exact ⟨u, Set.mem_of_mem_inter_left h_u, v, h_v, rfl⟩    · by_contra h      have := mem_sub_one u |>.mp h_u      have := mem_one (u ++ v) |>.mp h      grind [append_eq_nil_iff]  · rintro ⟨⟨u, h_u, v, h_v, rfl⟩, h_x⟩    rcases eq_or_ne u [] with (rfl | h_u')    · use v, (mem_sub l 1 v |>.mpr) ⟨h_v, Not.intro h_x⟩, []      grind [mem_sub, mem_one]    · use u, (mem_sub_one u).mpr ⟨h_u, h_u'⟩, v
See it in the graphDiscuss this resultChallenge it