p. 28, proof of Theorem 1 — (1) has a C.D.R. provided T_m is not contained in the meet of all C.D.R.s of (4)
ProvedHallReps.CDR.cdr_of_not_subset_cdrMeetLet () be subsets of a set , and consider the shorter system
obtained by deleting the last set. Let be the meet of all the C.D.R.s of (4): the set of elements of occurring as representatives in every C.D.R. of (4). If is not contained in ,
then the full system has a C.D.R.
This is the first half of the induction step in Hall's proof of Theorem 1: an element is avoided by some C.D.R. of (4), and that C.D.R. together with represents the whole system.
Formalization Note. The paper's sets are T : Fin (m + 1) → Set α (so the Lean m + 1 is the paper's , and is built in); the system (4) is fun i : Fin m => T i.castSucc and is T (Fin.last m). The paper also has, at this point, a C.D.R. of (4) from the induction hypothesis; it is not assumed here because the hypothesis already implies it (if (4) had no C.D.R., would be all of ).
import Mathlib import Definitions.Def_HallReps_CDR_System
namespace HallReps.CDR
theorem cdr_of_not_subset_cdrMeet {α : Type*} {m : ℕ} (T : Fin (m + 1) → Set α)
(hT : ¬ T (Fin.last m) ⊆ cdrMeet (fun i : Fin m => T i.castSucc)) :
∃ a : Fin (m + 1) → α, IsCDR T a := by sorry
end HallReps.CDR
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.