inductive
definition
BraakStage
show as:
view math explainer →
open explainer
Read the cached plain-language explainer.
open lean source
IndisputableMonolith.CrossDomain.CubeFaceUniversality on GitHub at line 43.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
formal source
40 | l1 | l2 | l3 | l4 | l5 | l6
41 deriving DecidableEq, Repr, BEq, Fintype
42
43inductive BraakStage where
44 | b1 | b2 | b3 | b4 | b5 | b6
45 deriving DecidableEq, Repr, BEq, Fintype
46
47inductive RoboticDOF where
48 | x | y | z | rollAxis | pitchAxis | yawAxis
49 deriving DecidableEq, Repr, BEq, Fintype
50
51theorem quark_has_6 : HasCubeFaceCount Quark := by
52 unfold HasCubeFaceCount; decide
53theorem lepton_has_6 : HasCubeFaceCount Lepton := by
54 unfold HasCubeFaceCount; decide
55theorem cortical_has_6 : HasCubeFaceCount CorticalLayer := by
56 unfold HasCubeFaceCount; decide
57theorem braak_has_6 : HasCubeFaceCount BraakStage := by
58 unfold HasCubeFaceCount; decide
59theorem robotic_has_6 : HasCubeFaceCount RoboticDOF := by
60 unfold HasCubeFaceCount; decide
61
62/-- The cube-face identity: 6 = 2 × 3 = face-binary × spatial-dim. -/
63theorem cube_face_identity : (6 : ℕ) = 2 * 3 := by decide
64
65/-- Q₃ Euler: V - E + F = 8 - 12 + 6 = 2. -/
66theorem q3_euler : (8 : ℤ) - 12 + 6 = 2 := by decide
67
68/-- Any two cube-face domains are equicardinal. -/
69theorem cube_face_equicardinal
70 {A B : Type} [Fintype A] [Fintype B]
71 (hA : HasCubeFaceCount A) (hB : HasCubeFaceCount B) :
72 Fintype.card A = Fintype.card B := by
73 rw [hA, hB]