Physlib.Fin.involutionCons_ext
theoremverifiedformalizationimported Lean
Physlib.Fin.involutionCons_ext
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Nat in lemma Physlib.Fin.involutionCons_ext {n : ℕ} {f1 f2 : (f : {f : Fin n → Fin n // Function.Involutive f}) × {i : Option (Fin n) // ∀ (h : i.isSome), f.1 (Option.get i h) = (Option.get i h)}} (h1 : f1.1 = f2.1) (h2 : f1.2 = Equiv.subtypeEquivRight (by rw [h1]; simp) f2.2) : f1 = f2
- Formalizes
- Physlib, `Physlib.Fin.involutionCons_ext`
- 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.Physlib.Fin.involutionCons_ext← Physlib.Fin.involutionCons_ext (Physlib/Mathematics/ForMathlib/Fin/Involutions.lean:146): verbatim
- Verified
- 09 Oct 2026
- Axioms
Quot.soundpropext
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Nat inlemma Physlib.Fin.involutionCons_ext {n : ℕ} {f1 f2 : (f : {f : Fin n → Fin n // Function.Involutive f}) × {i : Option (Fin n) // ∀ (h : i.isSome), f.1 (Option.get i h) = (Option.get i h)}} (h1 : f1.1 = f2.1) (h2 : f1.2 = Equiv.subtypeEquivRight (by rw [h1]; simp) f2.2) : f1 = f2 := by cases f1 cases f2 simp only at h1 h2 subst h1 rename_i fst snd snd_1 simp_all only [Sigma.mk.inj_iff, heq_eq_eq, true_and] obtain ⟨val, property⟩ := fst obtain ⟨val_1, property_1⟩ := snd obtain ⟨val_2, property_2⟩ := snd_1 simp_all only rfl