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 | input stringlengths 73 2.09M |
|---|---|---|---|---|---|---|---|---|---|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | case _ right =>
apply Exists.elim right
intro zs a2
apply Exists.intro zs
tauto | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
right : ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
right : ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys)... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | apply Exists.intro hd.snd | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
left : y ∈ hd.2
⊢ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl) | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
left : y ∈ hd.2
⊢ y ∈ hd.2 ∧ ((hd.1, hd.2) = hd ∨ (hd.1, hd.2) ∈ tl) | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
left : y ∈ hd.2
⊢ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | tauto | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
left : y ∈ hd.2
⊢ y ∈ hd.2 ∧ ((hd.1, hd.2) = hd ∨ (hd.1, hd.2) ∈ tl) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
left : y ∈ hd.2
⊢ y ∈ hd.2 ∧ ((hd.1, hd.2) = hd ∨ (hd.1, hd.2) ∈ tl)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | apply Exists.elim right | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
right : ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl) | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
right : ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
⊢ ∀ (a : List Node), y ∈ a ∧ (hd.1, a) ∈ tl → ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl) | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
right : ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys)... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | intro zs a2 | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
right : ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
⊢ ∀ (a : List Node), y ∈ a ∧ (hd.1, a) ∈ tl → ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl) | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
right : ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
zs : List Node
a2 : y ∈ zs ∧ (hd.1, zs) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl) | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
right : ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
⊢ ∀ (a : List Node), y ∈ a ∧ (hd.1, a) ∈ tl → ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | apply Exists.intro zs | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
right : ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
zs : List Node
a2 : y ∈ zs ∧ (hd.1, zs) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl) | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
right : ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
zs : List Node
a2 : y ∈ zs ∧ (hd.1, zs) ∈ tl
⊢ y ∈ zs ∧ ((hd.1, zs) = hd ∨ (hd.1, zs) ∈ tl) | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
right : ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
zs : List Node
a2 : y ∈ zs ∧ (hd.1, zs) ∈ tl
⊢... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | tauto | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
right : ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
zs : List Node
a2 : y ∈ zs ∧ (hd.1, zs) ∈ tl
⊢ y ∈ zs ∧ ((hd.1, zs) = hd ∨ (hd.1, zs) ∈ tl) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
right : ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
zs : List Node
a2 : y ∈ zs ∧ (hd.1, zs) ∈ tl
⊢... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | intro a1 | case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
⊢ (∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl)) → y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl | case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl)
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl | Please generate a tactic in lean4 to solve the state.
STATE:
case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
⊢ (∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl)) → y ∈ hd.2 ∨ ∃ ys, y ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | simp only [Prod.eq_iff_fst_eq_snd_eq] at a1 | case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl)
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl | case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (True ∧ ys = hd.2 ∨ (hd.1, ys) ∈ tl)
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl | Please generate a tactic in lean4 to solve the state.
STATE:
case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl)
⊢ y ∈ hd.2 ∨ ∃ ys, y... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | simp at a1 | case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (True ∧ ys = hd.2 ∨ (hd.1, ys) ∈ tl)
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl | case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl | Please generate a tactic in lean4 to solve the state.
STATE:
case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (True ∧ ys = hd.2 ∨ (hd.1, ys) ∈ tl)
⊢ y ∈ hd.2 ∨ ∃ ys, ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | apply Exists.elim a1 | case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl | case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
⊢ ∀ (a : List Node), y ∈ a ∧ (a = hd.2 ∨ (hd.1, a) ∈ tl) → y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (h... | Please generate a tactic in lean4 to solve the state.
STATE:
case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | intro zs a2 | case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
⊢ ∀ (a : List Node), y ∈ a ∧ (a = hd.2 ∨ (hd.1, a) ∈ tl) → y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (h... | case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2 : y ∈ zs ∧ (zs = hd.2 ∨ (hd.1, zs) ∈ tl)
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ ... | Please generate a tactic in lean4 to solve the state.
STATE:
case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
⊢ ∀ (a : List Node), y ∈ a... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | cases a2 | case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2 : y ∈ zs ∧ (zs = hd.2 ∨ (hd.1, zs) ∈ tl)
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ ... | case mpr.intro
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
left✝ : y ∈ zs
right✝ : zs = hd.2 ∨ (hd.1, zs) ∈ tl
⊢ y ∈ hd.2 ∨ ∃... | Please generate a tactic in lean4 to solve the state.
STATE:
case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2 : y ∈ zs... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | case _ a2_left a2_right =>
cases a2_right
case _ left =>
subst left
tauto
case _ right =>
right
apply Exists.intro zs
tauto | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
a2_right : zs = hd.2 ∨ (hd.1, zs) ∈ tl
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
a2_... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | cases a2_right | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
a2_right : zs = hd.2 ∨ (hd.1, zs) ∈ tl
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys... | case inl
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
h✝ : zs = hd.2
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
a2_... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | case _ left =>
subst left
tauto | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
left : zs = hd.2
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
lef... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | case _ right =>
right
apply Exists.intro zs
tauto | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
right : (hd.1, zs) ∈ tl
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
rig... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | subst left | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
left : zs = hd.2
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
a2_left : y ∈ hd.2
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
lef... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | tauto | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
a2_left : y ∈ hd.2
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
a2_left : y ∈ hd.2
⊢ y ∈ hd.2 ∨ ∃ y... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | right | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
right : (hd.1, zs) ∈ tl
⊢ y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈... | case h
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
right : (hd.1, zs) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
rig... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | apply Exists.intro zs | case h
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
right : (hd.1, zs) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl | case h
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
right : (hd.1, zs) ∈ tl
⊢ y ∈ zs ∧ (hd.1, zs) ∈ tl | Please generate a tactic in lean4 to solve the state.
STATE:
case h
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | tauto | case h
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈ zs
right : (hd.1, zs) ∈ tl
⊢ y ∈ zs ∧ (hd.1, zs) ∈ tl | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case h
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : ∃ ys, y ∈ ys ∧ (ys = hd.2 ∨ (hd.1, ys) ∈ tl)
zs : List Node
a2_left : y ∈... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | simp | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
⊢ y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ hd :: tl | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
⊢ y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl) | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
⊢ y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ hd :: tl
TACT... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | simp only [ih] | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
⊢ y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl) | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
⊢ (∃ ys, y ∈ ys ∧ (x, ys) ∈ tl) ↔ ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl) | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
⊢ y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys)... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | constructor | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
⊢ (∃ ys, y ∈ ys ∧ (x, ys) ∈ tl) ↔ ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl) | case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
⊢ (∃ ys, y ∈ ys ∧ (x, ys) ∈ tl) → ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl)
case mpr
Node : Type
inst✝ : DecidableEq ... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
⊢ (∃ ys, y ∈ ys ∧ (x, ys) ∈ tl) ↔ ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x,... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | intro a1 | case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
⊢ (∃ ys, y ∈ ys ∧ (x, ys) ∈ tl) → ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl) | case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl) | Please generate a tactic in lean4 to solve the state.
STATE:
case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
⊢ (∃ ys, y ∈ ys ∧ (x, ys) ∈ tl) → ∃ ys, y ∈ ys ∧ ((x, ys) = ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | apply Exists.elim a1 | case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl) | case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
⊢ ∀ (a : List Node), y ∈ a ∧ (x, a) ∈ tl → ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl) | Please generate a tactic in lean4 to solve the state.
STATE:
case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((x, ys) =... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | intro zs a2 | case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
⊢ ∀ (a : List Node), y ∈ a ∧ (x, a) ∈ tl → ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl) | case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
zs : List Node
a2 : y ∈ zs ∧ (x, zs) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl) | Please generate a tactic in lean4 to solve the state.
STATE:
case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
⊢ ∀ (a : List Node), y ∈ a ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | cases a2 | case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
zs : List Node
a2 : y ∈ zs ∧ (x, zs) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl) | case mp.intro
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
zs : List Node
left✝ : y ∈ zs
right✝ : (x, zs) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((x, ys) = hd... | Please generate a tactic in lean4 to solve the state.
STATE:
case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
zs : List Node
a2 : y ∈ zs ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | case _ a2_left a2_right =>
apply Exists.intro zs
tauto | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
zs : List Node
a2_left : y ∈ zs
a2_right : (x, zs) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys)... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
zs : List Node
a2_left : y ∈ zs
a2_... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | apply Exists.intro zs | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
zs : List Node
a2_left : y ∈ zs
a2_right : (x, zs) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys)... | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
zs : List Node
a2_left : y ∈ zs
a2_right : (x, zs) ∈ tl
⊢ y ∈ zs ∧ ((x, zs) = hd ∨ (x, zs) ∈ tl) | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
zs : List Node
a2_left : y ∈ zs
a2_... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | tauto | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
zs : List Node
a2_left : y ∈ zs
a2_right : (x, zs) ∈ tl
⊢ y ∈ zs ∧ ((x, zs) = hd ∨ (x, zs) ∈ tl) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
zs : List Node
a2_left : y ∈ zs
a2_... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | intro a1 | case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
⊢ (∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl)) → ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl | case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl)
⊢ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl | Please generate a tactic in lean4 to solve the state.
STATE:
case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
⊢ (∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl)) → ∃ ys, y ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | simp only [Prod.eq_iff_fst_eq_snd_eq] at a1 | case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl)
⊢ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl | case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x = hd.1 ∧ ys = hd.2 ∨ (x, ys) ∈ tl)
⊢ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl | Please generate a tactic in lean4 to solve the state.
STATE:
case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ ((x, ys) = hd ∨ (x, ys) ∈ tl)
⊢ ∃ ys, y... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | tauto | case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x = hd.1 ∧ ys = hd.2 ∨ (x, ys) ∈ tl)
⊢ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case mpr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : ¬hd.1 = x
a1 : ∃ ys, y ∈ ys ∧ (x = hd.1 ∧ ys = hd.2 ∨ (x, ys) ∈ tl)
⊢... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | direct_succ_list_set_equiv | [125, 1] | [135, 41] | ext a | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
⊢ ↑(direct_succ_list g x).toFinset = direct_succ_set g x | case h
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x a : Node
⊢ a ∈ ↑(direct_succ_list g x).toFinset ↔ a ∈ direct_succ_set g x | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
⊢ ↑(direct_succ_list g x).toFinset = direct_succ_set g x
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | direct_succ_list_set_equiv | [125, 1] | [135, 41] | simp only [direct_succ_set] | case h
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x a : Node
⊢ a ∈ ↑(direct_succ_list g x).toFinset ↔ a ∈ direct_succ_set g x | case h
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x a : Node
⊢ a ∈ ↑(direct_succ_list g x).toFinset ↔ a ∈ {y | ∃ ys, y ∈ ys ∧ (x, ys) ∈ g} | Please generate a tactic in lean4 to solve the state.
STATE:
case h
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x a : Node
⊢ a ∈ ↑(direct_succ_list g x).toFinset ↔ a ∈ direct_succ_set g x
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | direct_succ_list_set_equiv | [125, 1] | [135, 41] | simp | case h
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x a : Node
⊢ a ∈ ↑(direct_succ_list g x).toFinset ↔ a ∈ {y | ∃ ys, y ∈ ys ∧ (x, ys) ∈ g} | case h
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x a : Node
⊢ a ∈ direct_succ_list g x ↔ ∃ ys, a ∈ ys ∧ (x, ys) ∈ g | Please generate a tactic in lean4 to solve the state.
STATE:
case h
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x a : Node
⊢ a ∈ ↑(direct_succ_list g x).toFinset ↔ a ∈ {y | ∃ ys, y ∈ ys ∧ (x, ys) ∈ g}
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | direct_succ_list_set_equiv | [125, 1] | [135, 41] | simp only [mem_direct_succ_list_iff] | case h
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x a : Node
⊢ a ∈ direct_succ_list g x ↔ ∃ ys, a ∈ ys ∧ (x, ys) ∈ g | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case h
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x a : Node
⊢ a ∈ direct_succ_list g x ↔ ∃ ys, a ∈ ys ∧ (x, ys) ∈ g
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_list_direct_succ_list_iff | [164, 1] | [172, 9] | simp only [list_direct_succ_list] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
⊢ ∀ (xs : List Node) (y : Node), y ∈ list_direct_succ_list g xs ↔ ∃ x ∈ xs, ∃ ys, y ∈ ys ∧ (x, ys) ∈ g | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
⊢ ∀ (xs : List Node) (y : Node),
y ∈ (List.map (fun x => direct_succ_list g x) xs).join ↔ ∃ x ∈ xs, ∃ ys, y ∈ ys ∧ (x, ys) ∈ g | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
⊢ ∀ (xs : List Node) (y : Node), y ∈ list_direct_succ_list g xs ↔ ∃ x ∈ xs, ∃ ys, y ∈ ys ∧ (x, ys) ∈ g
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_list_direct_succ_list_iff | [164, 1] | [172, 9] | simp only [← mem_direct_succ_list_iff] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
⊢ ∀ (xs : List Node) (y : Node),
y ∈ (List.map (fun x => direct_succ_list g x) xs).join ↔ ∃ x ∈ xs, ∃ ys, y ∈ ys ∧ (x, ys) ∈ g | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
⊢ ∀ (xs : List Node) (y : Node),
y ∈ (List.map (fun x => direct_succ_list g x) xs).join ↔ ∃ x ∈ xs, y ∈ direct_succ_list g x | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
⊢ ∀ (xs : List Node) (y : Node),
y ∈ (List.map (fun x => direct_succ_list g x) xs).join ↔ ∃ x ∈ xs, ∃ ys, y ∈ ys ∧ (x, ys) ∈ g
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_list_direct_succ_list_iff | [164, 1] | [172, 9] | simp | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
⊢ ∀ (xs : List Node) (y : Node),
y ∈ (List.map (fun x => direct_succ_list g x) xs).join ↔ ∃ x ∈ xs, y ∈ direct_succ_list g x | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
⊢ ∀ (xs : List Node) (y : Node),
y ∈ (List.map (fun x => direct_succ_list g x) xs).join ↔ ∃ x ∈ xs, y ∈ direct_succ_list g x
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | list_direct_succ_list_set_equiv | [175, 1] | [184, 9] | simp only [list_direct_succ_set] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
xs : List Node
⊢ ↑(list_direct_succ_list g xs).toFinset = list_direct_succ_set g xs | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
xs : List Node
⊢ ↑(list_direct_succ_list g xs).toFinset = {y | ∃ x ∈ xs, ∃ ys, y ∈ ys ∧ (x, ys) ∈ g} | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
xs : List Node
⊢ ↑(list_direct_succ_list g xs).toFinset = list_direct_succ_set g xs
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | list_direct_succ_list_set_equiv | [175, 1] | [184, 9] | simp only [← mem_list_direct_succ_list_iff] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
xs : List Node
⊢ ↑(list_direct_succ_list g xs).toFinset = {y | ∃ x ∈ xs, ∃ ys, y ∈ ys ∧ (x, ys) ∈ g} | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
xs : List Node
⊢ ↑(list_direct_succ_list g xs).toFinset = {y | y ∈ list_direct_succ_list g xs} | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
xs : List Node
⊢ ↑(list_direct_succ_list g xs).toFinset = {y | ∃ x ∈ xs, ∃ ys, y ∈ ys ∧ (x, ys) ∈ g}
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | list_direct_succ_list_set_equiv | [175, 1] | [184, 9] | simp | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
xs : List Node
⊢ ↑(list_direct_succ_list g xs).toFinset = {y | y ∈ list_direct_succ_list g xs} | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
xs : List Node
⊢ ↑(list_direct_succ_list g xs).toFinset = {y | y ∈ list_direct_succ_list g xs}
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | list_direct_succ_list_cons | [187, 1] | [196, 9] | simp only [list_direct_succ_list] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
xs : List Node
⊢ list_direct_succ_list g (x :: xs) = direct_succ_list g x ++ list_direct_succ_list g xs | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
xs : List Node
⊢ (List.map (fun x => direct_succ_list g x) (x :: xs)).join =
direct_succ_list g x ++ (List.map (fun x => direct_succ_list g x) xs).join | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
xs : List Node
⊢ list_direct_succ_list g (x :: xs) = direct_succ_list g x ++ list_direct_succ_list g xs
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | list_direct_succ_list_cons | [187, 1] | [196, 9] | simp | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
xs : List Node
⊢ (List.map (fun x => direct_succ_list g x) (x :: xs)).join =
direct_succ_list g x ++ (List.map (fun x => direct_succ_list g x) xs).join | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
xs : List Node
⊢ (List.map (fun x => direct_succ_list g x) (x :: xs)).join =
direct_succ_list g x ++ (List.map (fun x => direct_succ_list g x) xs).join
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | list_direct_succ_set_cons | [199, 1] | [210, 8] | simp only [list_direct_succ_set] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
xs : List Node
⊢ list_direct_succ_set g (x :: xs) = ↑(direct_succ_list g x).toFinset ∪ list_direct_succ_set g xs | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
xs : List Node
⊢ {y | ∃ x_1 ∈ x :: xs, ∃ ys, y ∈ ys ∧ (x_1, ys) ∈ g} =
↑(direct_succ_list g x).toFinset ∪ {y | ∃ x ∈ xs, ∃ ys, y ∈ ys ∧ (x, ys) ∈ g} | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
xs : List Node
⊢ list_direct_succ_set g (x :: xs) = ↑(direct_succ_list g x).toFinset ∪ list_direct_succ_set g xs
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | list_direct_succ_set_cons | [199, 1] | [210, 8] | simp only [← mem_direct_succ_list_iff] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
xs : List Node
⊢ {y | ∃ x_1 ∈ x :: xs, ∃ ys, y ∈ ys ∧ (x_1, ys) ∈ g} =
↑(direct_succ_list g x).toFinset ∪ {y | ∃ x ∈ xs, ∃ ys, y ∈ ys ∧ (x, ys) ∈ g} | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
xs : List Node
⊢ {y | ∃ x_1 ∈ x :: xs, y ∈ direct_succ_list g x_1} =
↑(direct_succ_list g x).toFinset ∪ {y | ∃ x ∈ xs, y ∈ direct_succ_list g x} | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
xs : List Node
⊢ {y | ∃ x_1 ∈ x :: xs, ∃ ys, y ∈ ys ∧ (x_1, ys) ∈ g} =
↑(direct_succ_list g x).toFinset ∪ {y | ∃ x ∈ xs, ∃ ys, y ∈ ys ∧ (x, ys) ∈ g}
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | list_direct_succ_set_cons | [199, 1] | [210, 8] | simp | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
xs : List Node
⊢ {y | ∃ x_1 ∈ x :: xs, y ∈ direct_succ_list g x_1} =
↑(direct_succ_list g x).toFinset ∪ {y | ∃ x ∈ xs, y ∈ direct_succ_list g x} | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
xs : List Node
⊢ {y | y ∈ direct_succ_list g x ∨ ∃ a ∈ xs, y ∈ direct_succ_list g a} =
{a | a ∈ direct_succ_list g x} ∪ {y | ∃ x ∈ xs, y ∈ direct_succ_list g x} | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
xs : List Node
⊢ {y | ∃ x_1 ∈ x :: xs, y ∈ direct_succ_list g x_1} =
↑(direct_succ_list g x).toFinset ∪ {y | ∃ x ∈ xs, y ∈ direct_succ_list g x}
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | list_direct_succ_set_cons | [199, 1] | [210, 8] | rfl | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
xs : List Node
⊢ {y | y ∈ direct_succ_list g x ∨ ∃ a ∈ xs, y ∈ direct_succ_list g a} =
{a | a ∈ direct_succ_list g x} ∪ {y | ∃ x ∈ xs, y ∈ direct_succ_list g x} | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
xs : List Node
⊢ {y | y ∈ direct_succ_list g x ∨ ∃ a ∈ xs, y ∈ direct_succ_list g a} =
{a | a ∈ direct_succ_list g x} ∪ {y | ∃ x ∈ xs, y ∈ direct_succ_list g x}
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | not_mem_imp_no_direct_succ | [227, 1] | [251, 14] | induction g | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
h1 : x ∉ g.nodes_of
⊢ direct_succ_list g x = [] | case nil
Node : Type
inst✝ : DecidableEq Node
x : Node
h1 : x ∉ Graph.nodes_of []
⊢ direct_succ_list [] x = []
case cons
Node : Type
inst✝ : DecidableEq Node
x : Node
head✝ : Node × List Node
tail✝ : List (Node × List Node)
tail_ih✝ : x ∉ Graph.nodes_of tail✝ → direct_succ_list tail✝ x = []
h1 : x ∉ Graph.nodes_of (he... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
x : Node
h1 : x ∉ g.nodes_of
⊢ direct_succ_list g x = []
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | not_mem_imp_no_direct_succ | [227, 1] | [251, 14] | case nil =>
simp only [direct_succ_list] | Node : Type
inst✝ : DecidableEq Node
x : Node
h1 : x ∉ Graph.nodes_of []
⊢ direct_succ_list [] x = [] | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
x : Node
h1 : x ∉ Graph.nodes_of []
⊢ direct_succ_list [] x = []
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | not_mem_imp_no_direct_succ | [227, 1] | [251, 14] | case cons hd tl ih =>
simp only [Graph.nodes_of] at ih
simp at ih
simp only [Graph.nodes_of] at h1
simp at h1
simp only [direct_succ_list]
split_ifs
case pos c1 =>
subst c1
simp at h1
case neg c1 =>
tauto | Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih : x ∉ Graph.nodes_of tl → direct_succ_list tl x = []
h1 : x ∉ Graph.nodes_of (hd :: tl)
⊢ direct_succ_list (hd :: tl) x = [] | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih : x ∉ Graph.nodes_of tl → direct_succ_list tl x = []
h1 : x ∉ Graph.nodes_of (hd :: tl)
⊢ direct_succ_list (hd :: tl) x = []
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | not_mem_imp_no_direct_succ | [227, 1] | [251, 14] | simp only [direct_succ_list] | Node : Type
inst✝ : DecidableEq Node
x : Node
h1 : x ∉ Graph.nodes_of []
⊢ direct_succ_list [] x = [] | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
x : Node
h1 : x ∉ Graph.nodes_of []
⊢ direct_succ_list [] x = []
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | not_mem_imp_no_direct_succ | [227, 1] | [251, 14] | simp only [Graph.nodes_of] at ih | Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih : x ∉ Graph.nodes_of tl → direct_succ_list tl x = []
h1 : x ∉ Graph.nodes_of (hd :: tl)
⊢ direct_succ_list (hd :: tl) x = [] | Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih : x ∉ List.map Prod.fst tl ∪ (List.map Prod.snd tl).join → direct_succ_list tl x = []
h1 : x ∉ Graph.nodes_of (hd :: tl)
⊢ direct_succ_list (hd :: tl) x = [] | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih : x ∉ Graph.nodes_of tl → direct_succ_list tl x = []
h1 : x ∉ Graph.nodes_of (hd :: tl)
⊢ direct_succ_list (hd :: tl) x = []
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | not_mem_imp_no_direct_succ | [227, 1] | [251, 14] | simp at ih | Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih : x ∉ List.map Prod.fst tl ∪ (List.map Prod.snd tl).join → direct_succ_list tl x = []
h1 : x ∉ Graph.nodes_of (hd :: tl)
⊢ direct_succ_list (hd :: tl) x = [] | Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
h1 : x ∉ Graph.nodes_of (hd :: tl)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
⊢ direct_succ_list (hd :: tl) x = [] | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih : x ∉ List.map Prod.fst tl ∪ (List.map Prod.snd tl).join → direct_succ_list tl x = []
h1 : x ∉ Graph.nodes_of (hd :: tl)
⊢ direct_succ_list (hd :: tl) x = []
T... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | not_mem_imp_no_direct_succ | [227, 1] | [251, 14] | simp only [Graph.nodes_of] at h1 | Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
h1 : x ∉ Graph.nodes_of (hd :: tl)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
⊢ direct_succ_list (hd :: tl) x = [] | Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
h1 : x ∉ List.map Prod.fst (hd :: tl) ∪ (List.map Prod.snd (hd :: tl)).join
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
⊢ dire... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
h1 : x ∉ Graph.nodes_of (hd :: tl)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_l... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | not_mem_imp_no_direct_succ | [227, 1] | [251, 14] | simp at h1 | Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
h1 : x ∉ List.map Prod.fst (hd :: tl) ∪ (List.map Prod.snd (hd :: tl)).join
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
⊢ dire... | Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
h1 :
¬x = hd.1 ∧
(∀ (x_1 : List Node), (x, x_1) ∉ tl) ∧ x ∉ hd.2 ∧ ∀ (x_1 : ... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
h1 : x ∉ List.map Prod.fst (hd :: tl) ∪ (List.map Prod.snd (hd :: tl)).join
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | not_mem_imp_no_direct_succ | [227, 1] | [251, 14] | simp only [direct_succ_list] | Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
h1 :
¬x = hd.1 ∧
(∀ (x_1 : List Node), (x, x_1) ∉ tl) ∧ x ∉ hd.2 ∧ ∀ (x_1 : ... | Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
h1 :
¬x = hd.1 ∧
(∀ (x_1 : List Node), (x, x_1) ∉ tl) ∧ x ∉ hd.2 ∧ ∀ (x_1 : ... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
h1 :
¬x = hd.1 ∧
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | not_mem_imp_no_direct_succ | [227, 1] | [251, 14] | split_ifs | Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
h1 :
¬x = hd.1 ∧
(∀ (x_1 : List Node), (x, x_1) ∉ tl) ∧ x ∉ hd.2 ∧ ∀ (x_1 : ... | case pos
Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
h1 :
¬x = hd.1 ∧
(∀ (x_1 : List Node), (x, x_1) ∉ tl) ∧ x ∉ hd.2 ∧ ... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
h1 :
¬x = hd.1 ∧
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | not_mem_imp_no_direct_succ | [227, 1] | [251, 14] | case pos c1 =>
subst c1
simp at h1 | Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
h1 :
¬x = hd.1 ∧
(∀ (x_1 : List Node), (x, x_1) ∉ tl) ∧ x ∉ hd.2 ∧ ∀ (x_1 : ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
h1 :
¬x = hd.1 ∧
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | not_mem_imp_no_direct_succ | [227, 1] | [251, 14] | case neg c1 =>
tauto | Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
h1 :
¬x = hd.1 ∧
(∀ (x_1 : List Node), (x, x_1) ∉ tl) ∧ x ∉ hd.2 ∧ ∀ (x_1 : ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
h1 :
¬x = hd.1 ∧
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | not_mem_imp_no_direct_succ | [227, 1] | [251, 14] | subst c1 | Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
h1 :
¬x = hd.1 ∧
(∀ (x_1 : List Node), (x, x_1) ∉ tl) ∧ x ∉ hd.2 ∧ ∀ (x_1 : ... | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x : List Node), (hd.1, x) ∉ tl) →
(∀ (x : List Node) (x_1 : Node), (x_1, x) ∈ tl → hd.1 ∉ x) → direct_succ_list tl hd.1 = []
h1 :
¬hd.1 = hd.1 ∧
(∀ (x : List Node), (hd.1, x) ∉ tl) ∧ hd.1 ∉ hd.2 ∧ ∀ (x : List No... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
h1 :
¬x = hd.1 ∧
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | not_mem_imp_no_direct_succ | [227, 1] | [251, 14] | simp at h1 | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x : List Node), (hd.1, x) ∉ tl) →
(∀ (x : List Node) (x_1 : Node), (x_1, x) ∈ tl → hd.1 ∉ x) → direct_succ_list tl hd.1 = []
h1 :
¬hd.1 = hd.1 ∧
(∀ (x : List Node), (hd.1, x) ∉ tl) ∧ hd.1 ∉ hd.2 ∧ ∀ (x : List No... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x : List Node), (hd.1, x) ∉ tl) →
(∀ (x : List Node) (x_1 : Node), (x_1, x) ∈ tl → hd.1 ∉ x) → direct_succ_list tl hd.1 = []
h1 :
¬hd.1 = hd.1 ∧
(∀ (x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | not_mem_imp_no_direct_succ | [227, 1] | [251, 14] | tauto | Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
h1 :
¬x = hd.1 ∧
(∀ (x_1 : List Node), (x, x_1) ∉ tl) ∧ x ∉ hd.2 ∧ ∀ (x_1 : ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
x : Node
hd : Node × List Node
tl : List (Node × List Node)
ih :
(∀ (x_1 : List Node), (x, x_1) ∉ tl) →
(∀ (x_1 : List Node) (x_2 : Node), (x_2, x_1) ∈ tl → x ∉ x_1) → direct_succ_list tl x = []
h1 :
¬x = hd.1 ∧
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | List.erase_diff_len_lt_diff_len | [254, 1] | [272, 26] | simp only [← List.diff_erase] | α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
⊢ ((l1.erase x).diff l2).length < (l1.diff l2).length | α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
⊢ ((l1.diff l2).erase x).length < (l1.diff l2).length | Please generate a tactic in lean4 to solve the state.
STATE:
α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
⊢ ((l1.erase x).diff l2).length < (l1.diff l2).length
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | List.erase_diff_len_lt_diff_len | [254, 1] | [272, 26] | have s1 : x ∈ l1.diff l2 := List.mem_diff_of_mem h1 h2 | α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
⊢ ((l1.diff l2).erase x).length < (l1.diff l2).length | α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
s1 : x ∈ l1.diff l2
⊢ ((l1.diff l2).erase x).length < (l1.diff l2).length | Please generate a tactic in lean4 to solve the state.
STATE:
α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
⊢ ((l1.diff l2).erase x).length < (l1.diff l2).length
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | List.erase_diff_len_lt_diff_len | [254, 1] | [272, 26] | have s2 : ((l1.diff l2).erase x).length = (l1.diff l2).length.pred := List.length_erase_of_mem s1 | α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
s1 : x ∈ l1.diff l2
⊢ ((l1.diff l2).erase x).length < (l1.diff l2).length | α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
s1 : x ∈ l1.diff l2
s2 : ((l1.diff l2).erase x).length = (l1.diff l2).length.pred
⊢ ((l1.diff l2).erase x).length < (l1.diff l2).length | Please generate a tactic in lean4 to solve the state.
STATE:
α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
s1 : x ∈ l1.diff l2
⊢ ((l1.diff l2).erase x).length < (l1.diff l2).length
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | List.erase_diff_len_lt_diff_len | [254, 1] | [272, 26] | simp only [s2] | α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
s1 : x ∈ l1.diff l2
s2 : ((l1.diff l2).erase x).length = (l1.diff l2).length.pred
⊢ ((l1.diff l2).erase x).length < (l1.diff l2).length | α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
s1 : x ∈ l1.diff l2
s2 : ((l1.diff l2).erase x).length = (l1.diff l2).length.pred
⊢ (l1.diff l2).length.pred < (l1.diff l2).length | Please generate a tactic in lean4 to solve the state.
STATE:
α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
s1 : x ∈ l1.diff l2
s2 : ((l1.diff l2).erase x).length = (l1.diff l2).length.pred
⊢ ((l1.diff l2).erase x).length < (l1.diff l2).length
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | List.erase_diff_len_lt_diff_len | [254, 1] | [272, 26] | have s3 : 0 < (l1.diff l2).length := List.length_pos_of_mem s1 | α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
s1 : x ∈ l1.diff l2
s2 : ((l1.diff l2).erase x).length = (l1.diff l2).length.pred
⊢ (l1.diff l2).length.pred < (l1.diff l2).length | α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
s1 : x ∈ l1.diff l2
s2 : ((l1.diff l2).erase x).length = (l1.diff l2).length.pred
s3 : 0 < (l1.diff l2).length
⊢ (l1.diff l2).length.pred < (l1.diff l2).length | Please generate a tactic in lean4 to solve the state.
STATE:
α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
s1 : x ∈ l1.diff l2
s2 : ((l1.diff l2).erase x).length = (l1.diff l2).length.pred
⊢ (l1.diff l2).length.pred < (l1.diff l2).length
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | List.erase_diff_len_lt_diff_len | [254, 1] | [272, 26] | exact Nat.pred_lt' s3 | α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
s1 : x ∈ l1.diff l2
s2 : ((l1.diff l2).erase x).length = (l1.diff l2).length.pred
s3 : 0 < (l1.diff l2).length
⊢ (l1.diff l2).length.pred < (l1.diff l2).length | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
α : Type
inst✝ : DecidableEq α
l1 l2 : List α
x : α
h1 : x ∈ l1
h2 : x ∉ l2
s1 : x ∈ l1.diff l2
s2 : ((l1.diff l2).erase x).length = (l1.diff l2).length.pred
s3 : 0 < (l1.diff l2).length
⊢ (l1.diff l2).length.pred < (l1.diff l2).length
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_cons | [346, 1] | [357, 26] | simp only [dft_aux] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
stack visited : List Node
x : Node
h1 : x ∈ visited
⊢ dft_aux g (x :: stack) visited = dft_aux g stack visited | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
stack visited : List Node
x : Node
h1 : x ∈ visited
⊢ (if x ∈ visited then dft_aux g stack visited else dft_aux g (direct_succ_list g x ++ stack) (x :: visited)) =
dft_aux g stack visited | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
stack visited : List Node
x : Node
h1 : x ∈ visited
⊢ dft_aux g (x :: stack) visited = dft_aux g stack visited
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_cons | [346, 1] | [357, 26] | simp only [if_pos h1] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
stack visited : List Node
x : Node
h1 : x ∈ visited
⊢ (if x ∈ visited then dft_aux g stack visited else dft_aux g (direct_succ_list g x ++ stack) (x :: visited)) =
dft_aux g stack visited | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
stack visited : List Node
x : Node
h1 : x ∈ visited
⊢ (if x ∈ visited then dft_aux g stack visited else dft_aux g (direct_succ_list g x ++ stack) (x :: visited)) =
dft_aux g stack visited
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | induction xs, zs using dft_aux.induct g | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
xs ys zs : List Node
⊢ dft_aux g (xs ++ ys) zs = dft_aux g ys (dft_aux g xs zs) | case case1
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited✝ : List Node
⊢ dft_aux g ([] ++ ys) visited✝ = dft_aux g ys (dft_aux g [] visited✝)
case case2
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited✝ : List Node
x✝ : Node
xs✝ : List Node
h✝ : x✝ ∈ visited✝
ih1✝ : dft_aux g (xs✝ ++ ys) ... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
xs ys zs : List Node
⊢ dft_aux g (xs ++ ys) zs = dft_aux g ys (dft_aux g xs zs)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | case _ visited =>
simp only [dft_aux]
simp | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
⊢ dft_aux g ([] ++ ys) visited = dft_aux g ys (dft_aux g [] visited) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
⊢ dft_aux g ([] ++ ys) visited = dft_aux g ys (dft_aux g [] visited)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | case _ visited x xs c1 ih =>
simp only [dft_aux]
simp only [if_pos c1]
simp only [← ih]
simp
simp only [dft_aux]
simp only [if_pos c1] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ dft_aux g (x :: xs ++ ys) visited = dft_aux g ys (dft_aux g (x :: xs) visited) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ dft_aux g (x :: xs ++ ys) visited = dft_aux g ys (dft_aux g (x :: xs)... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | case _ visited x xs c1 ih =>
simp only [dft_aux]
simp only [if_neg c1]
simp only [← ih]
simp
simp only [dft_aux]
simp only [if_neg c1] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢ dft_aux g (x :: xs ++ ys) visited = dft_aux g ys (dft_aux g ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | simp only [dft_aux] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
⊢ dft_aux g ([] ++ ys) visited = dft_aux g ys (dft_aux g [] visited) | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
⊢ dft_aux g ([] ++ ys) visited = dft_aux g ys visited | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
⊢ dft_aux g ([] ++ ys) visited = dft_aux g ys (dft_aux g [] visited)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | simp | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
⊢ dft_aux g ([] ++ ys) visited = dft_aux g ys visited | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
⊢ dft_aux g ([] ++ ys) visited = dft_aux g ys visited
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | simp only [dft_aux] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ dft_aux g (x :: xs ++ ys) visited = dft_aux g ys (dft_aux g (x :: xs) visited) | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ dft_aux g (x :: xs ++ ys) visited =
dft_aux g ys (if x ∈ visited then dft_aux g xs visited else dft_aux g (direct_succ_list g ... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ dft_aux g (x :: xs ++ ys) visited = dft_aux g ys (dft_aux g (x :: xs)... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | simp only [if_pos c1] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ dft_aux g (x :: xs ++ ys) visited =
dft_aux g ys (if x ∈ visited then dft_aux g xs visited else dft_aux g (direct_succ_list g ... | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ dft_aux g (x :: xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited) | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ dft_aux g (x :: xs ++ ys) visited =
dft_aux g ys (if x ∈ visited ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | simp only [← ih] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ dft_aux g (x :: xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited) | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ dft_aux g (x :: xs ++ ys) visited = dft_aux g (xs ++ ys) visited | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ dft_aux g (x :: xs ++ ys) visited = dft_aux g ys (dft_aux g xs visite... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | simp | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ dft_aux g (x :: xs ++ ys) visited = dft_aux g (xs ++ ys) visited | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ dft_aux g (x :: (xs ++ ys)) visited = dft_aux g (xs ++ ys) visited | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ dft_aux g (x :: xs ++ ys) visited = dft_aux g (xs ++ ys) visited
TACT... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | simp only [dft_aux] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ dft_aux g (x :: (xs ++ ys)) visited = dft_aux g (xs ++ ys) visited | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ (if x ∈ visited then dft_aux g (xs ++ ys) visited
else dft_aux g (direct_succ_list g x ++ (xs ++ ys)) (x :: visited)) =
df... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ dft_aux g (x :: (xs ++ ys)) visited = dft_aux g (xs ++ ys) visited
TA... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | simp only [if_pos c1] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ (if x ∈ visited then dft_aux g (xs ++ ys) visited
else dft_aux g (direct_succ_list g x ++ (xs ++ ys)) (x :: visited)) =
df... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∈ visited
ih : dft_aux g (xs ++ ys) visited = dft_aux g ys (dft_aux g xs visited)
⊢ (if x ∈ visited then dft_aux g (xs ++ ys) visited
else dft_aux g ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | simp only [dft_aux] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢ dft_aux g (x :: xs ++ ys) visited = dft_aux g ys (dft_aux g ... | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢ dft_aux g (x :: xs ++ ys) visited =
dft_aux g ys (if x ∈... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | simp only [if_neg c1] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢ dft_aux g (x :: xs ++ ys) visited =
dft_aux g ys (if x ∈... | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢ dft_aux g (x :: xs ++ ys) visited = dft_aux g ys (dft_aux g ... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | simp only [← ih] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢ dft_aux g (x :: xs ++ ys) visited = dft_aux g ys (dft_aux g ... | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢ dft_aux g (x :: xs ++ ys) visited = dft_aux g (direct_succ_l... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | simp | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢ dft_aux g (x :: xs ++ ys) visited = dft_aux g (direct_succ_l... | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢ dft_aux g (x :: (xs ++ ys)) visited = dft_aux g (direct_succ... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | simp only [dft_aux] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢ dft_aux g (x :: (xs ++ ys)) visited = dft_aux g (direct_succ... | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢ (if x ∈ visited then dft_aux g (xs ++ ys) visited
else d... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | dft_aux_append | [360, 1] | [385, 28] | simp only [if_neg c1] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢ (if x ∈ visited then dft_aux g (xs ++ ys) visited
else d... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
ys visited : List Node
x : Node
xs : List Node
c1 : x ∉ visited
ih :
dft_aux g (direct_succ_list g x ++ xs ++ ys) (x :: visited) =
dft_aux g ys (dft_aux g (direct_succ_list g x ++ xs) (x :: visited))
⊢... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | visited_subset_dft_aux | [388, 1] | [409, 17] | induction stack, visited using dft_aux.induct g | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
stack visited : List Node
⊢ visited ⊆ dft_aux g stack visited | case case1
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited✝ : List Node
⊢ visited✝ ⊆ dft_aux g [] visited✝
case case2
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited✝ : List Node
x✝ : Node
xs✝ : List Node
h✝ : x✝ ∈ visited✝
ih1✝ : visited✝ ⊆ dft_aux g xs✝ visited✝
⊢ visited✝ ⊆ dft_aux g (x✝ :: ... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
stack visited : List Node
⊢ visited ⊆ dft_aux g stack visited
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | visited_subset_dft_aux | [388, 1] | [409, 17] | case _ visited =>
simp only [dft_aux]
simp | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
⊢ visited ⊆ dft_aux g [] visited | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
⊢ visited ⊆ dft_aux g [] visited
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | visited_subset_dft_aux | [388, 1] | [409, 17] | case _ visited x stack c1 ih =>
simp only [dft_aux]
simp only [if_pos c1]
exact ih | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
x : Node
stack : List Node
c1 : x ∈ visited
ih : visited ⊆ dft_aux g stack visited
⊢ visited ⊆ dft_aux g (x :: stack) visited | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
x : Node
stack : List Node
c1 : x ∈ visited
ih : visited ⊆ dft_aux g stack visited
⊢ visited ⊆ dft_aux g (x :: stack) visited
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | visited_subset_dft_aux | [388, 1] | [409, 17] | simp only [dft_aux] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
⊢ visited ⊆ dft_aux g [] visited | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
⊢ visited ⊆ visited | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
⊢ visited ⊆ dft_aux g [] visited
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | visited_subset_dft_aux | [388, 1] | [409, 17] | simp | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
⊢ visited ⊆ visited | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
⊢ visited ⊆ visited
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | visited_subset_dft_aux | [388, 1] | [409, 17] | simp only [dft_aux] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
x : Node
stack : List Node
c1 : x ∈ visited
ih : visited ⊆ dft_aux g stack visited
⊢ visited ⊆ dft_aux g (x :: stack) visited | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
x : Node
stack : List Node
c1 : x ∈ visited
ih : visited ⊆ dft_aux g stack visited
⊢ visited ⊆ if x ∈ visited then dft_aux g stack visited else dft_aux g (direct_succ_list g x ++ stack) (x :: visited) | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
x : Node
stack : List Node
c1 : x ∈ visited
ih : visited ⊆ dft_aux g stack visited
⊢ visited ⊆ dft_aux g (x :: stack) visited
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | visited_subset_dft_aux | [388, 1] | [409, 17] | simp only [if_pos c1] | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
x : Node
stack : List Node
c1 : x ∈ visited
ih : visited ⊆ dft_aux g stack visited
⊢ visited ⊆ if x ∈ visited then dft_aux g stack visited else dft_aux g (direct_succ_list g x ++ stack) (x :: visited) | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
x : Node
stack : List Node
c1 : x ∈ visited
ih : visited ⊆ dft_aux g stack visited
⊢ visited ⊆ dft_aux g stack visited | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
x : Node
stack : List Node
c1 : x ∈ visited
ih : visited ⊆ dft_aux g stack visited
⊢ visited ⊆ if x ∈ visited then dft_aux g stack visited else dft_aux g (direct_succ_list g x ++ stack) (... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | visited_subset_dft_aux | [388, 1] | [409, 17] | exact ih | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
x : Node
stack : List Node
c1 : x ∈ visited
ih : visited ⊆ dft_aux g stack visited
⊢ visited ⊆ dft_aux g stack visited | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
visited : List Node
x : Node
stack : List Node
c1 : x ∈ visited
ih : visited ⊆ dft_aux g stack visited
⊢ visited ⊆ dft_aux g stack visited
TACTIC:
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.