AFTD Auto-Formalizing Theoretical Domains

digraph_nonneighborhood_kernel_no_second_layer_kernel_counterexample

theoremverified

The displayed source-free oriented twenty-vertex graph has an out-kernel in every non-neighborhood. Its only quasi-kernels are singletons in the cyclic seven-vertex core, and every such singleton has a kernel-free second out-neighborhood.

Statement

theorem digraph_nonneighborhood_kernel_no_second_layer_kernel_counterexample :
    (∀ v, v ∉ in541_join_out v) ∧
    (∀ u v, v ∈ in541_join_out u → u ∉ in541_join_out v) ∧
    (∀ v, ∃ u, v ∈ in541_join_out u) ∧
    (∀ v, ∃ K : Finset (Fin 20),
      (∀ x ∈ K, x ≠ v ∧ x ∉ in541_join_out v ∧ v ∉ in541_join_out x) ∧
      in541_join_independent K ∧
      (∀ x, x ≠ v → x ∉ in541_join_out v → v ∉ in541_join_out x →
        ∃ k ∈ K, k = x ∨ x ∈ in541_join_out k)) ∧
    (∀ v ∈ in541_join_core, in541_join_qk {v}) ∧
    (∀ Q : Finset (Fin 20), in541_join_qk Q → ∃ v ∈ in541_join_core, Q = {v}) ∧
    (∀ v ∈ in541_join_core,
      let R := Finset.univ.filter (fun x => x ≠ v ∧ x ∉ in541_join_out v)
      ∀ K : Finset (Fin 20), K ⊆ R → in541_join_independent K →
        ¬ (∀ x ∈ R, ∃ k ∈ K, k = x ∨ x ∈ in541_join_out k))
Source
Explicit finite construction and component-by-component audit in experiment 14470; it is a computational counterexample candidate to the proposed universal second-layer-kernel shortcut and is not yet Lean-verified. The cyclic core is a classical graph, https://www.combinatorics.org/ojs/index.php/eljc/article/download/v13i1r69/pdf/.
Verified
05 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1

The proof, explained

