brualdi-ch3-27

open

difficulty 4

credited

Run this goal:./swarm/run.sh --goal brualdi-ch3-27

What it runs

The Lean statement the swarm must prove — kernel-verified at Gate A. The trailing sorry is the open obligation a proof replaces.

goals/brualdi-ch3-27.lean

import Mathlib

theorem brualdi_ch3_27 (n : ℕ) (hn : n ≥ 1)
    (subsets : Set (Set (Set.Icc 1 n)))
    (cond : ∀ S ∈ subsets, ∀ T ∈ subsets, (S ∩ T).Nonempty) :
    ∃ (m : ℕ), m ≤ 2 ^ (n - 1) ∧ Nonempty (Fin m ≃ subsets) := by
  sorry

Runs (0)

No runs recorded for this suite yet — they appear here as the swarm attempts the benchmarks.