AFTD Auto-Formalizing Theoretical Domains

op_1370_three_two_singletons_sharp

theoremverifiedoriginal

For every n at least three there are three nonempty uncomplemented mutually strongly incomparable families of subsets of an n-element set, the first two of which are singleton families, whose total size is exactly 2^(n-1)-1.

Statement

theorem op_1370_three_two_singletons_sharp (n : ℕ) (hn : 3 ≤ n) : ∃ 𝒜 : Fin 3 → Finset (Finset (Fin n)), (∀ i, (𝒜 i).Nonempty) ∧ (∀ i, is_uncomplemented (𝒜 i)) ∧ strongly_incomparable 𝒜 ∧ (𝒜 0).card = 1 ∧ (𝒜 1).card = 1 ∧ (∑ i, (𝒜 i).card) = 2 ^ (n - 1) - 1
Related work
arXiv:2611.12199, Proposition 4.2 and Conjecture 4.3; a sharp construction with two singleton families.
Verified
13 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • is_uncomplementedA family of subsets of a finite set is uncomplemented if no set and its complement both belong to the family.
  • strongly_incomparableAn indexed family of finset families 𝒜 : ι → Finset (Finset α) is strongly incomparable if for all i j : ι with i ≠ j, for all…

Read back from the Lean

For every natural number $n \ge 3$, there exists a triple of families of subsets of $\text{Fin } n$, denoted $\mathcal{A} : \text{Fin } 3 \to \text{Finset}(\text{Finset}(\text{Fin } n))$, such that: 1. For each $i \in \text{Fin } 3$, $\mathcal{A}(i)$ is nonempty; 2. For each $i \in \text{Fin } 3$, $\mathcal{A}(i)$ is uncomplemented (no set in $\mathcal{A}(i)$ has its complement in $\text{Fin } n$ also in $\mathcal{A}(i)$); 3. $\mathcal{A}$ is strongly incomparable (for all $i, j \in \text{Fin } 3$ with $i \ne j$, no set $A \in \mathcal{A}(i)$ is a subset of any set $B \in \mathcal{A}(j)$); 4. $|\mathcal{A}(0)| = 1$; 5. $|\mathcal{A}(1)| = 1$; 6. The sum of the cardinalities of all three families, $\sum_{i \in \text{Fin } 3} |\mathcal{A}(i)|$, is equal to $2^{n - 1} - 1$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

