Theorem: BunchImpl.Bunch.neq_self_right_semi (BunchImpl/Bunch.lean)

State before:
P✝ : Sort u_1
b2 b1 : Bunch P✝
⊢ b2 ≠ (b1 ;ᵇ b2)
Tactic:
intro h
State after:
P✝ : Sort u_1
b2 b1 : Bunch P✝
h : b2 = (b1 ;ᵇ b2)
⊢ False

State before:
P✝ : Sort u_1
b2 b1 : Bunch P✝
h : b2 = (b1 ;ᵇ b2)
⊢ False
Tactic:
have := congrArg sizeOf h
State after:
P✝ : Sort u_1
b2 b1 : Bunch P✝
h : b2 = (b1 ;ᵇ b2)
this : sizeOf b2 = sizeOf (b1 ;ᵇ b2)
⊢ False

State before:
P✝ : Sort u_1
b2 b1 : Bunch P✝
h : b2 = (b1 ;ᵇ b2)
this : sizeOf b2 = sizeOf (b1 ;ᵇ b2)
⊢ False
Tactic:
clear h
State after:
P✝ : Sort u_1
b2 b1 : Bunch P✝
this : sizeOf b2 = sizeOf (b1 ;ᵇ b2)
⊢ False

State before:
P✝ : Sort u_1
b2 b1 : Bunch P✝
this : sizeOf b2 = sizeOf (b1 ;ᵇ b2)
⊢ False
Tactic:
simp at this
State after:
no goals