Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

covered4 360 — Boolean sensitivity certificate

Proved
Sensitivity213981Formal.ThreeBoundEndpoint22Reachable.covered4_360

by yousofy · Oct 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

boolean-functionssensitivitysensitivity-213981-formal

The following universally quantified assertion holds for the finite sets, Boolean families, tournament data, and profile coordinates defined in the imported interfaces. Each binder specifies the domain of its variable, and bracketed conditions specify finite or ordered structures.

RelaxedReachable.Covers⁡(Endpoint22Packed.tree⁡,List.take⁡(40,List.drop⁡(360,Endpoint22Types.types4⁡)))\operatorname{RelaxedReachable.Covers}\bigl(\operatorname{Endpoint22Packed.tree}, \operatorname{List.take}\bigl(40, \operatorname{List.drop}\bigl(360, \operatorname{Endpoint22Types.types4}\bigr)\bigr)\bigr)RelaxedReachable.Covers(Endpoint22Packed.tree,List.take(40,List.drop(360,Endpoint22Types.types4)))

Here B={false,true}\mathbb B=\{\mathsf{false},\mathsf{true}\}B={false,true}; Pfin(X)\mathcal P_{\mathrm{fin}}(X)Pfin​(X) denotes the finite subsets of XXX. Named functions and predicates refer to their definitions in the cited source. This result supplies the corresponding covered4 360 step in the verified 222222-level sensitivity construction.

Preamble
import Definitions.Def_Sensitivity213981Formal_Endpoint22ReachChecks000
import Definitions.Def_Sensitivity213981Formal_Endpoint22ReachChecks001
import Definitions.Def_Sensitivity213981Formal_Endpoint22ReachChecks002
import Definitions.Def_Sensitivity213981Formal_Endpoint22ReachChecks003
import Definitions.Def_Sensitivity213981Formal_Endpoint22ReachChecks004
import Definitions.Def_Sensitivity213981Formal_Endpoint22ReachChecks005
import Definitions.Def_Sensitivity213981Formal_Endpoint22TypeData
import Definitions.Def_Sensitivity213981Formal_Namespaces
import Definitions.Def_Sensitivity213981Formal_NamespacesComplete
import Definitions.Def_Sensitivity213981Formal_RelaxedReachableSearch
import Definitions.Def_Sensitivity213981Formal_RelaxedRecordCoverage
import Definitions.Def_SensitivityCampaign
import Definitions.Def_SensitivitySeparation
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Fin
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.Algebra.Order.Ring.Nat
import Mathlib.Combinatorics.Hall.Finite
import Mathlib.Data.Finset.Card
import Mathlib.Data.Finset.Lattice.Fold
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Finset.Sort
import Mathlib.Data.Finset.Union
import Mathlib.Data.Fintype.Basic
import Mathlib.Data.Fintype.EquivFin
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Fintype.Powerset
import Mathlib.Data.Fintype.Prod
import Mathlib.Data.List.FinRange
import Mathlib.Data.List.Sort
import Mathlib.Data.List.TakeDrop
import Mathlib.Data.Nat.Digits.Defs
import Mathlib.Data.Prod.Lex
import Mathlib.Tactic.FinCases
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Ring

set_option autoImplicit false
set_option maxHeartbeats 0
set_option maxRecDepth 200000
Formal statement
theorem Sensitivity213981Formal.ThreeBoundEndpoint22Reachable.covered4_360 :
Sensitivity213981Formal.ThreeBoundRelaxedReachable.Covers Sensitivity213981Formal.ThreeBoundEndpoint22Packed.tree
  (@List.take.{0} (List.{0} Sensitivity213981Formal.ThreeBoundQ3.Kind)
    (@OfNat.ofNat.{0} Nat (nat_lit 40) (instOfNatNat (nat_lit 40)))
    (@List.drop.{0} (List.{0} Sensitivity213981Formal.ThreeBoundQ3.Kind)
      (@OfNat.ofNat.{0} Nat (nat_lit 360) (instOfNatNat (nat_lit 360)))
      Sensitivity213981Formal.ThreeBoundEndpoint22Types.types4)) := by sorry
Source
https://chatgpt.com/library?file_id=libfile_431310a5a24c81918d3f7bda6cf4262b&account_id=personal; verified archive SHA-256 15679de91204c2f0619380925cb21f560610f5a2467627ac5de8715f34ff3ddd; Endpoint22ReachTypes4.lean, lines 404–446.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me