AFTD Auto-Formalizing Theoretical Domains

Cslib.MachineLearning.PACLearning.SetShatters.superset

theoremverifiedformalizationimported Lean

Shattering is monotone in the concept class: if C shatters W and C ⊆ C', then C' shatters W.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set in
variable {α : Type*} in
theorem Cslib.MachineLearning.PACLearning.SetShatters.superset {C C' : ConceptClass α Bool} {W : Set α}
    (hW : SetShatters C W) (hCC' : C ⊆ C') : SetShatters C' W
Formalizes
CSLib, `Cslib.MachineLearning.PACLearning.SetShatters.superset`
Lean proof
By Samuel Schlesinger, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Samuel Schlesinger. 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
none — Lean reports it depends on no axioms
Built on 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Set invariable {α : Type*} in/-- Shattering is monotone in the concept class: if `C` shatters `W` and `C ⊆ C'`, then `C'` shatters `W`. -/theorem Cslib.MachineLearning.PACLearning.SetShatters.superset {C C' : ConceptClass α Bool} {W : Set α}    (hW : SetShatters C W) (hCC' : C ⊆ C') : SetShatters C' W := by  intro W' hW'  obtain ⟨c, hc, hcW⟩ := hW W' hW'  exact ⟨c, hCC' hc, hcW⟩
See it in the graphDiscuss this resultChallenge it