`BoolOp`

definition

show as: view math explainer →

module: IndisputableMonolith.Mathematics.BooleanAlgebraFromRS
domain: Mathematics
line: 28 · github
papers citing: none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Mathematics.BooleanAlgebraFromRS on GitHub at line 28.

browse module

All declarations in this module, on Recognition.

explainer page

Tracked in the explainer inventory; generation is lazy so crawlers do not trigger LLM jobs.

open explainer

used by

formal source

  25
  26namespace IndisputableMonolith.Mathematics.BooleanAlgebraFromRS
  27
  28inductive BoolOp where
  29  | AND | OR | NOT | NAND | NOR
  30  deriving DecidableEq, Repr, BEq, Fintype
  31
  32theorem boolOpCount : Fintype.card BoolOp = 5 := by decide
  33
  34def atomCount : ℕ := 2 ^ 3
  35theorem atomCount_eq_8 : atomCount = 8 := by decide
  36theorem atoms_eq_2cubeD : atomCount = 2 ^ 3 := rfl
  37
  38structure BooleanAlgebraCert where
  39  five_ops : Fintype.card BoolOp = 5
  40  eight_atoms : atomCount = 8
  41  atoms_2cubeD : atomCount = 2 ^ 3
  42
  43def booleanAlgebraCert : BooleanAlgebraCert where
  44  five_ops := boolOpCount
  45  eight_atoms := atomCount_eq_8
  46  atoms_2cubeD := atoms_eq_2cubeD
  47
  48end IndisputableMonolith.Mathematics.BooleanAlgebraFromRS

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.