Inverse_of_Composite_Bijection
Provedbijectionscomposite-mappingsinverse-mappingsproofwiki
Let f and g be bijections. Then (g ∘ f)⁻¹ = f⁻¹ ∘ g⁻¹ and f⁻¹ ∘ g⁻¹ is itself a bijection.
Preamble
import Mathlib.Logic.Equiv.Basic
Formal statement
theorem Inverse_of_Composite_Bijection {α β γ : Type _} (f : α ≃ β) (g : β ≃ γ) : (f.trans g).symm = g.symm.trans f.symm := by sorrySource