sách gpt4 ai đã đi

proof - 在精益证明的目标中应用函数

In lại 作者:行者123 更新时间:2023-12-03 23:38:56 27 4
mua khóa gpt4 Nike

有一个树数据结构和一个flip方法。我想写一个证明,如果你申请flip方法到一棵树两次你得到初始树。我有一个目标

⊢ flip_mytree (flip_mytree (mytree.branch t_ᾰ t_ᾰ_1 t_ᾰ_2)) = mytree.branch t_ᾰ t_ᾰ_1 t_ᾰ_2
我想更换 flip_mytree (mytree.branch t_ᾰ t_ᾰ_1 t_ᾰ_2)结果为 flip_mytree .我该怎么做?或者怎么拉 (mytree.branch a l r) := mytree.branch a (flip_mytree r) (flip_mytree l)Từ flip_mytree 的假设函数定义到我的定理上下文中?
我读过 hàng , áp dụnghave战术,但他们在这里似乎没用。
下面是一个完整的例子。
universes u

inductive mytree (A : Type u) : Type u
| leaf : A → mytree
| branch : A → mytree → mytree → mytree

def flip_mytree {A : Type u} : mytree A → mytree A
| t@(mytree.leaf _) := t
| (mytree.branch a l r) := mytree.branch a (flip_mytree r) (flip_mytree l)


theorem flip_flip {A : Type u} {t : mytree A} : flip_mytree (flip_mytree t) = t :=
begin
cases t,


kết thúc

1 Câu trả lời

我认为您需要进行归纳而不是案例才能使其起作用。
但这只需 induction 即可实现和 hàng如下

universes u

inductive mytree (A : Type u) : Type u
| leaf : A → mytree
| branch : A → mytree → mytree → mytree

def flip_mytree {A : Type u} : mytree A → mytree A
| t@(mytree.leaf _) := t
| (mytree.branch a l r) := mytree.branch a (flip_mytree r) (flip_mytree l)


theorem flip_flip {A : Type u} {t : mytree A} : flip_mytree (flip_mytree t) = t :=
begin
induction t with l a b₁ b₂ ih₁ ih₂,
rw [flip_mytree],
refl,

rw [flip_mytree, flip_mytree],
rw [ih₁, ih₂],
kết thúc

关于proof - 在精益证明的目标中应用函数,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/67199246/

27 4 0
行者123
Hồ sơ cá nhân

Tôi là một lập trình viên xuất sắc, rất giỏi!

Nhận phiếu giảm giá Didi Taxi miễn phí
Mã giảm giá Didi Taxi
Giấy chứng nhận ICP Bắc Kinh số 000000
Hợp tác quảng cáo: 1813099741@qq.com 6ren.com