To construct the three families, we pick three distinct elements x, y, z in an n-element set (available since n ≥ 3) and let s be the set of the remaining n - 1 elements. We take the first two families to be the singletons 𝒜₀ = {{x, y}} and 𝒜₁ = {{x, z}}, and the third family 𝒜₂ to be all subsets of s except ∅, {y}, and {z}. Uncomplementedness and strong incomparability hold because every set in 𝒜₀ ∪ 𝒜₁ contains x while no set in 𝒜₂ contains x, and the three excluded sets in T prevent any member of 𝒜₂ from being contained in {x, y} or {x, z}. The total size is 1 + 1 + (2^(n-1) - 3) = 2^(n-1) - 1.

  1. Choose three distinct elements x, y, z in {0, ..., n-1}, set s = {0, ..., n-1} \ {x}, and define the candidate families 𝒜₀ = {{x, y}}, 𝒜₁ = {{x, z}}, and 𝒜₂ = 𝒫(s) \ {∅, {y}, {z}}.

    Since n ≥ 3, the indices 0, 1, and 2 define valid elements x, y, z of Fin n. We let s be the set of all elements other than x, let T = {∅, {y}, {z}}, and construct the triple of families 𝒜 = ![ {{x, y}}, {{x, z}}, 𝒫(s) \ T ] as our witness for the existential goal.

    lines 2–8

      let x : Fin n := ⟨0, by omega⟩
      let y : Fin n := ⟨1, by omega⟩
      let z : Fin n := ⟨2, by omega⟩
      let s : Finset (Fin n) := Finset.univ.erase x
      let T : Finset (Finset (Fin n)) := {∅, {y}, {z}}
      let 𝒜 : Fin 3 → Finset (Finset (Fin n)) := ![ { {x, y} }, { {x, z} }, s.powerset \ T ]
      use 𝒜
  2. The chosen elements x, y, and z are pairwise distinct: x ≠ y, x ≠ z, and y ≠ z.

    By definition, x, y, and z have underlying values 0, 1, and 2 respectively, so equality between any two would equate distinct natural numbers, an immediate contradiction.

    lines 9–11

      have hx_ne_y : x ≠ y := by dsimp [x, y]; intro h; cases h
      have hx_ne_z : x ≠ z := by dsimp [x, z]; intro h; cases h
      have hy_ne_z : y ≠ z := by dsimp [y, z]; intro h; cases h
  3. The excluded family T is a 3-element subset of 𝒫(s), and |𝒜₂| = 2^(n-1) - 3.

    Each element of T = {∅, {y}, {z}} is a subset of s because neither y nor z equals x, so T ⊆ 𝒫(s). Since ∅, {y}, and {z} are pairwise distinct, |T| = 3. Because s is obtained by erasing one element from an n-element universe, |s| = n - 1 and |𝒫(s)| = 2^(n-1). Subtracting the 3 elements of T gives |𝒫(s) \ T| = 2^(n-1) - 3.

    lines 12–25

    uses Finset.mem_insert, Finset.mem_singleton, Finset.mem_powerset, Finset.subset_iff, Finset.card_insert_of_notMem, Finset.card_singleton, Finset.card_sdiff_of_subset, Finset.card_powerset, Finset.card_erase_of_mem, Finset.mem_univ, Finset.card_univ, Fintype.card_fin

      have hT_sub : T ⊆ s.powerset := by
        intro A hA
        simp only [T, Finset.mem_insert, Finset.mem_singleton] at hA
        rcases hA with rfl | rfl | rfl
        · simp [s]
        · simp [s, Finset.mem_powerset, Finset.subset_iff, hx_ne_y.symm]
        · simp [s, Finset.mem_powerset, Finset.subset_iff, hx_ne_z.symm]
      have hT_card : T.card = 3 := by
        dsimp [T]
        have h1 : (∅ : Finset (Fin n)) ∉ ({ {y}, {z} } : Finset (Finset (Fin n))) := by simp
        have h2 : ({y} : Finset (Fin n)) ∉ ({ {z} } : Finset (Finset (Fin n))) := by simp [hy_ne_z]
        rw [Finset.card_insert_of_notMem h1, Finset.card_insert_of_notMem h2, Finset.card_singleton]
      have hA2_card : (s.powerset \ T).card = 2 ^ (n - 1) - 3 := by
        rw [Finset.card_sdiff_of_subset hT_sub, Finset.card_powerset, Finset.card_erase_of_mem (Finset.mem_univ x), Finset.card_univ, Fintype.card_fin, hT_card]
  4. 4 ≤ 2^(n-1).

    Since n ≥ 3, we have 2 ≤ n - 1. By monotonicity of powers of 2, 4 = 2^2 ≤ 2^(n-1).

    lines 26–29

    uses Nat.pow_le_pow_right

      have hpow : 4 ≤ 2 ^ (n - 1) := by
        have : 2 ≤ n - 1 := by omega
        calc 4 = 2 ^ 2 := by rfl
        _ ≤ 2 ^ (n - 1) := Nat.pow_le_pow_right (by omega) this
  5. It suffices to verify the six required properties: that each 𝒜_i is nonempty, each is uncomplemented, the collection is strongly incomparable, |𝒜₀| = 1, |𝒜₁| = 1, and the sum of sizes is 2^(n-1) - 1.

    We decompose the conjunction into six subgoals, one for each required condition on the family 𝒜.

    line 30

      refine ⟨?_, ?_, ?_, ?_, ?_, ?_⟩
  6. Each family 𝒜_i is nonempty.

    For i = 0 and i = 1, 𝒜_i is a singleton set, which is always nonempty. For i = 2, its size is 2^(n-1) - 3; since 2^(n-1) ≥ 4, this size is at least 1 > 0, so 𝒜₂ is nonempty.

    lines 31–35

    uses Finset.singleton_nonempty, Finset.card_pos.mp

      · intro i
        fin_cases i
        · dsimp [𝒜]; exact Finset.singleton_nonempty _
        · dsimp [𝒜]; exact Finset.singleton_nonempty _
        · dsimp [𝒜]; apply Finset.card_pos.mp; rw [hA2_card]; omega
  7. Each family 𝒜_i is uncomplemented: no set in 𝒜_i has its complement in 𝒜_i.

    We check each family. For 𝒜₀ = {{x, y}}, if {x, y}ᶜ were in 𝒜₀, it would equal {x, y}, implying x ∈ {x, y}ᶜ, which contradicts x ∈ {x, y}. The same argument shows 𝒜₁ = {{x, z}} is uncomplemented. For 𝒜₂, every member A satisfies A ⊆ s, meaning x ∉ A and hence x ∈ Aᶜ. If Aᶜ were also in 𝒜₂, we would have Aᶜ ⊆ s, forcing x ∉ Aᶜ, a contradiction.

    lines 36–75

    uses Finset.mem_singleton, Finset.mem_sdiff, Finset.mem_powerset

      · intro i
        fin_cases i
        · intro A hA
          dsimp [𝒜] at hA
          simp only [Finset.mem_singleton] at hA
          subst hA
          intro hAc
          dsimp [𝒜] at hAc
          simp only [Finset.mem_singleton] at hAc
          have hx : x ∈ ({x, y} : Finset (Fin n)) := by simp
          have hx' : x ∉ ({x, y} : Finset (Fin n))ᶜ := by simp
          rw [hAc] at hx'
          exact hx' hx
        · intro A hA
          dsimp [𝒜] at hA
          simp only [Finset.mem_singleton] at hA
          subst hA
          intro hAc
          dsimp [𝒜] at hAc
          simp only [Finset.mem_singleton] at hAc
          have hx : x ∈ ({x, z} : Finset (Fin n)) := by simp
          have hx' : x ∉ ({x, z} : Finset (Fin n))ᶜ := by simp
          rw [hAc] at hx'
          exact hx' hx
        · intro A hA
          dsimp [𝒜] at hA
          simp only [Finset.mem_sdiff, Finset.mem_powerset] at hA
          intro hAc
          dsimp [𝒜] at hAc
          simp only [Finset.mem_sdiff, Finset.mem_powerset] at hAc
          have hxA : x ∉ A := by
            intro h
            have := hA.1 h
            simp [s] at this
          have hxAc : x ∈ Aᶜ := by simp [hxA]
          have hx_not : x ∉ Aᶜ := by
            intro h
            have := hAc.1 h
            simp [s] at this
          exact hx_not hxAc
  8. The families 𝒜₀, 𝒜₁, 𝒜₂ are strongly incomparable: for all i ≠ j, no A ∈ 𝒜_i is a subset of any B ∈ 𝒜_j.

    We inspect all pairs of distinct families: - Between 𝒜₀ and 𝒜₁: {x, y} ⊆ {x, z} would force y ∈ {x, z}, contradicting y ≠ x and y ≠ z; symmetrically {x, z} ⊆ {x, y} fails since z ∉ {x, y}. - From 𝒜₀ or 𝒜₁ to 𝒜₂: if {x, y} ⊆ B (or {x, z} ⊆ B) with B ∈ 𝒜₂, then x ∈ B ⊆ s, contradicting x ∉ s. - From 𝒜₂ to 𝒜₀ or 𝒜₁: if A ∈ 𝒜₂ and A ⊆ {x, y}, then since x ∉ A, every element of A must be y, so A ⊆ {y}. Thus A is either ∅ or {y}. But both sets were explicitly removed in T, so A ∉ 𝒜₂, a contradiction. The case A ⊆ {x, z} similarly forces A ∈ {∅, {z}} ⊆ T, again a contradiction.

    lines 76–142

    uses Finset.mem_singleton, Finset.mem_sdiff, Finset.mem_powerset, Finset.mem_insert, Finset.subset_singleton_iff.mp

      · intro i j hij
        fin_cases i <;> fin_cases j
        · intro A hA B hB hsub; exact (hij rfl).elim
        · intro A hA B hB hsub
          dsimp [𝒜] at hA hB
          simp only [Finset.mem_singleton] at hA hB
          subst hA hB
          have : y ∈ ({x, z} : Finset (Fin n)) := hsub (by simp)
          simp [hx_ne_y.symm, hy_ne_z] at this
        · intro A hA B hB hsub
          dsimp [𝒜] at hA hB
          simp only [Finset.mem_singleton] at hA
          simp only [Finset.mem_sdiff, Finset.mem_powerset] at hB
          subst hA
          have hx_in_A : x ∈ ({x, y} : Finset (Fin n)) := by simp
          have hx_in_B : x ∈ B := hsub hx_in_A
          have hx_in_s : x ∈ s := hB.1 hx_in_B
          simp [s] at hx_in_s
        · intro A hA B hB hsub
          dsimp [𝒜] at hA hB
          simp only [Finset.mem_singleton] at hA hB
          subst hA hB
          have hz : z ∈ ({x, y} : Finset (Fin n)) := hsub (by simp)
          simp [hx_ne_z.symm, hy_ne_z.symm] at hz
        · intro A hA B hB hsub; exact (hij rfl).elim
        · intro A hA B hB hsub
          dsimp [𝒜] at hA hB
          simp only [Finset.mem_singleton] at hA
          simp only [Finset.mem_sdiff, Finset.mem_powerset] at hB
          subst hA
          have hx_in_A : x ∈ ({x, z} : Finset (Fin n)) := by simp
          have hx_in_B : x ∈ B := hsub hx_in_A
          have hx_in_s : x ∈ s := hB.1 hx_in_B
          simp [s] at hx_in_s
        · intro A hA B hB hsub
          dsimp [𝒜] at hA hB
          simp only [Finset.mem_sdiff, Finset.mem_powerset] at hA
          simp only [Finset.mem_singleton] at hB
          subst hB
          have hA_sub_y : A ⊆ {y} := by
            intro u hu
            have hu_xy := hsub hu
            simp only [Finset.mem_insert, Finset.mem_singleton] at hu_xy
            rcases hu_xy with rfl | rfl
            · have : x ∈ s := hA.1 hu
              simp [s] at this
            · simp
          rcases Finset.subset_singleton_iff.mp hA_sub_y with rfl | rfl
          · exact hA.2 (by simp [T])
          · exact hA.2 (by simp [T])
        · intro A hA B hB hsub
          dsimp [𝒜] at hA hB
          simp only [Finset.mem_sdiff, Finset.mem_powerset] at hA
          simp only [Finset.mem_singleton] at hB
          subst hB
          have hA_sub_z : A ⊆ {z} := by
            intro u hu
            have hu_xz := hsub hu
            simp only [Finset.mem_insert, Finset.mem_singleton] at hu_xz
            rcases hu_xz with rfl | rfl
            · have : x ∈ s := hA.1 hu
              simp [s] at this
            · simp
          rcases Finset.subset_singleton_iff.mp hA_sub_z with rfl | rfl
          · exact hA.2 (by simp [T])
          · exact hA.2 (by simp [T])
        · intro A hA B hB hsub; exact (hij rfl).elim
  9. |𝒜₀| = 1 and |𝒜₁| = 1.

    Both 𝒜₀ = {{x, y}} and 𝒜₁ = {{x, z}} are singleton families by construction, so their cardinalities are 1.

    lines 143–144

    uses Finset.card_singleton

      · dsimp [𝒜]; exact Finset.card_singleton _
      · dsimp [𝒜]; exact Finset.card_singleton _
  10. The total size of the three families is 2^(n-1) - 1.

    Expanding the sum over Fin 3 gives |𝒜₀| + |𝒜₁| + |𝒜₂| = 1 + 1 + (2^(n-1) - 3). Since 2^(n-1) ≥ 4, linear integer arithmetic simplifies this to 2^(n-1) - 1.

    lines 145–150

    uses Fin.sum_univ_three, Finset.card_singleton

      · rw [Fin.sum_univ_three]
        have h0 : (𝒜 0).card = 1 := by dsimp [𝒜]; exact Finset.card_singleton _
        have h1 : (𝒜 1).card = 1 := by dsimp [𝒜]; exact Finset.card_singleton _
        have h2 : (𝒜 2).card = 2 ^ (n - 1) - 3 := by dsimp [𝒜]; exact hA2_card
        rw [h0, h1, h2]
        omega
