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

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

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

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

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

State before:
P✝ : Sort u_1
b1 b2 : Bunch P✝
this : 1 + sizeOf b1 + sizeOf b2 = sizeOf b1
⊢ False
Tactic:
linarith
State after:
no goals