AFTD Auto-Formalizing Theoretical Domains

Equiv.sumEquivSigmalCond

defimported Lean

An alternative form of Equiv.sumEquivSigmaBool where Bool.casesOn is replaced by cond.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped InnerProductSpace in
open Module in
def Equiv.sumEquivSigmalCond : Fin m ⊕ Fin n ≃ Σ b, cond b (Fin m) (Fin n)
Defined in
Physlib, `Equiv.sumEquivSigmalCond`
Lean proof
By Gordon Hsu, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 Gordon Hsu. 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
none listed
Used by 3

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped InnerProductSpace in
open Module in
/-- An alternative form of `Equiv.sumEquivSigmaBool` where `Bool.casesOn` is replaced by `cond`. -/
def Equiv.sumEquivSigmalCond : Fin m ⊕ Fin n ≃ Σ b, cond b (Fin m) (Fin n) :=
  calc Fin m ⊕ Fin n
    _ ≃ Fin n ⊕ Fin m := sumComm ..
    _ ≃ Σ b, bif b then (Fin m) else (Fin n) := sumEquivSigmaBool ..
    _ ≃ Σ b, cond b (Fin m) (Fin n) := sigmaCongrRight (fun | true | false => Equiv.refl _)
See it in the graphDiscuss this resultChallenge it