AFTD Auto-Formalizing Theoretical Domains

BiLinearSymm.swap

theoremverifiedformalizationimported Lean

BiLinearSymm.swap

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open BiLinearSymm in
open BigOperators in
variable {V : Type} [AddCommMonoid V] [Module ℚ V] in
lemma BiLinearSymm.swap (f : BiLinearSymm V) (S T : V) : f S T = f T S
Formalizes
Physlib, `BiLinearSymm.swap`
Lean proof
By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2024 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
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • BiLinearSymm.instFunA symmetric bilinear form can be treated as a function from V to V →ₗ[ℚ] ℚ.
  • BiLinearSymmThe structure of a symmetric bilinear function.
Used by 6

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open BiLinearSymm in
open BigOperators in
variable {V : Type} [AddCommMonoid V] [Module ℚ V] in
lemma BiLinearSymm.swap (f : BiLinearSymm V) (S T : V) : f S T = f T S := f.swap' S T
See it in the graphDiscuss this resultChallenge it