Theorem: Std.RBNode.Path.Ordered.del
File: Std/Data/RBMap/Alter.lean

tactic: unfold del
state_before: α : Type u_1
cmp : α → α → Ordering
c✝ : RBColor
parent : Path α
x : α
b a : RBNode α
ha : RBNode.Ordered cmp a
hp : Ordered cmp parent
xb : All (fun x_1 => cmpLT cmp x x_1) b
xp : RootOrdered cmp parent x
bp : All (RootOrdered cmp parent) b
hb : RBNode.Ordered cmp b
H : All (RootOrdered cmp (left c✝ parent x b)) a
⊢ RBNode.Ordered cmp (Path.del (left c✝ parent x b) a red)

tactic: have ⟨ax, ap⟩ := All_and.1 H
state_before: α : Type u_1
cmp : α → α → Ordering
c✝ : RBColor
parent : Path α
x : α
b a : RBNode α
ha : RBNode.Ordered cmp a
hp : Ordered cmp parent
xb : All (fun x_1 => cmpLT cmp x x_1) b
xp : RootOrdered cmp parent x
bp : All (RootOrdered cmp parent) b
hb : RBNode.Ordered cmp b
H : All (RootOrdered cmp (left c✝ parent x b)) a
⊢ RBNode.Ordered cmp (Path.del parent (node red a x b) c✝)

tactic: exact hp.del ⟨ax, xb, ha, hb⟩ ⟨xp, ap, bp⟩
state_before: α : Type u_1
cmp : α → α → Ordering
c✝ : RBColor
parent : Path α
x : α
b a : RBNode α
ha : RBNode.Ordered cmp a
hp : Ordered cmp parent
xb : All (fun x_1 => cmpLT cmp x x_1) b
xp : RootOrdered cmp parent x
bp : All (RootOrdered cmp parent) b
hb : RBNode.Ordered cmp b
H : All (RootOrdered cmp (left c✝ parent x b)) a
ax : All (fun a => cmpLT cmp a x) a
ap : All (fun a => RootOrdered cmp parent a) a
⊢ RBNode.Ordered cmp (Path.del parent (node red a x b) c✝)

tactic: unfold del
state_before: α : Type u_1
cmp : α → α → Ordering
c✝ : RBColor
a : RBNode α
x : α
parent : Path α
b : RBNode α
hb : RBNode.Ordered cmp b
hp : Ordered cmp parent
ax : All (fun x_1 => cmpLT cmp x_1 x) a
xp : RootOrdered cmp parent x
ap : All (RootOrdered cmp parent) a
ha : RBNode.Ordered cmp a
H : All (RootOrdered cmp (right c✝ a x parent)) b
⊢ RBNode.Ordered cmp (Path.del (right c✝ a x parent) b red)

tactic: have ⟨xb, bp⟩ := All_and.1 H
state_before: α : Type u_1
cmp : α → α → Ordering
c✝ : RBColor
a : RBNode α
x : α
parent : Path α
b : RBNode α
hb : RBNode.Ordered cmp b
hp : Ordered cmp parent
ax : All (fun x_1 => cmpLT cmp x_1 x) a
xp : RootOrdered cmp parent x
ap : All (RootOrdered cmp parent) a
ha : RBNode.Ordered cmp a
H : All (RootOrdered cmp (right c✝ a x parent)) b
⊢ RBNode.Ordered cmp (Path.del parent (node red a x b) c✝)

tactic: exact hp.del ⟨ax, xb, ha, hb⟩ ⟨xp, ap, bp⟩
state_before: α : Type u_1
cmp : α → α → Ordering
c✝ : RBColor
a : RBNode α
x : α
parent : Path α
b : RBNode α
hb : RBNode.Ordered cmp b
hp : Ordered cmp parent
ax : All (fun x_1 => cmpLT cmp x_1 x) a
xp : RootOrdered cmp parent x
ap : All (RootOrdered cmp parent) a
ha : RBNode.Ordered cmp a
H : All (RootOrdered cmp (right c✝ a x parent)) b
xb : All (fun a => cmpLT cmp x a) b
bp : All (fun a => RootOrdered cmp parent a) b
⊢ RBNode.Ordered cmp (Path.del parent (node red a x b) c✝)

