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/Util/KDTensor.lean | Nat.le_mul_pred | [596, 1] | [610, 2] | case zero => {
rewrite [H] at LE;
simp at LE;
rewrite [LE];
simp;
} | x y n : β
LE : x β€ pred n
H : n = zero
β’ x * y β€ zero * y - y | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.le_mul_pred | [596, 1] | [610, 2] | case succ n' => {
simp at LE;
rewrite [H] at LE;
simp at LE;
sorry; } | x y n : β
LE : x β€ pred n
n' : β
H : n = succ n'
β’ x * y β€ succ n' * y - y | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.le_mul_pred | [596, 1] | [610, 2] | rewrite [H] at LE | x y n : β
LE : x β€ pred n
H : n = zero
β’ x * y β€ zero * y - y | x y n : β
LE : x β€ pred zero
H : n = zero
β’ x * y β€ zero * y - y |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.le_mul_pred | [596, 1] | [610, 2] | simp at LE | x y n : β
LE : x β€ pred zero
H : n = zero
β’ x * y β€ zero * y - y | x y n : β
H : n = zero
LE : x = 0
β’ x * y β€ zero * y - y |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.le_mul_pred | [596, 1] | [610, 2] | rewrite [LE] | x y n : β
H : n = zero
LE : x = 0
β’ x * y β€ zero * y - y | x y n : β
H : n = zero
LE : x = 0
β’ 0 * y β€ zero * y - y |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.le_mul_pred | [596, 1] | [610, 2] | simp | x y n : β
H : n = zero
LE : x = 0
β’ 0 * y β€ zero * y - y | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.le_mul_pred | [596, 1] | [610, 2] | rewrite [H] at LE | x y n : β
LE : x β€ pred n
n' : β
H : n = succ n'
β’ x * y β€ succ n' * y - y | x y n n' : β
LE : x β€ pred (succ n')
H : n = succ n'
β’ x * y β€ succ n' * y - y |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.le_mul_pred | [596, 1] | [610, 2] | simp at LE | x y n n' : β
LE : x β€ pred (succ n')
H : n = succ n'
β’ x * y β€ succ n' * y - y | x y n n' : β
LE : x β€ n'
H : n = succ n'
β’ x * y β€ succ n' * y - y |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.le_mul_pred | [596, 1] | [610, 2] | sorry | x y n n' : β
LE : x β€ n'
H : n = succ n'
β’ x * y β€ succ n' * y - y | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.NonEmpty.empty_absurd | [654, 1] | [656, 2] | cases CONTRA | Ξ± : Type
CONTRA : NonEmpty []
β’ False | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | TensorIndex'.empty_dims_is_empty | [659, 1] | [661, 2] | cases index | index : TensorIndex' []
β’ index = Empty | case Empty
β’ Empty = Empty |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | TensorIndex'.empty_dims_is_empty | [659, 1] | [661, 2] | simp | case Empty
β’ Empty = Empty | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.lt_iff_gt | [671, 1] | [682, 2] | intros a b | β’ β (a b : β), a < b β b > a | a b : β
β’ a < b β b > a |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.lt_iff_gt | [671, 1] | [682, 2] | constructor | a b : β
β’ a < b β b > a | case mp
a b : β
β’ a < b β b > a
case mpr
a b : β
β’ b > a β a < b |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.lt_iff_gt | [671, 1] | [682, 2] | case mp => {
intros A_LT_B;
simp [GT.gt]; exact A_LT_B;
} | a b : β
β’ a < b β b > a | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.lt_iff_gt | [671, 1] | [682, 2] | case mpr => {
intros B_GT_A;
simp [GT.gt] at B_GT_A;
exact B_GT_A;
} | a b : β
β’ b > a β a < b | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.lt_iff_gt | [671, 1] | [682, 2] | intros A_LT_B | a b : β
β’ a < b β b > a | a b : β
A_LT_B : a < b
β’ b > a |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.lt_iff_gt | [671, 1] | [682, 2] | simp [GT.gt] | a b : β
A_LT_B : a < b
β’ b > a | a b : β
A_LT_B : a < b
β’ a < b |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.lt_iff_gt | [671, 1] | [682, 2] | exact A_LT_B | a b : β
A_LT_B : a < b
β’ a < b | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.lt_iff_gt | [671, 1] | [682, 2] | intros B_GT_A | a b : β
β’ b > a β a < b | a b : β
B_GT_A : b > a
β’ a < b |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.lt_iff_gt | [671, 1] | [682, 2] | simp [GT.gt] at B_GT_A | a b : β
B_GT_A : b > a
β’ a < b | a b : β
B_GT_A : a < b
β’ a < b |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.lt_iff_gt | [671, 1] | [682, 2] | exact B_GT_A | a b : β
B_GT_A : a < b
β’ a < b | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | shapeProd_cons_prod | [719, 1] | [721, 2] | simp [Nat.mul_assoc] | x y : β
zs : List β
β’ shapeProd (x :: y :: zs) = shapeProd (x * y :: zs) | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.mul_of_nonzero_is_nonzero | [728, 1] | [747, 2] | intros a | β’ β (a b : β), a β 0 β b β 0 β a * b β 0 | a : β
β’ β (b : β), a β 0 β b β 0 β a * b β 0 |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.mul_of_nonzero_is_nonzero | [728, 1] | [747, 2] | induction a | a : β
β’ β (b : β), a β 0 β b β 0 β a * b β 0 | case zero
β’ β (b : β), zero β 0 β b β 0 β zero * b β 0
case succ
nβ : β
n_ihβ : β (b : β), nβ β 0 β b β 0 β nβ * b β 0
β’ β (b : β), succ nβ β 0 β b β 0 β succ nβ * b β 0 |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.mul_of_nonzero_is_nonzero | [728, 1] | [747, 2] | case zero => {
intros b A_NEQ_ZERO; simp [A_NEQ_ZERO]; contradiction;
} | β’ β (b : β), zero β 0 β b β 0 β zero * b β 0 | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.mul_of_nonzero_is_nonzero | [728, 1] | [747, 2] | case succ a' IH => {
intros b;
induction b;
case zero => {
intros A B;
simp at B;
}
case succ b' IH' => {
intros A B;
simp [Nat.mul];
}
} | a' : β
IH : β (b : β), a' β 0 β b β 0 β a' * b β 0
β’ β (b : β), succ a' β 0 β b β 0 β succ a' * b β 0 | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.mul_of_nonzero_is_nonzero | [728, 1] | [747, 2] | intros b A_NEQ_ZERO | β’ β (b : β), zero β 0 β b β 0 β zero * b β 0 | b : β
A_NEQ_ZERO : zero β 0
β’ b β 0 β zero * b β 0 |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.mul_of_nonzero_is_nonzero | [728, 1] | [747, 2] | simp [A_NEQ_ZERO] | b : β
A_NEQ_ZERO : zero β 0
β’ b β 0 β zero * b β 0 | b : β
A_NEQ_ZERO : zero β 0
β’ 0 < b β False |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.mul_of_nonzero_is_nonzero | [728, 1] | [747, 2] | contradiction | b : β
A_NEQ_ZERO : zero β 0
β’ 0 < b β False | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.mul_of_nonzero_is_nonzero | [728, 1] | [747, 2] | intros b | a' : β
IH : β (b : β), a' β 0 β b β 0 β a' * b β 0
β’ β (b : β), succ a' β 0 β b β 0 β succ a' * b β 0 | a' : β
IH : β (b : β), a' β 0 β b β 0 β a' * b β 0
b : β
β’ succ a' β 0 β b β 0 β succ a' * b β 0 |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.mul_of_nonzero_is_nonzero | [728, 1] | [747, 2] | induction b | a' : β
IH : β (b : β), a' β 0 β b β 0 β a' * b β 0
b : β
β’ succ a' β 0 β b β 0 β succ a' * b β 0 | case zero
a' : β
IH : β (b : β), a' β 0 β b β 0 β a' * b β 0
β’ succ a' β 0 β zero β 0 β succ a' * zero β 0
case succ
a' : β
IH : β (b : β), a' β 0 β b β 0 β a' * b β 0
nβ : β
n_ihβ : succ a' β 0 β nβ β 0 β succ a' * nβ β 0
β’ succ a' β 0 β succ nβ β 0 β succ a' * succ nβ β 0 |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.mul_of_nonzero_is_nonzero | [728, 1] | [747, 2] | case zero => {
intros A B;
simp at B;
} | a' : β
IH : β (b : β), a' β 0 β b β 0 β a' * b β 0
β’ succ a' β 0 β zero β 0 β succ a' * zero β 0 | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.mul_of_nonzero_is_nonzero | [728, 1] | [747, 2] | case succ b' IH' => {
intros A B;
simp [Nat.mul];
} | a' : β
IH : β (b : β), a' β 0 β b β 0 β a' * b β 0
b' : β
IH' : succ a' β 0 β b' β 0 β succ a' * b' β 0
β’ succ a' β 0 β succ b' β 0 β succ a' * succ b' β 0 | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.mul_of_nonzero_is_nonzero | [728, 1] | [747, 2] | intros A B | a' : β
IH : β (b : β), a' β 0 β b β 0 β a' * b β 0
β’ succ a' β 0 β zero β 0 β succ a' * zero β 0 | a' : β
IH : β (b : β), a' β 0 β b β 0 β a' * b β 0
A : succ a' β 0
B : zero β 0
β’ succ a' * zero β 0 |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.mul_of_nonzero_is_nonzero | [728, 1] | [747, 2] | simp at B | a' : β
IH : β (b : β), a' β 0 β b β 0 β a' * b β 0
A : succ a' β 0
B : zero β 0
β’ succ a' * zero β 0 | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.mul_of_nonzero_is_nonzero | [728, 1] | [747, 2] | intros A B | a' : β
IH : β (b : β), a' β 0 β b β 0 β a' * b β 0
b' : β
IH' : succ a' β 0 β b' β 0 β succ a' * b' β 0
β’ succ a' β 0 β succ b' β 0 β succ a' * succ b' β 0 | a' : β
IH : β (b : β), a' β 0 β b β 0 β a' * b β 0
b' : β
IH' : succ a' β 0 β b' β 0 β succ a' * b' β 0
A : succ a' β 0
B : succ b' β 0
β’ succ a' * succ b' β 0 |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Nat.mul_of_nonzero_is_nonzero | [728, 1] | [747, 2] | simp [Nat.mul] | a' : β
IH : β (b : β), a' β 0 β b β 0 β a' * b β 0
b' : β
IH' : succ a' β 0 β b' β 0 β succ a' * b' β 0
A : succ a' β 0
B : succ b' β 0
β’ succ a' * succ b' β 0 | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | zip_flat_index_go_length | [777, 1] | [788, 2] | induction xs | Ξ± : Type u_1
xs : List Ξ±
β’ β (ix bound : β) (H : ix + List.length xs = bound), List.length xs = List.length (zipFlatIndexGo xs ix bound H) | case nil
Ξ± : Type u_1
β’ β (ix bound : β) (H : ix + List.length [] = bound), List.length [] = List.length (zipFlatIndexGo [] ix bound H)
case cons
Ξ± : Type u_1
headβ : Ξ±
tailβ : List Ξ±
tail_ihβ :
β (ix bound : β) (H : ix + List.length tailβ = bound),
List.length tailβ = List.length (zipFlatIndexGo tailβ ix bound ... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | zip_flat_index_go_length | [777, 1] | [788, 2] | case nil => {
intros; unfold zipFlatIndexGo; rfl;
} | Ξ± : Type u_1
β’ β (ix bound : β) (H : ix + List.length [] = bound), List.length [] = List.length (zipFlatIndexGo [] ix bound H) | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | zip_flat_index_go_length | [777, 1] | [788, 2] | case cons x xs' IND => {
intros ix bound H;
simp [zipFlatIndexGo];
apply IND;
} | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND : β (ix bound : β) (H : ix + List.length xs' = bound), List.length xs' = List.length (zipFlatIndexGo xs' ix bound H)
β’ β (ix bound : β) (H : ix + List.length (x :: xs') = bound),
List.length (x :: xs') = List.length (zipFlatIndexGo (x :: xs') ix bound H) | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | zip_flat_index_go_length | [777, 1] | [788, 2] | intros | Ξ± : Type u_1
β’ β (ix bound : β) (H : ix + List.length [] = bound), List.length [] = List.length (zipFlatIndexGo [] ix bound H) | Ξ± : Type u_1
ixβ boundβ : β
Hβ : ixβ + List.length [] = boundβ
β’ List.length [] = List.length (zipFlatIndexGo [] ixβ boundβ Hβ) |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | zip_flat_index_go_length | [777, 1] | [788, 2] | unfold zipFlatIndexGo | Ξ± : Type u_1
ixβ boundβ : β
Hβ : ixβ + List.length [] = boundβ
β’ List.length [] = List.length (zipFlatIndexGo [] ixβ boundβ Hβ) | Ξ± : Type u_1
ixβ boundβ : β
Hβ : ixβ + List.length [] = boundβ
β’ List.length [] = List.length [] |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | zip_flat_index_go_length | [777, 1] | [788, 2] | rfl | Ξ± : Type u_1
ixβ boundβ : β
Hβ : ixβ + List.length [] = boundβ
β’ List.length [] = List.length [] | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | zip_flat_index_go_length | [777, 1] | [788, 2] | intros ix bound H | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND : β (ix bound : β) (H : ix + List.length xs' = bound), List.length xs' = List.length (zipFlatIndexGo xs' ix bound H)
β’ β (ix bound : β) (H : ix + List.length (x :: xs') = bound),
List.length (x :: xs') = List.length (zipFlatIndexGo (x :: xs') ix bound H) | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND : β (ix bound : β) (H : ix + List.length xs' = bound), List.length xs' = List.length (zipFlatIndexGo xs' ix bound H)
ix bound : β
H : ix + List.length (x :: xs') = bound
β’ List.length (x :: xs') = List.length (zipFlatIndexGo (x :: xs') ix bound H) |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | zip_flat_index_go_length | [777, 1] | [788, 2] | simp [zipFlatIndexGo] | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND : β (ix bound : β) (H : ix + List.length xs' = bound), List.length xs' = List.length (zipFlatIndexGo xs' ix bound H)
ix bound : β
H : ix + List.length (x :: xs') = bound
β’ List.length (x :: xs') = List.length (zipFlatIndexGo (x :: xs') ix bound H) | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND : β (ix bound : β) (H : ix + List.length xs' = bound), List.length xs' = List.length (zipFlatIndexGo xs' ix bound H)
ix bound : β
H : ix + List.length (x :: xs') = bound
β’ List.length xs' = List.length (zipFlatIndexGo xs' (ix + 1) bound (_ : ix + 1 + List.length xs' = bound)) |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | zip_flat_index_go_length | [777, 1] | [788, 2] | apply IND | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND : β (ix bound : β) (H : ix + List.length xs' = bound), List.length xs' = List.length (zipFlatIndexGo xs' ix bound H)
ix bound : β
H : ix + List.length (x :: xs') = bound
β’ List.length xs' = List.length (zipFlatIndexGo xs' (ix + 1) bound (_ : ix + 1 + List.length xs' = bound)) | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | rewrite [<- H] | Ξ± : Type ?u.95188
xs : List Ξ±
ix bound : β
H : ix + length xs = bound
deltaIx : β
GETIX : deltaIx < length xs
β’ ix + deltaIx < bound | Ξ± : Type ?u.95188
xs : List Ξ±
ix bound : β
H : ix + length xs = bound
deltaIx : β
GETIX : deltaIx < length xs
β’ ix + deltaIx < ix + length xs |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | simp [Nat.add_lt_add_left, GETIX] | Ξ± : Type ?u.95188
xs : List Ξ±
ix bound : β
H : ix + length xs = bound
deltaIx : β
GETIX : deltaIx < length xs
β’ ix + deltaIx < ix + length xs | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | intros xs | Ξ± : Type u_1
β’ β (xs : List Ξ±) (ix bound : β) (H : ix + length xs = bound) (deltaIx : β) (GETIX : deltaIx < length xs),
getF (zipFlatIndexGo xs ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs ix bound H)) =
(getF xs deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + deltaIx < bound) }... | Ξ± : Type u_1
xs : List Ξ±
β’ β (ix bound : β) (H : ix + length xs = bound) (deltaIx : β) (GETIX : deltaIx < length xs),
getF (zipFlatIndexGo xs ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs ix bound H)) =
(getF xs deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + deltaIx < bound) }) |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | induction xs | Ξ± : Type u_1
xs : List Ξ±
β’ β (ix bound : β) (H : ix + length xs = bound) (deltaIx : β) (GETIX : deltaIx < length xs),
getF (zipFlatIndexGo xs ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs ix bound H)) =
(getF xs deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + deltaIx < bound) }) | case nil
Ξ± : Type u_1
β’ β (ix bound : β) (H : ix + length [] = bound) (deltaIx : β) (GETIX : deltaIx < length []),
getF (zipFlatIndexGo [] ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo [] ix bound H)) =
(getF [] deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + deltaIx < bound) })
ca... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | case nil => {
intros ix bound H deltaIx GETIX;
simp [List.length, Nat.not_lt_zero] at GETIX;
} | Ξ± : Type u_1
β’ β (ix bound : β) (H : ix + length [] = bound) (deltaIx : β) (GETIX : deltaIx < length []),
getF (zipFlatIndexGo [] ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo [] ix bound H)) =
(getF [] deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + deltaIx < bound) }) | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | case cons x xs' IND => {
intros ix bound H deltaIx GETIX; cases deltaIx;
case zero => {
simp;
simp [zipFlatIndexGo, List.getF]
}
case succ deltaIx' => {
simp [zipFlatIndexGo];
simp [List.getF];
rewrite [IND];
simp [Nat.add_assoc, Nat.add_one, Nat.succ_add, Nat.add_succ];
simp at GETIX;
app... | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + de... | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | intros ix bound H deltaIx GETIX | Ξ± : Type u_1
β’ β (ix bound : β) (H : ix + length [] = bound) (deltaIx : β) (GETIX : deltaIx < length []),
getF (zipFlatIndexGo [] ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo [] ix bound H)) =
(getF [] deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + deltaIx < bound) }) | Ξ± : Type u_1
ix bound : β
H : ix + length [] = bound
deltaIx : β
GETIX : deltaIx < length []
β’ getF (zipFlatIndexGo [] ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo [] ix bound H)) =
(getF [] deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + deltaIx < bound) }) |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | simp [List.length, Nat.not_lt_zero] at GETIX | Ξ± : Type u_1
ix bound : β
H : ix + length [] = bound
deltaIx : β
GETIX : deltaIx < length []
β’ getF (zipFlatIndexGo [] ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo [] ix bound H)) =
(getF [] deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + deltaIx < bound) }) | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | intros ix bound H deltaIx GETIX | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + de... | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + de... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | cases deltaIx | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + de... | case zero
Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | case zero => {
simp;
simp [zipFlatIndexGo, List.getF]
} | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + de... | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | case succ deltaIx' => {
simp [zipFlatIndexGo];
simp [List.getF];
rewrite [IND];
simp [Nat.add_assoc, Nat.add_one, Nat.succ_add, Nat.add_succ];
simp at GETIX;
apply Nat.lt_of_succ_lt_succ;
exact GETIX;
} | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + de... | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | simp | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + de... | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + de... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | simp [zipFlatIndexGo, List.getF] | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + de... | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | simp [zipFlatIndexGo] | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + de... | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + de... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | simp [List.getF] | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + de... | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + de... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | rewrite [IND] | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + de... | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + de... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | simp [Nat.add_assoc, Nat.add_one, Nat.succ_add, Nat.add_succ] | Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (_ : ix + de... | case GETIX
Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | simp at GETIX | case GETIX
Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (... | case GETIX
Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | apply Nat.lt_of_succ_lt_succ | case GETIX
Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound := (... | case GETIX.a
Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound :=... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_go_get | [795, 1] | [824, 2] | exact GETIX | case GETIX.a
Ξ± : Type u_1
x : Ξ±
xs' : List Ξ±
IND :
β (ix bound : β) (H : ix + length xs' = bound) (deltaIx : β) (GETIX : deltaIx < length xs'),
getF (zipFlatIndexGo xs' ix bound H) deltaIx (_ : deltaIx < length (zipFlatIndexGo xs' ix bound H)) =
(getF xs' deltaIx GETIX, { ix := ix + deltaIx, h_ix_inbound :=... | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.length_zip_flat_index | [833, 1] | [836, 2] | apply Eq.symm | Ξ± : Type u_1
xs : List Ξ±
β’ length (zipFlatIndex xs) = length xs | case h
Ξ± : Type u_1
xs : List Ξ±
β’ length xs = length (zipFlatIndex xs) |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.length_zip_flat_index | [833, 1] | [836, 2] | apply zip_flat_index_go_length | case h
Ξ± : Type u_1
xs : List Ξ±
β’ length xs = length (zipFlatIndex xs) | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_get | [839, 1] | [847, 2] | simp | Ξ± : Type ?u.103966
xs : List Ξ±
getIx : β
GETIX : getIx < length xs
β’ getIx < length (zipFlatIndex xs) | Ξ± : Type ?u.103966
xs : List Ξ±
getIx : β
GETIX : getIx < length xs
β’ getIx < length xs |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_get | [839, 1] | [847, 2] | apply GETIX | Ξ± : Type ?u.103966
xs : List Ξ±
getIx : β
GETIX : getIx < length xs
β’ getIx < length xs | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_get | [839, 1] | [847, 2] | simp[zipFlatIndex] | Ξ± : Type u_1
xs : List Ξ±
getIx : β
GETIX : getIx < length xs
β’ getF (zipFlatIndex xs) getIx (_ : getIx < length (zipFlatIndex xs)) =
(getF xs getIx GETIX, { ix := getIx, h_ix_inbound := GETIX }) | Ξ± : Type u_1
xs : List Ξ±
getIx : β
GETIX : getIx < length xs
β’ getF (zipFlatIndexGo xs 0 (length xs) (_ : 0 + length xs = length xs)) getIx
(_ : getIx < length (zipFlatIndexGo xs 0 (length xs) (_ : 0 + length xs = length xs))) =
(getF xs getIx GETIX, { ix := getIx, h_ix_inbound := GETIX }) |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_get | [839, 1] | [847, 2] | have RHS : { ix := getIx, h_ix_inbound := GETIX : TensorFlatIndex (xs.length) } = {ix := 0 + getIx, h_ix_inbound := by { simp; apply GETIX } : TensorFlatIndex (xs.length)} := by {
simp;
} | Ξ± : Type u_1
xs : List Ξ±
getIx : β
GETIX : getIx < length xs
β’ getF (zipFlatIndexGo xs 0 (length xs) (_ : 0 + length xs = length xs)) getIx
(_ : getIx < length (zipFlatIndexGo xs 0 (length xs) (_ : 0 + length xs = length xs))) =
(getF xs getIx GETIX, { ix := getIx, h_ix_inbound := GETIX }) | Ξ± : Type u_1
xs : List Ξ±
getIx : β
GETIX : getIx < length xs
RHS : { ix := getIx, h_ix_inbound := GETIX } = { ix := 0 + getIx, h_ix_inbound := (_ : 0 + getIx < length xs) }
β’ getF (zipFlatIndexGo xs 0 (length xs) (_ : 0 + length xs = length xs)) getIx
(_ : getIx < length (zipFlatIndexGo xs 0 (length xs) (_ : 0 + ... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_get | [839, 1] | [847, 2] | rewrite [RHS] | Ξ± : Type u_1
xs : List Ξ±
getIx : β
GETIX : getIx < length xs
RHS : { ix := getIx, h_ix_inbound := GETIX } = { ix := 0 + getIx, h_ix_inbound := (_ : 0 + getIx < length xs) }
β’ getF (zipFlatIndexGo xs 0 (length xs) (_ : 0 + length xs = length xs)) getIx
(_ : getIx < length (zipFlatIndexGo xs 0 (length xs) (_ : 0 + ... | Ξ± : Type u_1
xs : List Ξ±
getIx : β
GETIX : getIx < length xs
RHS : { ix := getIx, h_ix_inbound := GETIX } = { ix := 0 + getIx, h_ix_inbound := (_ : 0 + getIx < length xs) }
β’ getF (zipFlatIndexGo xs 0 (length xs) (_ : 0 + length xs = length xs)) getIx
(_ : getIx < length (zipFlatIndexGo xs 0 (length xs) (_ : 0 + ... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_get | [839, 1] | [847, 2] | apply List.zip_flat_index_go_get (xs := xs) (ix := 0) (bound := List.length xs) (deltaIx := getIx) (GETIX := GETIX) | Ξ± : Type u_1
xs : List Ξ±
getIx : β
GETIX : getIx < length xs
RHS : { ix := getIx, h_ix_inbound := GETIX } = { ix := 0 + getIx, h_ix_inbound := (_ : 0 + getIx < length xs) }
β’ getF (zipFlatIndexGo xs 0 (length xs) (_ : 0 + length xs = length xs)) getIx
(_ : getIx < length (zipFlatIndexGo xs 0 (length xs) (_ : 0 + ... | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_get | [839, 1] | [847, 2] | simp | Ξ± : Type u_1
xs : List Ξ±
getIx : β
GETIX : getIx < length xs
β’ 0 + getIx < length xs | Ξ± : Type u_1
xs : List Ξ±
getIx : β
GETIX : getIx < length xs
β’ getIx < length xs |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_get | [839, 1] | [847, 2] | apply GETIX | Ξ± : Type u_1
xs : List Ξ±
getIx : β
GETIX : getIx < length xs
β’ getIx < length xs | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.zip_flat_index_get | [839, 1] | [847, 2] | simp | Ξ± : Type u_1
xs : List Ξ±
getIx : β
GETIX : getIx < length xs
β’ { ix := getIx, h_ix_inbound := GETIX } = { ix := 0 + getIx, h_ix_inbound := (_ : 0 + getIx < length xs) } | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.mapM_loop_map | [874, 1] | [884, 63] | intros h | M : Type u_1 β Type u_2
Ξ± : Type u_3
Ξ² : Type u_1
instβΒΉ : Monad M
instβ : LawfulMonad M
l : List Ξ±
f : Ξ± β Ξ²
fM : Ξ± β M Ξ²
results : List Ξ²
β’ (β (a : Ξ±), fM a = pure (f a)) β mapM.loop fM l results = pure (reverse results ++ map f l) | M : Type u_1 β Type u_2
Ξ± : Type u_3
Ξ² : Type u_1
instβΒΉ : Monad M
instβ : LawfulMonad M
l : List Ξ±
f : Ξ± β Ξ²
fM : Ξ± β M Ξ²
results : List Ξ²
h : β (a : Ξ±), fM a = pure (f a)
β’ mapM.loop fM l results = pure (reverse results ++ map f l) |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.mapM_loop_map | [874, 1] | [884, 63] | revert results | M : Type u_1 β Type u_2
Ξ± : Type u_3
Ξ² : Type u_1
instβΒΉ : Monad M
instβ : LawfulMonad M
l : List Ξ±
f : Ξ± β Ξ²
fM : Ξ± β M Ξ²
results : List Ξ²
h : β (a : Ξ±), fM a = pure (f a)
β’ mapM.loop fM l results = pure (reverse results ++ map f l) | M : Type u_1 β Type u_2
Ξ± : Type u_3
Ξ² : Type u_1
instβΒΉ : Monad M
instβ : LawfulMonad M
l : List Ξ±
f : Ξ± β Ξ²
fM : Ξ± β M Ξ²
h : β (a : Ξ±), fM a = pure (f a)
β’ β (results : List Ξ²), mapM.loop fM l results = pure (reverse results ++ map f l) |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.mapM_loop_map | [874, 1] | [884, 63] | induction l with
| nil => intros results; simp [map];
| cons a l ih =>
intros results
simp [mapM.loop, map, h, ih, reverse_cons, append_assoc] | M : Type u_1 β Type u_2
Ξ± : Type u_3
Ξ² : Type u_1
instβΒΉ : Monad M
instβ : LawfulMonad M
l : List Ξ±
f : Ξ± β Ξ²
fM : Ξ± β M Ξ²
h : β (a : Ξ±), fM a = pure (f a)
β’ β (results : List Ξ²), mapM.loop fM l results = pure (reverse results ++ map f l) | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.mapM_loop_map | [874, 1] | [884, 63] | intros results | case nil
M : Type u_1 β Type u_2
Ξ± : Type u_3
Ξ² : Type u_1
instβΒΉ : Monad M
instβ : LawfulMonad M
f : Ξ± β Ξ²
fM : Ξ± β M Ξ²
h : β (a : Ξ±), fM a = pure (f a)
β’ β (results : List Ξ²), mapM.loop fM [] results = pure (reverse results ++ map f []) | case nil
M : Type u_1 β Type u_2
Ξ± : Type u_3
Ξ² : Type u_1
instβΒΉ : Monad M
instβ : LawfulMonad M
f : Ξ± β Ξ²
fM : Ξ± β M Ξ²
h : β (a : Ξ±), fM a = pure (f a)
results : List Ξ²
β’ mapM.loop fM [] results = pure (reverse results ++ map f []) |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.mapM_loop_map | [874, 1] | [884, 63] | simp [map] | case nil
M : Type u_1 β Type u_2
Ξ± : Type u_3
Ξ² : Type u_1
instβΒΉ : Monad M
instβ : LawfulMonad M
f : Ξ± β Ξ²
fM : Ξ± β M Ξ²
h : β (a : Ξ±), fM a = pure (f a)
results : List Ξ²
β’ mapM.loop fM [] results = pure (reverse results ++ map f []) | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.mapM_loop_map | [874, 1] | [884, 63] | intros results | case cons
M : Type u_1 β Type u_2
Ξ± : Type u_3
Ξ² : Type u_1
instβΒΉ : Monad M
instβ : LawfulMonad M
f : Ξ± β Ξ²
fM : Ξ± β M Ξ²
h : β (a : Ξ±), fM a = pure (f a)
a : Ξ±
l : List Ξ±
ih : β (results : List Ξ²), mapM.loop fM l results = pure (reverse results ++ map f l)
β’ β (results : List Ξ²), mapM.loop fM (a :: l) results = pure (... | case cons
M : Type u_1 β Type u_2
Ξ± : Type u_3
Ξ² : Type u_1
instβΒΉ : Monad M
instβ : LawfulMonad M
f : Ξ± β Ξ²
fM : Ξ± β M Ξ²
h : β (a : Ξ±), fM a = pure (f a)
a : Ξ±
l : List Ξ±
ih : β (results : List Ξ²), mapM.loop fM l results = pure (reverse results ++ map f l)
results : List Ξ²
β’ mapM.loop fM (a :: l) results = pure (rever... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.mapM_loop_map | [874, 1] | [884, 63] | simp [mapM.loop, map, h, ih, reverse_cons, append_assoc] | case cons
M : Type u_1 β Type u_2
Ξ± : Type u_3
Ξ² : Type u_1
instβΒΉ : Monad M
instβ : LawfulMonad M
f : Ξ± β Ξ²
fM : Ξ± β M Ξ²
h : β (a : Ξ±), fM a = pure (f a)
a : Ξ±
l : List Ξ±
ih : β (results : List Ξ²), mapM.loop fM l results = pure (reverse results ++ map f l)
results : List Ξ²
β’ mapM.loop fM (a :: l) results = pure (rever... | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | List.mapM_map | [886, 1] | [889, 27] | apply List.mapM_loop_map | M : Type u_1 β Type u_2
Ξ± : Type u_3
Ξ² : Type u_1
instβΒΉ : Monad M
instβ : LawfulMonad M
l : List Ξ±
f : Ξ± β Ξ²
fM : Ξ± β M Ξ²
β’ (β (a : Ξ±), fM a = pure (f a)) β mapM fM l = pure (map f l) | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Tensor1D.mapM_map | [891, 1] | [899, 32] | intros h | M : Type β Type
instβΒΉ : Monad M
instβ : LawfulMonad M
v : Tensor1D
f : TensorFlatIndex v.size0 β FinInt 32 β FinInt 32
fM : TensorFlatIndex v.size0 β FinInt 32 β M (FinInt 32)
β’ (β (flat_index : TensorFlatIndex v.size0) (val : FinInt 32), fM flat_index val = pure (f flat_index val)) β
mapMWithFlatIndex v fM = pure... | M : Type β Type
instβΒΉ : Monad M
instβ : LawfulMonad M
v : Tensor1D
f : TensorFlatIndex v.size0 β FinInt 32 β FinInt 32
fM : TensorFlatIndex v.size0 β FinInt 32 β M (FinInt 32)
h : β (flat_index : TensorFlatIndex v.size0) (val : FinInt 32), fM flat_index val = pure (f flat_index val)
β’ mapMWithFlatIndex v fM = pure (ma... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Tensor1D.mapM_map | [891, 1] | [899, 32] | unfold mapWithFlatIndex | M : Type β Type
instβΒΉ : Monad M
instβ : LawfulMonad M
v : Tensor1D
f : TensorFlatIndex v.size0 β FinInt 32 β FinInt 32
fM : TensorFlatIndex v.size0 β FinInt 32 β M (FinInt 32)
h : β (flat_index : TensorFlatIndex v.size0) (val : FinInt 32), fM flat_index val = pure (f flat_index val)
β’ mapMWithFlatIndex v fM = pure (ma... | M : Type β Type
instβΒΉ : Monad M
instβ : LawfulMonad M
v : Tensor1D
f : TensorFlatIndex v.size0 β FinInt 32 β FinInt 32
fM : TensorFlatIndex v.size0 β FinInt 32 β M (FinInt 32)
h : β (flat_index : TensorFlatIndex v.size0) (val : FinInt 32), fM flat_index val = pure (f flat_index val)
β’ mapMWithFlatIndex v fM =
pure... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Tensor1D.mapM_map | [891, 1] | [899, 32] | unfold mapMWithFlatIndex | M : Type β Type
instβΒΉ : Monad M
instβ : LawfulMonad M
v : Tensor1D
f : TensorFlatIndex v.size0 β FinInt 32 β FinInt 32
fM : TensorFlatIndex v.size0 β FinInt 32 β M (FinInt 32)
h : β (flat_index : TensorFlatIndex v.size0) (val : FinInt 32), fM flat_index val = pure (f flat_index val)
β’ mapMWithFlatIndex v fM =
pure... | M : Type β Type
instβΒΉ : Monad M
instβ : LawfulMonad M
v : Tensor1D
f : TensorFlatIndex v.size0 β FinInt 32 β FinInt 32
fM : TensorFlatIndex v.size0 β FinInt 32 β M (FinInt 32)
h : β (flat_index : TensorFlatIndex v.size0) (val : FinInt 32), fM flat_index val = pure (f flat_index val)
β’ (do
let data β
List... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Tensor1D.mapM_map | [891, 1] | [899, 32] | rw [List.mapM_map] | M : Type β Type
instβΒΉ : Monad M
instβ : LawfulMonad M
v : Tensor1D
f : TensorFlatIndex v.size0 β FinInt 32 β FinInt 32
fM : TensorFlatIndex v.size0 β FinInt 32 β M (FinInt 32)
h : β (flat_index : TensorFlatIndex v.size0) (val : FinInt 32), fM flat_index val = pure (f flat_index val)
β’ (do
let data β
List... | M : Type β Type
instβΒΉ : Monad M
instβ : LawfulMonad M
v : Tensor1D
f : TensorFlatIndex v.size0 β FinInt 32 β FinInt 32
fM : TensorFlatIndex v.size0 β FinInt 32 β M (FinInt 32)
h : β (flat_index : TensorFlatIndex v.size0) (val : FinInt 32), fM flat_index val = pure (f flat_index val)
β’ (do
let data β pure (List.m... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Tensor1D.mapM_map | [891, 1] | [899, 32] | . simp [v.h_data_size]; rfl | M : Type β Type
instβΒΉ : Monad M
instβ : LawfulMonad M
v : Tensor1D
f : TensorFlatIndex v.size0 β FinInt 32 β FinInt 32
fM : TensorFlatIndex v.size0 β FinInt 32 β M (FinInt 32)
h : β (flat_index : TensorFlatIndex v.size0) (val : FinInt 32), fM flat_index val = pure (f flat_index val)
β’ (do
let data β pure (List.m... | case a
M : Type β Type
instβΒΉ : Monad M
instβ : LawfulMonad M
v : Tensor1D
f : TensorFlatIndex v.size0 β FinInt 32 β FinInt 32
fM : TensorFlatIndex v.size0 β FinInt 32 β M (FinInt 32)
h : β (flat_index : TensorFlatIndex v.size0) (val : FinInt 32), fM flat_index val = pure (f flat_index val)
β’ β (a : FinInt 32 Γ TensorF... |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/KDTensor.lean | Tensor1D.mapM_map | [891, 1] | [899, 32] | . intros a; cases a; simp [h] | case a
M : Type β Type
instβΒΉ : Monad M
instβ : LawfulMonad M
v : Tensor1D
f : TensorFlatIndex v.size0 β FinInt 32 β FinInt 32
fM : TensorFlatIndex v.size0 β FinInt 32 β M (FinInt 32)
h : β (flat_index : TensorFlatIndex v.size0) (val : FinInt 32), fM flat_index val = pure (f flat_index val)
β’ β (a : FinInt 32 Γ TensorF... | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | playground/tactic.lean | testSuccess | [80, 1] | [83, 7] | intros a b c d e | β’ Nat β β (bint : Int), Nat β β (dint : Int), Int β bint = dint | a : Nat
b : Int
c : Nat
d e : Int
β’ b = d |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | playground/tactic.lean | testGoalNotEqualityMustFail | [85, 1] | [87, 10] | intros a b c | β’ Nat β Int β Nat β Nat | a : Nat
b : Int
c : Nat
β’ Nat |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/Arith.lean | Int.sub_add_assoc | [21, 1] | [22, 64] | simp [Int.sub_eq_add_neg, Int.add_assoc, Int.add_comm (-m) k] | n m k : β€
β’ n - m + k = n + (k - m) | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/Arith.lean | Int.sub_assoc | [24, 1] | [25, 67] | simp [Int.sub_eq_add_neg, Int.add_assoc, Int.add_comm (-m) (-k)] | n m k : β€
β’ n - m - k = n - k - m | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/Arith.lean | Int.add_sub | [27, 1] | [29, 39] | rw [Int.sub_eq_add_neg, Int.add_comm m (-n), βInt.add_assoc,
Int.add_right_neg, Int.zero_add] | n m : β€
β’ n + (m - n) = m | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/Arith.lean | Int.sub_add_dist | [31, 1] | [33, 48] | rw [Int.sub_eq_add_neg, Int.neg_add, βInt.add_assoc,
βInt.sub_eq_add_neg, βInt.sub_eq_add_neg] | n m p : β€
β’ n - (m + p) = n - m - p | no goals |
https://github.com/opencompl/lean-mlir.git | e43d21592801e5e40477b14b7a554e356060c40c | MLIR/Util/Arith.lean | Int.mul_two | [39, 1] | [44, 22] | have h: (2:Int) = 1 + 1 := rfl | n : β€
β’ n * 2 = n + n | n : β€
h : 2 = 1 + 1
β’ n * 2 = n + n |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.