`Matches`

definition

show as: view math explainer →

module: IndisputableMonolith.RecogSpec.Core
domain: RecogSpec
line: 132 · github
papers citing: none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.RecogSpec.Core on GitHub at line 132.

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

depends on

used by

formal source

 129  g2Muon0_isPhi       : PhiClosed φ g2Muon0
 130
 131/-- "Bridge B matches universal U" (pure proposition). -/
 132def Matches (φ : ℝ) (L : Ledger) (B : Bridge L) (U : UniversalDimless φ) : Prop :=
 133  ∃ (P : DimlessPack L B),
 134    P.alpha = U.alpha0
 135      ∧ P.massRatios = U.massRatios0
 136      ∧ P.mixingAngles = U.mixingAngles0
 137      ∧ P.g2Muon = U.g2Muon0
 138      ∧ P.strongCPNeutral = U.strongCP0
 139      ∧ P.eightTickMinimal = U.eightTick0
 140      ∧ P.bornRule = U.born0
 141
 142end
 143
 144end RecogSpec
 145end IndisputableMonolith

papers checked against this theorem

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