Fin.sum_univ_three
The sum of a function over `Fin 3` is the sum of its values at 0, 1, and 2.
Fintype.card_fin
The cardinality of `Fin n` is n.
Finset.card_erase_of_mem
Removing an element belonging to a finite set reduces its cardinality by 1.
Finset.card_insert_of_notMem
Inserting an element into a finite set that does not already contain it increases its cardinality by 1.
Finset.card_pos.mp
A finite set with strictly positive cardinality is nonempty.
Finset.card_powerset
The power set of a finite set s has cardinality 2^|s|.
Finset.card_sdiff_of_subset
If s ⊆ t, the cardinality of the difference t \ s is |t| - |s|.
Finset.card_singleton
The cardinality of a singleton set is 1.
Finset.card_univ
The universal finite set of a finite type has cardinality equal to the type's cardinality.
Finset.mem_insert
An element belongs to the insertion of b into s if and only if it equals b or belongs to s.
Finset.mem_powerset
A set belongs to the power set of t if and only if it is a subset of t.
Finset.mem_sdiff
An element belongs to s \ t if and only if it belongs to s and does not belong to t.
Finset.mem_singleton
An element belongs to {a} if and only if it equals a.
Finset.mem_univ
Every element of a finite type belongs to its universal finite set univ.
Finset.singleton_nonempty
Every singleton finite set is nonempty.
Finset.subset_iff
A set s₁ is a subset of s₂ if and only if every element of s₁ is in s₂.
Finset.subset_singleton_iff.mp
A subset of a singleton set {a} is either empty or equal to {a}.
Nat.pow_le_pow_right
For any positive base, exponentiation is monotonically increasing with respect to the exponent.

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