tactic: unfold del
state_before: α : Type u_1
cmp : α → α → Ordering
c✝ : RBColor
parent : Path α
x : α
b a : RBNode α
ha : RBNode.Ordered cmp a
hp : Ordered cmp parent
xb : All (fun x_1 => cmpLT cmp x x_1) b
xp : RootOrdered cmp parent x
bp : All (RootOrdered cmp parent) b
hb : RBNode.Ordered cmp b
H : All (RootOrdered cmp (left c✝ parent x b)) a
⊢ RBNode.Ordered cmp (Path.del (left c✝ parent x b) a black)

tactic: have ⟨ax, ap⟩ := All_and.1 H
state_before: α : Type u_1
cmp : α → α → Ordering
c✝ : RBColor
parent : Path α
x : α
b a : RBNode α
ha : RBNode.Ordered cmp a
hp : Ordered cmp parent
xb : All (fun x_1 => cmpLT cmp x x_1) b
xp : RootOrdered cmp parent x
bp : All (RootOrdered cmp parent) b
hb : RBNode.Ordered cmp b
H : All (RootOrdered cmp (left c✝ parent x b)) a
⊢ RBNode.Ordered cmp (Path.del parent (balLeft a x b) c✝)

tactic: exact hp.del (ha.balLeft ax xb hb) (ap.balLeft xp bp)
state_before: α : Type u_1
cmp : α → α → Ordering
c✝ : RBColor
parent : Path α
x : α
b a : RBNode α
ha : RBNode.Ordered cmp a
hp : Ordered cmp parent
xb : All (fun x_1 => cmpLT cmp x x_1) b
xp : RootOrdered cmp parent x
bp : All (RootOrdered cmp parent) b
hb : RBNode.Ordered cmp b
H : All (RootOrdered cmp (left c✝ parent x b)) a
ax : All (fun a => cmpLT cmp a x) a
ap : All (fun a => RootOrdered cmp parent a) a
⊢ RBNode.Ordered cmp (Path.del parent (balLeft a x b) c✝)

tactic: unfold del
state_before: α : Type u_1
cmp : α → α → Ordering
c✝ : RBColor
a : RBNode α
x : α
parent : Path α
b : RBNode α
hb : RBNode.Ordered cmp b
hp : Ordered cmp parent
ax : All (fun x_1 => cmpLT cmp x_1 x) a
xp : RootOrdered cmp parent x
ap : All (RootOrdered cmp parent) a
ha : RBNode.Ordered cmp a
H : All (RootOrdered cmp (right c✝ a x parent)) b
⊢ RBNode.Ordered cmp (Path.del (right c✝ a x parent) b black)

tactic: have ⟨xb, bp⟩ := All_and.1 H
state_before: α : Type u_1
cmp : α → α → Ordering
c✝ : RBColor
a : RBNode α
x : α
parent : Path α
b : RBNode α
hb : RBNode.Ordered cmp b
hp : Ordered cmp parent
ax : All (fun x_1 => cmpLT cmp x_1 x) a
xp : RootOrdered cmp parent x
ap : All (RootOrdered cmp parent) a
ha : RBNode.Ordered cmp a
H : All (RootOrdered cmp (right c✝ a x parent)) b
⊢ RBNode.Ordered cmp (Path.del parent (balRight a x b) c✝)

tactic: exact hp.del (ha.balRight ax xb hb) (ap.balRight xp bp)
state_before: α : Type u_1
cmp : α → α → Ordering
c✝ : RBColor
a : RBNode α
x : α
parent : Path α
b : RBNode α
hb : RBNode.Ordered cmp b
hp : Ordered cmp parent
ax : All (fun x_1 => cmpLT cmp x_1 x) a
xp : RootOrdered cmp parent x
ap : All (RootOrdered cmp parent) a
ha : RBNode.Ordered cmp a
H : All (RootOrdered cmp (right c✝ a x parent)) b
xb : All (fun a => cmpLT cmp x a) b
bp : All (fun a => RootOrdered cmp parent a) b
⊢ RBNode.Ordered cmp (Path.del parent (balRight a x b) c✝)