The theorem constructs a 20-vertex oriented graph partitioned into a 7-vertex cyclic tournament core, an 8-vertex middle layer, and a 5-vertex sink layer. Exhaustive finite computation establishes that the graph is loopless, oriented, source-free, and that every vertex has an out-kernel in its non-neighborhood. Because the core induces a tournament completely dominating the rest of the graph, a general classification lemma shows that the only quasi-kernels are singletons {v} in the core; for each such vertex, its non-out-neighborhood induces a directed 3-cycle, which exhaustive check over all subsets shows is kernel-free.

  1. The property of being an independent set of vertices is decidable.

    Unfolding the definition of `in541_join_independent` expresses independence as a bounded universal quantifier over the finite set Q, which Lean synthesizes as decidable via typeclass inference.

    lines 24–26

    instance (Q : Finset (Fin 20)) : Decidable (in541_join_independent Q) := by
      unfold in541_join_independent
      infer_instance
  2. The property of being a quasi-kernel is decidable.

    Unfolding `in541_join_qk` expresses the quasi-kernel condition as independence together with the condition that every vertex is reached in at most two steps; both are finite bounded checks synthesized by typeclass inference.

    lines 28–30

    instance (Q : Finset (Fin 20)) : Decidable (in541_join_qk Q) := by
      unfold in541_join_qk
      infer_instance
  3. The graph is loopless, oriented (has no 2-cycles), and source-free (every vertex has in-degree at least 1). automation

    Classical logic is assumed, and the three basic properties—looplessness, orientation, and having no sources—are verified by finite exhaustive computation using `decide`.

    lines 47–50

      classical
      have hloop : ∀ v, v ∉ in541_join_out v := by decide
      have horient : ∀ u v, v ∈ in541_join_out u → u ∉ in541_join_out v := by decide
      have hsrc : ∀ v, ∃ u, v ∈ in541_join_out u := by decide
  4. Every vertex has an out-kernel in its non-neighborhood. automation

    We inspect each vertex v from 0 to 19 individually using `fin_cases`. For core vertices 0 through 6, the non-neighborhood is empty, so K = ∅ is trivially a kernel. For middle vertices 7 through 14, an explicit singleton (such as {12} for 7 or {7} for 8) is supplied. For the last five vertices 15 through 19, an explicit three-element set (such as {17, 18, 19}) is supplied. In every case, `decide` verifies that K is an independent dominating set of the non-neighborhood.

    lines 51–78

      have hlocal : ∀ v, ∃ K : Finset (Fin 20),
          (∀ x ∈ K, x ≠ v ∧ x ∉ in541_join_out v ∧ v ∉ in541_join_out x) ∧
          in541_join_independent K ∧
          (∀ x, x ≠ v → x ∉ in541_join_out v → v ∉ in541_join_out x →
            ∃ k ∈ K, k = x ∨ x ∈ in541_join_out k) := by
        intro v
        fin_cases v
        · refine ⟨∅, ?_⟩; decide
        · refine ⟨∅, ?_⟩; decide
        · refine ⟨∅, ?_⟩; decide
        · refine ⟨∅, ?_⟩; decide
        · refine ⟨∅, ?_⟩; decide
        · refine ⟨∅, ?_⟩; decide
        · refine ⟨∅, ?_⟩; decide
        · refine ⟨{12}, ?_⟩; decide
        · refine ⟨{7}, ?_⟩; decide
        · refine ⟨{11}, ?_⟩; decide
        · refine ⟨{7}, ?_⟩; decide
        · refine ⟨{13}, ?_⟩; decide
        · refine ⟨{7}, ?_⟩; decide
        · refine ⟨{11}, ?_⟩; decide
        · refine ⟨{13}, ?_⟩; decide
        · refine ⟨{17,18,19}, ?_⟩; decide
        · refine ⟨{17,18,19}, ?_⟩; decide
        · refine ⟨{15,18,19}, ?_⟩; decide
        · refine ⟨{15,17,19}, ?_⟩; decide
        · refine ⟨{15,17,18}, ?_⟩; decide
    
  5. For every vertex v in the 7-vertex core, the singleton {v} is a quasi-kernel. automation

    The finite decision procedure `decide` checks that each singleton {v} for v ∈ {0, ..., 6} is independent and reaches every vertex in the 20-vertex graph in at most two steps.

    line 79

      have hcoreq : ∀ v ∈ in541_join_core, in541_join_qk {v} := by decide
  6. The only quasi-kernels of the graph are the singletons {v} for core vertices v.

    We consider the edge relation as a digraph. The core is verified by `decide` to induce a tournament (`htour`) and to completely dominate all vertices outside the core with no backward edges (`hcross`). By `digraph_source_tournament_quasikernel_singleton`, any quasi-kernel must be a singleton contained in the core tournament.

    lines 80–85

    uses digraph_source_tournament_quasikernel_singleton

      have hclass : ∀ Q : Finset (Fin 20), in541_join_qk Q → ∃ v ∈ in541_join_core, Q = {v} := by
        intro Q hQ
        let D : Digraph (Fin 20) := ⟨fun u v => v ∈ in541_join_out u⟩
        have htour : ∀ u ∈ in541_join_core, ∀ v ∈ in541_join_core, u ≠ v → D.Adj u v ∨ D.Adj v u := by decide
        have hcross : ∀ u ∈ in541_join_core, ∀ v, v ∉ in541_join_core → D.Adj u v ∧ ¬ D.Adj v u := by decide
        exact digraph_source_tournament_quasikernel_singleton D in541_join_core Q (by decide) htour hcross hQ.1 hQ.2
  7. It remains only to show that no core vertex has a kernel in its non-out-neighborhood.

    We combine the six previously established properties into the main conjunction, leaving the seventh claim to be proved.

    line 86

      refine ⟨hloop, horient, hsrc, hlocal, hcoreq, hclass, ?_⟩
  8. To show that no core vertex has a kernel in its non-out-neighborhood, it suffices to check vertices 0 through 6 individually.

    We introduce a core vertex v. By definition of the core, v must be one of the seven elements 0, 1, 2, 3, 4, 5, or 6; we split into these seven cases.

    lines 87–90

      intro v hv
      have hv' : v = 0 ∨ v = 1 ∨ v = 2 ∨ v = 3 ∨ v = 4 ∨ v = 5 ∨ v = 6 := by
        simpa [in541_join_core] using hv
      rcases hv' with rfl | rfl | rfl | rfl | rfl | rfl | rfl
  9. For vertex 0, its non-out-neighborhood R = {3, 5, 6} has no kernel. automation

    The non-out-neighborhood of 0 is computed by `decide` to be {3, 5, 6}. Any candidate kernel K ⊆ R must be in its powerset (`Finset.mem_powerset.mpr`). Expanding the powerset into its 8 subsets via `Finset.mem_insert` and `Finset.mem_singleton`, `decide` verifies for each candidate that it either contains an edge or fails to dominate R.

    lines 91–100

    uses Finset.mem_powerset.mpr, Finset.mem_insert, Finset.mem_singleton

      · dsimp only
        intro K hK hI hD
        have hr : (Finset.univ.filter (fun x => x ≠ (0 : Fin 20) ∧ x ∉ in541_join_out 0)) = ({3,5,6} : Finset (Fin 20)) := by decide
        rw [hr] at hK hD
        have hm : K ∈ ({3,5,6} : Finset (Fin 20)).powerset := Finset.mem_powerset.mpr hK
        have hp : ({3,5,6} : Finset (Fin 20)).powerset = ({∅, {3}, {5}, {6}, {3,5}, {3,6}, {5,6}, {3,5,6}} : Finset (Finset (Fin 20))) := by decide
        rw [hp] at hm
        simp only [Finset.mem_insert, Finset.mem_singleton] at hm
        rcases hm with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl
        all_goals revert hI hD; decide
  10. For vertex 1, its non-out-neighborhood R = {0, 4, 6} has no kernel. automation

    The non-out-neighborhood of 1 is computed to be {0, 4, 6}. We enumerate all 8 subsets in its powerset (`Finset.mem_powerset.mpr`, `Finset.mem_insert`, `Finset.mem_singleton`), and `decide` verifies that none is an independent dominating set.

    lines 101–110

    uses Finset.mem_powerset.mpr, Finset.mem_insert, Finset.mem_singleton

      · dsimp only
        intro K hK hI hD
        have hr : (Finset.univ.filter (fun x => x ≠ (1 : Fin 20) ∧ x ∉ in541_join_out 1)) = ({0,4,6} : Finset (Fin 20)) := by decide
        rw [hr] at hK hD
        have hm : K ∈ ({0,4,6} : Finset (Fin 20)).powerset := Finset.mem_powerset.mpr hK
        have hp : ({0,4,6} : Finset (Fin 20)).powerset = ({∅, {0}, {4}, {6}, {0,4}, {0,6}, {4,6}, {0,4,6}} : Finset (Finset (Fin 20))) := by decide
        rw [hp] at hm
        simp only [Finset.mem_insert, Finset.mem_singleton] at hm
        rcases hm with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl
        all_goals revert hI hD; decide
  11. For vertex 2, its non-out-neighborhood R = {0, 1, 5} has no kernel. automation

    The non-out-neighborhood of 2 is computed to be {0, 1, 5}. We enumerate all 8 subsets in its powerset (`Finset.mem_powerset.mpr`, `Finset.mem_insert`, `Finset.mem_singleton`), and `decide` refutes each candidate.

    lines 111–120

    uses Finset.mem_powerset.mpr, Finset.mem_insert, Finset.mem_singleton

      · dsimp only
        intro K hK hI hD
        have hr : (Finset.univ.filter (fun x => x ≠ (2 : Fin 20) ∧ x ∉ in541_join_out 2)) = ({0,1,5} : Finset (Fin 20)) := by decide
        rw [hr] at hK hD
        have hm : K ∈ ({0,1,5} : Finset (Fin 20)).powerset := Finset.mem_powerset.mpr hK
        have hp : ({0,1,5} : Finset (Fin 20)).powerset = ({∅, {0}, {1}, {5}, {0,1}, {0,5}, {1,5}, {0,1,5}} : Finset (Finset (Fin 20))) := by decide
        rw [hp] at hm
        simp only [Finset.mem_insert, Finset.mem_singleton] at hm
        rcases hm with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl
        all_goals revert hI hD; decide
  12. For vertex 3, its non-out-neighborhood R = {1, 2, 6} has no kernel. automation

    The non-out-neighborhood of 3 is computed to be {1, 2, 6}. We enumerate all 8 subsets in its powerset (`Finset.mem_powerset.mpr`, `Finset.mem_insert`, `Finset.mem_singleton`), and `decide` refutes each candidate.

    lines 121–130

    uses Finset.mem_powerset.mpr, Finset.mem_insert, Finset.mem_singleton

      · dsimp only
        intro K hK hI hD
        have hr : (Finset.univ.filter (fun x => x ≠ (3 : Fin 20) ∧ x ∉ in541_join_out 3)) = ({1,2,6} : Finset (Fin 20)) := by decide
        rw [hr] at hK hD
        have hm : K ∈ ({1,2,6} : Finset (Fin 20)).powerset := Finset.mem_powerset.mpr hK
        have hp : ({1,2,6} : Finset (Fin 20)).powerset = ({∅, {1}, {2}, {6}, {1,2}, {1,6}, {2,6}, {1,2,6}} : Finset (Finset (Fin 20))) := by decide
        rw [hp] at hm
        simp only [Finset.mem_insert, Finset.mem_singleton] at hm
        rcases hm with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl
        all_goals revert hI hD; decide
  13. For vertex 4, its non-out-neighborhood R = {0, 2, 3} has no kernel. automation

    The non-out-neighborhood of 4 is computed to be {0, 2, 3}. We enumerate all 8 subsets in its powerset (`Finset.mem_powerset.mpr`, `Finset.mem_insert`, `Finset.mem_singleton`), and `decide` refutes each candidate.

    lines 131–140

    uses Finset.mem_powerset.mpr, Finset.mem_insert, Finset.mem_singleton

      · dsimp only
        intro K hK hI hD
        have hr : (Finset.univ.filter (fun x => x ≠ (4 : Fin 20) ∧ x ∉ in541_join_out 4)) = ({0,2,3} : Finset (Fin 20)) := by decide
        rw [hr] at hK hD
        have hm : K ∈ ({0,2,3} : Finset (Fin 20)).powerset := Finset.mem_powerset.mpr hK
        have hp : ({0,2,3} : Finset (Fin 20)).powerset = ({∅, {0}, {2}, {3}, {0,2}, {0,3}, {2,3}, {0,2,3}} : Finset (Finset (Fin 20))) := by decide
        rw [hp] at hm
        simp only [Finset.mem_insert, Finset.mem_singleton] at hm
        rcases hm with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl
        all_goals revert hI hD; decide
  14. For vertex 5, its non-out-neighborhood R = {1, 3, 4} has no kernel. automation

    The non-out-neighborhood of 5 is computed to be {1, 3, 4}. We enumerate all 8 subsets in its powerset (`Finset.mem_powerset.mpr`, `Finset.mem_insert`, `Finset.mem_singleton`), and `decide` refutes each candidate.

    lines 141–150

    uses Finset.mem_powerset.mpr, Finset.mem_insert, Finset.mem_singleton

      · dsimp only
        intro K hK hI hD
        have hr : (Finset.univ.filter (fun x => x ≠ (5 : Fin 20) ∧ x ∉ in541_join_out 5)) = ({1,3,4} : Finset (Fin 20)) := by decide
        rw [hr] at hK hD
        have hm : K ∈ ({1,3,4} : Finset (Fin 20)).powerset := Finset.mem_powerset.mpr hK
        have hp : ({1,3,4} : Finset (Fin 20)).powerset = ({∅, {1}, {3}, {4}, {1,3}, {1,4}, {3,4}, {1,3,4}} : Finset (Finset (Fin 20))) := by decide
        rw [hp] at hm
        simp only [Finset.mem_insert, Finset.mem_singleton] at hm
        rcases hm with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl
        all_goals revert hI hD; decide
  15. For vertex 6, its non-out-neighborhood R = {2, 4, 5} has no kernel. automation

    The non-out-neighborhood of 6 is computed to be {2, 4, 5}. We enumerate all 8 subsets in its powerset (`Finset.mem_powerset.mpr`, `Finset.mem_insert`, `Finset.mem_singleton`), and `decide` refutes each candidate.

    lines 151–160

    uses Finset.mem_powerset.mpr, Finset.mem_insert, Finset.mem_singleton

      · dsimp only
        intro K hK hI hD
        have hr : (Finset.univ.filter (fun x => x ≠ (6 : Fin 20) ∧ x ∉ in541_join_out 6)) = ({2,4,5} : Finset (Fin 20)) := by decide
        rw [hr] at hK hD
        have hm : K ∈ ({2,4,5} : Finset (Fin 20)).powerset := Finset.mem_powerset.mpr hK
        have hp : ({2,4,5} : Finset (Fin 20)).powerset = ({∅, {2}, {4}, {5}, {2,4}, {2,5}, {4,5}, {2,4,5}} : Finset (Finset (Fin 20))) := by decide
        rw [hp] at hm
        simp only [Finset.mem_insert, Finset.mem_singleton] at hm
        rcases hm with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl
        all_goals revert hI hD; decide
