Theorem: BunchImpl.BunchWithHole.cunit_eq (BunchImpl/Bunch.lean)

State before:
P : Sort u_1
b : Bunch P
Γ : BunchWithHole P
⊢ cunit = ↑Γ b ↔ Γ = hole ∧ b = cunit
Tactic:
rw [show (_ = _ ↔ _ = _) from ⟨Eq.symm, Eq.symm⟩]
State after:
P : Sort u_1
b : Bunch P
Γ : BunchWithHole P
⊢ ↑Γ b = cunit ↔ Γ = hole ∧ b = cunit

State before:
P : Sort u_1
b : Bunch P
Γ : BunchWithHole P
⊢ ↑Γ b = cunit ↔ Γ = hole ∧ b = cunit
Tactic:
simp
State after:
no goals