AFTD Auto-Formalizing Theoretical Domains

Cslib.MachineLearning.PACLearning.versionSpaces_ncard_le

theoremverifiedformalizationimported Lean

A finite concept class has at most 2 ^ C.ncard version spaces: the lattice embeds in the powerset.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set in
variable {α : Type*} {β : Type*} in
theorem Cslib.MachineLearning.PACLearning.versionSpaces_ncard_le {C : ConceptClass α β} (hC : C.Finite) :
    (VersionSpaces C).ncard ≤ 2 ^ C.ncard
Formalizes
CSLib, `Cslib.MachineLearning.PACLearning.versionSpaces_ncard_le`
Lean proof
By Dhruv Gupta, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Dhruv Gupta. 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 3

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set in
variable {α : Type*} {β : Type*} in
/-- A finite concept class has at most `2 ^ C.ncard` version spaces: the lattice embeds in the powerset. -/
theorem Cslib.MachineLearning.PACLearning.versionSpaces_ncard_le {C : ConceptClass α β} (hC : C.Finite) :
    (VersionSpaces C).ncard ≤ 2 ^ C.ncard :=
  (ncard_le_ncard (versionSpaces_subset_powerset C) hC.finite_subsets).trans_eq
    (ncard_powerset C hC)
See it in the graphDiscuss this resultChallenge it