url
stringclasses 147
values | commit
stringclasses 147
values | file_path
stringlengths 7
101
| full_name
stringlengths 1
94
| start
stringlengths 6
10
| end
stringlengths 6
11
| tactic
stringlengths 1
11.2k
| state_before
stringlengths 3
2.09M
| state_after
stringlengths 6
2.09M
|
|---|---|---|---|---|---|---|---|---|
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.Bunch.neq_left_semi | [88, 9] | [92, 11] | linarith | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : 1 + sizeOf (b1 PUnit.{u_1}) + sizeOf (b2 PUnit.{u_1}) = sizeOf (b1 PUnit.{u_1})
⊢ False | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.Bunch.neq_right_semi | [94, 9] | [97, 39] | intro h | P✝ : Sort u_1
b1 b2 : Bunch P✝
⊢ (b1 ;ᵇ b2) ≠ b2 | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ;ᵇ b2) = b2
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.Bunch.neq_right_semi | [94, 9] | [97, 39] | have := congrArg sizeOf h | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ;ᵇ b2) = b2
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ;ᵇ b2) = b2
this : sizeOf (b1 ;ᵇ b2) = sizeOf b2
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.Bunch.neq_right_semi | [94, 9] | [97, 39] | clear h | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ;ᵇ b2) = b2
this : sizeOf (b1 ;ᵇ b2) = sizeOf b2
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf (b1 ;ᵇ b2) = sizeOf b2
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.Bunch.neq_right_semi | [94, 9] | [97, 39] | simp [instSizeOfBunch, semi] at this | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf (b1 ;ᵇ b2) = sizeOf b2
⊢ False | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.Bunch.neq_self_left_semi | [99, 9] | [103, 11] | intro h | P✝ : Sort u_1
b1 b2 : Bunch P✝
⊢ b1 ≠ (b1 ;ᵇ b2) | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : b1 = (b1 ;ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.Bunch.neq_self_left_semi | [99, 9] | [103, 11] | have := congrArg sizeOf h | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : b1 = (b1 ;ᵇ b2)
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : b1 = (b1 ;ᵇ b2)
this : sizeOf b1 = sizeOf (b1 ;ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.Bunch.neq_self_left_semi | [99, 9] | [103, 11] | clear h | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : b1 = (b1 ;ᵇ b2)
this : sizeOf b1 = sizeOf (b1 ;ᵇ b2)
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf b1 = sizeOf (b1 ;ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.Bunch.neq_self_left_semi | [99, 9] | [103, 11] | simp [instSizeOfBunch, semi] at this | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf b1 = sizeOf (b1 ;ᵇ b2)
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf (b1 PUnit.{u_1}) = 1 + sizeOf (b1 PUnit.{u_1}) + sizeOf (b2 PUnit.{u_1})
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.Bunch.neq_self_left_semi | [99, 9] | [103, 11] | linarith | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf (b1 PUnit.{u_1}) = 1 + sizeOf (b1 PUnit.{u_1}) + sizeOf (b2 PUnit.{u_1})
⊢ False | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.Bunch.neq_self_right_semi | [105, 9] | [108, 39] | intro h | P✝ : Sort u_1
b2 b1 : Bunch P✝
⊢ b2 ≠ (b1 ;ᵇ b2) | P✝ : Sort u_1
b2 b1 : Bunch P✝
h : b2 = (b1 ;ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.Bunch.neq_self_right_semi | [105, 9] | [108, 39] | have := congrArg sizeOf h | P✝ : Sort u_1
b2 b1 : Bunch P✝
h : b2 = (b1 ;ᵇ b2)
⊢ False | P✝ : Sort u_1
b2 b1 : Bunch P✝
h : b2 = (b1 ;ᵇ b2)
this : sizeOf b2 = sizeOf (b1 ;ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.Bunch.neq_self_right_semi | [105, 9] | [108, 39] | clear h | P✝ : Sort u_1
b2 b1 : Bunch P✝
h : b2 = (b1 ;ᵇ b2)
this : sizeOf b2 = sizeOf (b1 ;ᵇ b2)
⊢ False | P✝ : Sort u_1
b2 b1 : Bunch P✝
this : sizeOf b2 = sizeOf (b1 ;ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.Bunch.neq_self_right_semi | [105, 9] | [108, 39] | simp [instSizeOfBunch, semi] at this | P✝ : Sort u_1
b2 b1 : Bunch P✝
this : sizeOf b2 = sizeOf (b1 ;ᵇ b2)
⊢ False | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.sizeOf_pos | [136, 1] | [137, 23] | induction h <;> simp | P : Sort u_1
V : Sort u_2
h : X P V
⊢ sizeOf h > 0 | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.sizeOf_substX | [139, 9] | [142, 23] | induction h <;> simp [subst, substX, comma, semi, instSizeOfBunch] at * <;>
simp [*] <;> sorry | P V : Sort u_1
b : Bunch.X P V
h : X P V
⊢ sizeOf (substX b h) = sizeOf b + sizeOf h - 1 | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.substX_idem | [144, 9] | [153, 20] | constructor | P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
⊢ substX b Γ = b ↔ Γ = hole | case mp
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
⊢ substX b Γ = b → Γ = hole
case mpr
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
⊢ Γ = hole → substX b Γ = b |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.substX_idem | [144, 9] | [153, 20] | intro h | case mp
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
⊢ substX b Γ = b → Γ = hole | case mp
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
h : substX b Γ = b
⊢ Γ = hole |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.substX_idem | [144, 9] | [153, 20] | have := sizeOf_substX b Γ | case mp
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
h : substX b Γ = b
⊢ Γ = hole | case mp
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
h : substX b Γ = b
this : sizeOf (substX b Γ) = sizeOf b + sizeOf Γ - 1
⊢ Γ = hole |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.substX_idem | [144, 9] | [153, 20] | rw [h] at this | case mp
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
h : substX b Γ = b
this : sizeOf (substX b Γ) = sizeOf b + sizeOf Γ - 1
⊢ Γ = hole | case mp
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
h : substX b Γ = b
this : sizeOf b = sizeOf b + sizeOf Γ - 1
⊢ Γ = hole |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.substX_idem | [144, 9] | [153, 20] | rw [Nat.add_sub_assoc (sizeOf_pos _)] at this | case mp
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
h : substX b Γ = b
this : sizeOf b = sizeOf b + sizeOf Γ - 1
⊢ Γ = hole | case mp
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
h : substX b Γ = b
this : sizeOf b = sizeOf b + (sizeOf Γ - Nat.succ 0)
⊢ Γ = hole |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.substX_idem | [144, 9] | [153, 20] | simp at this | case mp
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
h : substX b Γ = b
this : sizeOf b = sizeOf b + (sizeOf Γ - Nat.succ 0)
⊢ Γ = hole | case mp
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
h : substX b Γ = b
this : sizeOf Γ ≤ Nat.succ 0
⊢ Γ = hole |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.substX_idem | [144, 9] | [153, 20] | cases Γ <;> simp at * <;> (
apply Nat.pos_iff_ne_zero.mp (sizeOf_pos _) this
) | case mp
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
h : substX b Γ = b
this : sizeOf Γ ≤ Nat.succ 0
⊢ Γ = hole | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.substX_idem | [144, 9] | [153, 20] | apply Nat.pos_iff_ne_zero.mp (sizeOf_pos _) this | case mp.semiR
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
l✝ : Bunch P✝
r✝ : X P✝ V✝
h : X.semi (l✝ V✝) (substX b r✝) = b
this : sizeOf r✝ = 0
⊢ False | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.substX_idem | [144, 9] | [153, 20] | rintro rfl | case mpr
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
⊢ Γ = hole → substX b Γ = b | case mpr
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
⊢ substX b hole = b |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.substX_idem | [144, 9] | [153, 20] | rfl | case mpr
P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
⊢ substX b hole = b | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.idem_substX | [155, 9] | [157, 7] | rw [eq_comm] | P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
⊢ b = substX b Γ ↔ Γ = hole | P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
⊢ substX b Γ = b ↔ Γ = hole |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.idem_substX | [155, 9] | [157, 7] | simp | P✝ V✝ : Sort u_1
b : Bunch.X P✝ V✝
Γ : X P✝ V✝
⊢ substX b Γ = b ↔ Γ = hole | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.prop_eq | [206, 9] | [209, 7] | rw [eq_comm] | P b : Type u_1
V : Bunch.X P b
Γ : BunchWithHole P
⊢ sorryAx ((fun x => Bunch.X P b) V) true = ↑(Γ b) V ↔
sorryAx Prop true ∧ sorryAx (?m.4408005 Γ) true = sorryAx (?m.4408005 Γ) true | P b : Type u_1
V : Bunch.X P b
Γ : BunchWithHole P
⊢ ↑(Γ b) V = sorryAx ((fun x => Bunch.X P b) V) true ↔
sorryAx Prop true ∧ sorryAx (?m.4408005 Γ) true = sorryAx (?m.4408005 Γ) true
⊢ {P b : Type u_1} → {V : Bunch.X P b} → BunchWithHole P → Sort u_2 |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.prop_eq | [206, 9] | [209, 7] | simp | P b : Type u_1
V : Bunch.X P b
Γ : BunchWithHole P
⊢ ↑(Γ b) V = sorryAx ((fun x => Bunch.X P b) V) true ↔
sorryAx Prop true ∧ sorryAx (?m.4408005 Γ) true = sorryAx (?m.4408005 Γ) true
⊢ {P b : Type u_1} → {V : Bunch.X P b} → BunchWithHole P → Sort u_2 | P b : Type u_1
V : Bunch.X P b
Γ : BunchWithHole P
⊢ ↑(Γ b) V = sorryAx (Bunch.X P b) true ↔ sorryAx Prop true
⊢ {P b : Type u_1} → {V : Bunch.X P b} → BunchWithHole P → Sort u_2 |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.cunit_eq | [219, 9] | [222, 7] | rw [show (_ = _ ↔ _ = _) from ⟨Eq.symm, Eq.symm⟩] | P : Type u_1
b : Sort u_2
Γ : BunchWithHole P
⊢ sorryAx (X P b) true = Γ b ↔ sorryAx Prop true ∧ b = sorryAx (Sort u_2) true | P : Type u_1
b : Sort u_2
Γ : BunchWithHole P
⊢ Γ b = sorryAx (X P b) true ↔ sorryAx Prop true ∧ b = sorryAx (Sort u_2) true |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.cunit_eq | [219, 9] | [222, 7] | simp | P : Type u_1
b : Sort u_2
Γ : BunchWithHole P
⊢ Γ b = sorryAx (X P b) true ↔ sorryAx Prop true ∧ b = sorryAx (Sort u_2) true | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.sunit_eq | [232, 9] | [235, 7] | rw [show (_ = _ ↔ _ = _) from ⟨Eq.symm, Eq.symm⟩] | P : Type u_1
b : Sort u_2
Γ : BunchWithHole P
⊢ sorryAx (X P b) true = Γ b ↔ sorryAx Prop true ∧ b = sorryAx (Sort u_2) true | P : Type u_1
b : Sort u_2
Γ : BunchWithHole P
⊢ Γ b = sorryAx (X P b) true ↔ sorryAx Prop true ∧ b = sorryAx (Sort u_2) true |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.sunit_eq | [232, 9] | [235, 7] | simp | P : Type u_1
b : Sort u_2
Γ : BunchWithHole P
⊢ Γ b = sorryAx (X P b) true ↔ sorryAx Prop true ∧ b = sorryAx (Sort u_2) true | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.eq_inv | [253, 1] | [294, 13] | intro h | P : Type u_1
Γ Γ' : BunchWithHole P
φ φ' : Bunch P
⊢ Γ (sorryAx (Sort u_2) true) = Γ' (sorryAx (Sort u_2) true) →
(∃ Δ, φ = ?m.12180131 Δ ∧ Γ.comp Δ = Γ') ∨
(∃ Δ, φ' = ?m.12180132 Δ ∧ Γ'.comp Δ = Γ) ∨
∃ Δ Δ', Δ φ = Γ' ∧ Δ' φ' = Γ ∧ (Bunch P → Sort u_2 → sorryAx Prop true) | P : Type u_1
Γ Γ' : BunchWithHole P
φ φ' : Bunch P
h : Γ (sorryAx (Sort u_2) true) = Γ' (sorryAx (Sort u_2) true)
⊢ (∃ Δ, φ = ?m.12180131 Δ ∧ Γ.comp Δ = Γ') ∨
(∃ Δ, φ' = ?m.12180132 Δ ∧ Γ'.comp Δ = Γ) ∨ ∃ Δ Δ', Δ φ = Γ' ∧ Δ' φ' = Γ ∧ (Bunch P → Sort u_2 → sorryAx Prop true) |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.idem | [296, 9] | [298, 21] | simp [FunLike.coe] | P : Type u_1
Γ : BunchWithHole P
b : Bunch P
⊢ sorryAx Prop true ↔ sorryAx Prop true | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Term/Bunch.lean | BunchImpl.BunchWithHole.idem' | [300, 9] | [302, 21] | simp [FunLike.coe] | P : Type u_1
Γ : BunchWithHole P
b : Bunch P
⊢ sorryAx Prop true ↔ sorryAx Prop true | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Subbunch.lean | BunchImpl.Subbunch.comma_inv | [20, 1] | [25, 31] | constructor | P✝ : Sort u_1
BL BR b : Bunch P✝
⊢ Subbunch (BL ,ᵇ BR) b ↔ Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ,ᵇ BR) | case mp
P✝ : Sort u_1
BL BR b : Bunch P✝
⊢ Subbunch (BL ,ᵇ BR) b → Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ,ᵇ BR)
case mpr
P✝ : Sort u_1
BL BR b : Bunch P✝
⊢ Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ,ᵇ BR) → Subbunch (BL ,ᵇ BR) b |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Subbunch.lean | BunchImpl.Subbunch.comma_inv | [20, 1] | [25, 31] | intro h | case mp
P✝ : Sort u_1
BL BR b : Bunch P✝
⊢ Subbunch (BL ,ᵇ BR) b → Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ,ᵇ BR) | case mp
P✝ : Sort u_1
BL BR b : Bunch P✝
h : Subbunch (BL ,ᵇ BR) b
⊢ Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ,ᵇ BR) |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Subbunch.lean | BunchImpl.Subbunch.comma_inv | [20, 1] | [25, 31] | cases h <;> simp_all | case mp
P✝ : Sort u_1
BL BR b : Bunch P✝
h : Subbunch (BL ,ᵇ BR) b
⊢ Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ,ᵇ BR) | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Subbunch.lean | BunchImpl.Subbunch.comma_inv | [20, 1] | [25, 31] | intro h | case mpr
P✝ : Sort u_1
BL BR b : Bunch P✝
⊢ Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ,ᵇ BR) → Subbunch (BL ,ᵇ BR) b | case mpr
P✝ : Sort u_1
BL BR b : Bunch P✝
h : Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ,ᵇ BR)
⊢ Subbunch (BL ,ᵇ BR) b |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Subbunch.lean | BunchImpl.Subbunch.comma_inv | [20, 1] | [25, 31] | cases h <;> aesop | case mpr
P✝ : Sort u_1
BL BR b : Bunch P✝
h : Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ,ᵇ BR)
⊢ Subbunch (BL ,ᵇ BR) b | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Subbunch.lean | BunchImpl.Subbunch.semi_inv | [27, 1] | [32, 31] | constructor | P✝ : Sort u_1
BL BR b : Bunch P✝
⊢ Subbunch (BL ;ᵇ BR) b ↔ Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ;ᵇ BR) | case mp
P✝ : Sort u_1
BL BR b : Bunch P✝
⊢ Subbunch (BL ;ᵇ BR) b → Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ;ᵇ BR)
case mpr
P✝ : Sort u_1
BL BR b : Bunch P✝
⊢ Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ;ᵇ BR) → Subbunch (BL ;ᵇ BR) b |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Subbunch.lean | BunchImpl.Subbunch.semi_inv | [27, 1] | [32, 31] | intro h | case mp
P✝ : Sort u_1
BL BR b : Bunch P✝
⊢ Subbunch (BL ;ᵇ BR) b → Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ;ᵇ BR) | case mp
P✝ : Sort u_1
BL BR b : Bunch P✝
h : Subbunch (BL ;ᵇ BR) b
⊢ Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ;ᵇ BR) |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Subbunch.lean | BunchImpl.Subbunch.semi_inv | [27, 1] | [32, 31] | cases h <;> simp_all | case mp
P✝ : Sort u_1
BL BR b : Bunch P✝
h : Subbunch (BL ;ᵇ BR) b
⊢ Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ;ᵇ BR) | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Subbunch.lean | BunchImpl.Subbunch.semi_inv | [27, 1] | [32, 31] | intro h | case mpr
P✝ : Sort u_1
BL BR b : Bunch P✝
⊢ Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ;ᵇ BR) → Subbunch (BL ;ᵇ BR) b | case mpr
P✝ : Sort u_1
BL BR b : Bunch P✝
h : Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ;ᵇ BR)
⊢ Subbunch (BL ;ᵇ BR) b |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Subbunch.lean | BunchImpl.Subbunch.semi_inv | [27, 1] | [32, 31] | cases h <;> aesop | case mpr
P✝ : Sort u_1
BL BR b : Bunch P✝
h : Subbunch BL b ∨ Subbunch BR b ∨ b = (BL ;ᵇ BR)
⊢ Subbunch (BL ;ᵇ BR) b | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Subbunch.lean | BunchImpl.Subbunch.trans | [34, 1] | [36, 41] | intro h1 h2 | P✝ : Sort u_1
b1 b2 b3 : Bunch P✝
⊢ Subbunch b1 b2 → Subbunch b2 b3 → Subbunch b1 b3 | P✝ : Sort u_1
b1 b2 b3 : Bunch P✝
h1 : Subbunch b1 b2
h2 : Subbunch b2 b3
⊢ Subbunch b1 b3 |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Subbunch.lean | BunchImpl.Subbunch.trans | [34, 1] | [36, 41] | induction h1 <;> cases h2 <;> simp_all | P✝ : Sort u_1
b1 b2 b3 : Bunch P✝
h1 : Subbunch b1 b2
h2 : Subbunch b2 b3
⊢ Subbunch b1 b3 | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Subbunch.lean | BunchImpl.Subbunch.size_lt | [38, 1] | [40, 37] | intro h1 | P : Sort u_1
b1 B1 : Bunch P
⊢ Subbunch B1 b1 → sizeOf B1 ≥ sizeOf b1 | P : Sort u_1
b1 B1 : Bunch P
h1 : Subbunch B1 b1
⊢ sizeOf B1 ≥ sizeOf b1 |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Subbunch.lean | BunchImpl.Subbunch.size_lt | [38, 1] | [40, 37] | induction h1 <;> simp <;> linarith | P : Sort u_1
b1 B1 : Bunch P
h1 : Subbunch B1 b1
⊢ sizeOf B1 ≥ sizeOf b1 | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Subbunch.lean | BunchImpl.Subbunch.subst_hole | [65, 1] | [67, 27] | induction Γ <;> simp [*] | P : Sort u_1
b : Bunch P
Γ : BunchWithHole P
⊢ Subbunch (↑Γ b) b | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_left_comma | [22, 9] | [26, 11] | intro h | P✝ : Sort u_1
b1 b2 : Bunch P✝
⊢ (b1 ,ᵇ b2) ≠ b1 | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ,ᵇ b2) = b1
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_left_comma | [22, 9] | [26, 11] | have := congrArg sizeOf h | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ,ᵇ b2) = b1
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ,ᵇ b2) = b1
this : sizeOf (b1 ,ᵇ b2) = sizeOf b1
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_left_comma | [22, 9] | [26, 11] | clear h | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ,ᵇ b2) = b1
this : sizeOf (b1 ,ᵇ b2) = sizeOf b1
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf (b1 ,ᵇ b2) = sizeOf b1
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_left_comma | [22, 9] | [26, 11] | simp at this | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf (b1 ,ᵇ b2) = sizeOf b1
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : 1 + sizeOf b1 + sizeOf b2 = sizeOf b1
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_left_comma | [22, 9] | [26, 11] | linarith | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : 1 + sizeOf b1 + sizeOf b2 = sizeOf b1
⊢ False | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_right_comma | [28, 9] | [31, 15] | intro h | P✝ : Sort u_1
b1 b2 : Bunch P✝
⊢ (b1 ,ᵇ b2) ≠ b2 | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ,ᵇ b2) = b2
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_right_comma | [28, 9] | [31, 15] | have := congrArg sizeOf h | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ,ᵇ b2) = b2
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ,ᵇ b2) = b2
this : sizeOf (b1 ,ᵇ b2) = sizeOf b2
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_right_comma | [28, 9] | [31, 15] | clear h | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ,ᵇ b2) = b2
this : sizeOf (b1 ,ᵇ b2) = sizeOf b2
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf (b1 ,ᵇ b2) = sizeOf b2
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_right_comma | [28, 9] | [31, 15] | simp at this | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf (b1 ,ᵇ b2) = sizeOf b2
⊢ False | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_left_comma | [33, 9] | [37, 11] | intro h | P✝ : Sort u_1
b1 b2 : Bunch P✝
⊢ b1 ≠ (b1 ,ᵇ b2) | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : b1 = (b1 ,ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_left_comma | [33, 9] | [37, 11] | have := congrArg sizeOf h | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : b1 = (b1 ,ᵇ b2)
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : b1 = (b1 ,ᵇ b2)
this : sizeOf b1 = sizeOf (b1 ,ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_left_comma | [33, 9] | [37, 11] | clear h | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : b1 = (b1 ,ᵇ b2)
this : sizeOf b1 = sizeOf (b1 ,ᵇ b2)
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf b1 = sizeOf (b1 ,ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_left_comma | [33, 9] | [37, 11] | simp at this | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf b1 = sizeOf (b1 ,ᵇ b2)
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf b1 = 1 + sizeOf b1 + sizeOf b2
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_left_comma | [33, 9] | [37, 11] | linarith | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf b1 = 1 + sizeOf b1 + sizeOf b2
⊢ False | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_right_comma | [39, 9] | [42, 15] | intro h | P✝ : Sort u_1
b2 b1 : Bunch P✝
⊢ b2 ≠ (b1 ,ᵇ b2) | P✝ : Sort u_1
b2 b1 : Bunch P✝
h : b2 = (b1 ,ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_right_comma | [39, 9] | [42, 15] | have := congrArg sizeOf h | P✝ : Sort u_1
b2 b1 : Bunch P✝
h : b2 = (b1 ,ᵇ b2)
⊢ False | P✝ : Sort u_1
b2 b1 : Bunch P✝
h : b2 = (b1 ,ᵇ b2)
this : sizeOf b2 = sizeOf (b1 ,ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_right_comma | [39, 9] | [42, 15] | clear h | P✝ : Sort u_1
b2 b1 : Bunch P✝
h : b2 = (b1 ,ᵇ b2)
this : sizeOf b2 = sizeOf (b1 ,ᵇ b2)
⊢ False | P✝ : Sort u_1
b2 b1 : Bunch P✝
this : sizeOf b2 = sizeOf (b1 ,ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_right_comma | [39, 9] | [42, 15] | simp at this | P✝ : Sort u_1
b2 b1 : Bunch P✝
this : sizeOf b2 = sizeOf (b1 ,ᵇ b2)
⊢ False | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_left_semi | [44, 9] | [48, 11] | intro h | P✝ : Sort u_1
b1 b2 : Bunch P✝
⊢ (b1 ;ᵇ b2) ≠ b1 | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ;ᵇ b2) = b1
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_left_semi | [44, 9] | [48, 11] | have := congrArg sizeOf h | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ;ᵇ b2) = b1
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ;ᵇ b2) = b1
this : sizeOf (b1 ;ᵇ b2) = sizeOf b1
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_left_semi | [44, 9] | [48, 11] | clear h | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ;ᵇ b2) = b1
this : sizeOf (b1 ;ᵇ b2) = sizeOf b1
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf (b1 ;ᵇ b2) = sizeOf b1
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_left_semi | [44, 9] | [48, 11] | simp at this | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf (b1 ;ᵇ b2) = sizeOf b1
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : 1 + sizeOf b1 + sizeOf b2 = sizeOf b1
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_left_semi | [44, 9] | [48, 11] | linarith | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : 1 + sizeOf b1 + sizeOf b2 = sizeOf b1
⊢ False | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_right_semi | [50, 9] | [53, 15] | intro h | P✝ : Sort u_1
b1 b2 : Bunch P✝
⊢ (b1 ;ᵇ b2) ≠ b2 | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ;ᵇ b2) = b2
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_right_semi | [50, 9] | [53, 15] | have := congrArg sizeOf h | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ;ᵇ b2) = b2
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ;ᵇ b2) = b2
this : sizeOf (b1 ;ᵇ b2) = sizeOf b2
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_right_semi | [50, 9] | [53, 15] | clear h | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : (b1 ;ᵇ b2) = b2
this : sizeOf (b1 ;ᵇ b2) = sizeOf b2
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf (b1 ;ᵇ b2) = sizeOf b2
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_right_semi | [50, 9] | [53, 15] | simp at this | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf (b1 ;ᵇ b2) = sizeOf b2
⊢ False | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_left_semi | [55, 9] | [59, 11] | intro h | P✝ : Sort u_1
b1 b2 : Bunch P✝
⊢ b1 ≠ (b1 ;ᵇ b2) | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : b1 = (b1 ;ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_left_semi | [55, 9] | [59, 11] | have := congrArg sizeOf h | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : b1 = (b1 ;ᵇ b2)
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : b1 = (b1 ;ᵇ b2)
this : sizeOf b1 = sizeOf (b1 ;ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_left_semi | [55, 9] | [59, 11] | clear h | P✝ : Sort u_1
b1 b2 : Bunch P✝
h : b1 = (b1 ;ᵇ b2)
this : sizeOf b1 = sizeOf (b1 ;ᵇ b2)
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf b1 = sizeOf (b1 ;ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_left_semi | [55, 9] | [59, 11] | simp at this | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf b1 = sizeOf (b1 ;ᵇ b2)
⊢ False | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf b1 = 1 + sizeOf b1 + sizeOf b2
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_left_semi | [55, 9] | [59, 11] | linarith | P✝ : Sort u_1
b1 b2 : Bunch P✝
this : sizeOf b1 = 1 + sizeOf b1 + sizeOf b2
⊢ False | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_right_semi | [61, 9] | [64, 15] | intro h | P✝ : Sort u_1
b2 b1 : Bunch P✝
⊢ b2 ≠ (b1 ;ᵇ b2) | P✝ : Sort u_1
b2 b1 : Bunch P✝
h : b2 = (b1 ;ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_right_semi | [61, 9] | [64, 15] | have := congrArg sizeOf h | P✝ : Sort u_1
b2 b1 : Bunch P✝
h : b2 = (b1 ;ᵇ b2)
⊢ False | P✝ : Sort u_1
b2 b1 : Bunch P✝
h : b2 = (b1 ;ᵇ b2)
this : sizeOf b2 = sizeOf (b1 ;ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_right_semi | [61, 9] | [64, 15] | clear h | P✝ : Sort u_1
b2 b1 : Bunch P✝
h : b2 = (b1 ;ᵇ b2)
this : sizeOf b2 = sizeOf (b1 ;ᵇ b2)
⊢ False | P✝ : Sort u_1
b2 b1 : Bunch P✝
this : sizeOf b2 = sizeOf (b1 ;ᵇ b2)
⊢ False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.Bunch.neq_self_right_semi | [61, 9] | [64, 15] | simp at this | P✝ : Sort u_1
b2 b1 : Bunch P✝
this : sizeOf b2 = sizeOf (b1 ;ᵇ b2)
⊢ False | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.BunchWithHole.sizeOf_pos | [94, 1] | [95, 23] | induction h <;> simp | P : Sort u_1
h : BunchWithHole P
⊢ sizeOf h > 0 | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.BunchWithHole.sizeOf_subst | [97, 9] | [99, 44] | induction h <;> simp [subst, *] <;> sorry | P : Sort u_1
b : Bunch P
h : BunchWithHole P
⊢ sizeOf (subst b h) = sizeOf b + sizeOf h - 1 | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.BunchWithHole.subst_idem | [101, 9] | [116, 21] | constructor | P✝ : Sort u_1
b : Bunch P✝
Γ : BunchWithHole P✝
⊢ subst b Γ = b ↔ Γ = hole | case mp
P✝ : Sort u_1
b : Bunch P✝
Γ : BunchWithHole P✝
⊢ subst b Γ = b → Γ = hole
case mpr
P✝ : Sort u_1
b : Bunch P✝
Γ : BunchWithHole P✝
⊢ Γ = hole → subst b Γ = b |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.BunchWithHole.subst_idem | [101, 9] | [116, 21] | intro h | case mp
P✝ : Sort u_1
b : Bunch P✝
Γ : BunchWithHole P✝
⊢ subst b Γ = b → Γ = hole | case mp
P✝ : Sort u_1
b : Bunch P✝
Γ : BunchWithHole P✝
h : subst b Γ = b
⊢ Γ = hole |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.BunchWithHole.subst_idem | [101, 9] | [116, 21] | have := sizeOf_subst b Γ | case mp
P✝ : Sort u_1
b : Bunch P✝
Γ : BunchWithHole P✝
h : subst b Γ = b
⊢ Γ = hole | case mp
P✝ : Sort u_1
b : Bunch P✝
Γ : BunchWithHole P✝
h : subst b Γ = b
this : sizeOf (subst b Γ) = sizeOf b + sizeOf Γ - 1
⊢ Γ = hole |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.BunchWithHole.subst_idem | [101, 9] | [116, 21] | rw [h] at this | case mp
P✝ : Sort u_1
b : Bunch P✝
Γ : BunchWithHole P✝
h : subst b Γ = b
this : sizeOf (subst b Γ) = sizeOf b + sizeOf Γ - 1
⊢ Γ = hole | case mp
P✝ : Sort u_1
b : Bunch P✝
Γ : BunchWithHole P✝
h : subst b Γ = b
this : sizeOf b = sizeOf b + sizeOf Γ - 1
⊢ Γ = hole |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.BunchWithHole.subst_idem | [101, 9] | [116, 21] | rw [Nat.add_sub_assoc (sizeOf_pos _)] at this | case mp
P✝ : Sort u_1
b : Bunch P✝
Γ : BunchWithHole P✝
h : subst b Γ = b
this : sizeOf b = sizeOf b + sizeOf Γ - 1
⊢ Γ = hole | case mp
P✝ : Sort u_1
b : Bunch P✝
Γ : BunchWithHole P✝
h : subst b Γ = b
this : sizeOf b = sizeOf b + (sizeOf Γ - Nat.succ 0)
⊢ Γ = hole |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.BunchWithHole.subst_idem | [101, 9] | [116, 21] | simp at this | case mp
P✝ : Sort u_1
b : Bunch P✝
Γ : BunchWithHole P✝
h : subst b Γ = b
this : sizeOf b = sizeOf b + (sizeOf Γ - Nat.succ 0)
⊢ Γ = hole | case mp
P✝ : Sort u_1
b : Bunch P✝
Γ : BunchWithHole P✝
h : subst b Γ = b
this : sizeOf Γ ≤ Nat.succ 0
⊢ Γ = hole |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.BunchWithHole.subst_idem | [101, 9] | [116, 21] | cases Γ <;> simp at * <;> (
revert this
suffices ¬ _ ≥ _ from this
simp
rw [Nat.add_assoc]
apply Nat.lt_add_of_pos_right
first | (apply Nat.add_pos_left; apply sizeOf_pos)
| (apply Nat.add_pos_right; apply sizeOf_pos)
) | case mp
P✝ : Sort u_1
b : Bunch P✝
Γ : BunchWithHole P✝
h : subst b Γ = b
this : sizeOf Γ ≤ Nat.succ 0
⊢ Γ = hole | no goals |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.BunchWithHole.subst_idem | [101, 9] | [116, 21] | revert this | case mp.semiR
P✝ : Sort u_1
b l✝ : Bunch P✝
r✝ : BunchWithHole P✝
h : (l✝ ;ᵇ subst b r✝) = b
this : 1 + sizeOf l✝ + sizeOf r✝ ≤ Nat.succ 0
⊢ False | case mp.semiR
P✝ : Sort u_1
b l✝ : Bunch P✝
r✝ : BunchWithHole P✝
h : (l✝ ;ᵇ subst b r✝) = b
⊢ 1 + sizeOf l✝ + sizeOf r✝ ≤ Nat.succ 0 → False |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.BunchWithHole.subst_idem | [101, 9] | [116, 21] | suffices ¬ _ ≥ _ from this | case mp.semiR
P✝ : Sort u_1
b l✝ : Bunch P✝
r✝ : BunchWithHole P✝
h : (l✝ ;ᵇ subst b r✝) = b
⊢ 1 + sizeOf l✝ + sizeOf r✝ ≤ Nat.succ 0 → False | case mp.semiR
P✝ : Sort u_1
b l✝ : Bunch P✝
r✝ : BunchWithHole P✝
h : (l✝ ;ᵇ subst b r✝) = b
⊢ ¬Nat.succ 0 ≥ 1 + sizeOf l✝ + sizeOf r✝ |
https://github.com/JamesGallicchio/brunched-invitations.git | 3082c5ae68d2022b1439310f315a0038dae24e0c | BunchImpl/Bunch.lean | BunchImpl.BunchWithHole.subst_idem | [101, 9] | [116, 21] | simp | case mp.semiR
P✝ : Sort u_1
b l✝ : Bunch P✝
r✝ : BunchWithHole P✝
h : (l✝ ;ᵇ subst b r✝) = b
⊢ ¬Nat.succ 0 ≥ 1 + sizeOf l✝ + sizeOf r✝ | case mp.semiR
P✝ : Sort u_1
b l✝ : Bunch P✝
r✝ : BunchWithHole P✝
h : (l✝ ;ᵇ subst b r✝) = b
⊢ Nat.succ 0 < 1 + sizeOf l✝ + sizeOf r✝ |