AFTD Auto-Formalizing Theoretical Domains

CreateAnnihilate.instDecidableNormalOrder

instanceimported Lean

The normal ordering on CreateAnnihilate is decidable.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
instance CreateAnnihilate.instDecidableNormalOrder : (φ φ' : CreateAnnihilate) → Decidable (normalOrder φ φ')
Defined in
Physlib, `CreateAnnihilate.instDecidableNormalOrder`
Lean proof
By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 Joseph Tooby-Smith. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.
Verified
10 Oct 2026
Axioms
none listed
Built on 3
  • CreateAnnihilateThe type CreateAnnihilate is the type containing two elements create and annihilate. This type is used to specify if an operator is…
  • CreateAnnihilate.normalOrderThe normal ordering on creation and annihilation operators. Under this relation, normalOrder a b is false only if a is annihilate and…
  • CreateAnnihilate.instFintypeThe type CreateAnnihilate is finite.
Used by 5

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- The normal ordering on `CreateAnnihilate` is decidable. -/
instance CreateAnnihilate.instDecidableNormalOrder : (φ φ' : CreateAnnihilate) → Decidable (normalOrder φ φ')
  | create, create => isTrue True.intro
  | annihilate, annihilate => isTrue True.intro
  | create, annihilate => isTrue True.intro
  | annihilate, create => isFalse False.elim
See it in the graphDiscuss this resultChallenge it