theorem op_1370_three_two_singletons_sharp (n : ℕ) (hn : 3 ≤ n) : ∃ 𝒜 : Fin 3 → Finset (Finset (Fin n)), (∀ i, (𝒜 i).Nonempty) ∧ (∀ i, is_uncomplemented (𝒜 i)) ∧ strongly_incomparable 𝒜 ∧ (𝒜 0).card = 1 ∧ (𝒜 1).card = 1 ∧ (∑ i, (𝒜 i).card) = 2 ^ (n - 1) - 1 := by  let x : Fin n := ⟨0, by omega⟩  let y : Fin n := ⟨1, by omega⟩  let z : Fin n := ⟨2, by omega⟩  let s : Finset (Fin n) := Finset.univ.erase x  let T : Finset (Finset (Fin n)) := {∅, {y}, {z}}  let 𝒜 : Fin 3 → Finset (Finset (Fin n)) := ![ { {x, y} }, { {x, z} }, s.powerset \ T ]  use 𝒜  have hx_ne_y : x ≠ y := by dsimp [x, y]; intro h; cases h  have hx_ne_z : x ≠ z := by dsimp [x, z]; intro h; cases h  have hy_ne_z : y ≠ z := by dsimp [y, z]; intro h; cases h  have hT_sub : T ⊆ s.powerset := by    intro A hA    simp only [T, Finset.mem_insert, Finset.mem_singleton] at hA    rcases hA with rfl | rfl | rfl    · simp [s]    · simp [s, Finset.mem_powerset, Finset.subset_iff, hx_ne_y.symm]    · simp [s, Finset.mem_powerset, Finset.subset_iff, hx_ne_z.symm]  have hT_card : T.card = 3 := by    dsimp [T]    have h1 : (∅ : Finset (Fin n)) ∉ ({ {y}, {z} } : Finset (Finset (Fin n))) := by simp    have h2 : ({y} : Finset (Fin n)) ∉ ({ {z} } : Finset (Finset (Fin n))) := by simp [hy_ne_z]    rw [Finset.card_insert_of_notMem h1, Finset.card_insert_of_notMem h2, Finset.card_singleton]  have hA2_card : (s.powerset \ T).card = 2 ^ (n - 1) - 3 := by    rw [Finset.card_sdiff_of_subset hT_sub, Finset.card_powerset, Finset.card_erase_of_mem (Finset.mem_univ x), Finset.card_univ, Fintype.card_fin, hT_card]  have hpow : 4 ≤ 2 ^ (n - 1) := by    have : 2 ≤ n - 1 := by omega    calc 4 = 2 ^ 2 := by rfl    _ ≤ 2 ^ (n - 1) := Nat.pow_le_pow_right (by omega) this  refine ⟨?_, ?_, ?_, ?_, ?_, ?_⟩  · intro i    fin_cases i    · dsimp [𝒜]; exact Finset.singleton_nonempty _    · dsimp [𝒜]; exact Finset.singleton_nonempty _    · dsimp [𝒜]; apply Finset.card_pos.mp; rw [hA2_card]; omega  · intro i    fin_cases i    · intro A hA      dsimp [𝒜] at hA      simp only [Finset.mem_singleton] at hA      subst hA      intro hAc      dsimp [𝒜] at hAc      simp only [Finset.mem_singleton] at hAc      have hx : x ∈ ({x, y} : Finset (Fin n)) := by simp      have hx' : x ∉ ({x, y} : Finset (Fin n))ᶜ := by simp      rw [hAc] at hx'      exact hx' hx    · intro A hA      dsimp [𝒜] at hA      simp only [Finset.mem_singleton] at hA      subst hA      intro hAc      dsimp [𝒜] at hAc      simp only [Finset.mem_singleton] at hAc      have hx : x ∈ ({x, z} : Finset (Fin n)) := by simp      have hx' : x ∉ ({x, z} : Finset (Fin n))ᶜ := by simp      rw [hAc] at hx'      exact hx' hx    · intro A hA      dsimp [𝒜] at hA      simp only [Finset.mem_sdiff, Finset.mem_powerset] at hA      intro hAc      dsimp [𝒜] at hAc      simp only [Finset.mem_sdiff, Finset.mem_powerset] at hAc      have hxA : x ∉ A := by        intro h        have := hA.1 h        simp [s] at this      have hxAc : x ∈ Aᶜ := by simp [hxA]      have hx_not : x ∉ Aᶜ := by        intro h        have := hAc.1 h        simp [s] at this      exact hx_not hxAc  · intro i j hij    fin_cases i <;> fin_cases j    · intro A hA B hB hsub; exact (hij rfl).elim    · intro A hA B hB hsub      dsimp [𝒜] at hA hB      simp only [Finset.mem_singleton] at hA hB      subst hA hB      have : y ∈ ({x, z} : Finset (Fin n)) := hsub (by simp)      simp [hx_ne_y.symm, hy_ne_z] at this    · intro A hA B hB hsub      dsimp [𝒜] at hA hB      simp only [Finset.mem_singleton] at hA      simp only [Finset.mem_sdiff, Finset.mem_powerset] at hB      subst hA      have hx_in_A : x ∈ ({x, y} : Finset (Fin n)) := by simp      have hx_in_B : x ∈ B := hsub hx_in_A      have hx_in_s : x ∈ s := hB.1 hx_in_B      simp [s] at hx_in_s    · intro A hA B hB hsub      dsimp [𝒜] at hA hB      simp only [Finset.mem_singleton] at hA hB      subst hA hB      have hz : z ∈ ({x, y} : Finset (Fin n)) := hsub (by simp)      simp [hx_ne_z.symm, hy_ne_z.symm] at hz    · intro A hA B hB hsub; exact (hij rfl).elim    · intro A hA B hB hsub      dsimp [𝒜] at hA hB      simp only [Finset.mem_singleton] at hA      simp only [Finset.mem_sdiff, Finset.mem_powerset] at hB      subst hA      have hx_in_A : x ∈ ({x, z} : Finset (Fin n)) := by simp      have hx_in_B : x ∈ B := hsub hx_in_A      have hx_in_s : x ∈ s := hB.1 hx_in_B      simp [s] at hx_in_s    · intro A hA B hB hsub      dsimp [𝒜] at hA hB      simp only [Finset.mem_sdiff, Finset.mem_powerset] at hA      simp only [Finset.mem_singleton] at hB      subst hB      have hA_sub_y : A ⊆ {y} := by        intro u hu        have hu_xy := hsub hu        simp only [Finset.mem_insert, Finset.mem_singleton] at hu_xy        rcases hu_xy with rfl | rfl        · have : x ∈ s := hA.1 hu          simp [s] at this        · simp      rcases Finset.subset_singleton_iff.mp hA_sub_y with rfl | rfl      · exact hA.2 (by simp [T])      · exact hA.2 (by simp [T])    · intro A hA B hB hsub      dsimp [𝒜] at hA hB      simp only [Finset.mem_sdiff, Finset.mem_powerset] at hA      simp only [Finset.mem_singleton] at hB      subst hB      have hA_sub_z : A ⊆ {z} := by        intro u hu        have hu_xz := hsub hu        simp only [Finset.mem_insert, Finset.mem_singleton] at hu_xz        rcases hu_xz with rfl | rfl        · have : x ∈ s := hA.1 hu          simp [s] at this        · simp      rcases Finset.subset_singleton_iff.mp hA_sub_z with rfl | rfl      · exact hA.2 (by simp [T])      · exact hA.2 (by simp [T])    · intro A hA B hB hsub; exact (hij rfl).elim  · dsimp [𝒜]; exact Finset.card_singleton _  · dsimp [𝒜]; exact Finset.card_singleton _  · rw [Fin.sum_univ_three]    have h0 : (𝒜 0).card = 1 := by dsimp [𝒜]; exact Finset.card_singleton _    have h1 : (𝒜 1).card = 1 := by dsimp [𝒜]; exact Finset.card_singleton _    have h2 : (𝒜 2).card = 2 ^ (n - 1) - 3 := by dsimp [𝒜]; exact hA2_card    rw [h0, h1, h2]    omega
See it in the graphDiscuss this resultChallenge it