AFTD Auto-Formalizing Theoretical Domains

op1370_three_point_paired_singleton_equality

theoremverified

There are two nonempty uncomplemented strongly incomparable families on three coordinates, one a singleton with its complement in the other family, whose total size is four.

Statement

theorem op1370_three_point_paired_singleton_equality :
    βˆƒ π’œ : Fin 2 β†’ Finset (Finset (Fin 3)),
      (βˆ€ i, (π’œ i).Nonempty) ∧ (βˆ€ i, is_uncomplemented (π’œ i)) ∧
      strongly_incomparable π’œ ∧ (π’œ 0).card = 1 ∧
      (βˆƒ S ∈ π’œ 0, Sᢜ ∈ π’œ 1) ∧ (βˆ‘ i, (π’œ i).card) = 2 ^ (3-1)
Source
A finite two-family equality configuration for OP-1370, experiment 28768.
Verified
16 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…

Lean source view module on GitHub

theorem op1370_three_point_paired_singleton_equality :
    βˆƒ π’œ : Fin 2 β†’ Finset (Finset (Fin 3)),
      (βˆ€ i, (π’œ i).Nonempty) ∧ (βˆ€ i, is_uncomplemented (π’œ i)) ∧
      strongly_incomparable π’œ ∧ (π’œ 0).card = 1 ∧
      (βˆƒ S ∈ π’œ 0, Sᢜ ∈ π’œ 1) ∧ (βˆ‘ i, (π’œ i).card) = 2 ^ (3-1) := by
  open Finset in
  let F : Fin 2 β†’ Finset (Finset (Fin 3)) := ![{{0,1}}, {{2}, {0,2}, {1,2}}]
  refine ⟨F, ?_, ?_, ?_, ?_, ?_, ?_⟩
  Β· decide +kernel
  Β· unfold is_uncomplemented
    decide +kernel
  Β· unfold strongly_incomparable
    decide +kernel
  Β· decide +kernel
  Β· decide +kernel
  Β· decide +kernel
See it in the graphDiscuss this resultChallenge it