1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
; (certify-book "perm")
(in-package "ACL2")
(defun rm (e x)
(if (consp x)
(if (equal e (car x))
(cdr x)
(cons (car x) (rm e (cdr x))))
nil))
(defun perm (x y)
(if (consp x)
(and (member (car x) y)
(perm (cdr x) (rm (car x) y)))
(not (consp y))))
; The following could be proved right now.
; (local
; (defthm perm-reflexive
; (perm x x)))
(local
(defthm perm-cons
(implies (member a x)
(equal (perm x (cons a y))
(perm (rm a x) y)))
:hints (("Goal" :induct (perm x y)))))
(local
(defthm perm-symmetric
(implies (perm x y) (perm y x))))
(local
(defthm member-rm
(implies (member a (rm b x)) (member a x))))
(local
(defthm perm-member
(implies (and (perm x y)
(member a x))
(member a y))))
(local
(defthm comm-rm
(equal (rm a (rm b x)) (rm b (rm a x)))))
(local
(defthm perm-rm
(implies (perm x y)
(perm (rm a x) (rm a y)))))
; We now prove this because we give a hint.
(local
(defthm perm-transitive
(implies (and (perm x y) (perm y z)) (perm x z))
:hints (("Goal" :induct (and (perm x y) (perm x z))))))
(defequiv perm)
|
