A dogma of cardinality
ProvedDogma.exists_dogma_card_21A dogma is a right-cancellative magma satisfying for all . Right-cancellative means that implies .
Theorem. There exists a dogma of cardinality .
Both prime factors and are inert in and occur to the first power, so is not covered by the sufficient condition of Dogma.exists_dogma_card_of_even_inert; the condition is therefore not necessary. (An exhaustive computer search, not formalized here, finds no dogma with or with elements, so this order does not arise as a product of smaller ones.) The statement is relevant to the second question of Problem 10 of the CUHK-Shenzhen AI Math Problems, which asks for which a dogma of cardinality exists.
Formalization Note. The statement is existential over a type and a binary operation. Cardinality is expressed with Nat.card, so forces to be finite.
import Mathlib
namespace Dogma
theorem exists_dogma_card_21 :
∃ (D : Type) (star : D → D → D), Nat.card D = 21 ∧
(∀ x y z : D, star x z = star y z → x = y) ∧
∀ x y : D, star (star x y) y = star y x := by
sorry
end Dogma