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/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/UB.lean
interpUB_bind
[64, 1]
[81, 28]
cases x <;> simp [ih]
case Vis.a.h T R : Type k : T → Fitree UBE R T✝ : Type e✝ : UBE T✝ k✝ : T✝ → Fitree UBE T ih : ∀ (a : T✝), Fitree.interp UBE.handle (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp UBE.handle (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp UBE.handle (k x) fequal2 : ∀ (α β : Type 1) (f g : α → β) (x y : α), f = g → x = y → f x = g y x : Except String T✝ ⊢ (match x with | Except.ok a => Fitree.interp UBE.handle (Fitree.bind (k✝ a) k) | Except.error e => Fitree.ret (Except.error e)) = Fitree.bind (match x with | Except.ok a => Fitree.interp UBE.handle (k✝ a) | Except.error e => Fitree.ret (Except.error e)) fun x => match x with | Except.error e => Fitree.ret (Except.error e) | Except.ok x => Fitree.interp UBE.handle (k x)
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/UB.lean
interpUB_bind
[64, 1]
[81, 28]
simp [h₁, h₂]
T R : Type k : T → Fitree UBE R T✝ : Type e✝ : UBE T✝ k✝ : T✝ → Fitree UBE T ih : ∀ (a : T✝), Fitree.interp UBE.handle (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp UBE.handle (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp UBE.handle (k x) α : Sort ?u.7562 β : Sort ?u.7563 f g : α → β x y : α h₁ : f = g h₂ : x = y ⊢ f x = g y
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/UB.lean
interpUB'_bind
[90, 1]
[107, 28]
induction t with | Ret _ => rfl | Vis _ _ ih => simp [interpUB', Fitree.interpExcept] at * simp [Fitree.interp, Fitree.bind, Bind.bind] simp [ExceptT.bind, ExceptT.mk, ExceptT.bindCont] have fequal2 α β (f g: α → β) x y: f = g → x = y → f x = g y := fun h₁ h₂ => by simp [h₁, h₂] apply fequal2; rfl; funext x cases x <;> simp [ih]
T : Type E : Type → Type R : Type t : Fitree (UBE +' E) T k : T → Fitree (UBE +' E) R ⊢ interpUB' (Fitree.bind t k) = Fitree.bind (interpUB' t) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => interpUB' (k x)
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/UB.lean
interpUB'_bind
[90, 1]
[107, 28]
rfl
case Ret T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R r✝ : T ⊢ interpUB' (Fitree.bind (Fitree.Ret r✝) k) = Fitree.bind (interpUB' (Fitree.Ret r✝)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => interpUB' (k x)
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/UB.lean
interpUB'_bind
[90, 1]
[107, 28]
simp [interpUB', Fitree.interpExcept] at *
case Vis T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), interpUB' (Fitree.bind (k✝ a) k) = Fitree.bind (interpUB' (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => interpUB' (k x) ⊢ interpUB' (Fitree.bind (Fitree.Vis e✝ k✝) k) = Fitree.bind (interpUB' (Fitree.Vis e✝ k✝)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => interpUB' (k x)
case Vis T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) ⊢ Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (Fitree.Vis e✝ k✝) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.Vis e✝ k✝)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x)
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/UB.lean
interpUB'_bind
[90, 1]
[107, 28]
simp [Fitree.interp, Fitree.bind, Bind.bind]
case Vis T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) ⊢ Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (Fitree.Vis e✝ k✝) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.Vis e✝ k✝)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x)
case Vis T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) ⊢ Fitree.bind (Fitree.case UBE.handle Fitree.liftHandler T✝ e✝) (ExceptT.bindCont fun t => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ t) k)) = Fitree.bind (Fitree.case UBE.handle Fitree.liftHandler T✝ e✝) fun x => Fitree.bind (ExceptT.bindCont (fun t => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ t)) x) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x)
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/UB.lean
interpUB'_bind
[90, 1]
[107, 28]
simp [ExceptT.bind, ExceptT.mk, ExceptT.bindCont]
case Vis T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) ⊢ Fitree.bind (Fitree.case UBE.handle Fitree.liftHandler T✝ e✝) (ExceptT.bindCont fun t => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ t) k)) = Fitree.bind (Fitree.case UBE.handle Fitree.liftHandler T✝ e✝) fun x => Fitree.bind (ExceptT.bindCont (fun t => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ t)) x) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x)
case Vis T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) ⊢ (Fitree.bind (Fitree.case UBE.handle Fitree.liftHandler T✝ e✝) fun x => match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) | Except.error e => Fitree.ret (Except.error e)) = Fitree.bind (Fitree.case UBE.handle Fitree.liftHandler T✝ e✝) fun x => Fitree.bind (match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a) | Except.error e => Fitree.ret (Except.error e)) fun x => match x with | Except.error e => Fitree.ret (Except.error e) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x)
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/UB.lean
interpUB'_bind
[90, 1]
[107, 28]
have fequal2 α β (f g: α → β) x y: f = g → x = y → f x = g y := fun h₁ h₂ => by simp [h₁, h₂]
case Vis T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) ⊢ (Fitree.bind (Fitree.case UBE.handle Fitree.liftHandler T✝ e✝) fun x => match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) | Except.error e => Fitree.ret (Except.error e)) = Fitree.bind (Fitree.case UBE.handle Fitree.liftHandler T✝ e✝) fun x => Fitree.bind (match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a) | Except.error e => Fitree.ret (Except.error e)) fun x => match x with | Except.error e => Fitree.ret (Except.error e) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x)
case Vis T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) fequal2 : ∀ (α : Sort ?u.10648) (β : Sort ?u.10649) (f g : α → β) (x y : α), f = g → x = y → f x = g y ⊢ (Fitree.bind (Fitree.case UBE.handle Fitree.liftHandler T✝ e✝) fun x => match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) | Except.error e => Fitree.ret (Except.error e)) = Fitree.bind (Fitree.case UBE.handle Fitree.liftHandler T✝ e✝) fun x => Fitree.bind (match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a) | Except.error e => Fitree.ret (Except.error e)) fun x => match x with | Except.error e => Fitree.ret (Except.error e) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x)
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/UB.lean
interpUB'_bind
[90, 1]
[107, 28]
apply fequal2
case Vis T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) fequal2 : ∀ (α : Sort ?u.10648) (β : Sort ?u.10649) (f g : α → β) (x y : α), f = g → x = y → f x = g y ⊢ (Fitree.bind (Fitree.case UBE.handle Fitree.liftHandler T✝ e✝) fun x => match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) | Except.error e => Fitree.ret (Except.error e)) = Fitree.bind (Fitree.case UBE.handle Fitree.liftHandler T✝ e✝) fun x => Fitree.bind (match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a) | Except.error e => Fitree.ret (Except.error e)) fun x => match x with | Except.error e => Fitree.ret (Except.error e) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x)
case Vis.a T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) fequal2 : ∀ (α β : Type 1) (f g : α → β) (x y : α), f = g → x = y → f x = g y ⊢ Fitree.bind (Fitree.case UBE.handle Fitree.liftHandler T✝ e✝) = Fitree.bind (Fitree.case UBE.handle Fitree.liftHandler T✝ e✝) case Vis.a T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) fequal2 : ∀ (α β : Type 1) (f g : α → β) (x y : α), f = g → x = y → f x = g y ⊢ (fun x => match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) | Except.error e => Fitree.ret (Except.error e)) = fun x => Fitree.bind (match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a) | Except.error e => Fitree.ret (Except.error e)) fun x => match x with | Except.error e => Fitree.ret (Except.error e) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x)
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/UB.lean
interpUB'_bind
[90, 1]
[107, 28]
rfl
case Vis.a T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) fequal2 : ∀ (α β : Type 1) (f g : α → β) (x y : α), f = g → x = y → f x = g y ⊢ Fitree.bind (Fitree.case UBE.handle Fitree.liftHandler T✝ e✝) = Fitree.bind (Fitree.case UBE.handle Fitree.liftHandler T✝ e✝) case Vis.a T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) fequal2 : ∀ (α β : Type 1) (f g : α → β) (x y : α), f = g → x = y → f x = g y ⊢ (fun x => match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) | Except.error e => Fitree.ret (Except.error e)) = fun x => Fitree.bind (match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a) | Except.error e => Fitree.ret (Except.error e)) fun x => match x with | Except.error e => Fitree.ret (Except.error e) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x)
case Vis.a T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) fequal2 : ∀ (α β : Type 1) (f g : α → β) (x y : α), f = g → x = y → f x = g y ⊢ (fun x => match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) | Except.error e => Fitree.ret (Except.error e)) = fun x => Fitree.bind (match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a) | Except.error e => Fitree.ret (Except.error e)) fun x => match x with | Except.error e => Fitree.ret (Except.error e) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x)
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/UB.lean
interpUB'_bind
[90, 1]
[107, 28]
funext x
case Vis.a T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) fequal2 : ∀ (α β : Type 1) (f g : α → β) (x y : α), f = g → x = y → f x = g y ⊢ (fun x => match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) | Except.error e => Fitree.ret (Except.error e)) = fun x => Fitree.bind (match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a) | Except.error e => Fitree.ret (Except.error e)) fun x => match x with | Except.error e => Fitree.ret (Except.error e) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x)
case Vis.a.h T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) fequal2 : ∀ (α β : Type 1) (f g : α → β) (x y : α), f = g → x = y → f x = g y x : Except String T✝ ⊢ (match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) | Except.error e => Fitree.ret (Except.error e)) = Fitree.bind (match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a) | Except.error e => Fitree.ret (Except.error e)) fun x => match x with | Except.error e => Fitree.ret (Except.error e) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x)
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/UB.lean
interpUB'_bind
[90, 1]
[107, 28]
cases x <;> simp [ih]
case Vis.a.h T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) fequal2 : ∀ (α β : Type 1) (f g : α → β) (x y : α), f = g → x = y → f x = g y x : Except String T✝ ⊢ (match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) | Except.error e => Fitree.ret (Except.error e)) = Fitree.bind (match x with | Except.ok a => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a) | Except.error e => Fitree.ret (Except.error e)) fun x => match x with | Except.error e => Fitree.ret (Except.error e) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x)
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/UB.lean
interpUB'_bind
[90, 1]
[107, 28]
simp [h₁, h₂]
T : Type E : Type → Type R : Type k : T → Fitree (UBE +' E) R T✝ : Type e✝ : sum1 UBE E T✝ k✝ : T✝ → Fitree (UBE +' E) T ih : ∀ (a : T✝), Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (Fitree.bind (k✝ a) k) = Fitree.bind (Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k✝ a)) fun x => match x with | Except.error ε => Fitree.ret (Except.error ε) | Except.ok x => Fitree.interp (Fitree.case UBE.handle Fitree.liftHandler) (k x) α : Sort ?u.10648 β : Sort ?u.10649 f g : α → β x y : α h₁ : f = g h₂ : x = y ⊢ f x = g y
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/AST.lean
MLIR.AST.AttrDict.find_none
[594, 9]
[596, 35]
simp [AttrDict.find, List.find?]
α σ : Type ε : σ → Type n' : String δ : Dialect α σ ε ⊢ find (mk []) n' = none
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/AST.lean
MLIR.AST.AttrDict.find_next
[598, 9]
[603, 70]
cases H: n == n' <;> simp [AttrDict.find, List.find?, AttrEntry.key, AttrEntry.value, H]
α σ : Type ε : σ → Type n n' : String δ : Dialect α σ ε v : AttrValue δ l : List (AttrEntry δ) ⊢ find (mk (AttrEntry.mk n v :: l)) n' = if (n == n') = true then some v else find (mk l) n'
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
Tensor.eq_of_fields_eq
[38, 1]
[42, 10]
intros h_shape h_data
τ : MLIRTy t₁ t₂ : Tensor τ ⊢ t₁.shape = t₂.shape → t₁.data = t₂.data → t₁ = t₂
τ : MLIRTy t₁ t₂ : Tensor τ h_shape : t₁.shape = t₂.shape h_data : t₁.data = t₂.data ⊢ t₁ = t₂
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
Tensor.eq_of_fields_eq
[38, 1]
[42, 10]
cases t₁
τ : MLIRTy t₁ t₂ : Tensor τ h_shape : t₁.shape = t₂.shape h_data : t₁.data = t₂.data ⊢ t₁ = t₂
case mk τ : MLIRTy t₂ : Tensor τ shape✝ : List ℕ data✝ : List (MLIRType.eval τ) h_data_size✝ : List.length data✝ = shapeProd shape✝ h_shape : { shape := shape✝, data := data✝, h_data_size := h_data_size✝ }.shape = t₂.shape h_data : { shape := shape✝, data := data✝, h_data_size := h_data_size✝ }.data = t₂.data ⊢ { shape := shape✝, data := data✝, h_data_size := h_data_size✝ } = t₂
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
Tensor.eq_of_fields_eq
[38, 1]
[42, 10]
cases t₂
case mk τ : MLIRTy t₂ : Tensor τ shape✝ : List ℕ data✝ : List (MLIRType.eval τ) h_data_size✝ : List.length data✝ = shapeProd shape✝ h_shape : { shape := shape✝, data := data✝, h_data_size := h_data_size✝ }.shape = t₂.shape h_data : { shape := shape✝, data := data✝, h_data_size := h_data_size✝ }.data = t₂.data ⊢ { shape := shape✝, data := data✝, h_data_size := h_data_size✝ } = t₂
case mk.mk τ : MLIRTy shape✝¹ : List ℕ data✝¹ : List (MLIRType.eval τ) h_data_size✝¹ : List.length data✝¹ = shapeProd shape✝¹ shape✝ : List ℕ data✝ : List (MLIRType.eval τ) h_data_size✝ : List.length data✝ = shapeProd shape✝ h_shape : { shape := shape✝¹, data := data✝¹, h_data_size := h_data_size✝¹ }.shape = { shape := shape✝, data := data✝, h_data_size := h_data_size✝ }.shape h_data : { shape := shape✝¹, data := data✝¹, h_data_size := h_data_size✝¹ }.data = { shape := shape✝, data := data✝, h_data_size := h_data_size✝ }.data ⊢ { shape := shape✝¹, data := data✝¹, h_data_size := h_data_size✝¹ } = { shape := shape✝, data := data✝, h_data_size := h_data_size✝ }
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
Tensor.eq_of_fields_eq
[38, 1]
[42, 10]
simp at *
case mk.mk τ : MLIRTy shape✝¹ : List ℕ data✝¹ : List (MLIRType.eval τ) h_data_size✝¹ : List.length data✝¹ = shapeProd shape✝¹ shape✝ : List ℕ data✝ : List (MLIRType.eval τ) h_data_size✝ : List.length data✝ = shapeProd shape✝ h_shape : { shape := shape✝¹, data := data✝¹, h_data_size := h_data_size✝¹ }.shape = { shape := shape✝, data := data✝, h_data_size := h_data_size✝ }.shape h_data : { shape := shape✝¹, data := data✝¹, h_data_size := h_data_size✝¹ }.data = { shape := shape✝, data := data✝, h_data_size := h_data_size✝ }.data ⊢ { shape := shape✝¹, data := data✝¹, h_data_size := h_data_size✝¹ } = { shape := shape✝, data := data✝, h_data_size := h_data_size✝ }
case mk.mk τ : MLIRTy shape✝¹ : List ℕ data✝¹ : List (MLIRType.eval τ) h_data_size✝¹ : List.length data✝¹ = shapeProd shape✝¹ shape✝ : List ℕ data✝ : List (MLIRType.eval τ) h_data_size✝ : List.length data✝ = shapeProd shape✝ h_shape : shape✝¹ = shape✝ h_data : data✝¹ = data✝ ⊢ shape✝¹ = shape✝ ∧ data✝¹ = data✝
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
Tensor.eq_of_fields_eq
[38, 1]
[42, 10]
trivial
case mk.mk τ : MLIRTy shape✝¹ : List ℕ data✝¹ : List (MLIRType.eval τ) h_data_size✝¹ : List.length data✝¹ = shapeProd shape✝¹ shape✝ : List ℕ data✝ : List (MLIRType.eval τ) h_data_size✝ : List.length data✝ = shapeProd shape✝ h_shape : shape✝¹ = shape✝ h_data : data✝¹ = data✝ ⊢ shape✝¹ = shape✝ ∧ data✝¹ = data✝
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
Tensor.map_shape
[66, 1]
[68, 2]
simp [Tensor.map]
σ τ : MLIRTy v : Tensor σ f : MLIRType.eval σ → MLIRType.eval τ ⊢ v.shape = (map v f).shape
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
arg_equal_implies_fn_equal
[89, 1]
[91, 2]
simp [EQ]
α β : Type x y : α f : α → β EQ : x = y ⊢ f x = f y
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
arg_equal_implies_fn_equal_2
[93, 1]
[96, 2]
simp [EQα, EQβ]
α β γ : Type a a' : α b b' : β f : α → β → γ EQα : a = a' EQβ : b = b' ⊢ f a b = f a' b'
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
RankedTensor.eq_of_fields_eq
[127, 1]
[132, 43]
intros h_shape h_data
τ : DimList D : MLIRTy t₁ t₂ : RankedTensor τ D ⊢ t₁.toTensor.shape = t₂.toTensor.shape → t₁.toTensor.data = t₂.toTensor.data → t₁ = t₂
τ : DimList D : MLIRTy t₁ t₂ : RankedTensor τ D h_shape : t₁.toTensor.shape = t₂.toTensor.shape h_data : t₁.toTensor.data = t₂.toTensor.data ⊢ t₁ = t₂
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
RankedTensor.eq_of_fields_eq
[127, 1]
[132, 43]
suffices t₁.toTensor = t₂.toTensor by cases t₁; cases t₂; simp at *; trivial
τ : DimList D : MLIRTy t₁ t₂ : RankedTensor τ D h_shape : t₁.toTensor.shape = t₂.toTensor.shape h_data : t₁.toTensor.data = t₂.toTensor.data ⊢ t₁ = t₂
τ : DimList D : MLIRTy t₁ t₂ : RankedTensor τ D h_shape : t₁.toTensor.shape = t₂.toTensor.shape h_data : t₁.toTensor.data = t₂.toTensor.data ⊢ t₁.toTensor = t₂.toTensor
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
RankedTensor.eq_of_fields_eq
[127, 1]
[132, 43]
apply Tensor.eq_of_fields_eq <;> trivial
τ : DimList D : MLIRTy t₁ t₂ : RankedTensor τ D h_shape : t₁.toTensor.shape = t₂.toTensor.shape h_data : t₁.toTensor.data = t₂.toTensor.data ⊢ t₁.toTensor = t₂.toTensor
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
RankedTensor.eq_of_fields_eq
[127, 1]
[132, 43]
cases t₁
τ : DimList D : MLIRTy t₁ t₂ : RankedTensor τ D h_shape : t₁.toTensor.shape = t₂.toTensor.shape h_data : t₁.toTensor.data = t₂.toTensor.data this : t₁.toTensor = t₂.toTensor ⊢ t₁ = t₂
case mk τ : DimList D : MLIRTy t₂ : RankedTensor τ D toTensor✝ : Tensor D h_refines✝ : DimList.shapeRefines toTensor✝.shape τ = true h_shape : { toTensor := toTensor✝, h_refines := h_refines✝ }.toTensor.shape = t₂.toTensor.shape h_data : { toTensor := toTensor✝, h_refines := h_refines✝ }.toTensor.data = t₂.toTensor.data this : { toTensor := toTensor✝, h_refines := h_refines✝ }.toTensor = t₂.toTensor ⊢ { toTensor := toTensor✝, h_refines := h_refines✝ } = t₂
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
RankedTensor.eq_of_fields_eq
[127, 1]
[132, 43]
cases t₂
case mk τ : DimList D : MLIRTy t₂ : RankedTensor τ D toTensor✝ : Tensor D h_refines✝ : DimList.shapeRefines toTensor✝.shape τ = true h_shape : { toTensor := toTensor✝, h_refines := h_refines✝ }.toTensor.shape = t₂.toTensor.shape h_data : { toTensor := toTensor✝, h_refines := h_refines✝ }.toTensor.data = t₂.toTensor.data this : { toTensor := toTensor✝, h_refines := h_refines✝ }.toTensor = t₂.toTensor ⊢ { toTensor := toTensor✝, h_refines := h_refines✝ } = t₂
case mk.mk τ : DimList D : MLIRTy toTensor✝¹ : Tensor D h_refines✝¹ : DimList.shapeRefines toTensor✝¹.shape τ = true toTensor✝ : Tensor D h_refines✝ : DimList.shapeRefines toTensor✝.shape τ = true h_shape : { toTensor := toTensor✝¹, h_refines := h_refines✝¹ }.toTensor.shape = { toTensor := toTensor✝, h_refines := h_refines✝ }.toTensor.shape h_data : { toTensor := toTensor✝¹, h_refines := h_refines✝¹ }.toTensor.data = { toTensor := toTensor✝, h_refines := h_refines✝ }.toTensor.data this : { toTensor := toTensor✝¹, h_refines := h_refines✝¹ }.toTensor = { toTensor := toTensor✝, h_refines := h_refines✝ }.toTensor ⊢ { toTensor := toTensor✝¹, h_refines := h_refines✝¹ } = { toTensor := toTensor✝, h_refines := h_refines✝ }
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
RankedTensor.eq_of_fields_eq
[127, 1]
[132, 43]
simp at *
case mk.mk τ : DimList D : MLIRTy toTensor✝¹ : Tensor D h_refines✝¹ : DimList.shapeRefines toTensor✝¹.shape τ = true toTensor✝ : Tensor D h_refines✝ : DimList.shapeRefines toTensor✝.shape τ = true h_shape : { toTensor := toTensor✝¹, h_refines := h_refines✝¹ }.toTensor.shape = { toTensor := toTensor✝, h_refines := h_refines✝ }.toTensor.shape h_data : { toTensor := toTensor✝¹, h_refines := h_refines✝¹ }.toTensor.data = { toTensor := toTensor✝, h_refines := h_refines✝ }.toTensor.data this : { toTensor := toTensor✝¹, h_refines := h_refines✝¹ }.toTensor = { toTensor := toTensor✝, h_refines := h_refines✝ }.toTensor ⊢ { toTensor := toTensor✝¹, h_refines := h_refines✝¹ } = { toTensor := toTensor✝, h_refines := h_refines✝ }
case mk.mk τ : DimList D : MLIRTy toTensor✝¹ : Tensor D h_refines✝¹ : DimList.shapeRefines toTensor✝¹.shape τ = true toTensor✝ : Tensor D h_refines✝ : DimList.shapeRefines toTensor✝.shape τ = true h_shape : toTensor✝¹.shape = toTensor✝.shape h_data : toTensor✝¹.data = toTensor✝.data this : toTensor✝¹ = toTensor✝ ⊢ toTensor✝¹ = toTensor✝
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
RankedTensor.eq_of_fields_eq
[127, 1]
[132, 43]
trivial
case mk.mk τ : DimList D : MLIRTy toTensor✝¹ : Tensor D h_refines✝¹ : DimList.shapeRefines toTensor✝¹.shape τ = true toTensor✝ : Tensor D h_refines✝ : DimList.shapeRefines toTensor✝.shape τ = true h_shape : toTensor✝¹.shape = toTensor✝.shape h_data : toTensor✝¹.data = toTensor✝.data this : toTensor✝¹ = toTensor✝ ⊢ toTensor✝¹ = toTensor✝
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
reshape_self
[206, 1]
[208, 54]
simp [reshape, dim_known_project_eq H₁ t.h_refines]
τ : MLIRTy D : DimList H₁ H₂ : known D = true Hprod : prod D = prod D t : RankedTensor D τ ⊢ reshape D H₁ H₂ Hprod t = t
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
Vector.eq_of_fields_eq
[278, 1]
[282, 10]
intros h_scale h_data
τ fixed : List ℕ scalable : MLIRTy v₁ v₂ : Vector τ fixed scalable ⊢ v₁.scale = v₂.scale → v₁.data = v₂.data → v₁ = v₂
τ fixed : List ℕ scalable : MLIRTy v₁ v₂ : Vector τ fixed scalable h_scale : v₁.scale = v₂.scale h_data : v₁.data = v₂.data ⊢ v₁ = v₂
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
Vector.eq_of_fields_eq
[278, 1]
[282, 10]
cases v₁
τ fixed : List ℕ scalable : MLIRTy v₁ v₂ : Vector τ fixed scalable h_scale : v₁.scale = v₂.scale h_data : v₁.data = v₂.data ⊢ v₁ = v₂
case mk τ fixed : List ℕ scalable : MLIRTy v₂ : Vector τ fixed scalable scale✝ : List ℕ data✝ : List (MLIRType.eval scalable) h_scale_size✝ : List.length scale✝ = List.length fixed h_data_size✝ : List.length data✝ = size τ fixed scale✝ h_scale_size✝ h_scale : { scale := scale✝, data := data✝, h_scale_size := h_scale_size✝, h_data_size := h_data_size✝ }.scale = v₂.scale h_data : { scale := scale✝, data := data✝, h_scale_size := h_scale_size✝, h_data_size := h_data_size✝ }.data = v₂.data ⊢ { scale := scale✝, data := data✝, h_scale_size := h_scale_size✝, h_data_size := h_data_size✝ } = v₂
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
Vector.eq_of_fields_eq
[278, 1]
[282, 10]
cases v₂
case mk τ fixed : List ℕ scalable : MLIRTy v₂ : Vector τ fixed scalable scale✝ : List ℕ data✝ : List (MLIRType.eval scalable) h_scale_size✝ : List.length scale✝ = List.length fixed h_data_size✝ : List.length data✝ = size τ fixed scale✝ h_scale_size✝ h_scale : { scale := scale✝, data := data✝, h_scale_size := h_scale_size✝, h_data_size := h_data_size✝ }.scale = v₂.scale h_data : { scale := scale✝, data := data✝, h_scale_size := h_scale_size✝, h_data_size := h_data_size✝ }.data = v₂.data ⊢ { scale := scale✝, data := data✝, h_scale_size := h_scale_size✝, h_data_size := h_data_size✝ } = v₂
case mk.mk τ fixed : List ℕ scalable : MLIRTy scale✝¹ : List ℕ data✝¹ : List (MLIRType.eval scalable) h_scale_size✝¹ : List.length scale✝¹ = List.length fixed h_data_size✝¹ : List.length data✝¹ = size τ fixed scale✝¹ h_scale_size✝¹ scale✝ : List ℕ data✝ : List (MLIRType.eval scalable) h_scale_size✝ : List.length scale✝ = List.length fixed h_data_size✝ : List.length data✝ = size τ fixed scale✝ h_scale_size✝ h_scale : { scale := scale✝¹, data := data✝¹, h_scale_size := h_scale_size✝¹, h_data_size := h_data_size✝¹ }.scale = { scale := scale✝, data := data✝, h_scale_size := h_scale_size✝, h_data_size := h_data_size✝ }.scale h_data : { scale := scale✝¹, data := data✝¹, h_scale_size := h_scale_size✝¹, h_data_size := h_data_size✝¹ }.data = { scale := scale✝, data := data✝, h_scale_size := h_scale_size✝, h_data_size := h_data_size✝ }.data ⊢ { scale := scale✝¹, data := data✝¹, h_scale_size := h_scale_size✝¹, h_data_size := h_data_size✝¹ } = { scale := scale✝, data := data✝, h_scale_size := h_scale_size✝, h_data_size := h_data_size✝ }
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
Vector.eq_of_fields_eq
[278, 1]
[282, 10]
simp at *
case mk.mk τ fixed : List ℕ scalable : MLIRTy scale✝¹ : List ℕ data✝¹ : List (MLIRType.eval scalable) h_scale_size✝¹ : List.length scale✝¹ = List.length fixed h_data_size✝¹ : List.length data✝¹ = size τ fixed scale✝¹ h_scale_size✝¹ scale✝ : List ℕ data✝ : List (MLIRType.eval scalable) h_scale_size✝ : List.length scale✝ = List.length fixed h_data_size✝ : List.length data✝ = size τ fixed scale✝ h_scale_size✝ h_scale : { scale := scale✝¹, data := data✝¹, h_scale_size := h_scale_size✝¹, h_data_size := h_data_size✝¹ }.scale = { scale := scale✝, data := data✝, h_scale_size := h_scale_size✝, h_data_size := h_data_size✝ }.scale h_data : { scale := scale✝¹, data := data✝¹, h_scale_size := h_scale_size✝¹, h_data_size := h_data_size✝¹ }.data = { scale := scale✝, data := data✝, h_scale_size := h_scale_size✝, h_data_size := h_data_size✝ }.data ⊢ { scale := scale✝¹, data := data✝¹, h_scale_size := h_scale_size✝¹, h_data_size := h_data_size✝¹ } = { scale := scale✝, data := data✝, h_scale_size := h_scale_size✝, h_data_size := h_data_size✝ }
case mk.mk τ fixed : List ℕ scalable : MLIRTy scale✝¹ : List ℕ data✝¹ : List (MLIRType.eval scalable) h_scale_size✝¹ : List.length scale✝¹ = List.length fixed h_data_size✝¹ : List.length data✝¹ = size τ fixed scale✝¹ h_scale_size✝¹ scale✝ : List ℕ data✝ : List (MLIRType.eval scalable) h_scale_size✝ : List.length scale✝ = List.length fixed h_data_size✝ : List.length data✝ = size τ fixed scale✝ h_scale_size✝ h_scale : scale✝¹ = scale✝ h_data : data✝¹ = data✝ ⊢ scale✝¹ = scale✝ ∧ data✝¹ = data✝
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Dialects/BuiltinModel.lean
Vector.eq_of_fields_eq
[278, 1]
[282, 10]
trivial
case mk.mk τ fixed : List ℕ scalable : MLIRTy scale✝¹ : List ℕ data✝¹ : List (MLIRType.eval scalable) h_scale_size✝¹ : List.length scale✝¹ = List.length fixed h_data_size✝¹ : List.length data✝¹ = size τ fixed scale✝¹ h_scale_size✝¹ scale✝ : List ℕ data✝ : List (MLIRType.eval scalable) h_scale_size✝ : List.length scale✝ = List.length fixed h_data_size✝ : List.length data✝ = size τ fixed scale✝ h_scale_size✝ h_scale : scale✝¹ = scale✝ h_data : data✝¹ = data✝ ⊢ scale✝¹ = scale✝ ∧ data✝¹ = data✝
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.equiv_refl
[96, 1]
[97, 45]
intros name τ
α σ : Type ε : σ → Type δ : Dialect α σ ε scope : SSAScope δ ⊢ equiv scope scope
α σ : Type ε : σ → Type δ : Dialect α σ ε scope : SSAScope δ name : SSAVal τ : MLIRType δ ⊢ get name scope τ = get name scope τ
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.equiv_refl
[96, 1]
[97, 45]
rfl
α σ : Type ε : σ → Type δ : Dialect α σ ε scope : SSAScope δ name : SSAVal τ : MLIRType δ ⊢ get name scope τ = get name scope τ
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.equiv_symm
[99, 1]
[103, 11]
intros H name τ
α σ : Type ε : σ → Type δ : Dialect α σ ε scope scope' : SSAScope δ ⊢ equiv scope scope' → equiv scope' scope
α σ : Type ε : σ → Type δ : Dialect α σ ε scope scope' : SSAScope δ H : equiv scope scope' name : SSAVal τ : MLIRType δ ⊢ get name scope' τ = get name scope τ
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.equiv_symm
[99, 1]
[103, 11]
specialize H name τ
α σ : Type ε : σ → Type δ : Dialect α σ ε scope scope' : SSAScope δ H : equiv scope scope' name : SSAVal τ : MLIRType δ ⊢ get name scope' τ = get name scope τ
α σ : Type ε : σ → Type δ : Dialect α σ ε scope scope' : SSAScope δ name : SSAVal τ : MLIRType δ H : get name scope τ = get name scope' τ ⊢ get name scope' τ = get name scope τ
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.equiv_symm
[99, 1]
[103, 11]
simp [H]
α σ : Type ε : σ → Type δ : Dialect α σ ε scope scope' : SSAScope δ name : SSAVal τ : MLIRType δ H : get name scope τ = get name scope' τ ⊢ get name scope' τ = get name scope τ
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.equiv_trans
[105, 1]
[112, 16]
intros H1 scope₃ H2 name τ
α σ : Type ε : σ → Type δ : Dialect α σ ε scope₁ scope₂ : SSAScope δ ⊢ equiv scope₁ scope₂ → ∀ ⦃scope₃ : SSAScope δ⦄, equiv scope₂ scope₃ → equiv scope₁ scope₃
α σ : Type ε : σ → Type δ : Dialect α σ ε scope₁ scope₂ : SSAScope δ H1 : equiv scope₁ scope₂ scope₃ : SSAScope δ H2 : equiv scope₂ scope₃ name : SSAVal τ : MLIRType δ ⊢ get name scope₁ τ = get name scope₃ τ
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.equiv_trans
[105, 1]
[112, 16]
specialize H1 name τ
α σ : Type ε : σ → Type δ : Dialect α σ ε scope₁ scope₂ : SSAScope δ H1 : equiv scope₁ scope₂ scope₃ : SSAScope δ H2 : equiv scope₂ scope₃ name : SSAVal τ : MLIRType δ ⊢ get name scope₁ τ = get name scope₃ τ
α σ : Type ε : σ → Type δ : Dialect α σ ε scope₁ scope₂ scope₃ : SSAScope δ H2 : equiv scope₂ scope₃ name : SSAVal τ : MLIRType δ H1 : get name scope₁ τ = get name scope₂ τ ⊢ get name scope₁ τ = get name scope₃ τ
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.equiv_trans
[105, 1]
[112, 16]
specialize H2 name τ
α σ : Type ε : σ → Type δ : Dialect α σ ε scope₁ scope₂ scope₃ : SSAScope δ H2 : equiv scope₂ scope₃ name : SSAVal τ : MLIRType δ H1 : get name scope₁ τ = get name scope₂ τ ⊢ get name scope₁ τ = get name scope₃ τ
α σ : Type ε : σ → Type δ : Dialect α σ ε scope₁ scope₂ scope₃ : SSAScope δ name : SSAVal τ : MLIRType δ H1 : get name scope₁ τ = get name scope₂ τ H2 : get name scope₂ τ = get name scope₃ τ ⊢ get name scope₁ τ = get name scope₃ τ
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.equiv_trans
[105, 1]
[112, 16]
simp [H1, H2]
α σ : Type ε : σ → Type δ : Dialect α σ ε scope₁ scope₂ scope₃ : SSAScope δ name : SSAVal τ : MLIRType δ H1 : get name scope₁ τ = get name scope₂ τ H2 : get name scope₂ τ = get name scope₃ τ ⊢ get name scope₁ τ = get name scope₃ τ
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_to_getT
[114, 1]
[130, 14]
simp [H]
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ τ τ' : MLIRType δ v' : MLIRType.eval τ' H : τ' = τ ⊢ MLIRType.eval τ' = MLIRType.eval τ
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_to_getT
[114, 1]
[130, 14]
induction scope
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ τ : MLIRType δ ⊢ get name scope τ = match getT name scope with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none
case nil α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal τ : MLIRType δ ⊢ get name [] τ = match getT name [] with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none case cons α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal τ : MLIRType δ head✝ : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail✝ : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : get name tail✝ τ = match getT name tail✝ with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none ⊢ get name (head✝ :: tail✝) τ = match getT name (head✝ :: tail✝) with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_to_getT
[114, 1]
[130, 14]
case nil => simp
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal τ : MLIRType δ ⊢ get name [] τ = match getT name [] with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_to_getT
[114, 1]
[130, 14]
case cons head tail HInd => unfold getT get byCases Hname: head.fst = name case h2 => rw [HInd]
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal τ : MLIRType δ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : get name tail τ = match getT name tail with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none ⊢ get name (head :: tail) τ = match getT name (head :: tail) with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_to_getT
[114, 1]
[130, 14]
simp
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal τ : MLIRType δ ⊢ get name [] τ = match getT name [] with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_to_getT
[114, 1]
[130, 14]
unfold getT get
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal τ : MLIRType δ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : get name tail τ = match getT name tail with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none ⊢ get name (head :: tail) τ = match getT name (head :: tail) with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal τ : MLIRType δ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : get name tail τ = match getT name tail with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none ⊢ (if H : head.fst = name then if H' : head.2.fst = τ then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) head.2.snd) else none else get name tail τ) = match if head.fst = name then some { fst := head.2.fst, snd := head.2.snd } else getT name tail with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_to_getT
[114, 1]
[130, 14]
byCases Hname: head.fst = name
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal τ : MLIRType δ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : get name tail τ = match getT name tail with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none ⊢ (if H : head.fst = name then if H' : head.2.fst = τ then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) head.2.snd) else none else get name tail τ) = match if head.fst = name then some { fst := head.2.fst, snd := head.2.snd } else getT name tail with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none
case h2 α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal τ : MLIRType δ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : get name tail τ = match getT name tail with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none Hname : ¬head.fst = name ⊢ get name tail τ = match getT name tail with | none => none | some { fst := τ', snd := v' } => if h : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_to_getT
[114, 1]
[130, 14]
case h2 => rw [HInd]
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal τ : MLIRType δ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : get name tail τ = match getT name tail with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none Hname : ¬head.fst = name ⊢ get name tail τ = match getT name tail with | none => none | some { fst := τ', snd := v' } => if h : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_to_getT
[114, 1]
[130, 14]
rw [HInd]
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal τ : MLIRType δ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : get name tail τ = match getT name tail with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none Hname : ¬head.fst = name ⊢ get name tail τ = match getT name tail with | none => none | some { fst := τ', snd := v' } => if h : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_some_getT
[132, 1]
[142, 6]
rw [get_to_getT]
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ τ : MLIRType δ v : MLIRType.eval τ ⊢ get name scope τ = some v → getT name scope = some { fst := τ, snd := v }
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ τ : MLIRType δ v : MLIRType.eval τ ⊢ (match getT name scope with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none) = some v → getT name scope = some { fst := τ, snd := v }
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_some_getT
[132, 1]
[142, 6]
split <;> simp at * <;> try contradiction
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ τ : MLIRType δ v : MLIRType.eval τ ⊢ (match getT name scope with | none => none | some { fst := τ', snd := v' } => if H : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v') else none) = some v → getT name scope = some { fst := τ, snd := v }
case h_2 α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ τ : MLIRType δ v : MLIRType.eval τ x✝ : Option ((τ : MLIRType δ) × MLIRType.eval τ) τ'✝ : MLIRType δ v'✝ : MLIRType.eval τ'✝ heq✝ : getT name scope = some { fst := τ'✝, snd := v'✝ } ⊢ (if h : τ'✝ = τ then some (cast (_ : (match τ'✝ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v'✝) else none) = some v → getT name scope = some { fst := τ, snd := v }
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_some_getT
[132, 1]
[142, 6]
case h_2 _ τ' _ Hget => byCases Hτ: τ' = τ intros H rw [←H, Hget] rfl
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ τ : MLIRType δ v : MLIRType.eval τ x✝ : Option ((τ : MLIRType δ) × MLIRType.eval τ) τ' : MLIRType δ v'✝ : MLIRType.eval τ' Hget : getT name scope = some { fst := τ', snd := v'✝ } ⊢ (if h : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v'✝) else none) = some v → getT name scope = some { fst := τ, snd := v }
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_some_getT
[132, 1]
[142, 6]
byCases Hτ: τ' = τ
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ τ : MLIRType δ v : MLIRType.eval τ x✝ : Option ((τ : MLIRType δ) × MLIRType.eval τ) τ' : MLIRType δ v'✝ : MLIRType.eval τ' Hget : getT name scope = some { fst := τ', snd := v'✝ } ⊢ (if h : τ' = τ then some (cast (_ : (match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v'✝) else none) = some v → getT name scope = some { fst := τ, snd := v }
case h1 α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ τ : MLIRType δ v : MLIRType.eval τ x✝ : Option ((τ : MLIRType δ) × MLIRType.eval τ) v'✝ : MLIRType.eval τ Hget : getT name scope = some { fst := τ, snd := v'✝ } ⊢ cast (_ : (match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v'✝ = v → getT name scope = some { fst := τ, snd := v }
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_some_getT
[132, 1]
[142, 6]
intros H
case h1 α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ τ : MLIRType δ v : MLIRType.eval τ x✝ : Option ((τ : MLIRType δ) × MLIRType.eval τ) v'✝ : MLIRType.eval τ Hget : getT name scope = some { fst := τ, snd := v'✝ } ⊢ cast (_ : (match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v'✝ = v → getT name scope = some { fst := τ, snd := v }
case h1 α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ τ : MLIRType δ v : MLIRType.eval τ x✝ : Option ((τ : MLIRType δ) × MLIRType.eval τ) v'✝ : MLIRType.eval τ Hget : getT name scope = some { fst := τ, snd := v'✝ } H : cast (_ : (match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v'✝ = v ⊢ getT name scope = some { fst := τ, snd := v }
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_some_getT
[132, 1]
[142, 6]
rw [←H, Hget]
case h1 α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ τ : MLIRType δ v : MLIRType.eval τ x✝ : Option ((τ : MLIRType δ) × MLIRType.eval τ) v'✝ : MLIRType.eval τ Hget : getT name scope = some { fst := τ, snd := v'✝ } H : cast (_ : (match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v'✝ = v ⊢ getT name scope = some { fst := τ, snd := v }
case h1 α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ τ : MLIRType δ v : MLIRType.eval τ x✝ : Option ((τ : MLIRType δ) × MLIRType.eval τ) v'✝ : MLIRType.eval τ Hget : getT name scope = some { fst := τ, snd := v'✝ } H : cast (_ : (match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v'✝ = v ⊢ some { fst := τ, snd := v'✝ } = some { fst := τ, snd := cast (_ : (match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v'✝ }
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_some_getT
[132, 1]
[142, 6]
rfl
case h1 α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ τ : MLIRType δ v : MLIRType.eval τ x✝ : Option ((τ : MLIRType δ) × MLIRType.eval τ) v'✝ : MLIRType.eval τ Hget : getT name scope = some { fst := τ, snd := v'✝ } H : cast (_ : (match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v'✝ = v ⊢ some { fst := τ, snd := v'✝ } = some { fst := τ, snd := cast (_ : (match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) v'✝ }
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_none_get
[144, 1]
[150, 48]
induction scope <;> simp
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ ⊢ getT name scope = none → ∀ (τ : MLIRType δ), get name scope τ = none
case cons α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal head✝ : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail✝ : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : getT name tail✝ = none → ∀ (τ : MLIRType δ), get name tail✝ τ = none ⊢ (if head✝.fst = name then some head✝.2 else getT name tail✝) = none → ∀ (τ : MLIRType δ), (if head✝.fst = name then if h : head✝.2.fst = τ then some (cast (_ : (match head✝.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) head✝.2.snd) else none else get name tail✝ τ) = none
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_none_get
[144, 1]
[150, 48]
case cons head tail HInd => byCases Hname: head.fst = name <;> assumption
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : getT name tail = none → ∀ (τ : MLIRType δ), get name tail τ = none ⊢ (if head.fst = name then some head.2 else getT name tail) = none → ∀ (τ : MLIRType δ), (if head.fst = name then if h : head.2.fst = τ then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) head.2.snd) else none else get name tail τ) = none
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_none_get
[144, 1]
[150, 48]
byCases Hname: head.fst = name <;> assumption
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : getT name tail = none → ∀ (τ : MLIRType δ), get name tail τ = none ⊢ (if head.fst = name then some head.2 else getT name tail) = none → ∀ (τ : MLIRType δ), (if head.fst = name then if h : head.2.fst = τ then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) head.2.snd) else none else get name tail τ) = none
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_some_get
[152, 1]
[161, 8]
induction scope <;> simp
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ τ : MLIRType δ v : MLIRType.eval τ ⊢ getT name scope = some { fst := τ, snd := v } → get name scope τ = some v
case cons α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal τ : MLIRType δ v : MLIRType.eval τ head✝ : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail✝ : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : getT name tail✝ = some { fst := τ, snd := v } → get name tail✝ τ = some v ⊢ (if head✝.fst = name then some head✝.2 else getT name tail✝) = some { fst := τ, snd := v } → (if head✝.fst = name then if h : head✝.2.fst = τ then some (cast (_ : (match head✝.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) head✝.2.snd) else none else get name tail✝ τ) = some v
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_some_get
[152, 1]
[161, 8]
case cons head tail HInd => byCases Hname: head.fst = name <;> try assumption have ⟨headName, headτ, headVal⟩ := head; simp at * intros H; cases H simp;
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal τ : MLIRType δ v : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : getT name tail = some { fst := τ, snd := v } → get name tail τ = some v ⊢ (if head.fst = name then some head.2 else getT name tail) = some { fst := τ, snd := v } → (if head.fst = name then if h : head.2.fst = τ then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) head.2.snd) else none else get name tail τ) = some v
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_some_get
[152, 1]
[161, 8]
byCases Hname: head.fst = name <;> try assumption
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal τ : MLIRType δ v : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : getT name tail = some { fst := τ, snd := v } → get name tail τ = some v ⊢ (if head.fst = name then some head.2 else getT name tail) = some { fst := τ, snd := v } → (if head.fst = name then if h : head.2.fst = τ then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) head.2.snd) else none else get name tail τ) = some v
case h1 α σ : Type ε : σ → Type δ : Dialect α σ ε τ : MLIRType δ v : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : getT head.fst tail = some { fst := τ, snd := v } → get head.fst tail τ = some v ⊢ head.2 = { fst := τ, snd := v } → (if h : head.2.fst = τ then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) head.2.snd) else none) = some v
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_some_get
[152, 1]
[161, 8]
have ⟨headName, headτ, headVal⟩ := head
case h1 α σ : Type ε : σ → Type δ : Dialect α σ ε τ : MLIRType δ v : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : getT head.fst tail = some { fst := τ, snd := v } → get head.fst tail τ = some v ⊢ head.2 = { fst := τ, snd := v } → (if h : head.2.fst = τ then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) head.2.snd) else none) = some v
case h1 α σ : Type ε : σ → Type δ : Dialect α σ ε τ : MLIRType δ v : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) headName : SSAVal headτ : MLIRType δ headVal : MLIRType.eval headτ HInd : getT (headName, { fst := headτ, snd := headVal }).fst tail = some { fst := τ, snd := v } → get (headName, { fst := headτ, snd := headVal }).fst tail τ = some v ⊢ (headName, { fst := headτ, snd := headVal }).2 = { fst := τ, snd := v } → (if h : (headName, { fst := headτ, snd := headVal }).2.fst = τ then some (cast (_ : (match (headName, { fst := headτ, snd := headVal }).2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) (headName, { fst := headτ, snd := headVal }).2.snd) else none) = some v
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_some_get
[152, 1]
[161, 8]
simp at *
case h1 α σ : Type ε : σ → Type δ : Dialect α σ ε τ : MLIRType δ v : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) headName : SSAVal headτ : MLIRType δ headVal : MLIRType.eval headτ HInd : getT (headName, { fst := headτ, snd := headVal }).fst tail = some { fst := τ, snd := v } → get (headName, { fst := headτ, snd := headVal }).fst tail τ = some v ⊢ (headName, { fst := headτ, snd := headVal }).2 = { fst := τ, snd := v } → (if h : (headName, { fst := headτ, snd := headVal }).2.fst = τ then some (cast (_ : (match (headName, { fst := headτ, snd := headVal }).2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) (headName, { fst := headτ, snd := headVal }).2.snd) else none) = some v
case h1 α σ : Type ε : σ → Type δ : Dialect α σ ε τ : MLIRType δ v : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) headName : SSAVal headτ : MLIRType δ headVal : MLIRType.eval headτ HInd : getT headName tail = some { fst := τ, snd := v } → get headName tail τ = some v ⊢ headτ = τ → HEq headVal v → (if h : headτ = τ then some (cast (_ : (match (headName, { fst := headτ, snd := headVal }).2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) headVal) else none) = some v
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_some_get
[152, 1]
[161, 8]
intros H
case h1 α σ : Type ε : σ → Type δ : Dialect α σ ε τ : MLIRType δ v : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) headName : SSAVal headτ : MLIRType δ headVal : MLIRType.eval headτ HInd : getT headName tail = some { fst := τ, snd := v } → get headName tail τ = some v ⊢ headτ = τ → HEq headVal v → (if h : headτ = τ then some (cast (_ : (match (headName, { fst := headτ, snd := headVal }).2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) headVal) else none) = some v
case h1 α σ : Type ε : σ → Type δ : Dialect α σ ε τ : MLIRType δ v : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) headName : SSAVal headτ : MLIRType δ headVal : MLIRType.eval headτ HInd : getT headName tail = some { fst := τ, snd := v } → get headName tail τ = some v H : headτ = τ ⊢ HEq headVal v → (if h : headτ = τ then some (cast (_ : (match (headName, { fst := headτ, snd := headVal }).2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) headVal) else none) = some v
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_some_get
[152, 1]
[161, 8]
cases H
case h1 α σ : Type ε : σ → Type δ : Dialect α σ ε τ : MLIRType δ v : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) headName : SSAVal headτ : MLIRType δ headVal : MLIRType.eval headτ HInd : getT headName tail = some { fst := τ, snd := v } → get headName tail τ = some v H : headτ = τ ⊢ HEq headVal v → (if h : headτ = τ then some (cast (_ : (match (headName, { fst := headτ, snd := headVal }).2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) headVal) else none) = some v
case h1.refl α σ : Type ε : σ → Type δ : Dialect α σ ε τ : MLIRType δ v : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) headName : SSAVal HInd : getT headName tail = some { fst := τ, snd := v } → get headName tail τ = some v headVal : MLIRType.eval τ ⊢ HEq headVal v → (if h : τ = τ then some (cast (_ : (match (headName, { fst := τ, snd := headVal }).2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) headVal) else none) = some v
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_some_get
[152, 1]
[161, 8]
simp
case h1.refl α σ : Type ε : σ → Type δ : Dialect α σ ε τ : MLIRType δ v : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) headName : SSAVal HInd : getT headName tail = some { fst := τ, snd := v } → get headName tail τ = some v headVal : MLIRType.eval τ ⊢ HEq headVal v → (if h : τ = τ then some (cast (_ : (match (headName, { fst := τ, snd := headVal }).2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) headVal) else none) = some v
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_some_get
[152, 1]
[161, 8]
assumption
case h2 α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal τ : MLIRType δ v : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : getT name tail = some { fst := τ, snd := v } → get name tail τ = some v Hname : ¬head.fst = name ⊢ getT name tail = some { fst := τ, snd := v } → get name tail τ = some v
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_none_getT
[163, 1]
[169, 52]
induction scope <;> simp
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal scope : SSAScope δ ⊢ (∀ (τ : MLIRType δ), get name scope τ = none) → getT name scope = none
case cons α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal head✝ : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail✝ : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : (∀ (τ : MLIRType δ), get name tail✝ τ = none) → getT name tail✝ = none ⊢ (∀ (τ : MLIRType δ), (if head✝.fst = name then if h : head✝.2.fst = τ then some (cast (_ : (match head✝.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) head✝.2.snd) else none else get name tail✝ τ) = none) → (if head✝.fst = name then some head✝.2 else getT name tail✝) = none
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_none_getT
[163, 1]
[169, 52]
case cons head tail HInd => byCases Hname: head.fst = name <;> try assumption
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : (∀ (τ : MLIRType δ), get name tail τ = none) → getT name tail = none ⊢ (∀ (τ : MLIRType δ), (if head.fst = name then if h : head.2.fst = τ then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) head.2.snd) else none else get name tail τ) = none) → (if head.fst = name then some head.2 else getT name tail) = none
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_none_getT
[163, 1]
[169, 52]
byCases Hname: head.fst = name <;> try assumption
α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : (∀ (τ : MLIRType δ), get name tail τ = none) → getT name tail = none ⊢ (∀ (τ : MLIRType δ), (if head.fst = name then if h : head.2.fst = τ then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) = match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε σ | MLIRType.erased => Unit) head.2.snd) else none else get name tail τ) = none) → (if head.fst = name then some head.2 else getT name tail) = none
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_none_getT
[163, 1]
[169, 52]
assumption
case h2 α σ : Type ε : σ → Type δ : Dialect α σ ε name : SSAVal head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) HInd : (∀ (τ : MLIRType δ), get name tail τ = none) → getT name tail = none Hname : ¬head.fst = name ⊢ (∀ (τ : MLIRType δ), get name tail τ = none) → getT name tail = none
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_set_ne
[171, 1]
[183, 17]
intros Hne scope τ val
α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal ⊢ v' ≠ v → ∀ ⦃scope : SSAScope δ⦄ ⦃τ : MLIRType δ⦄ ⦃val : MLIRType.eval τ⦄, getT v (set v' τ val scope) = getT v scope
α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v scope : SSAScope δ τ : MLIRType δ val : MLIRType.eval τ ⊢ getT v (set v' τ val scope) = getT v scope
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_set_ne
[171, 1]
[183, 17]
induction scope with | nil => simp [Hne] | cons head tail => simp byCases H: head.fst = v' . simp [Hne] . byCases H2: head.fst = v assumption
α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v scope : SSAScope δ τ : MLIRType δ val : MLIRType.eval τ ⊢ getT v (set v' τ val scope) = getT v scope
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_set_ne
[171, 1]
[183, 17]
simp [Hne]
case nil α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ : MLIRType δ val : MLIRType.eval τ ⊢ getT v (set v' τ val []) = getT v []
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_set_ne
[171, 1]
[183, 17]
simp
case cons α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : getT v (set v' τ val tail) = getT v tail ⊢ getT v (set v' τ val (head :: tail)) = getT v (head :: tail)
case cons α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : getT v (set v' τ val tail) = getT v tail ⊢ getT v (if head.fst = v' then (head.fst, { fst := τ, snd := val }) :: tail else head :: set v' τ val tail) = if head.fst = v then some head.2 else getT v tail
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_set_ne
[171, 1]
[183, 17]
byCases H: head.fst = v'
case cons α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : getT v (set v' τ val tail) = getT v tail ⊢ getT v (if head.fst = v' then (head.fst, { fst := τ, snd := val }) :: tail else head :: set v' τ val tail) = if head.fst = v then some head.2 else getT v tail
case cons.h1 α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v : SSAVal τ : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) Hne : head.fst ≠ v tail_ih✝ : getT v (set head.fst τ val tail) = getT v tail ⊢ (if head.fst = v then some { fst := τ, snd := val } else getT v tail) = if head.fst = v then some head.2 else getT v tail case cons.h2 α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : getT v (set v' τ val tail) = getT v tail H : ¬head.fst = v' ⊢ (if head.fst = v then some head.2 else getT v (set v' τ val tail)) = if head.fst = v then some head.2 else getT v tail
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_set_ne
[171, 1]
[183, 17]
. simp [Hne]
case cons.h1 α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v : SSAVal τ : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) Hne : head.fst ≠ v tail_ih✝ : getT v (set head.fst τ val tail) = getT v tail ⊢ (if head.fst = v then some { fst := τ, snd := val } else getT v tail) = if head.fst = v then some head.2 else getT v tail case cons.h2 α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : getT v (set v' τ val tail) = getT v tail H : ¬head.fst = v' ⊢ (if head.fst = v then some head.2 else getT v (set v' τ val tail)) = if head.fst = v then some head.2 else getT v tail
case cons.h2 α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : getT v (set v' τ val tail) = getT v tail H : ¬head.fst = v' ⊢ (if head.fst = v then some head.2 else getT v (set v' τ val tail)) = if head.fst = v then some head.2 else getT v tail
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_set_ne
[171, 1]
[183, 17]
. byCases H2: head.fst = v assumption
case cons.h2 α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : getT v (set v' τ val tail) = getT v tail H : ¬head.fst = v' ⊢ (if head.fst = v then some head.2 else getT v (set v' τ val tail)) = if head.fst = v then some head.2 else getT v tail
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_set_eq
[185, 1]
[192, 15]
induction scope with | nil => simp | cons head tail => simp byCases H: head.fst = v assumption
α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ scope : SSAScope δ v : SSAVal τ : MLIRType δ val : MLIRType.eval τ ⊢ getT v (set v τ val scope) = some { fst := τ, snd := val }
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_set_eq
[185, 1]
[192, 15]
simp
case nil α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v : SSAVal τ : MLIRType δ val : MLIRType.eval τ ⊢ getT v (set v τ val []) = some { fst := τ, snd := val }
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_set_eq
[185, 1]
[192, 15]
simp
case cons α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v : SSAVal τ : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : getT v (set v τ val tail) = some { fst := τ, snd := val } ⊢ getT v (set v τ val (head :: tail)) = some { fst := τ, snd := val }
case cons α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v : SSAVal τ : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : getT v (set v τ val tail) = some { fst := τ, snd := val } ⊢ getT v (if head.fst = v then (head.fst, { fst := τ, snd := val }) :: tail else head :: set v τ val tail) = some { fst := τ, snd := val }
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_set_eq
[185, 1]
[192, 15]
byCases H: head.fst = v
case cons α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v : SSAVal τ : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : getT v (set v τ val tail) = some { fst := τ, snd := val } ⊢ getT v (if head.fst = v then (head.fst, { fst := τ, snd := val }) :: tail else head :: set v τ val tail) = some { fst := τ, snd := val }
case cons.h2 α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v : SSAVal τ : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : getT v (set v τ val tail) = some { fst := τ, snd := val } H : ¬head.fst = v ⊢ getT v (set v τ val tail) = some { fst := τ, snd := val }
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.getT_set_eq
[185, 1]
[192, 15]
assumption
case cons.h2 α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v : SSAVal τ : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ tail : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : getT v (set v τ val tail) = some { fst := τ, snd := val } H : ¬head.fst = v ⊢ getT v (set v τ val tail) = some { fst := τ, snd := val }
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_set_ne_val
[194, 1]
[205, 50]
intros Hne scope τ τ' val
α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal ⊢ v' ≠ v → ∀ ⦃scope : SSAScope δ⦄ ⦃τ τ' : MLIRType δ⦄ ⦃val : MLIRType.eval τ⦄, get v (set v' τ val scope) τ' = get v scope τ'
α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v scope : SSAScope δ τ τ' : MLIRType δ val : MLIRType.eval τ ⊢ get v (set v' τ val scope) τ' = get v scope τ'
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_set_ne_val
[194, 1]
[205, 50]
induction scope with | nil => simp [Hne] | cons head nil => simp byCases H: head.fst = v' . simp [Hne] . byCases H2: head.fst = v <;> try assumption
α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v scope : SSAScope δ τ τ' : MLIRType δ val : MLIRType.eval τ ⊢ get v (set v' τ val scope) τ' = get v scope τ'
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_set_ne_val
[194, 1]
[205, 50]
simp [Hne]
case nil α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ τ' : MLIRType δ val : MLIRType.eval τ ⊢ get v (set v' τ val []) τ' = get v [] τ'
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_set_ne_val
[194, 1]
[205, 50]
simp
case cons α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ τ' : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ nil : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : get v (set v' τ val nil) τ' = get v nil τ' ⊢ get v (set v' τ val (head :: nil)) τ' = get v (head :: nil) τ'
case cons α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ τ' : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ nil : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : get v (set v' τ val nil) τ' = get v nil τ' ⊢ get v (if head.fst = v' then (head.fst, { fst := τ, snd := val }) :: nil else head :: set v' τ val nil) τ' = if head.fst = v then if h : head.2.fst = τ' then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) = match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) head.2.snd) else none else get v nil τ'
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_set_ne_val
[194, 1]
[205, 50]
byCases H: head.fst = v'
case cons α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ τ' : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ nil : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : get v (set v' τ val nil) τ' = get v nil τ' ⊢ get v (if head.fst = v' then (head.fst, { fst := τ, snd := val }) :: nil else head :: set v' τ val nil) τ' = if head.fst = v then if h : head.2.fst = τ' then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) = match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) head.2.snd) else none else get v nil τ'
case cons.h1 α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v : SSAVal τ τ' : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ nil : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) Hne : head.fst ≠ v tail_ih✝ : get v (set head.fst τ val nil) τ' = get v nil τ' ⊢ (if head.fst = v then if h : τ = τ' then some (cast (_ : (match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) = match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) val) else none else get v nil τ') = if head.fst = v then if h : head.2.fst = τ' then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) = match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) head.2.snd) else none else get v nil τ' case cons.h2 α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ τ' : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ nil : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : get v (set v' τ val nil) τ' = get v nil τ' H : ¬head.fst = v' ⊢ (if head.fst = v then if h : head.2.fst = τ' then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) = match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) head.2.snd) else none else get v (set v' τ val nil) τ') = if head.fst = v then if h : head.2.fst = τ' then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) = match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) head.2.snd) else none else get v nil τ'
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_set_ne_val
[194, 1]
[205, 50]
. simp [Hne]
case cons.h1 α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v : SSAVal τ τ' : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ nil : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) Hne : head.fst ≠ v tail_ih✝ : get v (set head.fst τ val nil) τ' = get v nil τ' ⊢ (if head.fst = v then if h : τ = τ' then some (cast (_ : (match τ with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) = match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) val) else none else get v nil τ') = if head.fst = v then if h : head.2.fst = τ' then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) = match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) head.2.snd) else none else get v nil τ' case cons.h2 α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ τ' : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ nil : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : get v (set v' τ val nil) τ' = get v nil τ' H : ¬head.fst = v' ⊢ (if head.fst = v then if h : head.2.fst = τ' then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) = match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) head.2.snd) else none else get v (set v' τ val nil) τ') = if head.fst = v then if h : head.2.fst = τ' then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) = match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) head.2.snd) else none else get v nil τ'
case cons.h2 α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ τ' : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ nil : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : get v (set v' τ val nil) τ' = get v nil τ' H : ¬head.fst = v' ⊢ (if head.fst = v then if h : head.2.fst = τ' then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) = match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) head.2.snd) else none else get v (set v' τ val nil) τ') = if head.fst = v then if h : head.2.fst = τ' then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) = match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) head.2.snd) else none else get v nil τ'
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_set_ne_val
[194, 1]
[205, 50]
. byCases H2: head.fst = v <;> try assumption
case cons.h2 α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ τ' : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ nil : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : get v (set v' τ val nil) τ' = get v nil τ' H : ¬head.fst = v' ⊢ (if head.fst = v then if h : head.2.fst = τ' then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) = match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) head.2.snd) else none else get v (set v' τ val nil) τ') = if head.fst = v then if h : head.2.fst = τ' then some (cast (_ : (match head.2.fst with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) = match τ' with | MLIRType.float a => Float | MLIRType.int signedness sz => FinInt sz | MLIRType.tensor1d => Tensor1D | MLIRType.tensor2d => Tensor2D | MLIRType.tensor4d => Tensor4D | MLIRType.index => ℤ | MLIRType.undefined a => Unit | MLIRType.extended σ => ε✝ σ | MLIRType.erased => Unit) head.2.snd) else none else get v nil τ'
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_set_ne_val
[194, 1]
[205, 50]
assumption
case cons.h2.h2 α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ v v' : SSAVal Hne : v' ≠ v τ τ' : MLIRType δ val : MLIRType.eval τ head : SSAVal × (τ : MLIRType δ) × MLIRType.eval τ nil : List (SSAVal × (τ : MLIRType δ) × MLIRType.eval τ) tail_ih✝ : get v (set v' τ val nil) τ' = get v nil τ' H : ¬head.fst = v' H2 : ¬head.fst = v ⊢ get v (set v' τ val nil) τ' = get v nil τ'
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_set_ne_type
[207, 1]
[218, 50]
intros Hne scope v val
α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ τ τ' : MLIRType δ ⊢ τ' ≠ τ → ∀ ⦃scope : SSAScope δ⦄ ⦃v : SSAVal⦄ ⦃val : MLIRType.eval τ'⦄, get v (set v τ' val scope) τ = none
α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ τ τ' : MLIRType δ Hne : τ' ≠ τ scope : SSAScope δ v : SSAVal val : MLIRType.eval τ' ⊢ get v (set v τ' val scope) τ = none
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_set_ne_type
[207, 1]
[218, 50]
induction scope with | nil => simp [Hne] | cons head tail Hind => simp byCases H: head.fst = v . simp [Hne] . byCases H2: head.fst = v <;> try assumption
α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ τ τ' : MLIRType δ Hne : τ' ≠ τ scope : SSAScope δ v : SSAVal val : MLIRType.eval τ' ⊢ get v (set v τ' val scope) τ = none
no goals
https://github.com/opencompl/lean-mlir.git
e43d21592801e5e40477b14b7a554e356060c40c
MLIR/Semantics/SSAEnv.lean
SSAScope.get_set_ne_type
[207, 1]
[218, 50]
simp [Hne]
case nil α σ : Type ε : σ → Type α✝ σ✝ : Type ε✝ : σ✝ → Type δ : Dialect α✝ σ✝ ε✝ τ τ' : MLIRType δ Hne : τ' ≠ τ v : SSAVal val : MLIRType.eval τ' ⊢ get v (set v τ' val []) τ = none
no goals