Theorem: BunchImpl.PreEquiv.cunit_left (BunchImpl/Equiv.lean)

State before:
P✝ : Sort u_1
B : Bunch P✝
⊢ ¬PreEquiv cunit B
Tactic:
intro h
State after:
P✝ : Sort u_1
B : Bunch P✝
h : PreEquiv cunit B
⊢ False

State before:
P✝ : Sort u_1
B : Bunch P✝
h : PreEquiv cunit B
⊢ False
Tactic:
generalize hA' : cunit = A' at h
State after:
P✝ : Sort u_1
B A' : Bunch P✝
hA' : cunit = A'
h : PreEquiv A' B
⊢ False

State before:
P✝ : Sort u_1
B A' : Bunch P✝
hA' : cunit = A'
h : PreEquiv A' B
⊢ False
Tactic:
induction h <;> simp at hA'
State after:
case subbunch
P✝ : Sort u_1
B A' : Bunch P✝
h✝ : BunchWithHole P✝
b1✝ b2✝ : Bunch P✝
a✝ : PreEquiv b1✝ b2✝
a_ih✝ : cunit = b1✝ → False
hA' : h✝ = BunchWithHole.hole ∧ b1✝ = cunit
⊢ False

State before:
case subbunch
P✝ : Sort u_1
B A' : Bunch P✝
h✝ : BunchWithHole P✝
b1✝ b2✝ : Bunch P✝
a✝ : PreEquiv b1✝ b2✝
a_ih✝ : cunit = b1✝ → False
hA' : h✝ = BunchWithHole.hole ∧ b1✝ = cunit
⊢ False
Tactic:
rcases hA' with ⟨rfl,rfl⟩
State after:
case subbunch.intro
P✝ : Sort u_1
B A' b2✝ : Bunch P✝
a✝ : PreEquiv cunit b2✝
a_ih✝ : cunit = cunit → False
⊢ False

State before:
case subbunch.intro
P✝ : Sort u_1
B A' b2✝ : Bunch P✝
a✝ : PreEquiv cunit b2✝
a_ih✝ : cunit = cunit → False
⊢ False
Tactic:
simp at *
State after:
no goals