digraph_source_tournament_quasikernel_singleton
In a finite digraph, if a nonempty subset S induces a tournament and completely dominates its complement with no backward edges, then every quasi-kernel Q of the digraph must be a singleton {s} for some s in S.
Finset.mem_powerset.mpr
If a set s is a subset of t, then s belongs to the powerset of t.
Finset.mem_insert
An element a belongs to insert b s if and only if a = b or a belongs to s.
Finset.mem_singleton
An element b belongs to the singleton set {a} if and only if b = a.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

set_option maxRecDepth 50000set_option maxHeartbeats 50000000def in541_join_core : Finset (Fin 20) := {0,1,2,3,4,5,6}def in541_join_middle : Finset (Fin 20) := {7,8,9,10,11,12,13,14}def in541_join_last : Finset (Fin 20) := {15,16,17,18,19}def in541_join_middle_out (v : Fin 20) : Finset (Fin 20) :=  if v = 7 then {11,13} else if v = 8 then {9,10,11} else  if v = 9 then {7,12} else if v = 10 then {9,14} else  if v = 11 then {10,14} else if v = 12 then {8,10,11,13,14} else  if v = 13 then {8,9} else if v = 14 then {7,8} else ∅def in541_join_out (v : Fin 20) : Finset (Fin 20) :=  if v ∈ in541_join_core then    (in541_join_core.filter fun u => u ≠ v ∧ (u.val + 7 - v.val) % 7 ∈ ({1,2,4} : Finset ℕ)) ∪      (in541_join_middle ∪ in541_join_last)  else if v ∈ in541_join_middle then in541_join_middle_out v ∪ in541_join_last  else if v = 15 then {16} else ∅def in541_join_independent (Q : Finset (Fin 20)) : Prop :=  ∀ u ∈ Q, ∀ v ∈ Q, u ≠ v → v ∉ in541_join_out udef in541_join_qk (Q : Finset (Fin 20)) : Prop :=  in541_join_independent Q ∧ ∀ v, ∃ u ∈ Q, u = v ∨ v ∈ in541_join_out u ∨    ∃ z, z ∈ in541_join_out u ∧ v ∈ in541_join_out zinstance (Q : Finset (Fin 20)) : Decidable (in541_join_independent Q) := by  unfold in541_join_independent  infer_instanceinstance (Q : Finset (Fin 20)) : Decidable (in541_join_qk Q) := by  unfold in541_join_qk  infer_instancetheorem digraph_nonneighborhood_kernel_no_second_layer_kernel_counterexample :    (∀ v, v ∉ in541_join_out v) ∧    (∀ u v, v ∈ in541_join_out u → u ∉ in541_join_out v) ∧    (∀ v, ∃ u, v ∈ in541_join_out u) ∧    (∀ v, ∃ K : Finset (Fin 20),      (∀ x ∈ K, x ≠ v ∧ x ∉ in541_join_out v ∧ v ∉ in541_join_out x) ∧      in541_join_independent K ∧      (∀ x, x ≠ v → x ∉ in541_join_out v → v ∉ in541_join_out x →        ∃ k ∈ K, k = x ∨ x ∈ in541_join_out k)) ∧    (∀ v ∈ in541_join_core, in541_join_qk {v}) ∧    (∀ Q : Finset (Fin 20), in541_join_qk Q → ∃ v ∈ in541_join_core, Q = {v}) ∧    (∀ v ∈ in541_join_core,      let R := Finset.univ.filter (fun x => x ≠ v ∧ x ∉ in541_join_out v)      ∀ K : Finset (Fin 20), K ⊆ R → in541_join_independent K →        ¬ (∀ x ∈ R, ∃ k ∈ K, k = x ∨ x ∈ in541_join_out k)) := by  classical  have hloop : ∀ v, v ∉ in541_join_out v := by decide  have horient : ∀ u v, v ∈ in541_join_out u → u ∉ in541_join_out v := by decide  have hsrc : ∀ v, ∃ u, v ∈ in541_join_out u := by decide  have hlocal : ∀ v, ∃ K : Finset (Fin 20),      (∀ x ∈ K, x ≠ v ∧ x ∉ in541_join_out v ∧ v ∉ in541_join_out x) ∧      in541_join_independent K ∧      (∀ x, x ≠ v → x ∉ in541_join_out v → v ∉ in541_join_out x →        ∃ k ∈ K, k = x ∨ x ∈ in541_join_out k) := by    intro v    fin_cases v    · refine ⟨∅, ?_⟩; decide    · refine ⟨∅, ?_⟩; decide    · refine ⟨∅, ?_⟩; decide    · refine ⟨∅, ?_⟩; decide    · refine ⟨∅, ?_⟩; decide    · refine ⟨∅, ?_⟩; decide    · refine ⟨∅, ?_⟩; decide    · refine ⟨{12}, ?_⟩; decide    · refine ⟨{7}, ?_⟩; decide    · refine ⟨{11}, ?_⟩; decide    · refine ⟨{7}, ?_⟩; decide    · refine ⟨{13}, ?_⟩; decide    · refine ⟨{7}, ?_⟩; decide    · refine ⟨{11}, ?_⟩; decide    · refine ⟨{13}, ?_⟩; decide    · refine ⟨{17,18,19}, ?_⟩; decide    · refine ⟨{17,18,19}, ?_⟩; decide    · refine ⟨{15,18,19}, ?_⟩; decide    · refine ⟨{15,17,19}, ?_⟩; decide    · refine ⟨{15,17,18}, ?_⟩; decide  have hcoreq : ∀ v ∈ in541_join_core, in541_join_qk {v} := by decide  have hclass : ∀ Q : Finset (Fin 20), in541_join_qk Q → ∃ v ∈ in541_join_core, Q = {v} := by    intro Q hQ    let D : Digraph (Fin 20) := ⟨fun u v => v ∈ in541_join_out u⟩    have htour : ∀ u ∈ in541_join_core, ∀ v ∈ in541_join_core, u ≠ v → D.Adj u v ∨ D.Adj v u := by decide    have hcross : ∀ u ∈ in541_join_core, ∀ v, v ∉ in541_join_core → D.Adj u v ∧ ¬ D.Adj v u := by decide    exact digraph_source_tournament_quasikernel_singleton D in541_join_core Q (by decide) htour hcross hQ.1 hQ.2  refine ⟨hloop, horient, hsrc, hlocal, hcoreq, hclass, ?_⟩  intro v hv  have hv' : v = 0 ∨ v = 1 ∨ v = 2 ∨ v = 3 ∨ v = 4 ∨ v = 5 ∨ v = 6 := by    simpa [in541_join_core] using hv  rcases hv' with rfl | rfl | rfl | rfl | rfl | rfl | rfl  · dsimp only    intro K hK hI hD    have hr : (Finset.univ.filter (fun x => x ≠ (0 : Fin 20) ∧ x ∉ in541_join_out 0)) = ({3,5,6} : Finset (Fin 20)) := by decide    rw [hr] at hK hD    have hm : K ∈ ({3,5,6} : Finset (Fin 20)).powerset := Finset.mem_powerset.mpr hK    have hp : ({3,5,6} : Finset (Fin 20)).powerset = ({∅, {3}, {5}, {6}, {3,5}, {3,6}, {5,6}, {3,5,6}} : Finset (Finset (Fin 20))) := by decide    rw [hp] at hm    simp only [Finset.mem_insert, Finset.mem_singleton] at hm    rcases hm with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl    all_goals revert hI hD; decide  · dsimp only    intro K hK hI hD    have hr : (Finset.univ.filter (fun x => x ≠ (1 : Fin 20) ∧ x ∉ in541_join_out 1)) = ({0,4,6} : Finset (Fin 20)) := by decide    rw [hr] at hK hD    have hm : K ∈ ({0,4,6} : Finset (Fin 20)).powerset := Finset.mem_powerset.mpr hK    have hp : ({0,4,6} : Finset (Fin 20)).powerset = ({∅, {0}, {4}, {6}, {0,4}, {0,6}, {4,6}, {0,4,6}} : Finset (Finset (Fin 20))) := by decide    rw [hp] at hm    simp only [Finset.mem_insert, Finset.mem_singleton] at hm    rcases hm with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl    all_goals revert hI hD; decide  · dsimp only    intro K hK hI hD    have hr : (Finset.univ.filter (fun x => x ≠ (2 : Fin 20) ∧ x ∉ in541_join_out 2)) = ({0,1,5} : Finset (Fin 20)) := by decide    rw [hr] at hK hD    have hm : K ∈ ({0,1,5} : Finset (Fin 20)).powerset := Finset.mem_powerset.mpr hK    have hp : ({0,1,5} : Finset (Fin 20)).powerset = ({∅, {0}, {1}, {5}, {0,1}, {0,5}, {1,5}, {0,1,5}} : Finset (Finset (Fin 20))) := by decide    rw [hp] at hm    simp only [Finset.mem_insert, Finset.mem_singleton] at hm    rcases hm with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl    all_goals revert hI hD; decide  · dsimp only    intro K hK hI hD    have hr : (Finset.univ.filter (fun x => x ≠ (3 : Fin 20) ∧ x ∉ in541_join_out 3)) = ({1,2,6} : Finset (Fin 20)) := by decide    rw [hr] at hK hD    have hm : K ∈ ({1,2,6} : Finset (Fin 20)).powerset := Finset.mem_powerset.mpr hK    have hp : ({1,2,6} : Finset (Fin 20)).powerset = ({∅, {1}, {2}, {6}, {1,2}, {1,6}, {2,6}, {1,2,6}} : Finset (Finset (Fin 20))) := by decide    rw [hp] at hm    simp only [Finset.mem_insert, Finset.mem_singleton] at hm    rcases hm with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl    all_goals revert hI hD; decide  · dsimp only    intro K hK hI hD    have hr : (Finset.univ.filter (fun x => x ≠ (4 : Fin 20) ∧ x ∉ in541_join_out 4)) = ({0,2,3} : Finset (Fin 20)) := by decide    rw [hr] at hK hD    have hm : K ∈ ({0,2,3} : Finset (Fin 20)).powerset := Finset.mem_powerset.mpr hK    have hp : ({0,2,3} : Finset (Fin 20)).powerset = ({∅, {0}, {2}, {3}, {0,2}, {0,3}, {2,3}, {0,2,3}} : Finset (Finset (Fin 20))) := by decide    rw [hp] at hm    simp only [Finset.mem_insert, Finset.mem_singleton] at hm    rcases hm with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl    all_goals revert hI hD; decide  · dsimp only    intro K hK hI hD    have hr : (Finset.univ.filter (fun x => x ≠ (5 : Fin 20) ∧ x ∉ in541_join_out 5)) = ({1,3,4} : Finset (Fin 20)) := by decide    rw [hr] at hK hD    have hm : K ∈ ({1,3,4} : Finset (Fin 20)).powerset := Finset.mem_powerset.mpr hK    have hp : ({1,3,4} : Finset (Fin 20)).powerset = ({∅, {1}, {3}, {4}, {1,3}, {1,4}, {3,4}, {1,3,4}} : Finset (Finset (Fin 20))) := by decide    rw [hp] at hm    simp only [Finset.mem_insert, Finset.mem_singleton] at hm    rcases hm with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl    all_goals revert hI hD; decide  · dsimp only    intro K hK hI hD    have hr : (Finset.univ.filter (fun x => x ≠ (6 : Fin 20) ∧ x ∉ in541_join_out 6)) = ({2,4,5} : Finset (Fin 20)) := by decide    rw [hr] at hK hD    have hm : K ∈ ({2,4,5} : Finset (Fin 20)).powerset := Finset.mem_powerset.mpr hK    have hp : ({2,4,5} : Finset (Fin 20)).powerset = ({∅, {2}, {4}, {5}, {2,4}, {2,5}, {4,5}, {2,4,5}} : Finset (Finset (Fin 20))) := by decide    rw [hp] at hm    simp only [Finset.mem_insert, Finset.mem_singleton] at hm    rcases hm with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl    all_goals revert hI hD; decide
See it in the graphDiscuss this resultChallenge it