Skip to content

Instantly share code, notes, and snippets.

@srghma

srghma/1

Created January 10, 2026 08:25
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save srghma/88c88cb3eddd36d29e336f9af831ad61 to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save srghma/88c88cb3eddd36d29e336f9af831ad61 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
1
This file has been truncated, but you can view the full file.
~/projects/mm0/mm0-hs   master  for i in ../examples/*.mm[01]; do
./.stack-work/dist/x86_64-linux-nix/ghc-9.10.3/build/mm0-hs/mm0-hs compile "$i" \
&& echo "=================== OK ==================== $i" \
|| echo "=================== ERR =================== $i"
done
depth limit exceeded
=================== ERR =================== ../examples/assembler-new.mm1
../examples/assembler-old.mm1:7:24:
|
7 | local def _x00: char = 0;
| ^
warning: unimplemented
../examples/assembler-old.mm1:8:24:
|
8 | local def _x01: char = 1;
| ^
warning: unimplemented
../examples/assembler-old.mm1:9:24:
|
9 | local def _x02: char = 2;
| ^
warning: unimplemented
../examples/assembler-old.mm1:11:30:
|
11 | local def _x00x1: string = $ s1 _x00 $;
| ^
error: s1 is not a function
../examples/assembler-old.mm1:12:35:
|
12 | local def _x00x2: string = $ _x00 ': _x00x1 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:13:35:
|
13 | local def _x00x3: string = $ _x00 ': _x00x2 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:14:37:
|
14 | local def _x00x4: string = $ _x00x2 '+ _x00x2 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:15:35:
|
15 | local def _x00x5: string = $ _x00 ': _x00x4 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:16:37:
|
16 | local def _x00x6: string = $ _x00x2 '+ _x00x4 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:17:37:
|
17 | local def _x00x7: string = $ _x00x3 '+ _x00x4 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:18:37:
|
18 | local def _x00x8: string = $ _x00x4 '+ _x00x4 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:19:35:
|
19 | local def _x00x9: string = $ _x00 ': _x00x8 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:20:37:
|
20 | local def _x00xa: string = $ _x00x2 '+ _x00x8 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:21:37:
|
21 | local def _x00xb: string = $ _x00x3 '+ _x00x8 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:22:37:
|
22 | local def _x00xc: string = $ _x00x4 '+ _x00x8 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:23:37:
|
23 | local def _x00xd: string = $ _x00x5 '+ _x00x8 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:24:37:
|
24 | local def _x00xe: string = $ _x00x6 '+ _x00x8 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:25:37:
|
25 | local def _x00xf: string = $ _x00x7 '+ _x00x8 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:26:42:
|
26 | do (def _x00xn @ on-hexstrings @ fn (s) (atom-app "_x00x" s));
| ^
error: Reference to unbound variable 'atom-app'
../examples/assembler-old.mm1:28:25:
|
28 | theorem _x00_eq: $ _x00 = 0 $ = '{,norm_num : $ ch = _ $};
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:29:25:
|
29 | theorem _x01_eq: $ _x01 = 1 $ = '{,norm_num : $ ch = _ $};
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:30:25:
|
30 | theorem _x02_eq: $ _x02 = 2 $ = '{,norm_num : $ ch = _ $};
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:32:29:
|
32 | theorem _x00x0_eq: $ _x00x0 = repeat 0 x0 $ = '(eqtr4 s2n_R0 @ repeateq2 h2n0);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:33:29:
|
33 | theorem _x00x1_eq: $ _x00x1 = repeat 0 x1 $ = '(eqtr4 (s2n_R1 _x00_eq) @ repeateq2 h2n1);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:34:29:
|
34 | theorem _x00x2_eq: $ _x00x2 = repeat 0 x2 $ = '(s2n_RS _x00_eq _x00x1_eq ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:35:29:
|
35 | theorem _x00x3_eq: $ _x00x3 = repeat 0 x3 $ = '(s2n_RS _x00_eq _x00x2_eq ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:36:29:
|
36 | theorem _x00x4_eq: $ _x00x4 = repeat 0 x4 $ = '(s2n_RA _x00x2_eq _x00x2_eq ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:37:29:
|
37 | theorem _x00x5_eq: $ _x00x5 = repeat 0 x5 $ = '(s2n_RS _x00_eq _x00x4_eq ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:38:29:
|
38 | theorem _x00x6_eq: $ _x00x6 = repeat 0 x6 $ = '(s2n_RA _x00x2_eq _x00x4_eq ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:39:29:
|
39 | theorem _x00x7_eq: $ _x00x7 = repeat 0 x7 $ = '(s2n_RA _x00x3_eq _x00x4_eq ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:40:29:
|
40 | theorem _x00x8_eq: $ _x00x8 = repeat 0 x8 $ = '(s2n_RA _x00x4_eq _x00x4_eq ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:41:29:
|
41 | theorem _x00x9_eq: $ _x00x9 = repeat 0 x9 $ = '(s2n_RS _x00_eq _x00x8_eq ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:42:29:
|
42 | theorem _x00xa_eq: $ _x00xa = repeat 0 xa $ = '(s2n_RA _x00x2_eq _x00x8_eq ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:43:29:
|
43 | theorem _x00xb_eq: $ _x00xb = repeat 0 xb $ = '(s2n_RA _x00x3_eq _x00x8_eq ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:44:29:
|
44 | theorem _x00xc_eq: $ _x00xc = repeat 0 xc $ = '(s2n_RA _x00x4_eq _x00x8_eq ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:45:29:
|
45 | theorem _x00xd_eq: $ _x00xd = repeat 0 xd $ = '(s2n_RA _x00x5_eq _x00x8_eq ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:46:29:
|
46 | theorem _x00xe_eq: $ _x00xe = repeat 0 xe $ = '(s2n_RA _x00x6_eq _x00x8_eq ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:47:29:
|
47 | theorem _x00xf_eq: $ _x00xf = repeat 0 xf $ = '(s2n_RA _x00x7_eq _x00x8_eq ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:48:45:
|
48 | do (def _x00xn_eq @ on-hexstrings @ fn (s) (atom-app "_x00x" s "_eq"));
| ^
error: Reference to unbound variable 'atom-app'
../examples/assembler-old.mm1:51:5:
|
51 | $ ,0x7f ': ,"E" ': ,"L" ': ,"F" ':
| ^
error: unexpected 'x'
expecting '$', digit, or infix >= 0
../examples/assembler-old.mm1:54:37:
|
54 | theorem ELF_IDENT_eq: $ ELF_IDENT_s = ELF_IDENT $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:59:41:
|
59 | local def _ch16 (c: char): string = $ c ': _x00x1 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:60:41:
|
60 | local def _ch32 (c: char): string = $ c ': _x00x3 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:61:41:
|
61 | local def _ch64 (c: char): string = $ c ': _x00x7 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:63:26:
|
63 | theorem _ch16_eq (h: $ c = a $): $ _ch16 c = u16Bytes a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:65:26:
|
65 | theorem _ch32_eq (h: $ c = a $): $ _ch32 c = u32Bytes a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:67:26:
|
67 | theorem _ch64_eq (h: $ c = a $): $ _ch64 c = u64Bytes a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:71:48:
|
71 | local def load_start_s (c: char): string = $ c ': _x00 ': ,0x40 ': _x00x5 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:72:39:
|
72 | local def load_start (x y): nat = $ ,0x4000 :x x :x y $;
| ^
error: unexpected 'x'
expecting '$', digit, or infix >= 0
../examples/assembler-old.mm1:74:31:
|
74 | local def text_start: nat = $ load_start x7 x8 $;
| ^
error: load_start is not a function
../examples/assembler-old.mm1:76:44:
|
76 | theorem load_start_eq2: $ load_start x0 x0 + x :x y = load_start x y $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/assembler-old.mm1:78:45:
|
78 | theorem load_start_pow2: $ load_start x0 x0 = 2 ^ ,22 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:82:25:
|
82 | theorem load_start_T: $ load_start x y e. u64 $ =
| ^
error: load_start is not a function
../examples/assembler-old.mm1:84:48:
|
84 | theorem load_start_eq: $ load_start_s (ch x y) = u64Bytes (load_start x y) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:90:15:
|
90 | $ ELF_IDENT_s '+ _ch16 _x02 '+ _ch16 ,0x3e '+ _ch32 _x01 '+
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:95:60:
|
95 | theorem ELF_header_ok: $ elfHeader ELF_header_s text_start 64 0 1 0 $ =
| ^
error: unexpected '6'
expecting '$' or infix >= 0
../examples/assembler-old.mm1:112:40:
|
112 | local def PAGE_SIZE_s: string = $ _x00 ': _x00 ': ,0x20 ': _x00x5 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:113:32:
|
113 | local def PAGE_SIZE: nat = $ 2 ^ ,21 $;
| ^
error: expecting (
../examples/assembler-old.mm1:114:36:
|
114 | theorem PAGE_SIZE_val: $ PAGE_SIZE = ,0x200000 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:117:37:
|
117 | theorem PAGE_SIZE_eq: $ PAGE_SIZE_s = u64Bytes PAGE_SIZE $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:124:14:
|
124 | $ _ch32 _x01 '+ _ch32 ,7 '+
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:128:26:
|
128 | local def PROT_RWX = $ 7 $;
| ^
error: expecting (
../examples/assembler-old.mm1:129:34:
|
129 | theorem PROT_RWX_val: $ PROT_RWX = upto 3 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:131:34:
|
131 | theorem ss_PROT_RWX: $ p e. Prot <-> p C_ PROT_RWX $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/assembler-old.mm1:133:46:
|
133 | theorem PROT_RWX_T: $ PROT_RWX e. Prot $ = '(mpbir ss_PROT_RWX ssid);
| ^
error: unknown theorem/hypothesis 'mpbir'
../examples/assembler-old.mm1:134:23:
|
134 | theorem PROT_RWX_R: $ PROT_READ C_ PROT_RWX $ = '(mpbi ss_PROT_RWX PROT_READ_T);
| ^
error: PROT_READ is not a function
../examples/assembler-old.mm1:135:23:
|
135 | theorem PROT_RWX_W: $ PROT_WRITE C_ PROT_RWX $ = '(mpbi ss_PROT_RWX PROT_WRITE_T);
| ^
error: PROT_WRITE is not a function
../examples/assembler-old.mm1:136:23:
|
136 | theorem PROT_RWX_X: $ PROT_EXEC C_ PROT_RWX $ = '(mpbi ss_PROT_RWX PROT_EXEC_T);
| ^
error: PROT_EXEC is not a function
../examples/assembler-old.mm1:137:48:
|
137 | theorem PROT_RWX_flags: $ protToFlags PROT_RWX = 7 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:144:14:
|
144 | (hfs: $ fs = u64Bytes filesz $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:170:16:
|
170 | $ ELF_header_s '+ basic_pHeader_s fs ms '+ c $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/assembler-old.mm1:173:13:
|
173 | $ text_start, PROT_RWX, text_start, c ++ repeat 0 bss $;
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/assembler-old.mm1:176:58:
|
176 | $ parseBasicElf elf text_start PROT_RWX text_start (c ++ repeat 0 bss) $;
| ^
error: expecting ) or infix >= 0
../examples/assembler-old.mm1:179:9:
|
179 | (h: $ ELF_lit_ok s bss c $): $ isBasicElf s $ =
| ^
error: ELF_lit_ok is not a function
../examples/assembler-old.mm1:183:14:
|
183 | (hfs: $ fs = u64Bytes filesz $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:225:14:
|
225 | $ end e. u64 /\ end = start + len s /\ E. n (start = text_start + n /\ sublistAt n c s) $;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/assembler-old.mm1:227:34:
|
227 | theorem assembledOLD_start (h: $ assembledOLD c s x y $): $ text_start <= x $ =
| ^
error: assembledOLD is not a function
../examples/assembler-old.mm1:230:32:
|
230 | theorem assembledOLD_end (h: $ assembledOLD c s x y $): $ y <= text_start + len c $ =
| ^
error: assembledOLD is not a function
../examples/assembler-old.mm1:237:30:
|
237 | $ assembledOLD c s start end /\ start < end $;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/assembler-old.mm1:239:36:
|
239 | theorem assembledOLD_func_lt (h: $ assembledOLD_func c s x y $): $ x < text_start + len c $ =
| ^
error: assembledOLD_func is not a function
../examples/assembler-old.mm1:242:39:
|
242 | theorem assembledOLD_func_bound (h: $ assembledOLD_func c s x y $):
| ^
error: assembledOLD_func is not a function
../examples/assembler-old.mm1:246:36:
|
246 | theorem assembledOLD_func_n0 (h: $ assembledOLD_func c s x y $): $ c != 0 $ =
| ^
error: assembledOLD_func is not a function
../examples/assembler-old.mm1:251:17:
|
251 | $ E. n (start = text_start + n /\ sublistAt n c s) ->
| ^
error: expecting ) or infix >= 0
../examples/assembler-old.mm1:254:60:
|
254 | theorem assemblesOLD_trul (h: $ assemblesOLD c s x y p (T. /\ q) $): $ assemblesOLD c s x y p q $ =
| ^
error: expecting (
../examples/assembler-old.mm1:256:64:
|
256 | theorem assemblesOLD_assoc (h: $ assemblesOLD c s x y p (q1 /\ q2 /\ q3) $):
| ^
error: expecting ) or infix >= 0
../examples/assembler-old.mm1:261:7:
|
261 | $ end = start + len s $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:263:27:
|
263 | theorem assemble1OLD_0: $ assemble1OLD s0 x x $ =
| ^
error: assemble1OLD is not a function
../examples/assembler-old.mm1:265:37:
|
265 | theorem assemble1OLD_1 (h1: $ suc x = y $): $ assemble1OLD (s1 c) x y $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:267:33:
|
267 | theorem assemble1OLD_A_lem: $ y = x + len s -> z = y + len t -> u = s ++ t -> z = x + len u $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:270:31:
|
270 | theorem assemble1OLD_A (h1: $ assemble1OLD s x y $) (h2: $ assemble1OLD t y z $):
| ^
error: assemble1OLD is not a function
../examples/assembler-old.mm1:272:37:
|
272 | theorem assemble1OLD_S (h1: $ suc x = y $) (h2: $ assemble1OLD s y z $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:290:28:
|
290 | $ assemble1OLD s start end /\ start < end $;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/assembler-old.mm1:292:54:
|
292 | theorem assemblesOLD_func_I (h: $ assemble1OLD (c ': s '+ t) x y $):
| ^
error: expecting ) or infix >= 0
../examples/assembler-old.mm1:297:26:
|
297 | theorem assemble_1 (h: $ assemble1OLD s x y $):
| ^
error: assemble1OLD is not a function
../examples/assembler-old.mm1:305:29:
|
305 | theorem assemble_func (h: $ assemblesOLD_func s x y $):
| ^
error: assemblesOLD_func is not a function
../examples/assembler-old.mm1:310:10:
|
310 | (h1: $ assemblesOLD c s x y p q $)
| ^
error: assemblesOLD is not a function
../examples/assembler-old.mm1:322:26:
|
322 | theorem assemblesOLD0: $ assemblesOLD c s0 x x p p $ =
| ^
error: assemblesOLD is not a function
../examples/assembler-old.mm1:326:41:
|
326 | (h1: $ assemblesOLD c c ,0x400078 end T. p $)
| ^
error: unexpected 'T'
expecting '$' or infix >= 0
../examples/assembler-old.mm1:449:16:
|
449 | [#undef (def r (ref! '(,x))) (insert refs x r) r]
| ^
error: expecting identifier char
../examples/assembler-old.mm1:621:3:
|
621 | (def (assemble base main bss pub xs)
| ^
error: unexpected "(def (ass"
expecting "abstract", "axiom", "coercion", "def", "delimiter", "do", "exit", "free", "import", "infixl", "infixr",
"input", "local", "notation", "output", "prefix", "provable", "pub", "pure", "sort", "strict", "term", "theorem", "
theorems", or '@'
../examples/assembler-old.mm1:639:1:
|
639 | @_ local def CFG_ok: set = $ S\ s, S\ l, S\ x, {y | y = x + len s} $;
| ^
error: Unknown function 'annotate'
../examples/assembler-old.mm1:639:33:
|
639 | @_ local def CFG_ok: set = $ S\ s, S\ l, S\ x, {y | y = x + len s} $;
| ^
error: expecting (
../examples/assembler-old.mm1:641:37:
|
641 | theorem CFG_ok_i: $ A C_ CFG_ok -> s, l, x, y e. A -> y = x + len s $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/assembler-old.mm1:644:49:
|
644 | theorem mk_CFG_ok (p: wff s l x y) (h: $ p -> y = x + len s $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:649:15:
|
649 | $ A C_ CFG_ok /\ E. u (s = u ++ t /\ u, l, x, y e. A) $;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/assembler-old.mm1:652:17:
|
652 | (h1: $ p -> y = x + len s $) (h2: $ s2 = u2 ++ t2 $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/assembler-old.mm1:659:21:
|
659 | $ E. y sat_CFG s s0 0 x y A $;
| ^
error: unexpected '0'
expecting '$', infix >= 0, or infix >= 41
../examples/assembler-old.mm1:660:43:
|
660 | theorem sat_CFG_func_i (h: $ sat_CFG s s0 0 x y A $):
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/assembler-old.mm1:662:32:
|
662 | theorem sat_CFG_func_iff (h: $ assemble1OLD s x y $):
| ^
error: assemble1OLD is not a function
../examples/assembler-old.mm1:671:1:
|
671 | @_ local def CFG0: set = $ S\ s, S\ l, S\ x, {y | s = 0 /\ y = x} $;
| ^
error: Unknown function 'annotate'
../examples/assembler-old.mm1:671:31:
|
671 | @_ local def CFG0: set = $ S\ s, S\ l, S\ x, {y | s = 0 /\ y = x} $;
| ^
error: expecting (
../examples/assembler-old.mm1:672:21:
|
672 | theorem sat_CFG0: $ sat_CFG s s l x x CFG0 $ =
| ^
error: sat_CFG is not a function
../examples/assembler-old.mm1:677:1:
|
677 | @_ local def CFG1 (ast: nat): set =
| ^
error: Unknown function 'annotate'
../examples/assembler-old.mm1:678:6:
|
678 | $ S\ s, S\ l, S\ x, {y | decode ast s /\ y = x + len s} $;
| ^
error: expecting (
../examples/assembler-old.mm1:679:20:
|
679 | theorem CFG1_ok: $ CFG1 ast C_ CFG_ok $ = (named '(mk_CFG_ok anr));
| ^
error: CFG1 is not a function
../examples/assembler-old.mm1:680:25:
|
680 | theorem sat_CFG1 (h1: $ assemble1OLD s x y $) (h2: $ decode ast s $):
| ^
error: assemble1OLD is not a function
../examples/assembler-old.mm1:684:1:
|
684 | @_ local def CFG_seq (A B: set): set =
| ^
error: Unknown function 'annotate'
../examples/assembler-old.mm1:685:6:
|
685 | $ S\ s, S\ l, S\ x, {y | E. t1 E. t2 E. z (s = t1 ++ t2 /\
| ^
error: expecting (
../examples/assembler-old.mm1:687:28:
|
687 | theorem sat_CFG_seq (h1: $ sat_CFG s t l x y A $) (h2: $ sat_CFG t u l y z B $):
| ^
error: sat_CFG is not a function
../examples/assembler-old.mm1:698:1:
|
698 | @_ local def CFG_S (ast: nat) (A: set): set = $ CFG_seq (CFG1 ast) A $;
| ^
error: Unknown function 'annotate'
../examples/assembler-old.mm1:698:49:
|
698 | @_ local def CFG_S (ast: nat) (A: set): set = $ CFG_seq (CFG1 ast) A $;
| ^
error: CFG_seq is not a function
../examples/assembler-old.mm1:699:26:
|
699 | theorem sat_CFG_S (h1: $ assemble1OLD s x y $) (h2: $ decode ast s $)
| ^
error: assemble1OLD is not a function
../examples/assembler-old.mm1:703:1:
|
703 | @_ local def CFG_scope (A: set): set =
| ^
error: Unknown function 'annotate'
../examples/assembler-old.mm1:704:6:
|
704 | $ S\ s, S\ l, S\ x, {y | E. a (s, a : l, x, y e. A)} $;
| ^
error: expecting (
../examples/assembler-old.mm1:705:46:
|
705 | theorem sat_CFG_scope (h: $ sat_CFG s t (a : l) x y A $):
| ^
error: expecting ) or infix >= 0
../examples/assembler-old.mm1:713:1:
|
713 | @_ local def CFG_label: set =
| ^
error: Unknown function 'annotate'
../examples/assembler-old.mm1:714:6:
|
714 | $ S\ s, S\ l, S\ x, {y | s = 0 /\ y = x /\ E. l2 l = x : l2} $;
| ^
error: expecting (
../examples/assembler-old.mm1:715:43:
|
715 | theorem sat_CFG_label: $ sat_CFG s s (x : l) x x CFG_label $ =
| ^
error: expecting ) or infix >= 0
../examples/assembler-old.mm1:720:1:
|
720 | @_ local def CFG_lift (A: set): set =
| ^
error: Unknown function 'annotate'
../examples/assembler-old.mm1:721:6:
|
721 | $ S\ s, S\ l, S\ x, {y | E. a E. l2 (l = a : l2 /\ s, l2, x, y e. A)} $;
| ^
error: expecting (
../examples/assembler-old.mm1:722:28:
|
722 | theorem sat_CFG_lift (h: $ sat_CFG s t l x y A $):
| ^
error: sat_CFG is not a function
../examples/assembler-old.mm1:730:1:
|
730 | @_ local def CFG_block (A B: set): set =
| ^
error: Unknown function 'annotate'
../examples/assembler-old.mm1:731:3:
|
731 | $ CFG_seq (CFG_scope (CFG_seq A CFG_label)) B $;
| ^
error: CFG_seq is not a function
../examples/assembler-old.mm1:732:47:
|
732 | theorem sat_CFG_block (h1: $ sat_CFG s t (y : l) x y A $) (h2: $ sat_CFG t u l y z B $):
| ^
error: expecting ) or infix >= 0
../examples/assembler-old.mm1:736:1:
|
736 | @_ local def CFG_loop (A B: set): set =
| ^
error: Unknown function 'annotate'
../examples/assembler-old.mm1:737:3:
|
737 | $ CFG_seq (CFG_scope (CFG_seq CFG_label A)) B $;
| ^
error: CFG_seq is not a function
../examples/assembler-old.mm1:738:46:
|
738 | theorem sat_CFG_loop (h1: $ sat_CFG s t (x : l) x y A $) (h2: $ sat_CFG t u l y z B $):
| ^
error: expecting ) or infix >= 0
../examples/assembler-old.mm1:742:1:
|
742 | @_ local def CFG_ex (p: wff x) (A: set x): set = $ {z | E. x (p /\ z e. A)} $;
| ^
error: Unknown function 'annotate'
../examples/assembler-old.mm1:742:68:
|
742 | @_ local def CFG_ex (p: wff x) (A: set x): set = $ {z | E. x (p /\ z e. A)} $;
| ^
error: expecting ) or infix >= 0
../examples/assembler-old.mm1:744:12:
|
744 | (e1: $ a = b -> (p <-> q) $) (e2: $ a = b -> A == B $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
=================== ERR =================== ../examples/assembler-old.mm1
=================== OK ==================== ../examples/big_unifier.mm1
=================== OK ==================== ../examples/compiler.mm0
depth limit exceeded
=================== ERR =================== ../examples/compiler.mm1
depth limit exceeded
=================== ERR =================== ../examples/compiler-new.mm1
depth limit exceeded
=================== ERR =================== ../examples/compiler-old.mm1
../examples/demo.mm1:15:29:
|
15 | (refine tgt (foldl ps '(:verb ,e) @ fn (acc p2) '(mp ,acc ,p2))))
| ^
error: failed to unify: a -> ?S? ?a ?b ?c =?= a -> b -> c
../examples/demo.mm1:15:29:
|
15 | (refine tgt (foldl ps '(:verb ,e) @ fn (acc p2) '(mp ,acc ,p2))))
| ^
error: terms do not match: S != imp
../examples/demo.mm1:15:29:
|
15 | (refine tgt (foldl ps '(:verb ,e) @ fn (acc p2) '(mp ,acc ,p2))))
| ^
error: failed to unify: ?K? ?a ?b =?= b
../examples/demo.mm1:15:29:
|
15 | (refine tgt (foldl ps '(:verb ,e) @ fn (acc p2) '(mp ,acc ,p2))))
| ^
error: term vs variable: ?K? ?a ?b != b
../examples/demo.mm1:18:40:
|
18 | theorem a1i (h: $ b $): $ a -> b $ = '(K h);
| ^
error: failed to unify: a -> b =?= b
../examples/demo.mm1:18:40:
|
18 | theorem a1i (h: $ b $): $ a -> b $ = '(K h);
| ^
error: term vs variable: a -> b != b
../examples/demo.mm1:19:68:
|
19 | theorem mpd (h1: $ a -> b $) (h2: $ a -> b -> c $): $ a -> c $ = '(S h2 h1);
| ^
error: ?a: wff
../examples/demo.mm1:19:68:
|
19 | theorem mpd (h1: $ a -> b $) (h2: $ a -> b -> c $): $ a -> c $ = '(S h2 h1);
| ^
error: failed to unify: a -> c =?= ?S? ?a ?b ?c
../examples/demo.mm1:19:68:
|
19 | theorem mpd (h1: $ a -> b $) (h2: $ a -> b -> c $): $ a -> c $ = '(S h2 h1);
| ^
error: terms do not match: imp != S
../examples/demo.mm1:19:73:
|
19 | theorem mpd (h1: $ a -> b $) (h2: $ a -> b -> c $): $ a -> c $ = '(S h2 h1);
| ^
error: failed to unify: a =?= a -> b
../examples/demo.mm1:19:73:
|
19 | theorem mpd (h1: $ a -> b $) (h2: $ a -> b -> c $): $ a -> c $ = '(S h2 h1);
| ^
error: variable vs term: a != a -> b
../examples/demo.mm1:24:10:
|
24 | '(S K (! K _ a));
| ^
error: syntax error in parseRefine: ?h
../examples/demo.mm1:34:14:
|
34 | (named '(S K K));
| ^
error: syntax error in parseRefine: ?h
../examples/demo.mm1:47:3:
|
47 | {2 + 2}
| ^
info: 4
../examples/demo.mm1:77:2:
|
77 | (stat));
| ^
info:
../examples/demo.mm1:84:2:
|
84 | (stat));
| ^
info:
=================== ERR =================== ../examples/demo.mm1
../examples/do-block.mm1:2:4:
|
2 | (display "hello world") -- hello world
| ^
info: hello world
../examples/do-block.mm1:3:4:
|
3 | (print (null? ())) -- #t
| ^
info: #t
../examples/do-block.mm1:4:3:
|
4 | (if (null? '(1)) 0 1) -- 1
| ^
info: 1
../examples/do-block.mm1:5:3:
|
5 | (if (null? ()) 0 1) -- 0
| ^
info: 0
../examples/do-block.mm1:6:3:
|
6 | {2 + 2} -- 4
| ^
info: 4
../examples/do-block.mm1:7:3:
|
7 | '{2 + 2} -- (+ 2 2)
| ^
info: (+ 2 2)
../examples/do-block.mm1:8:3:
|
8 | {1 < 2 < 3 < 4} -- #t
| ^
info: #t
../examples/do-block.mm1:9:3:
|
9 | {1 < 2 < 3 < 3} -- #f
| ^
info: #f
../examples/do-block.mm1:10:3:
|
10 | {1 * 2 * 3 * 4} -- 24
| ^
info: 24
../examples/do-block.mm1:11:3:
|
11 | (max 1 2 3 4) -- 4
| ^
info: 4
../examples/do-block.mm1:12:3:
|
12 | (min 1 2 3 4) -- 1
| ^
info: 1
../examples/do-block.mm1:13:3:
|
13 | (hd '(* 1 2 3 4)) -- *
| ^
info: *
../examples/do-block.mm1:14:3:
|
14 | (tl '(* 1 2 3 4)) -- (1 2 3 4)
| ^
info: (1 2 3 4)
../examples/do-block.mm1:15:3:
|
15 | (list 1 2 3 4) -- (1 2 3 4)
| ^
info: (1 2 3 4)
../examples/do-block.mm1:17:3:
|
17 | {x + x} -- 10
| ^
info: 10
../examples/do-block.mm1:19:3:
|
19 | x -- #<closure>
| ^
info: #<closure>
../examples/do-block.mm1:20:3:
|
20 | (x) -- 5
| ^
info: 5
../examples/do-block.mm1:22:3:
|
22 | (fact 5) -- 120
| ^
info: 120
../examples/do-block.mm1:23:3:
|
23 | ((fn (a) ''a) 1) -- (quote a)
| ^
info: (quote a)
../examples/do-block.mm1:24:3:
|
24 | ((fn (a) '',a) 1) -- (quote 1)
| ^
info: (quote 1)
../examples/do-block.mm1:25:3:
|
25 | ((fn (a) '(,a . ,a)) 1) -- (1 . 1)
| ^
info: (1 . 1)
../examples/do-block.mm1:26:3:
|
26 | (cons (list (def x 2) x) (x))-- ((2) . 5)
| ^
info: ((2) . 5)
=================== OK ==================== ../examples/do-block.mm1
=================== OK ==================== ../examples/goldbach.mm0
../examples/hello_assembler.mm0:6:1:
|
6 | output string: $ hello $;
| ^
warning: unimplemented
=================== OK ==================== ../examples/hello_assembler.mm0
depth limit exceeded
=================== ERR =================== ../examples/hello_assembler.mm1
../examples/hello.mm0:46:1:
|
46 | output string: $ _H + _e + _l + _l + _o + __ +
| ^
warning: unimplemented
=================== OK ==================== ../examples/hello.mm0
=================== OK ==================== ../examples/hello_mmc.mm0
depth limit exceeded
=================== ERR =================== ../examples/hello_mmc.mm1
=================== OK ==================== ../examples/hol.mm0
../examples/hol.mm1:127:50:
|
127 | theorem eqmpr (h1: $ G |- B <=> A $) (h2: $ G |- A $): $ G |- B $ = '(eqmp (sym h1) h2);
| ^
error: inferred two types term, wff for A
../examples/hol.mm1:134:52:
|
134 | pub theorem EQT_ELIM (h: $ G |- P <=> T $): $ G |- P $ = '(eqmpr h TRUTH);
| ^
error: inferred two types term, wff for P
../examples/hol.mm1:135:47:
|
135 | pub theorem EQT_INTRO (h: $ G |- P $): $ G |- P <=> T $ = '(ded TRUTH (anwl h));
| ^
error: inferred two types wff, term for P
../examples/hol.mm1:208:60:
|
208 | pub theorem CONJ (h1: $ G |- a $) (h2: $ G |- b $): $ G |- a /\ b $ =
| ^
error: inferred two types wff, term for a
../examples/hol.mm1:212:52:
|
212 | pub theorem CONJ_PAIR (h: $ G |- a /\ b $): $ G |- a; b $ =
| ^
error: inferred two types term, wff for a
../examples/hol.mm1:231:52:
|
231 | pub theorem CONJUNCT1 (h: $ G |- a /\ b $): $ G |- a $ = '(anld @ CONJ_PAIR h);
| ^
error: inferred two types term, wff for a
../examples/hol.mm1:232:52:
|
232 | pub theorem CONJUNCT2 (h: $ G |- a /\ b $): $ G |- b $ = '(anrd @ CONJ_PAIR h);
| ^
error: inferred two types term, wff for b
../examples/hol.mm1:252:51:
|
252 | pub theorem MP (h1: $ G |- p ==> q $) (h2: $ G |- p $): $ G |- q $ =
| ^
error: inferred two types term, wff for p
../examples/hol.mm1:255:74:
|
255 | pub theorem DISCH (hp: $ G |- p: bool $) (hq: $ G |- q: bool $) (h: $ G; p |- q $): $ G |- p ==> q $ =
| ^
error: inferred two types term, wff for p
../examples/hol.mm1:258:49:
|
258 | pub theorem UNDISCH (h: $ G |- p ==> q $): $ G; p |- q $ = '(MP (anwl h) anr);
| ^
error: inferred two types term, wff for p
../examples/hol.mm1:260:8:
|
260 | '(ded (UNDISCH h1) (UNDISCH h2));
| ^
error: unknown theorem/hypothesis 'UNDISCH'
../examples/hol.mm1:263:3:
|
263 | '(DISCH (eqR1 h) (eqR2 h) @ eqmp (anwl h) anr);
| ^
error: unknown theorem/hypothesis 'DISCH'
../examples/hol.mm1:268:3:
|
268 | '(DISCH (anld @ impR h1) (anrd @ impR h2) @ syl (ian anl (UNDISCH h1)) (UNDISCH h2));
| ^
error: unknown theorem/hypothesis 'DISCH'
../examples/hol.mm1:288:3:
|
288 | '(EQT_ELIM @ trans (aeq1 (eqmp (all_def @ appTR2 (thmR h2) allT) h2) h) @
| ^
error: unknown theorem/hypothesis 'EQT_ELIM'
../examples/hol.mm1:295:3:
|
295 | '(DISCH (allcT h0) h2 @ eqmp (anwl @ betac h0 h1 h2 h3) (specp (anwl h1) anr));
| ^
error: unknown theorem/hypothesis 'DISCH'
../examples/hol.mm1:300:3:
|
300 | '(MP (spec (lamTR @ appTR2 (thmR h4) allT) h1 h2 h3) h4);
| ^
error: unknown theorem/hypothesis 'MP'
../examples/hol.mm1:304:3:
|
304 | '(eqmpr (all_def @ lamT @ thmR h) @ leq @ EQT_INTRO h);
| ^
error: unknown theorem/hypothesis 'eqmpr'
../examples/hol.mm1:337:5:
|
337 | '(MP (SPEC hq
| ^
error: unknown theorem/hypothesis 'MP'
../examples/hol.mm1:347:5:
|
347 | '(eqmpr (ex_def h1) @ !! GEN r @ DISCH (allcT ,H) anr @
| ^
error: unknown theorem/hypothesis 'eqmpr'
../examples/hol.mm1:354:23:
|
354 | '(existsp (lamT h1) @ eqmpr (betac h1 h2 (thmR h4) h3) h4);
| ^
error: unknown theorem/hypothesis 'eqmpr'
../examples/hol.mm1:381:3:
|
381 | '(eqmpr (orc_def (thmR h1) h2) @ !! GEN r @
| ^
error: unknown theorem/hypothesis 'eqmpr'
../examples/hol.mm1:386:3:
|
386 | '(eqmpr (orc_def h1 (thmR h2)) @ !! GEN r @
| ^
error: unknown theorem/hypothesis 'eqmpr'
../examples/hol.mm1:391:13:
|
391 | (h1: $ G; p |- r $) (h2: $ G; q |- r $): $ G |- r $ =
| ^
error: inferred two types term, wff for p
../examples/hol.mm1:417:62:
|
417 | pub theorem NOT_INTRO (h: $ G |- p ==> F $): $ G |- ~p $ = '(eqmpr (notc_def @ anld @ impR h) h);
| ^
error: unknown theorem/hypothesis 'eqmpr'
../examples/hol.mm1:419:30:
|
419 | '(IMP_ANTISYM (NOT_ELIM h) @ DISCH FT (notR h) @ CONTR (anwl @ notR h) anr);
| ^
error: unknown theorem/hypothesis 'DISCH'
../examples/hol.mm1:442:15:
|
442 | '(GEN @ GEN @ DISCH (appT anlr anr) (appT anlr @ appT selT anlr) @ ax_sel anllr anr);
| ^
error: unknown theorem/hypothesis 'DISCH'
../examples/hol.mm1:451:5:
|
451 | '(DISJ_CASES ,(F (fn (x) x) 'anr 'TT 'TRUTH) H _ (DISJ1 anr @ anwl h2))
| ^
error: unknown theorem/hypothesis 'DISJ_CASES'
../examples/hol.mm1:458:71:
|
458 | pub theorem CCONTR (h: $ G |- p: bool $) (h2: $ G; ~p |- F $): $ G |- p $ =
| ^
error: inferred two types term, wff for p
=================== ERR =================== ../examples/hol.mm1
../examples/lean.mm1:627:21:
|
627 | {(!! subst_var a) : $ subst: _ [ list_ind / _ ] = _ $}) @ conv_list_ind h);
| ^
error: unknown theorem/hypothesis ':'
../examples/lean.mm1:641:5:
|
641 | : $ subst: _ [ list_ind / _ ] = _ $}) @
| ^
error: unknown theorem/hypothesis ':'
../examples/lean.mm1:659:20:
|
659 | {Rec_kappa_0 : $ Rec_kappa _ list_ind $} @
| ^
error: unknown theorem/hypothesis ':'
../examples/lean.mm1:715:18:
|
715 | {Rec_kappa_0 : $ Rec_kappa _ list_ind $}
| ^
error: unknown theorem/hypothesis ':'
../examples/lean.mm1:758:18:
|
758 | {Rec_kappa_0 : $ Rec_kappa _ list_ind $}
| ^
error: unknown theorem/hypothesis ':'
=================== ERR =================== ../examples/lean.mm1
=================== OK ==================== ../examples/miu.mm0
=================== OK ==================== ../examples/mm0.mm0
../examples/mm0.mm1:6:1:
|
6 | @_ def sPure (n: nat): wff = $ true (pi11 n) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:6:36:
|
6 | @_ def sPure (n: nat): wff = $ true (pi11 n) $;
| ^
error: true is not a function
../examples/mm0.mm1:8:1:
|
8 | @_ def sStrict (n: nat): wff = $ true (pi12 n) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:8:36:
|
8 | @_ def sStrict (n: nat): wff = $ true (pi12 n) $;
| ^
error: true is not a function
../examples/mm0.mm1:10:1:
|
10 | @_ def sProvable (n: nat): wff = $ true (pi21 n) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:10:36:
|
10 | @_ def sProvable (n: nat): wff = $ true (pi21 n) $;
| ^
error: true is not a function
../examples/mm0.mm1:12:1:
|
12 | @_ def sFree (n: nat): wff = $ true (pi22 n) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:12:36:
|
12 | @_ def sFree (n: nat): wff = $ true (pi22 n) $;
| ^
error: true is not a function
../examples/mm0.mm1:18:1:
|
18 | @_ def PBound (s: nat): nat = $ b0 s $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:18:33:
|
18 | @_ def PBound (s: nat): nat = $ b0 s $;
| ^
error: b0 is not a function
../examples/mm0.mm1:20:1:
|
20 | @_ def PReg (s vs: nat): nat = $ b1 (s, vs) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:20:41:
|
20 | @_ def PReg (s vs: nat): nat = $ b1 (s, vs) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:25:1:
|
25 | @_ def binderSort (x: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:26:11:
|
26 | $ case (\ n, n) (\ n, fst n) @ x $;
| ^
error: expecting (
../examples/mm0.mm1:27:63:
|
27 | pub theorem binderSortBound (s: nat): $ binderSort (PBound s) = s $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:29:65:
|
29 | pub theorem binderSortReg (s vs: nat): $ binderSort (PReg s vs) = s $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:32:42:
|
32 | theorem binderSort_leid: $ binderSort bi <= bi $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:43:1:
|
43 | @_ def SVar (v: nat): nat = $ b0 v $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:43:31:
|
43 | @_ def SVar (v: nat): nat = $ b0 v $;
| ^
error: b0 is not a function
../examples/mm0.mm1:45:1:
|
45 | @_ def SApp (f x: nat): nat = $ b1 (f, x) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:45:40:
|
45 | @_ def SApp (f x: nat): nat = $ b1 (f, x) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:47:35:
|
47 | theorem SApp_ltid: $ e IN es -> e < SApp f es $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:50:1:
|
50 | @_ local def SExprRec (V F: set): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:51:5:
|
51 | $ \ e, srec (\ ih, case V (\\ f, \ x, F @ (f, x, map ih x)) @ size (Dom ih)) e $;
| ^
error: expecting (
../examples/mm0.mm1:53:38:
|
53 | theorem SExprRec_val: $ SExprRec V F @ e =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:62:38:
|
62 | theorem SExprRec_Var: $ SExprRec V F @ SVar v = V @ v $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:65:18:
|
65 | $ SExprRec V F @ SApp f es = F @ (f, es, map (SExprRec V F) es) $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:71:39:
|
71 | theorem indd_aux (G p: wff x) (e: $ x = b -> (p <-> q) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:76:12:
|
76 | (hn: $ x = n -> (px <-> pn) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:95:1:
|
95 | @_ def DSort (id sd: nat): nat = $ b0 (b0 (b0 (id, sd))) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:95:52:
|
95 | @_ def DSort (id sd: nat): nat = $ b0 (b0 (b0 (id, sd))) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:101:1:
|
101 | @_ def DTerm (id args ret: nat): nat = $ b0 (b0 (b1 (id, args, ret))) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:101:58:
|
101 | @_ def DTerm (id args ret: nat): nat = $ b0 (b0 (b1 (id, args, ret))) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:108:1:
|
108 | @_ def DAxiom (args hs ret: nat): nat = $ b0 (b1 (args, hs, ret)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:108:57:
|
108 | @_ def DAxiom (args hs ret: nat): nat = $ b0 (b1 (args, hs, ret)) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:116:1:
|
116 | @_ def DDef (id args ret def: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:117:17:
|
117 | $ b1 (b0 (id, args, ret, def)) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:125:1:
|
125 | @_ def DThm (vs hs ret: nat): nat = $ b1 (b1 (vs, hs, ret)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:125:51:
|
125 | @_ def DThm (vs hs ret: nat): nat = $ b1 (b1 (vs, hs, ret)) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:130:1:
|
130 | @_ def getSD (env id sd: nat): wff = $ DSort id sd IN env $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:130:40:
|
130 | @_ def getSD (env id sd: nat): wff = $ DSort id sd IN env $;
| ^
error: DSort is not a function
../examples/mm0.mm1:135:1:
|
135 | @_ def getTerm (env id a r v: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:136:5:
|
136 | $ v = 0 /\ DTerm id a r IN env \/ DDef id a r v IN env $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:138:50:
|
138 | theorem getTerm_ltid: $ getTerm env x a r v -> x < env /\ a < env /\ r < env /\ v < env $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:156:53:
|
156 | theorem getTerm_retltid: $ getTerm env x a r v -> r < env $ = '(rsyl getTerm_ltid anlr);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:157:53:
|
157 | theorem getTerm_valltid: $ getTerm env x a r v -> v < env $ = '(rsyl getTerm_ltid anr);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:162:1:
|
162 | @_ def getThm (env a h r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:163:23:
|
163 | $ DAxiom a h r IN env \/ DThm a h r IN env $;
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/mm0.mm1:168:1:
|
168 | @_ def isSort (env s .sd: nat): wff = $ E. sd getSD env s sd $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:168:47:
|
168 | @_ def isSort (env s .sd: nat): wff = $ E. sd getSD env s sd $;
| ^
error: getSD is not a function
../examples/mm0.mm1:174:1:
|
174 | @_ def isBound (ctx x .s: nat): wff = $ E. s nth x ctx = suc (PBound s) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:174:56:
|
174 | @_ def isBound (ctx x .s: nat): wff = $ E. s nth x ctx = suc (PBound s) $;
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 41
../examples/mm0.mm1:180:1:
|
180 | @_ def DepType (env ctx ty .x: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:181:23:
|
181 | $ isSort env (fst ty) /\ A. x (x e. snd ty -> isBound ctx x) $;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/mm0.mm1:183:1:
|
183 | @_ local def Ctx_aux (env ctx: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:184:9:
|
184 | $ rlrec 1 (\\ ctx2, \\ bi, \ ih, ih * nat (bi e. Sum
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/mm0.mm1:187:44:
|
187 | theorem Ctx_aux0 (env: nat): $ Ctx_aux env 0 = 1 $ = (named 'rlrec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:188:52:
|
188 | theorem Ctx_auxS (env: nat): $ Ctx_aux env (ctx |> bi) = Ctx_aux env ctx *
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:201:1:
|
201 | @_ abstract def Ctx (env ctx: nat): wff = $ true (Ctx_aux env ctx) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:201:45:
|
201 | @_ abstract def Ctx (env ctx: nat): wff = $ true (Ctx_aux env ctx) $;
| ^
error: true is not a function
../examples/mm0.mm1:202:40:
|
202 | pub theorem Ctx0 (env: nat): $ Ctx env 0 $ = '(mpbir (trueeq Ctx_aux0) true1);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:203:68:
|
203 | pub theorem CtxBound (env ctx s: nat) {sd: nat}: $ Ctx env (ctx |> PBound s) <->
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:207:59:
|
207 | pub theorem CtxReg (env ctx s vs: nat): $ Ctx env (ctx |> PReg s vs) <->
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:212:1:
|
212 | @_ local def ExprBi_aux (ctx e ih: nat): set = $ Sum
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:213:3:
|
213 | {s | E. v (e = SVar v /\ nth v ctx = suc (PBound s))}
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/mm0.mm1:216:1:
|
216 | @_ local def Expr_aux (env ctx: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:218:6:
|
218 | (\ v, lower {s | E. bi (nth v ctx = suc bi /\ binderSort bi = s)})
| ^
error: expecting (
../examples/mm0.mm1:224:42:
|
224 | theorem Expr_aux_Var: $ Expr_aux env ctx @ SVar v =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:229:42:
|
229 | theorem Expr_aux_App: $ Expr_aux env ctx @ SApp f es =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:246:1:
|
246 | @_ abstract def Expr (env ctx e s: nat): wff = $ s e. Expr_aux env ctx @ e $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:246:72:
|
246 | @_ abstract def Expr (env ctx e s: nat): wff = $ s e. Expr_aux env ctx @ e $;
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:248:1:
|
248 | @_ abstract def ExprBi (env ctx e bi: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:249:46:
|
249 | $ bi e. ExprBi_aux ctx e (Expr_aux env ctx @ e) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:252:39:
|
252 | $ zip es (map (Expr_aux env ctx) es), args e. all2 (S\ p, ExprBi_aux ctx (fst p) (snd p)) <->
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/mm0.mm1:264:77:
|
264 | pub theorem ExprVar (env ctx v s: nat) {bi: nat}: $ Expr env ctx (SVar v) s <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:273:32:
|
273 | $ Expr env ctx (SApp f xs) s <-> E. args E. ret E. o
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:284:33:
|
284 | $ ExprBi env ctx e (PBound s) <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:288:34:
|
288 | $ ExprBi env ctx e (PReg s vs) <-> Expr env ctx e s $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:296:1:
|
296 | @_ def ExprProv (env ctx e .s .sd: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:297:35:
|
297 | $ E. s E. sd (Expr env ctx e s /\ getSD env s sd /\ sProvable sd) $;
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/mm0.mm1:302:1:
|
302 | @_ def appendDummies (ctx ds .d: nat): nat = $ ctx ++ map (\ d, PBound d) ds $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:302:52:
|
302 | @_ def appendDummies (ctx ds .d: nat): nat = $ ctx ++ map (\ d, PBound d) ds $;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/mm0.mm1:304:1:
|
304 | @_ local def HasVar_aux (ctx: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:306:6:
|
306 | (\ u, lower {v | E. s nth u ctx = suc (PBound s) /\ u = v \/
| ^
error: expecting (
../examples/mm0.mm1:315:1:
|
315 | @_ abstract def HasVar (ctx e v: nat): wff = $ v e. HasVar_aux ctx @ e $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:315:68:
|
315 | @_ abstract def HasVar (ctx e v: nat): wff = $ v e. HasVar_aux ctx @ e $;
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:317:45:
|
317 | theorem HasVar_Var: $ HasVar ctx (SVar u) v <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:332:15:
|
332 | $ nth u ctx = suc (PBound s) -> (HasVar ctx (SVar u) v <-> u = v) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:339:15:
|
339 | $ nth u ctx = suc (PReg s vs) -> (HasVar ctx (SVar u) v <-> v e. vs) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:348:30:
|
348 | $ HasVar ctx (SApp f es) v <-> E. e (e IN es /\ HasVar ctx e v) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:363:1:
|
363 | @_ def MaybeFreeArgs (es a v .s .vs .u: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:364:19:
|
364 | $ E. s E. vs (a = PReg s vs /\ ~(E. u (u e. vs /\ nth u es = suc (SVar v)))) $;
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/mm0.mm1:366:1:
|
366 | @_ local def Free_aux (env ctx v: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:368:6:
|
368 | (\ u, nat (HasVar ctx (SVar u) v))
| ^
error: expecting (
../examples/mm0.mm1:382:1:
|
382 | @_ abstract def Free (env ctx e v: nat): wff = $ true (Free_aux env ctx v @ e) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:382:77:
|
382 | @_ abstract def Free (env ctx e v: nat): wff = $ true (Free_aux env ctx v @ e) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:384:29:
|
384 | $ Free env ctx (SVar u) v <-> HasVar ctx (SVar u) v $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:390:32:
|
390 | $ Free env ctx (SApp f es) v <-> E. args E. r E. rs E. o
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:415:1:
|
415 | @_ def TermOk (env id args ret .a .r .v .sd: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:416:40:
|
416 | $ ~E. a E. r E. v getTerm env id a r v /\
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 41
../examples/mm0.mm1:427:1:
|
427 | @_ def DefOk (env id args ret ds e .ctx .v .s .sd: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:428:26:
|
428 | $ TermOk env id args ret /\ [ appendDummies args ds / ctx ]
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/mm0.mm1:434:1:
|
434 | @_ local def DeclThm_aux (env: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:435:6:
|
435 | $ S\ args, S\ hs, {ret | Ctx env args /\ all {x | ExprProv env args x} (ret : hs)} $;
| ^
error: expecting (
../examples/mm0.mm1:438:9:
|
438 | $ args, hs, ret e. DeclThm_aux env <->
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/mm0.mm1:446:1:
|
446 | @_ abstract def Decl (env d: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:450:11:
|
450 | (S\ id, {sd | ~E. sd2 getSD env id sd2})
| ^
error: expecting (
../examples/mm0.mm1:459:28:
|
459 | $ Decl env (DSort id sd) <-> ~E. sd2 getSD env id sd2 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:462:34:
|
462 | $ Decl env (DTerm id args ret) <-> TermOk env id args ret $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:465:35:
|
465 | $ Decl env (DAxiom args hs ret) <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:469:35:
|
469 | $ Decl env (DDef id args ret o) <-> TermOk env id args ret /\
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:475:33:
|
475 | $ Decl env (DThm args hs ret) <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:479:1:
|
479 | @_ local def Env_aux (e: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:480:9:
|
480 | $ rlrec 1 (\\ e1, \\ s, \ ih, ih * nat (Decl e1 s)) e $;
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/mm0.mm1:486:1:
|
486 | @_ abstract def Env (e: nat): wff = $ true (Env_aux e) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:486:39:
|
486 | @_ abstract def Env (e: nat): wff = $ true (Env_aux e) $;
| ^
error: true is not a function
../examples/mm0.mm1:487:25:
|
487 | pub theorem Env0: $ Env 0 $ = (named '(mpbir (trueeq rlrec0) true1));
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:488:42:
|
488 | pub theorem EnvS (e s: nat): $ Env (e |> s) <-> Env e /\ Decl e s $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:494:1:
|
494 | @_ local def EnvExtend_aux (e2_: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:495:14:
|
495 | $ rlrec (sn 0)
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:518:1:
|
518 | @_ abstract def EnvExtend (e1 e2: nat): wff = $ e1 e. EnvExtend_aux e2 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:518:55:
|
518 | @_ abstract def EnvExtend (e1 e2: nat): wff = $ e1 e. EnvExtend_aux e2 $;
| ^
error: EnvExtend_aux is not a function
../examples/mm0.mm1:519:48:
|
519 | pub theorem EnvExtend0 (e: nat): $ EnvExtend e 0 <-> e = 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:523:13:
|
523 | (h1: $ ih = EnvExtend_aux E2 -> case
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:558:25:
|
558 | (h: $ p -> E. e (e1 = e |> A /\ EnvExtend e E2) \/ EnvExtend e1 E2 $):
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:564:25:
|
564 | $ EnvExtend e1 (e2 |> DSort id sd) <->
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:574:25:
|
574 | $ EnvExtend e1 (e2 |> DTerm id a r) <->
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:584:25:
|
584 | $ EnvExtend e1 (e2 |> DAxiom a h r) <->
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:594:25:
|
594 | $ EnvExtend e1 (e2 |> DDef id a r o) <->
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:616:25:
|
616 | $ EnvExtend e1 (e2 |> DThm a h r) <->
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:631:1:
|
631 | @_ local def substExpr_aux (subst: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:632:15:
|
632 | $ SExprRec (\ v, nth v subst - 1) (\\ f, \\ xs, \ ih, SApp f ih) $;
| ^
error: expecting (
../examples/mm0.mm1:638:1:
|
638 | @_ abstract def substExpr (subst e: nat): nat = $ substExpr_aux subst @ e $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:638:71:
|
638 | @_ abstract def substExpr (subst e: nat): nat = $ substExpr_aux subst @ e $;
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:640:50:
|
640 | theorem substExpr_aux_lam: $ substExpr_aux subst == \ e, substExpr subst e $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:644:30:
|
644 | $ substExpr subst (SVar v) = nth v subst - 1 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:647:33:
|
647 | $ substExpr subst (SApp f es) = SApp f (map (\ e, substExpr subst e) es) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:656:1:
|
656 | @_ def CRefl (e: nat): nat = $ b0 (b0 (b0 e)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:656:32:
|
656 | @_ def CRefl (e: nat): nat = $ b0 (b0 (b0 e)) $;
| ^
error: b0 is not a function
../examples/mm0.mm1:660:1:
|
660 | @_ def CSymm (p: nat): nat = $ b0 (b0 (b1 p)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:660:32:
|
660 | @_ def CSymm (p: nat): nat = $ b0 (b0 (b1 p)) $;
| ^
error: b0 is not a function
../examples/mm0.mm1:664:1:
|
664 | @_ def CTrans (p q: nat): nat = $ b0 (b1 (p, q)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:664:46:
|
664 | @_ def CTrans (p q: nat): nat = $ b0 (b1 (p, q)) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:669:1:
|
669 | @_ def CCong (f cs: nat): nat = $ b1 (b0 (f, cs)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:669:46:
|
669 | @_ def CCong (f cs: nat): nat = $ b1 (b0 (f, cs)) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:674:1:
|
674 | @_ def CUnfold (f es zs: nat): nat = $ b1 (b1 (f, es, zs)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:674:51:
|
674 | @_ def CUnfold (f es zs: nat): nat = $ b1 (b1 (f, es, zs)) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:676:25:
|
676 | theorem CSymm_ltid: $ c < CSymm c $ = '(ltb0tr @ ltb0tr b1ltid);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:678:28:
|
678 | theorem CTrans_ltid1: $ c1 < CTrans c1 c2 $ = '(ltb0tr @ ltb1tr leprid1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:679:28:
|
679 | theorem CTrans_ltid2: $ c2 < CTrans c1 c2 $ = '(ltb0tr @ ltb1tr leprid2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:681:36:
|
681 | theorem CCong_ltid: $ c IN cs -> c < CCong f cs $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:684:1:
|
684 | @_ local def CExprRec (R S T C U: set): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:685:5:
|
685 | $ \ e, srec (\ ih, case
| ^
error: expecting (
../examples/mm0.mm1:693:44:
|
693 | theorem CExprRec_val: $ CExprRec R S T C U @ e = case
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:706:46:
|
706 | theorem CExprRec_CRefl: $ CExprRec R S T C U @ CRefl e = R @ e $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:709:24:
|
709 | $ CExprRec R S T C U @ CSymm c = S @ (c, CExprRec R S T C U @ c) $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:713:24:
|
713 | $ CExprRec R S T C U @ CTrans c1 c2 =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:720:24:
|
720 | $ CExprRec R S T C U @ CCong f cs = C @ (f, cs, map (CExprRec R S T C U) cs) $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:726:24:
|
726 | $ CExprRec R S T C U @ CUnfold f es zs = U @ (f, es, zs) $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:729:40:
|
729 | theorem indd_aux2 (G p: wff x) (e: $ x = c -> (p <-> q) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:736:12:
|
736 | (hn: $ x = n -> (px <-> pn) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:767:1:
|
767 | @_ def VHyp (n: nat): nat = $ b0 (b0 n) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:767:31:
|
767 | @_ def VHyp (n: nat): nat = $ b0 (b0 n) $;
| ^
error: b0 is not a function
../examples/mm0.mm1:774:1:
|
774 | @_ def VThm (a h r es ps: nat): nat = $ b0 (b1 (a, h, r, es, ps)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:774:52:
|
774 | @_ def VThm (a h r es ps: nat): nat = $ b0 (b1 (a, h, r, es, ps)) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:778:1:
|
778 | @_ def VConv (c p: nat): nat = $ b1 (c, p) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:778:41:
|
778 | @_ def VConv (c p: nat): nat = $ b1 (c, p) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:780:35:
|
780 | theorem VThm_ltid: $ p IN ps -> p < VThm a h r es ps $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:783:25:
|
783 | theorem VConv_ltid: $ p < VConv c p $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:786:1:
|
786 | @_ local def VExprRec (H T C: set): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:787:5:
|
787 | $ \ e, srec (\ ih, case
| ^
error: expecting (
../examples/mm0.mm1:792:40:
|
792 | theorem VExprRec_val: $ VExprRec H T C @ e = case
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:805:41:
|
805 | theorem VExprRec_VHyp: $ VExprRec H T C @ VHyp n = H @ n $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:808:20:
|
808 | $ VExprRec H T C @ VThm a h r es ps = T @ (a, h, r, es, ps, map (VExprRec H T C) ps) $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:815:20:
|
815 | $ VExprRec H T C @ VConv c p = C @ (c, p, VExprRec H T C @ p) $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:824:12:
|
824 | (hn: $ x = q -> (px <-> pq) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:839:1:
|
839 | @_ local def VerifyConv_aux (env ctx: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:841:8:
|
841 | (\ e, lower (S\ e1, S\ e2, {s | Expr env ctx e s /\ e = e1 /\ e = e2}))
| ^
error: expecting (
../examples/mm0.mm1:866:1:
|
866 | @_ abstract def VerifyConv (env ctx c e1 e2 s: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:867:5:
|
867 | $ e1, e2, s e. VerifyConv_aux env ctx @ c $;
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/mm0.mm1:871:1:
|
871 | @_ def VerifyConvs (env ctx cs es1 es2 bis .n .i .c .e1 .e2 .bi: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:872:18:
|
872 | $ E. n (len cs = n /\ len es1 = n /\ len es2 = n /\ len bis = n /\
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:879:48:
|
879 | (VerifyConvs env ctx cs es1 es2 bis -> es1 < n /\ es2 < n) $ =
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/mm0.mm1:910:28:
|
910 | $ VerifyConv_aux env ctx @ CRefl e = lower (S\ e1, S\ e2, {s |
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:916:42:
|
916 | $ VerifyConv env ctx (CRefl e) e1 e2 s <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:927:28:
|
927 | $ VerifyConv_aux env ctx @ CSymm c = lower (S\ e1, S\ e2, {s |
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:933:42:
|
933 | $ VerifyConv env ctx (CSymm c) e1 e2 s <-> VerifyConv env ctx c e2 e1 s $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:942:28:
|
942 | $ VerifyConv_aux env ctx @ CTrans c1 c2 = lower (S\ e1, S\ e2, {s |
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:949:47:
|
949 | $ VerifyConv env ctx (CTrans c1 c2) e1 e2 s <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:959:28:
|
959 | $ VerifyConv_aux env ctx @ CCong f cs = lower (S\ e1, S\ e2, {s |
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:984:45:
|
984 | $ VerifyConv env ctx (CCong f cs) e1 e2 s <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1009:28:
|
1009 | $ VerifyConv_aux env ctx @ CUnfold f es zs = lower (S\ e1, S\ e2, {s |
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:1021:50:
|
1021 | $ VerifyConv env ctx (CUnfold f es zs) e1 e2 s <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1043:1:
|
1043 | @_ local def VerifyProof_aux (env ctx hs: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1045:8:
|
1045 | (\ n, lower {ret | nth n hs = suc ret})
| ^
error: expecting (
../examples/mm0.mm1:1070:1:
|
1070 | @_ abstract def VerifyProof (env ctx hs pf ret: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1071:37:
|
1071 | $ ret e. VerifyProof_aux env ctx hs @ pf $;
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:1074:32:
|
1074 | $ VerifyProof_aux env ctx hs @ VHyp n = lower {ret | nth n hs = suc ret} $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:1078:41:
|
1078 | $ VerifyProof env ctx hs (VHyp n) ret <-> nth n hs = suc ret $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1084:32:
|
1084 | $ VerifyProof_aux env ctx hs @ VThm args2 hs2 ret2 es ps = lower {ret |
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:1111:60:
|
1111 | $ VerifyProof env ctx hs (VThm args2 hs2 ret2 es ps) ret <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1125:32:
|
1125 | $ VerifyProof_aux env ctx hs @ VConv c p = lower {ret |
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/mm0.mm1:1132:44:
|
1132 | $ VerifyProof env ctx hs (VConv c p) ret <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1141:1:
|
1141 | @_ local def EnvFull_aux (env: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1142:9:
|
1142 | $ rlrec 1 (\\ e, \\ d, \ ih, case (\ x, ih)
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/mm0.mm1:1149:38:
|
1149 | theorem EnvFull_aux_0: $ EnvFull_aux 0 = 1 $ = (named 'rlrec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:1150:46:
|
1150 | theorem EnvFull_aux_S: $ EnvFull_aux (env |> d) = case (\ x, EnvFull_aux env)
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1159:47:
|
1159 | theorem EnvFull_aux_b0: $ EnvFull_aux (env |> b0 x) = EnvFull_aux env $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1166:1:
|
1166 | @_ abstract def EnvFull (env: nat): wff = $ true (EnvFull_aux env) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1166:45:
|
1166 | @_ abstract def EnvFull (env: nat): wff = $ true (EnvFull_aux env) $;
| ^
error: true is not a function
../examples/mm0.mm1:1167:33:
|
1167 | pub theorem EnvFull0: $ EnvFull 0 $ = '(mpbir (trueeq EnvFull_aux_0) true1);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:1169:21:
|
1169 | $ EnvFull (env |> DSort id sd) <-> EnvFull env $ = '(trueeq EnvFull_aux_b0);
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1171:21:
|
1171 | $ EnvFull (env |> DTerm id a r) <-> EnvFull env $ = '(trueeq EnvFull_aux_b0);
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1173:21:
|
1173 | $ EnvFull (env |> DAxiom a h r) <-> EnvFull env $ = '(trueeq EnvFull_aux_b0);
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1175:21:
|
1175 | $ EnvFull (env |> DDef id a r o) <-> EnvFull env /\ o != 0 $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1179:21:
|
1179 | $ EnvFull (env |> DThm a h r) <-> EnvFull env /\
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1191:1:
|
1191 | @_ def ValidEnv (env .e .p: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1192:11:
|
1192 | $ Env env /\ E. e (Env e /\ EnvExtend env e /\ EnvFull e) $;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/mm0.mm1:1202:1:
|
1202 | @_ def _nl: char = "\n";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1202:24:
|
1202 | @_ def _nl: char = "\n";
| ^
warning: unimplemented
../examples/mm0.mm1:1204:1:
|
1204 | @_ def __: char = " ";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1204:24:
|
1204 | @_ def __: char = " ";
| ^
warning: unimplemented
../examples/mm0.mm1:1206:1:
|
1206 | @_ def _dollar: char = "$";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1206:24:
|
1206 | @_ def _dollar: char = "$";
| ^
warning: unimplemented
../examples/mm0.mm1:1208:1:
|
1208 | @_ def _lparen: char = "(";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1208:24:
|
1208 | @_ def _lparen: char = "(";
| ^
warning: unimplemented
../examples/mm0.mm1:1210:1:
|
1210 | @_ def _rparen: char = ")";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1210:24:
|
1210 | @_ def _rparen: char = ")";
| ^
warning: unimplemented
../examples/mm0.mm1:1212:1:
|
1212 | @_ def _ast: char = "*";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1212:24:
|
1212 | @_ def _ast: char = "*";
| ^
warning: unimplemented
../examples/mm0.mm1:1214:1:
|
1214 | @_ def _hyphen: char = "-";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1214:24:
|
1214 | @_ def _hyphen: char = "-";
| ^
warning: unimplemented
../examples/mm0.mm1:1216:1:
|
1216 | @_ def _dot: char = ".";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1216:24:
|
1216 | @_ def _dot: char = ".";
| ^
warning: unimplemented
../examples/mm0.mm1:1218:1:
|
1218 | @_ def _colon: char = ":";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1218:24:
|
1218 | @_ def _colon: char = ":";
| ^
warning: unimplemented
../examples/mm0.mm1:1220:1:
|
1220 | @_ def _semi: char = ";";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1220:24:
|
1220 | @_ def _semi: char = ";";
| ^
warning: unimplemented
../examples/mm0.mm1:1222:1:
|
1222 | @_ def _equal: char = "=";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1222:24:
|
1222 | @_ def _equal: char = "=";
| ^
warning: unimplemented
../examples/mm0.mm1:1224:1:
|
1224 | @_ def _gt: char = ">";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1224:24:
|
1224 | @_ def _gt: char = ">";
| ^
warning: unimplemented
../examples/mm0.mm1:1226:1:
|
1226 | @_ def _under: char = "_";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1226:24:
|
1226 | @_ def _under: char = "_";
| ^
warning: unimplemented
../examples/mm0.mm1:1228:1:
|
1228 | @_ def _lbrace: char = "{";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1228:24:
|
1228 | @_ def _lbrace: char = "{";
| ^
warning: unimplemented
../examples/mm0.mm1:1230:1:
|
1230 | @_ def _rbrace: char = "}";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1230:24:
|
1230 | @_ def _rbrace: char = "}";
| ^
warning: unimplemented
../examples/mm0.mm1:1233:1:
|
1233 | @_ def _0: char = "0";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1233:19:
|
1233 | @_ def _0: char = "0";
| ^
warning: unimplemented
../examples/mm0.mm1:1234:1:
|
1234 | @_ def _1: char = "1";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1234:19:
|
1234 | @_ def _1: char = "1";
| ^
warning: unimplemented
../examples/mm0.mm1:1235:1:
|
1235 | @_ def _2: char = "2";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1235:19:
|
1235 | @_ def _2: char = "2";
| ^
warning: unimplemented
../examples/mm0.mm1:1236:1:
|
1236 | @_ def _3: char = "3";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1236:19:
|
1236 | @_ def _3: char = "3";
| ^
warning: unimplemented
../examples/mm0.mm1:1237:1:
|
1237 | @_ def _4: char = "4";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1237:19:
|
1237 | @_ def _4: char = "4";
| ^
warning: unimplemented
../examples/mm0.mm1:1238:1:
|
1238 | @_ def _5: char = "5";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1238:19:
|
1238 | @_ def _5: char = "5";
| ^
warning: unimplemented
../examples/mm0.mm1:1239:1:
|
1239 | @_ def _6: char = "6";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1239:19:
|
1239 | @_ def _6: char = "6";
| ^
warning: unimplemented
../examples/mm0.mm1:1240:1:
|
1240 | @_ def _7: char = "7";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1240:19:
|
1240 | @_ def _7: char = "7";
| ^
warning: unimplemented
../examples/mm0.mm1:1241:1:
|
1241 | @_ def _8: char = "8";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1241:19:
|
1241 | @_ def _8: char = "8";
| ^
warning: unimplemented
../examples/mm0.mm1:1242:1:
|
1242 | @_ def _9: char = "9";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1242:19:
|
1242 | @_ def _9: char = "9";
| ^
warning: unimplemented
../examples/mm0.mm1:1245:1:
|
1245 | @_ def _A: char = "A";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1245:19:
|
1245 | @_ def _A: char = "A";
| ^
warning: unimplemented
../examples/mm0.mm1:1246:1:
|
1246 | @_ def _Z: char = "Z";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1246:19:
|
1246 | @_ def _Z: char = "Z";
| ^
warning: unimplemented
../examples/mm0.mm1:1249:1:
|
1249 | @_ def _a: char = "a";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1249:19:
|
1249 | @_ def _a: char = "a";
| ^
warning: unimplemented
../examples/mm0.mm1:1250:1:
|
1250 | @_ def _b: char = "b";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1250:19:
|
1250 | @_ def _b: char = "b";
| ^
warning: unimplemented
../examples/mm0.mm1:1251:1:
|
1251 | @_ def _c: char = "c";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1251:19:
|
1251 | @_ def _c: char = "c";
| ^
warning: unimplemented
../examples/mm0.mm1:1252:1:
|
1252 | @_ def _d: char = "d";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1252:19:
|
1252 | @_ def _d: char = "d";
| ^
warning: unimplemented
../examples/mm0.mm1:1253:1:
|
1253 | @_ def _e: char = "e";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1253:19:
|
1253 | @_ def _e: char = "e";
| ^
warning: unimplemented
../examples/mm0.mm1:1254:1:
|
1254 | @_ def _f: char = "f";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1254:19:
|
1254 | @_ def _f: char = "f";
| ^
warning: unimplemented
../examples/mm0.mm1:1255:1:
|
1255 | @_ def _h: char = "h";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1255:19:
|
1255 | @_ def _h: char = "h";
| ^
warning: unimplemented
../examples/mm0.mm1:1256:1:
|
1256 | @_ def _i: char = "i";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1256:19:
|
1256 | @_ def _i: char = "i";
| ^
warning: unimplemented
../examples/mm0.mm1:1257:1:
|
1257 | @_ def _l: char = "l";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1257:19:
|
1257 | @_ def _l: char = "l";
| ^
warning: unimplemented
../examples/mm0.mm1:1258:1:
|
1258 | @_ def _m: char = "m";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1258:19:
|
1258 | @_ def _m: char = "m";
| ^
warning: unimplemented
../examples/mm0.mm1:1259:1:
|
1259 | @_ def _n: char = "n";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1259:19:
|
1259 | @_ def _n: char = "n";
| ^
warning: unimplemented
../examples/mm0.mm1:1260:1:
|
1260 | @_ def _o: char = "o";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1260:19:
|
1260 | @_ def _o: char = "o";
| ^
warning: unimplemented
../examples/mm0.mm1:1261:1:
|
1261 | @_ def _p: char = "p";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1261:19:
|
1261 | @_ def _p: char = "p";
| ^
warning: unimplemented
../examples/mm0.mm1:1262:1:
|
1262 | @_ def _r: char = "r";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1262:19:
|
1262 | @_ def _r: char = "r";
| ^
warning: unimplemented
../examples/mm0.mm1:1263:1:
|
1263 | @_ def _s: char = "s";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1263:19:
|
1263 | @_ def _s: char = "s";
| ^
warning: unimplemented
../examples/mm0.mm1:1264:1:
|
1264 | @_ def _t: char = "t";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1264:19:
|
1264 | @_ def _t: char = "t";
| ^
warning: unimplemented
../examples/mm0.mm1:1265:1:
|
1265 | @_ def _u: char = "u";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1265:19:
|
1265 | @_ def _u: char = "u";
| ^
warning: unimplemented
../examples/mm0.mm1:1266:1:
|
1266 | @_ def _v: char = "v";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1266:19:
|
1266 | @_ def _v: char = "v";
| ^
warning: unimplemented
../examples/mm0.mm1:1267:1:
|
1267 | @_ def _x: char = "x";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1267:19:
|
1267 | @_ def _x: char = "x";
| ^
warning: unimplemented
../examples/mm0.mm1:1268:1:
|
1268 | @_ def _z: char = "z";
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1268:19:
|
1268 | @_ def _z: char = "z";
| ^
warning: unimplemented
../examples/mm0.mm1:1279:5:
|
1279 | scan '(_nl _dot _0 _9 _colon _gt _A _Z _under _a _z _lbrace _rbrace) @ fn (b)
| ^
error: Reference to unbound variable 'scan'
../examples/mm0.mm1:1300:1:
|
1300 | @_ def prefix (s t .x: nat): wff = $ E. x s ++ x = t $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1300:45:
|
1300 | @_ def prefix (s t .x: nat): wff = $ E. x s ++ x = t $;
| ^
error: unexpected '+'
expecting '$', infix >= 0, or infix >= 41
../examples/mm0.mm1:1302:23:
|
1302 | theorem takeprefix: $ prefix (take l n) l $ = '(!! iexe l2 (eqeq1d appendeq2) takedrop);
| ^
error: prefix is not a function
../examples/mm0.mm1:1304:40:
|
1304 | theorem prefix_eq_take: $ prefix l1 l2 <-> l1 = take l2 (len l1) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1309:46:
|
1309 | theorem prefix_len: $ prefix l1 l2 -> len l1 <= len l2 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1312:32:
|
1312 | theorem prefix_asymm: $ len l2 <= len l1 -> prefix l1 l2 -> l1 = l2 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1315:28:
|
1315 | theorem prefix_0: $ prefix 0 l $ = '(!! iexe r (eqeq1d appendeq2) append0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:1316:22:
|
1316 | theorem prefix_id: $ prefix l l $ = '(!! iexe r (eqeq1d appendeq2) append02);
| ^
error: prefix is not a function
../examples/mm0.mm1:1317:22:
|
1317 | theorem prefix_tr: $ prefix l1 l2 -> prefix l2 l3 -> prefix l1 l3 $ =
| ^
error: prefix is not a function
../examples/mm0.mm1:1321:31:
|
1321 | theorem prefix_02: $ prefix l 0 <-> l = 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:1324:34:
|
1324 | theorem prefix_S1: $ prefix (x : l1) l2 <-> E. l3 (prefix l1 l3 /\ l2 = x : l3) $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1330:40:
|
1330 | theorem prefix_append1: $ prefix (l ++ l1) (l ++ l2) <-> prefix l1 l2 $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1333:33:
|
1333 | theorem prefix_S: $ prefix (x : l1) (y : l2) <-> x = y /\ prefix l1 l2 $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1337:48:
|
1337 | theorem prefix_nth: $ prefix l1 l2 -> nth n l1 = suc x -> nth n l2 = suc x $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:1343:1:
|
1343 | @_ def maxPrefix (A: set) (s: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1344:7:
|
1344 | $ the {z | E. x E. t (x ++ t = s /\ x e. A /\
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/mm0.mm1:1349:28:
|
1349 | $ ~ (E. x (prefix x s /\ x e. A)) -> maxPrefix A s = 0 $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1353:34:
|
1353 | theorem maxPrefix_subsn: $ subsn {z |
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/mm0.mm1:1375:25:
|
1375 | $ E. x (prefix x s /\ x e. A) ->
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1415:41:
|
1415 | theorem maxPrefixSilem: $ maxPrefix A s = suc (x, t) ->
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:1422:39:
|
1422 | theorem maxPrefixSi1: $ maxPrefix A s = suc (x, t) -> x ++ t = s $ = (named '(anld @ anld maxPrefixSilem));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:1423:39:
|
1423 | theorem maxPrefixSi2: $ maxPrefix A s = suc (x, t) -> x e. A $ = (named '(anrd @ anld maxPrefixSilem));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:1424:48:
|
1424 | theorem maxPrefixSi3 (h1: $ G -> maxPrefix A s = suc (x, t) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:1429:35:
|
1429 | theorem maxPrefix_eqS (h1: $ G -> prefix a s $) (h2: $ G -> a e. A $):
| ^
error: prefix is not a function
../examples/mm0.mm1:1434:43:
|
1434 | theorem maxPrefix_prefix: $ maxPrefix A s = suc (x, t) -> prefix x s $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:1437:42:
|
1437 | theorem maxPrefix_asymm {y} (h: $ x e. A /\ y e. A /\ prefix x y -> x = y $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/mm0.mm1:1459:1:
|
1459 | @_ def regexStar (R: set) (.s .t .L .x .y: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1460:6:
|
1460 | $ S\ s, {t | E. L (L, t e. all2 R /\ s = ljoin L)} $;
| ^
error: expecting (
../examples/mm0.mm1:1466:1:
|
1466 | @_ def regexApp (R S: set) (.z .a .b .x .y: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1467:32:
|
1467 | $ {z | E. x E. y E. a E. b (x, a e. R /\ y, b e. S /\ z = x ++ y, a, b)} $;
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/mm0.mm1:1468:8:
|
1468 | infixr regexApp: $<+>$ prec 75;
| ^
error: term 'regexApp' not declared
../examples/mm0.mm1:1474:1:
|
1474 | @_ def regexPlus (R: set) (.x: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1475:15:
|
1475 | $ regexStar R i^i {x | snd x != 0} $;
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/mm0.mm1:1481:1:
|
1481 | @_ def regexOpt (R: set) (.s .t .y: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1482:6:
|
1482 | $ sn 0 u. S\ s, {t | E. y (s, y e. R /\ t = suc y)} $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:1487:1:
|
1487 | @_ def white: nat = $ __ ; sn _nl $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1487:26:
|
1487 | @_ def white: nat = $ __ ; sn _nl $;
| ^
error: unexpected ';'
expecting '$' or infix >= 0
../examples/mm0.mm1:1489:32:
|
1489 | theorem el_white: $ c e. white <-> c = __ \/ c = _nl $ = '(bitr elins @ oreq2i elsn);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1491:44:
|
1491 | theorem white_lt_dollar: $ c e. white -> c < _dollar $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1495:44:
|
1495 | theorem white_lt_hyphen: $ c e. white -> c < _hyphen $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1502:1:
|
1502 | @_ def regexLineComment (.x .y: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1503:6:
|
1503 | $ (\ x, _hyphen : _hyphen : x ++ _nl : 0) '' {x | all {y | y != _nl} x} $;
| ^
error: expecting (
../examples/mm0.mm1:1505:54:
|
1505 | theorem el_regexLineComment: $ s e. regexLineComment <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1509:59:
|
1509 | theorem regexLineComment_n0: $ s e. regexLineComment -> s != 0 $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/mm0.mm1:1512:34:
|
1512 | theorem regexLineComment_hd: $ x : t e. regexLineComment -> x = _hyphen /\ t != 0 $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/mm0.mm1:1516:12:
|
1516 | (hA: $ A == (\ x, l ++ x ++ c : 0) '' {x | all {y | y != c} x} $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:1532:14:
|
1532 | (h: $ G -> prefix s t $): $ G -> s = t $ =
| ^
error: prefix is not a function
../examples/mm0.mm1:1540:1:
|
1540 | @_ def whitespace (.c: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1541:7:
|
1541 | $ ((\ c, c : 0) '' white) u. regexLineComment $;
| ^
error: expecting (
../examples/mm0.mm1:1543:42:
|
1543 | theorem el_whitespace: $ s e. whitespace <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1546:47:
|
1546 | theorem whitespace_n0: $ s e. whitespace -> s != 0 $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/mm0.mm1:1549:28:
|
1549 | theorem whitespace_hd: $ x : t e. whitespace -> x e. white \/ x = _hyphen $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/mm0.mm1:1554:30:
|
1554 | theorem whitespace_lt_0: $ x : t e. whitespace -> x < _0 $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/mm0.mm1:1560:32:
|
1560 | theorem whitespace_hd_RLC: $ x : t e. whitespace -> x = _hyphen -> x : t e. regexLineComment $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/mm0.mm1:1565:34:
|
1565 | theorem whitespace_hd_white: $ x : t e. whitespace -> x != _hyphen -> x e. white /\ t = 0 $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/mm0.mm1:1571:14:
|
1571 | (h: $ G -> prefix s t $): $ G -> s = t $ =
| ^
error: prefix is not a function
../examples/mm0.mm1:1587:49:
|
1587 | theorem whitespace_maxPrefix: $ s e. whitespace <-> maxPrefix whitespace (s ++ t) = suc (s, t) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1593:1:
|
1593 | @_ def regexMath (.x .y: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1594:6:
|
1594 | $ (\ x, _dollar : x ++ _dollar : 0) '' {x | all {y | y != _dollar} x} $;
| ^
error: expecting (
../examples/mm0.mm1:1596:40:
|
1596 | theorem el_regexMath: $ s e. regexMath <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1599:45:
|
1599 | theorem regexMath_n0: $ s e. regexMath -> s != 0 $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/mm0.mm1:1603:14:
|
1603 | (h: $ G -> prefix s t $): $ G -> s = t $ =
| ^
error: prefix is not a function
../examples/mm0.mm1:1607:27:
|
1607 | theorem regexMath_hd: $ x : t e. regexMath -> x = _dollar $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/mm0.mm1:1610:47:
|
1610 | theorem regexMath_maxPrefix: $ s e. regexMath <-> maxPrefix regexMath (s ++ t) = suc (s, t) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1616:1:
|
1616 | @_ def IdentStart (.c: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1617:15:
|
1617 | $ {c | (_a <= c /\ c <= _z) \/ (_A <= c /\ c <= _Z) \/ c = _under} $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1619:42:
|
1619 | theorem el_IdentStart: $ c e. IdentStart <-> (_a <= c /\ c <= _z) \/ (_A <= c /\ c <= _Z) \/ c = _under $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1622:51:
|
1622 | theorem IdentStart_bound: $ c e. IdentStart -> _A <= c /\ c <= _z $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1630:1:
|
1630 | @_ def digits (.c: nat): set = $ {c | _0 <= c /\ c <= _9} $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1630:45:
|
1630 | @_ def digits (.c: nat): set = $ {c | _0 <= c /\ c <= _9} $;
| ^
error: expecting infix >= 1 or }
../examples/mm0.mm1:1632:33:
|
1632 | theorem eldigits: $ c e. digits <-> _0 <= c /\ c <= _9 $ = (named '(elabe @ aneqd leeq2 leeq1));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1634:39:
|
1634 | theorem digits0: $ _0 e. digits $ = '(mpbir eldigits @ ian leid @ ltle _0_lt_9);
| ^
error: unknown theorem/hypothesis 'mpbir'
../examples/mm0.mm1:1635:39:
|
1635 | theorem digits9: $ _9 e. digits $ = '(mpbir eldigits @ ian (ltle _0_lt_9) leid);
| ^
error: unknown theorem/hypothesis 'mpbir'
../examples/mm0.mm1:1640:1:
|
1640 | @_ def IdentRest (.c: nat): set = $ IdentStart u. digits $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1640:48:
|
1640 | @_ def IdentRest (.c: nat): set = $ IdentStart u. digits $;
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/mm0.mm1:1642:49:
|
1642 | theorem IdentRest_bound: $ c e. IdentRest -> _0 <= c /\ c <= _z $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1650:1:
|
1650 | @_ def regexIdent (.s .x .y .t: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1651:23:
|
1651 | $ {s | E. x E. t (s = x : t /\ x e. IdentStart /\ all IdentRest t)} $;
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/mm0.mm1:1653:42:
|
1653 | theorem el_regexIdent: $ s e. regexIdent <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1657:47:
|
1657 | theorem regexIdent_n0: $ s e. regexIdent -> s != 0 $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/mm0.mm1:1660:30:
|
1660 | theorem regexIdent_cons: $ x : t e. regexIdent <-> x e. IdentStart /\ all IdentRest t $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/mm0.mm1:1665:31:
|
1665 | theorem regexIdent_bound: $ x : t e. regexIdent -> _A <= x /\ x <= _z $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/mm0.mm1:1672:1:
|
1672 | @_ def isNumber (.s .x .y .t: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1673:12:
|
1673 | $ sn (_0 : 0) u. {s | E. x E. t (s = x : t /\
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1676:38:
|
1676 | theorem el_isNumber: $ s e. isNumber <-> s = _0 : 0 \/
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1680:43:
|
1680 | theorem isNumber_n0: $ s e. isNumber -> s != 0 $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/mm0.mm1:1683:48:
|
1683 | theorem isNumber_allDigits: $ l e. isNumber -> all digits l $ =
| ^
error: all is not a function
../examples/mm0.mm1:1688:26:
|
1688 | theorem isNumber_hd: $ x : t e. isNumber -> _0 <= x /\ x <= _9 $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/mm0.mm1:1694:1:
|
1694 | @_ def symbols: nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1695:8:
|
1695 | $ _ast ; _dot ; _colon ; _semi ; _lparen ; _rparen ;
| ^
error: unexpected ';'
expecting '$' or infix >= 0
../examples/mm0.mm1:1698:50:
|
1698 | theorem symbols_bound: $ c e. symbols -> _dollar < c /\ c < _0 \/ _9 < c /\ c < _A \/ _z < c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1708:51:
|
1708 | theorem symbols_bound2: $ c e. symbols -> _dollar < c /\ (c < _0 \/ _9 < c) /\ (c < _A \/ _z < c) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1714:48:
|
1714 | theorem symbols_ne_hyphen: $ c e. symbols -> c != _hyphen $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/mm0.mm1:1721:1:
|
1721 | @_ def TK (s: nat): nat = $ b0 s $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1721:29:
|
1721 | @_ def TK (s: nat): nat = $ b0 s $;
| ^
error: b0 is not a function
../examples/mm0.mm1:1723:1:
|
1723 | @_ def MATH (s: nat): nat = $ b1 s $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1723:31:
|
1723 | @_ def MATH (s: nat): nat = $ b1 s $;
| ^
error: b1 is not a function
../examples/mm0.mm1:1725:1:
|
1725 | @_ local def Tokenize_aux (G s A F n): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1726:23:
|
1726 | $ if (maxPrefix A s = 0) n
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1730:41:
|
1730 | theorem Tokenize_aux_0: $ maxPrefix A s = 0 -> Tokenize_aux G s A F n = n $ = (named 'ifpos);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:1732:58:
|
1732 | theorem Tokenize_aux_n0 (a: nat x) {y} (h: $ y e. A -> y != 0 $):
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/mm0.mm1:1746:1:
|
1746 | @_ abstract def Tokenize {.s1} (s: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1747:11:
|
1747 | $ srec (\ f, N[size (Dom f) / s1]
| ^
error: expecting (
../examples/mm0.mm1:1756:27:
|
1756 | theorem symbols_cons: $ x : b e. (\ c, c : 0) '' A <-> x e. A /\ b = 0 $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/mm0.mm1:1760:31:
|
1760 | theorem symbols_n0: $ x e. (\ c, c : 0) '' A -> x != 0 $ = '(sylbi ellamima @ eex @ anwr sucne0);
| ^
error: expecting (
../examples/mm0.mm1:1763:13:
|
1763 | $ x e. (\ c, c : 0) '' A /\ y e. (\ c, c : 0) '' A /\ prefix x y -> x = y $ =
| ^
error: expecting (
../examples/mm0.mm1:1769:37:
|
1769 | theorem symbols_maxPrefix: $ x e. A <-> maxPrefix ((\ c, c : 0) '' A) (x : t) = suc (x : 0, t) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:1773:36:
|
1773 | theorem Tokenize_val: $ Tokenize s = if (s = 0) 1 (
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:1789:65:
|
1789 | theorem Tokenize_aux_S (v1 n: nat x1 t1 r1) (v: nat t) (h: $ x1 = x /\ t1 = t -> v1 = v $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:1797:35:
|
1797 | pub theorem Tokenize0: $ Tokenize 0 = suc 0 $ = (named '(eqtr Tokenize_val @ ifpos eqid));
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:1799:43:
|
1799 | theorem Tokenize_n0_lem (h: $ x e. A -> x != 0 $): $ maxPrefix A s = suc (x, r) -> s != 0 $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/mm0.mm1:1803:39:
|
1803 | $ s e. whitespace -> Tokenize (s ++ x) = Tokenize x $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1809:22:
|
1809 | (hA: $ x e. A -> x != 0 $) (hB: $ y e. B -> y != 0 $)
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/mm0.mm1:1823:28:
|
1823 | $ maxPrefix regexIdent s = suc (x, r) ->
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:1832:26:
|
1832 | $ maxPrefix isNumber s = suc (x, r) ->
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:1845:35:
|
1845 | $ c e. symbols -> Tokenize (c : x) =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1863:38:
|
1863 | $ s e. regexMath -> Tokenize (s ++ x) =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1878:7:
|
1878 | $ s != 0 ->
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/mm0.mm1:1900:1:
|
1900 | @_ def regexMap (F R: set): set = $ R o> cnv F $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1900:39:
|
1900 | @_ def regexMap (F R: set): set = $ R o> cnv F $;
| ^
error: unexpected 'o'
expecting '$' or infix >= 0
../examples/mm0.mm1:1901:8:
|
1901 | infixr regexMap: $<@>$ prec 100;
| ^
error: term 'regexMap' not declared
../examples/mm0.mm1:1906:1:
|
1906 | @_ def regexAppL (R S: set) (.x: nat): set = $ (\ x, fst x) <@> (R <+> S) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1906:51:
|
1906 | @_ def regexAppL (R S: set) (.x: nat): set = $ (\ x, fst x) <@> (R <+> S) $;
| ^
error: expecting (
../examples/mm0.mm1:1907:8:
|
1907 | infixl regexAppL: $<+$ prec 77;
| ^
error: term 'regexAppL' not declared
../examples/mm0.mm1:1912:1:
|
1912 | @_ def regexAppR (R S: set) (.x: nat): set = $ (\ x, snd x) <@> (R <+> S) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1912:51:
|
1912 | @_ def regexAppR (R S: set) (.x: nat): set = $ (\ x, snd x) <@> (R <+> S) $;
| ^
error: expecting (
../examples/mm0.mm1:1913:8:
|
1913 | infixr regexAppR: $+>$ prec 76;
| ^
error: term 'regexAppR' not declared
../examples/mm0.mm1:1918:46:
|
1918 | def parseTk (tk: string): set = $ sn (TK tk, 0) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1921:38:
|
1921 | def parseOptTk (tk: string): set = $ regexOpt (parseTk tk) $;
| ^
error: regexOpt is not a function
../examples/mm0.mm1:1923:32:
|
1923 | def parseCh (c: char): set = $ parseTk (s1 c) $;
| ^
error: parseTk is not a function
../examples/mm0.mm1:1926:1:
|
1926 | @_ def _pure: string = $ _p ': _u ': _r ': _e ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1926:29:
|
1926 | @_ def _pure: string = $ _p ': _u ': _r ': _e ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:1928:1:
|
1928 | @_ def _strict: string = $ _s ': _t ': _r ': _i ': _c ': _t ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1928:31:
|
1928 | @_ def _strict: string = $ _s ': _t ': _r ': _i ': _c ': _t ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:1930:1:
|
1930 | @_ def _provable: string = $ _p ': _r ': _o ': _v ': _a ': _b ': _l ': _e ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1930:33:
|
1930 | @_ def _provable: string = $ _p ': _r ': _o ': _v ': _a ': _b ': _l ': _e ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:1932:1:
|
1932 | @_ def _free: string = $ _f ': _r ': _e ': _e ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1932:29:
|
1932 | @_ def _free: string = $ _f ': _r ': _e ': _e ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:1935:1:
|
1935 | @_ def parseSortData: set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1936:25:
|
1936 | $ (parseOptTk _pure <+> parseOptTk _strict) <+>
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1940:1:
|
1940 | @_ def parseIdent_ (.s: nat): set = $ (\ s, TK s, s) '' regexIdent $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1940:42:
|
1940 | @_ def parseIdent_ (.s: nat): set = $ (\ s, TK s, s) '' regexIdent $;
| ^
error: expecting (
../examples/mm0.mm1:1942:1:
|
1942 | @_ def parseIdent (.x: nat): set = $ parseIdent_ i^i {x | snd x != s1 _under} $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1942:50:
|
1942 | @_ def parseIdent (.x: nat): set = $ parseIdent_ i^i {x | snd x != s1 _under} $;
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/mm0.mm1:1946:1:
|
1946 | @_ def ASTSort (x: nat): nat = $ b0 (b0 (b0 x)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1946:34:
|
1946 | @_ def ASTSort (x: nat): nat = $ b0 (b0 (b0 x)) $;
| ^
error: b0 is not a function
../examples/mm0.mm1:1949:1:
|
1949 | @_ def ASTTerm (x: nat): nat = $ b0 (b0 (b1 x)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1949:34:
|
1949 | @_ def ASTTerm (x: nat): nat = $ b0 (b0 (b1 x)) $;
| ^
error: b0 is not a function
../examples/mm0.mm1:1952:1:
|
1952 | @_ def ASTAxiom (x: nat): nat = $ b0 (b1 (b0 x)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1952:35:
|
1952 | @_ def ASTAxiom (x: nat): nat = $ b0 (b1 (b0 x)) $;
| ^
error: b0 is not a function
../examples/mm0.mm1:1956:1:
|
1956 | @_ def ASTDef (x: nat): nat = $ b0 (b1 (b1 x)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1956:33:
|
1956 | @_ def ASTDef (x: nat): nat = $ b0 (b1 (b1 x)) $;
| ^
error: b0 is not a function
../examples/mm0.mm1:1959:1:
|
1959 | @_ def ASTThm (x: nat): nat = $ b1 (b0 (b0 x)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1959:33:
|
1959 | @_ def ASTThm (x: nat): nat = $ b1 (b0 (b0 x)) $;
| ^
error: b1 is not a function
../examples/mm0.mm1:1962:1:
|
1962 | @_ def ASTIO (out x: nat): nat = $ b1 (b0 (b1 (out, x))) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1962:53:
|
1962 | @_ def ASTIO (out x: nat): nat = $ b1 (b0 (b1 (out, x))) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:1964:1:
|
1964 | @_ def ASTNota (x: nat): nat = $ b1 (b1 x) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1964:34:
|
1964 | @_ def ASTNota (x: nat): nat = $ b1 (b1 x) $;
| ^
error: b1 is not a function
../examples/mm0.mm1:1967:1:
|
1967 | @_ def _sort: string = $ _s ': _o ': _r ': _t ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1967:29:
|
1967 | @_ def _sort: string = $ _s ': _o ': _r ': _t ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:1969:1:
|
1969 | @_ def parseSort (.x: nat): set = $ (\ x, ASTSort x) <@>
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1969:40:
|
1969 | @_ def parseSort (.x: nat): set = $ (\ x, ASTSort x) <@>
| ^
error: expecting (
../examples/mm0.mm1:1987:1:
|
1987 | @_ def parseType (.x: nat): set = $ (\ x, b0 x) <@>
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1987:40:
|
1987 | @_ def parseType (.x: nat): set = $ (\ x, b0 x) <@>
| ^
error: expecting (
../examples/mm0.mm1:1990:1:
|
1990 | @_ def parseFmla (.s: nat): set = $ Ran (\ s, MATH s, b1 s) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1990:44:
|
1990 | @_ def parseFmla (.s: nat): set = $ Ran (\ s, MATH s, b1 s) $;
| ^
error: expecting (
../examples/mm0.mm1:1992:1:
|
1992 | @_ def parseTypeFmla: set = $ parseType u. parseFmla $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1992:41:
|
1992 | @_ def parseTypeFmla: set = $ parseType u. parseFmla $;
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/mm0.mm1:1995:1:
|
1995 | @_ def parseDummyId (.x: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:1996:6:
|
1996 | $ (\ x, b0 x) <@> parseIdent_ u.
| ^
error: expecting (
../examples/mm0.mm1:2000:1:
|
2000 | @_ def parseCurlyBinder (.x .z: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2001:6:
|
2001 | $ (\ z, map (case (\ x, 1, x, snd z) (\ x, 2, x, snd z)) (fst z)) <@>
| ^
error: expecting (
../examples/mm0.mm1:2005:1:
|
2005 | @_ def parseRegBinder (.x .z: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2006:6:
|
2006 | $ (\ z, map (case (\ x, 0, x, snd z) (\ x, 2, x, snd z)) (fst z)) <@>
| ^
error: expecting (
../examples/mm0.mm1:2010:1:
|
2010 | @_ def parseBinder (.x .y: nat): set = $ parseCurlyBinder u. parseRegBinder $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2010:59:
|
2010 | @_ def parseBinder (.x .y: nat): set = $ parseCurlyBinder u. parseRegBinder $;
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/mm0.mm1:2013:1:
|
2013 | @_ def parseBinders (.x .z: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2014:6:
|
2014 | $ (\ x, ljoin x) <@> regexStar parseBinder $;
| ^
error: expecting (
../examples/mm0.mm1:2019:1:
|
2019 | @_ def parseArrows: set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2020:31:
|
2020 | $ regexStar (parseTypeFmla <+ parseCh _gt) <+> parseTypeFmla $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2026:1:
|
2026 | @_ def parseBindersAndArrows (.x .z: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2027:6:
|
2027 | $ (\ x, fst x ++ map (\ z, (0, s1 _under, z)) (pi21 x), pi22 x) <@>
| ^
error: expecting (
../examples/mm0.mm1:2034:14:
|
2034 | $ parseTk tk +> parseIdent <+> parseBindersAndArrows <+ parseCh _semi $;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/mm0.mm1:2037:1:
|
2037 | @_ def _term: string = $ _t ': _e ': _r ': _m ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2037:29:
|
2037 | @_ def _term: string = $ _t ': _e ': _r ': _m ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:2039:1:
|
2039 | @_ def parseTerm (.x: nat): set = $ (\ x, ASTTerm x) <@> parseSimple _term $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2039:40:
|
2039 | @_ def parseTerm (.x: nat): set = $ (\ x, ASTTerm x) <@> parseSimple _term $;
| ^
error: expecting (
../examples/mm0.mm1:2042:1:
|
2042 | @_ def _axiom: string = $ _a ': _x ': _i ': _o ': _m ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2042:30:
|
2042 | @_ def _axiom: string = $ _a ': _x ': _i ': _o ': _m ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:2044:1:
|
2044 | @_ def parseAxiom (.x: nat): set = $ (\ x, ASTAxiom x) <@> parseSimple _axiom $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2044:41:
|
2044 | @_ def parseAxiom (.x: nat): set = $ (\ x, ASTAxiom x) <@> parseSimple _axiom $;
| ^
error: expecting (
../examples/mm0.mm1:2047:1:
|
2047 | @_ def _theorem: string = $ _t ': _h ': _e ': _o ': _r ': _e ': _m ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2047:32:
|
2047 | @_ def _theorem: string = $ _t ': _h ': _e ': _o ': _r ': _e ': _m ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:2049:1:
|
2049 | @_ def parseThm (.x: nat): set = $ (\ x, ASTThm x) <@> parseSimple _theorem $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2049:39:
|
2049 | @_ def parseThm (.x: nat): set = $ (\ x, ASTThm x) <@> parseSimple _theorem $;
| ^
error: expecting (
../examples/mm0.mm1:2052:1:
|
2052 | @_ def _def: string = $ _d ': _e ': _f ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2052:28:
|
2052 | @_ def _def: string = $ _d ': _e ': _f ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:2054:1:
|
2054 | @_ def parseDef (.x: nat): set = $ (\ x, ASTDef x) <@>
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2054:39:
|
2054 | @_ def parseDef (.x: nat): set = $ (\ x, ASTDef x) <@>
| ^
error: expecting (
../examples/mm0.mm1:2060:1:
|
2060 | @_ def NotaDelim (x: nat): nat = $ b0 (b0 x) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2060:36:
|
2060 | @_ def NotaDelim (x: nat): nat = $ b0 (b0 x) $;
| ^
error: b0 is not a function
../examples/mm0.mm1:2062:1:
|
2062 | @_ def NotaInfix (x y: nat): nat = $ b0 (b1 (b0 (x, y))) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2062:53:
|
2062 | @_ def NotaInfix (x y: nat): nat = $ b0 (b1 (b0 (x, y))) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2064:1:
|
2064 | @_ def NotaPfx (x: nat): nat = $ b0 (b1 (b1 x)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2064:34:
|
2064 | @_ def NotaPfx (x: nat): nat = $ b0 (b1 (b1 x)) $;
| ^
error: b0 is not a function
../examples/mm0.mm1:2066:1:
|
2066 | @_ def NotaCoe (x: nat): nat = $ b1 (b0 x) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2066:34:
|
2066 | @_ def NotaCoe (x: nat): nat = $ b1 (b0 x) $;
| ^
error: b1 is not a function
../examples/mm0.mm1:2069:1:
|
2069 | @_ def NotaGen (x: nat): nat = $ b1 (b1 x) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2069:34:
|
2069 | @_ def NotaGen (x: nat): nat = $ b1 (b1 x) $;
| ^
error: b1 is not a function
../examples/mm0.mm1:2072:1:
|
2072 | @_ def _delimiter: string =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2073:6:
|
2073 | $ _d ': _e ': _l ': _i ': _m ': _i ': _t ': _e ': _r ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:2075:1:
|
2075 | @_ def parseDelim (.x: nat): set = $ (\ x, NotaDelim x) <@>
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2075:41:
|
2075 | @_ def parseDelim (.x: nat): set = $ (\ x, NotaDelim x) <@>
| ^
error: expecting (
../examples/mm0.mm1:2081:1:
|
2081 | @_ abstract def stoi (x: nat): nat = $ rlrec 0 (\\ s, \\ i, \ ih, ih * 10 + (i - _0)) x $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2081:46:
|
2081 | @_ abstract def stoi (x: nat): nat = $ rlrec 0 (\\ s, \\ i, \ ih, ih * 10 + (i - _0)) x $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:2082:27:
|
2082 | pub theorem stoi0: $ stoi 0 = 0 $ = (named 'rlrec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:2083:44:
|
2083 | pub theorem stoiS (s x: nat): $ stoi (s |> x) = stoi s * 10 + (x - _0) $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2088:1:
|
2088 | @_ def parseNumber (.s: nat): set = $ (\ s, TK s, stoi s) '' isNumber $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2088:42:
|
2088 | @_ def parseNumber (.s: nat): set = $ (\ s, TK s, stoi s) '' isNumber $;
| ^
error: expecting (
../examples/mm0.mm1:2091:1:
|
2091 | @_ def _max: string = $ _m ': _a ': _x ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2091:28:
|
2091 | @_ def _max: string = $ _m ': _a ': _x ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:2093:1:
|
2093 | @_ def parsePrec (.x: nat): set = $ parseTk _max u. (\ x, suc x) <@> parseNumber $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2093:50:
|
2093 | @_ def parsePrec (.x: nat): set = $ parseTk _max u. (\ x, suc x) <@> parseNumber $;
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/mm0.mm1:2096:1:
|
2096 | @_ def _prec: string = $ _p ': _r ': _e ': _c ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2096:29:
|
2096 | @_ def _prec: string = $ _p ': _r ': _e ': _c ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:2100:14:
|
2100 | $ parseTk tk +> parseIdent <+> parseCh _colon +> parseFmla <+>
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/mm0.mm1:2104:1:
|
2104 | @_ def _infixl: string = $ _i ': _n ': _f ': _i ': _x ': _l ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2104:31:
|
2104 | @_ def _infixl: string = $ _i ': _n ': _f ': _i ': _x ': _l ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:2106:1:
|
2106 | @_ def _infixr: string = $ _i ': _n ': _f ': _i ': _x ': _r ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2106:31:
|
2106 | @_ def _infixr: string = $ _i ': _n ': _f ': _i ': _x ': _r ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:2108:1:
|
2108 | @_ def _prefix: string = $ _p ': _r ': _e ': _f ': _i ': _x ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2108:31:
|
2108 | @_ def _prefix: string = $ _p ': _r ': _e ': _f ': _i ': _x ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:2110:1:
|
2110 | @_ def parseInfixl (.x: nat): set = $ (\ x, NotaInfix 0 x) <@> parseSimpleNota _infixl $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2110:42:
|
2110 | @_ def parseInfixl (.x: nat): set = $ (\ x, NotaInfix 0 x) <@> parseSimpleNota _infixl $;
| ^
error: expecting (
../examples/mm0.mm1:2112:1:
|
2112 | @_ def parseInfixr (.x: nat): set = $ (\ x, NotaInfix 1 x) <@> parseSimpleNota _infixr $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2112:42:
|
2112 | @_ def parseInfixr (.x: nat): set = $ (\ x, NotaInfix 1 x) <@> parseSimpleNota _infixr $;
| ^
error: expecting (
../examples/mm0.mm1:2114:1:
|
2114 | @_ def parsePfx (.x: nat): set = $ (\ x, NotaPfx x) <@> parseSimpleNota _prefix $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2114:39:
|
2114 | @_ def parsePfx (.x: nat): set = $ (\ x, NotaPfx x) <@> parseSimpleNota _prefix $;
| ^
error: expecting (
../examples/mm0.mm1:2117:1:
|
2117 | @_ def _coercion: string = $ _c ': _o ': _e ': _r ': _c ': _i ': _o ': _n ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2117:33:
|
2117 | @_ def _coercion: string = $ _c ': _o ': _e ': _r ': _c ': _i ': _o ': _n ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:2119:1:
|
2119 | @_ def parseCoe (.x: nat): set = $ (\ x, NotaCoe x) <@>
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2119:39:
|
2119 | @_ def parseCoe (.x: nat): set = $ (\ x, NotaCoe x) <@>
| ^
error: expecting (
../examples/mm0.mm1:2126:1:
|
2126 | @_ def parseLiteral (.x: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2127:7:
|
2127 | $ ((\ x, b0 x) <@> (parseCh _lparen +> parseFmla <+>
| ^
error: expecting (
../examples/mm0.mm1:2132:1:
|
2132 | @_ def _notation: string = $ _n ': _o ': _t ': _a ': _t ': _i ': _o ': _n ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2132:33:
|
2132 | @_ def _notation: string = $ _n ': _o ': _t ': _a ': _t ': _i ': _o ': _n ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:2134:1:
|
2134 | @_ def parseGenNota (.x: nat): set = $ (\ x, NotaGen x) <@>
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2134:43:
|
2134 | @_ def parseGenNota (.x: nat): set = $ (\ x, NotaGen x) <@>
| ^
error: expecting (
../examples/mm0.mm1:2139:1:
|
2139 | @_ def parseNota (.x: nat): set = $ (\ x, ASTNota x) <@>
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2139:40:
|
2139 | @_ def parseNota (.x: nat): set = $ (\ x, ASTNota x) <@>
| ^
error: expecting (
../examples/mm0.mm1:2144:1:
|
2144 | @_ def _input: string = $ _i ': _n ': _p ': _u ': _t ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2144:30:
|
2144 | @_ def _input: string = $ _i ': _n ': _p ': _u ': _t ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:2146:1:
|
2146 | @_ def _output: string = $ _o ': _u ': _t ': _p ': _u ': _t ': s0 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2146:31:
|
2146 | @_ def _output: string = $ _o ': _u ': _t ': _p ': _u ': _t ': s0 $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/mm0.mm1:2149:1:
|
2149 | @_ def inputKinds: nat = $0$;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2149:28:
|
2149 | @_ def inputKinds: nat = $0$;
| ^
error: expecting (
../examples/mm0.mm1:2151:1:
|
2151 | @_ def outputKinds: nat = $0$;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2151:29:
|
2151 | @_ def outputKinds: nat = $0$;
| ^
error: expecting (
../examples/mm0.mm1:2156:14:
|
2156 | $ parseTk tk +> (parseIdent i^i {x | snd x e. k}) <+>
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/mm0.mm1:2162:1:
|
2162 | @_ def parseIO (.x: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2163:7:
|
2163 | $ ((\ x, ASTIO 0 x) <@> parseIO1 _input inputKinds) u.
| ^
error: expecting (
../examples/mm0.mm1:2167:1:
|
2167 | @_ def parseAST: set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2168:27:
|
2168 | $ regexStar (parseSort u. parseTerm u. parseAxiom u.
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2172:1:
|
2172 | @_ def parse (s ast .tks: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2173:24:
|
2173 | $ E. tks (Tokenize s = suc tks /\ tks, ast e. parseAST) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2181:1:
|
2181 | @_ abstract def lookupVar (ctx x: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2182:9:
|
2182 | $ rlrec 0 (\\ bis, \\ p, \ ih, N[fst (snd p) / y] if (x = y) (suc (len bis)) ih) ctx $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:2184:46:
|
2184 | pub theorem lookupVar0 (x: nat): $ lookupVar 0 x = 0 $ = (named 'rlrec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:2187:23:
|
2187 | $ lookupVar (bis |> (c, x, t)) y =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2195:23:
|
2195 | $ lookupVar (bis |> (c, x, t)) x = suc (len bis) $ = '(eqtr lookupVarS @ ifpos eqid);
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2196:49:
|
2196 | pub theorem lookupVarNe (bis c x y t: nat): $ y != x ->
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/mm0.mm1:2205:1:
|
2205 | @_ def nonemptyNonwhite (.s .c: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2206:13:
|
2206 | $ {s | s != 0 /\ all {c | ~c e. white} s} $;
| ^
error: expecting infix >= 1 or }
../examples/mm0.mm1:2208:54:
|
2208 | theorem el_nonemptyNonwhite: $ s e. nonemptyNonwhite <-> s != 0 /\ all {c | ~c e. white} s $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2213:1:
|
2213 | @_ abstract def simpleTokenize {.s1} (s: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2214:11:
|
2214 | $ srec (\ f,
| ^
error: expecting (
../examples/mm0.mm1:2221:48:
|
2221 | theorem simpleTokenize_val: $ simpleTokenize s =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:2231:47:
|
2231 | pub theorem simpleTokenize0: $ simpleTokenize 0 = 0 $ = (named '(eqtr simpleTokenize_val lrec0));
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:2233:31:
|
2233 | theorem simpleTokenize_S: $ s = c : t -> simpleTokenize s =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:2247:39:
|
2247 | $ c e. white -> simpleTokenize (c : s) = simpleTokenize s $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2251:34:
|
2251 | $ maxPrefix nonemptyNonwhite s = suc (x, r) ->
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:2266:37:
|
2266 | theorem simpleTokenize_infix: $ all {x | x e. nonemptyNonwhite /\ E. a E. b s = a ++ x ++ b} (simpleTokenize
s) $ =
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/mm0.mm1:2298:44:
|
2298 | theorem simpleTokenize_nonemptyNonwhite: $ all nonemptyNonwhite (simpleTokenize s) $ =
| ^
error: all is not a function
../examples/mm0.mm1:2301:57:
|
2301 | theorem simpleTokenize_le: $ c IN simpleTokenize s -> c <= s $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2308:1:
|
2308 | @_ abstract def getDelimiters (ast: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2309:9:
|
2309 | $ rlrec 0 (\\ a, \\ t, \ ih,
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:2316:45:
|
2316 | pub theorem getDelimiters0: $ getDelimiters 0 = 0, 0 $ = (named '(eqtr4 rlrec0 pr0));
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:2318:33:
|
2318 | theorem getDelimitersS (h1: $ t // 2 // 2 // 2 // 2 = p $)
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/mm0.mm1:2334:23:
|
2334 | $ getDelimiters ast = a, b ->
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:2346:21:
|
2346 | $ ~(E. l E. r t = ASTNota (NotaDelim (b1 l, b1 r))) ->
| ^
error: expecting ), infix >= 0, or infix >= 41
../examples/mm0.mm1:2351:34:
|
2351 | $ x e. fst (getDelimiters ast) \/ x e. snd (getDelimiters ast) ->
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/mm0.mm1:2371:1:
|
2371 | @_ def delimitersOk (A: set) (.x .y: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2372:27:
|
2372 | $ A. x (x e. A -> len x = 1) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2374:1:
|
2374 | @_ local def delimiterFree (ast: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2375:52:
|
2375 | $ {s | ~(E. l E. x E. r (x e. getDelimiters ast /\ s = l ++ x ++ r))} $;
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/mm0.mm1:2379:1:
|
2379 | @_ abstract def tokenizeFmla (ast f: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2380:8:
|
2380 | $ lrec 0 (\\ x, \\ xs, \ ih,
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:2388:58:
|
2388 | pub theorem tokenizeFmla0 (ast: nat): $ tokenizeFmla ast 0 = 0 $ = (named 'lrec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:2390:46:
|
2390 | theorem tokenizeFmlaS: $ tokenizeFmla ast xs = ih ->
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:2403:66:
|
2403 | theorem tokenizeFmlaS_n0: $ ~x e. white -> tokenizeFmla ast (x : xs) != 0 $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2408:70:
|
2408 | pub theorem tokenizeFmlaWhite: $ x e. white -> tokenizeFmla ast (x : xs) = tokenizeFmla ast xs $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2411:67:
|
2411 | pub theorem tokenizeFmla1: $ ~x e. white -> tokenizeFmla ast (x : 0) = (x : 0) : 0 $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2415:49:
|
2415 | theorem tokenizeFmlaSS: $ tokenizeFmla ast (y : xs) = ih -> ~x e. white ->
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2425:69:
|
2425 | theorem tokenizeFmla_nonemptyNonwhite_lem: $ all nonemptyNonwhite l /\ ~x e. white ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/mm0.mm1:2442:42:
|
2442 | theorem tokenizeFmla_nonemptyNonwhite: $ all nonemptyNonwhite (tokenizeFmla ast xs) $ =
| ^
error: all is not a function
../examples/mm0.mm1:2462:27:
|
2462 | $ tokenizeFmla ast (x : xs) = l : r2 -> (~x e. white <-> E. r l = x : r) $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2478:53:
|
2478 | $ ~x e. white -> E. l E. r2 tokenizeFmla ast (x : xs) = (x : l) : r2 $ =
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/mm0.mm1:2483:7:
|
2483 | $ x : 0 e. fst (getDelimiters ast) ->
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/mm0.mm1:2491:53:
|
2491 | (h1: $ G -> ~x e. white $) (h2: $ G -> y e. white \/ y : 0 e. snd (getDelimiters ast) $):
| ^
error: unexpected '\'
expecting '$', infix >= 0, or infix >= 50
../examples/mm0.mm1:2498:17:
|
2498 | $ ~x e. white /\ y : 0 e. snd (getDelimiters ast) ->
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 41
../examples/mm0.mm1:2504:37:
|
2504 | (h2: $ G -> tokenizeFmla ast (y : xs) = (y : r) : r2 $)
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2514:17:
|
2514 | $ ~x e. white /\
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 41
../examples/mm0.mm1:2522:26:
|
2522 | tokenizeFmla ast (s ++ c : t) = tokenizeFmla ast s ++ tokenizeFmla ast t $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2573:1:
|
2573 | @_ abstract def getPfx (ast: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2574:13:
|
2574 | $ lower (S\ x, S\ c, {p | E. fmla (
| ^
error: expecting (
../examples/mm0.mm1:2578:6:
|
2578 | $ x, c, p e. getPfx ast <-> E. fmla (
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/mm0.mm1:2599:1:
|
2599 | @_ abstract def getInfix (ast r: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2600:13:
|
2600 | $ lower (S\ x, S\ c, {p | E. fmla (
| ^
error: expecting (
../examples/mm0.mm1:2604:6:
|
2604 | $ x, c, p e. getInfix ast r <-> E. fmla
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/mm0.mm1:2624:1:
|
2624 | @_ abstract def getNota (ast: nat): nat = $ lower {z | ASTNota (NotaGen z) IN ast} $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2624:45:
|
2624 | @_ abstract def getNota (ast: nat): nat = $ lower {z | ASTNota (NotaGen z) IN ast} $;
| ^
error: lower is not a function
../examples/mm0.mm1:2626:22:
|
2626 | $ x e. getNota ast <-> ASTNota (NotaGen x) IN ast $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2635:1:
|
2635 | @_ abstract def getCoe (ast: nat): nat = $ lower {z | ASTNota (NotaCoe z) IN ast} $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2635:44:
|
2635 | @_ abstract def getCoe (ast: nat): nat = $ lower {z | ASTNota (NotaCoe z) IN ast} $;
| ^
error: lower is not a function
../examples/mm0.mm1:2637:21:
|
2637 | $ x e. getCoe ast <-> ASTNota (NotaCoe x) IN ast $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2646:1:
|
2646 | @_ abstract def precle (m n: nat): wff = $ n = 0 \/ m != 0 /\ m - 1 <= n - 1 $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2646:46:
|
2646 | @_ abstract def precle (m n: nat): wff = $ n = 0 \/ m != 0 /\ m - 1 <= n - 1 $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:2647:8:
|
2647 | infixl precle: $<=p$ prec 50;
| ^
error: term 'precle' not declared
../examples/mm0.mm1:2648:36:
|
2648 | pub theorem precle02 (n: nat): $ n <=p 0 $ = '(orl eqid);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2649:38:
|
2649 | pub theorem precle01 (m: nat): $ ~ 0 <=p suc m $ =
| ^
error: expecting prefix >= 0
../examples/mm0.mm1:2651:41:
|
2651 | pub theorem precleS (m n: nat): $ suc m <=p suc n <-> m <= n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2655:1:
|
2655 | @_ abstract def precSuc (n: nat): nat = $ if (n = 0) 0 (suc n) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2655:51:
|
2655 | @_ abstract def precSuc (n: nat): nat = $ if (n = 0) 0 (suc n) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2656:33:
|
2656 | pub theorem precSuc0: $ precSuc 0 = 0 $ = '(ifpos eqid);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:2657:50:
|
2657 | pub theorem precSucS (n: nat): $ precSuc (suc n) = suc (suc n) $ = '(ifneg peano1);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:2661:1:
|
2661 | @_ abstract def litsPrec (lits q: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2662:14:
|
2662 | $ if (lits = 0) q (case (\\ c, \ p, precSuc p) (\ v, 0) @ fst (lits - 1)) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2663:44:
|
2663 | pub theorem litsPrec0 (q: nat): $ litsPrec 0 q = q $ = (named '(ifpos eqid));
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:2665:19:
|
2665 | $ litsPrec (z : lits) q = case (\\ c, \ p, precSuc p) (\ v, 0) @ z $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2668:22:
|
2668 | $ litsPrec (b0 (c, p) : lits) q = precSuc p $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2671:22:
|
2671 | $ litsPrec (b1 v : lits) q = 0 $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2678:1:
|
2678 | @_ def PTVar (v: nat): nat = $ b0 (b0 (b0 v)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2678:32:
|
2678 | @_ def PTVar (v: nat): nat = $ b0 (b0 (b0 v)) $;
| ^
error: b0 is not a function
../examples/mm0.mm1:2680:1:
|
2680 | @_ def PTParens (x: nat): nat = $ b0 (b0 (b1 x)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2680:35:
|
2680 | @_ def PTParens (x: nat): nat = $ b0 (b0 (b1 x)) $;
| ^
error: b0 is not a function
../examples/mm0.mm1:2682:1:
|
2682 | @_ def PTFunc (f xs: nat): nat = $ b0 (b1 (f, xs)) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2682:47:
|
2682 | @_ def PTFunc (f xs: nat): nat = $ b0 (b1 (f, xs)) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2685:1:
|
2685 | @_ def PTPfx (f c xs: nat): nat = $ b1 (b0 (b0 (f, c, xs))) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2685:52:
|
2685 | @_ def PTPfx (f c xs: nat): nat = $ b1 (b0 (b0 (f, c, xs))) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2689:1:
|
2689 | @_ def PTNota (f lits: nat): nat = $ b1 (b0 (b1 (f, lits))) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2689:53:
|
2689 | @_ def PTNota (f lits: nat): nat = $ b1 (b0 (b1 (f, lits))) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2692:1:
|
2692 | @_ def PTInfix (r f c x y: nat): nat = $ b1 (b1 (b0 (r, f, c, x, y))) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2692:57:
|
2692 | @_ def PTInfix (r f c x y: nat): nat = $ b1 (b1 (b0 (r, f, c, x, y))) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2695:1:
|
2695 | @_ def PTCoe (f x: nat): nat = $ b1 (b1 (b1 (f, x))) $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2695:49:
|
2695 | @_ def PTCoe (f x: nat): nat = $ b1 (b1 (b1 (f, x))) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2697:28:
|
2697 | theorem PTParens_ltid: $ e < PTParens e $ = '(ltb0tr @ ltb0tr b1ltid);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2698:37:
|
2698 | theorem PTFunc_ltid: $ e IN es -> e < PTFunc f es $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2700:36:
|
2700 | theorem PTPfx_ltid: $ e IN es -> e < PTPfx f c es $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2702:40:
|
2702 | theorem PTNota_ltid: $ b1 e IN ls -> e < PTNota f ls $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2704:28:
|
2704 | theorem PTInfix_ltid1: $ x < PTInfix r f c x y $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2706:28:
|
2706 | theorem PTInfix_ltid2: $ y < PTInfix r f c x y $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2708:25:
|
2708 | theorem PTCoe_ltid: $ x < PTCoe f x $ = '(ltb1tr @ leb1tr @ leb1tr leprid2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2711:1:
|
2711 | @_ abstract def ptToStr (pt: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2712:11:
|
2712 | $ srec (\ ih, case
| ^
error: expecting (
../examples/mm0.mm1:2728:16:
|
2728 | $ ptToStr ei = case
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:2745:54:
|
2745 | pub theorem ptToStrVar (v: nat): $ ptToStr (PTVar v) = v : 0 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:2749:26:
|
2749 | $ ptToStr (PTParens e) = s1 _lparen : ptToStr e ++ s1 _rparen : 0 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:2754:69:
|
2754 | pub theorem ptToStrFunc {s: nat} (f x: nat): $ ptToStr (PTFunc f x) =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:2761:71:
|
2761 | pub theorem ptToStrPfx {s: nat} (f c x: nat): $ ptToStr (PTPfx f c x) =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:2769:26:
|
2769 | $ ptToStr (PTNota f x) = ljoin (map (case (\ y, y : 0) (\ y, ptToStr y)) x) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:2780:33:
|
2780 | $ ptToStr (PTInfix r f c x y) = ptToStr x ++ c : ptToStr y $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:2786:58:
|
2786 | pub theorem ptToStrCoe (f x: nat): $ ptToStr (PTCoe f x) = ptToStr x $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:2791:1:
|
2791 | @_ local def ptCheckNotaLs_aux (bis lits: nat) (IH: set) (xs es p: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2792:15:
|
2792 | $ nztails lits, xs e. all2 (S\ lits1, {x | lits1 e. S\ lit, {lr | lit e. Sum
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/mm0.mm1:2800:27:
|
2800 | $ ptCheckNotaLs_aux bis 0 IH xs es p <-> xs = 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:2803:34:
|
2803 | $ ptCheckNotaLs_aux bis (lit : lits) IH xs es p <-> E. x E. xs2 (
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2815:37:
|
2815 | b1 v IN lits -> lookupVar bis v = suc n ->
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 25
../examples/mm0.mm1:2830:1:
|
2830 | @_ local def ptCheck_aux1 (eac: nat) (ih: set) (p pt e: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2834:10:
|
2834 | {v | E. n (lookupVar (pi22 eac) v = suc n /\ e = SVar n)}
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:2867:62:
|
2867 | theorem ptCheck_aux_Var: $ ptCheck_aux1 eac ih p (PTVar v) e <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2870:69:
|
2870 | theorem ptCheck_aux_Parens: $ ptCheck_aux1 eac ih p (PTParens pt) e <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2873:67:
|
2873 | theorem ptCheck_aux_Func: $ ptCheck_aux1 eac ih p (PTFunc f xs) e <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2879:67:
|
2879 | theorem ptCheck_aux_Pfx: $ ptCheck_aux1 eac ih p (PTPfx f c xs) e <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2886:67:
|
2886 | theorem ptCheck_aux_Nota: $ ptCheck_aux1 eac ih p (PTNota f xs) e <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2894:74:
|
2894 | theorem ptCheck_aux_Infix: $ ptCheck_aux1 eac ih p (PTInfix r f c x y) e <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2903:64:
|
2903 | theorem ptCheck_aux_Coe: $ ptCheck_aux1 eac ih p (PTCoe f x) e <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:2909:27:
|
2909 | theorem getPfx_precle: $ f, c, p e. getPfx (pi21 eac) -> p <= suc eac $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/mm0.mm1:2914:6:
|
2914 | $ f, bis, ty, lits e. getNota (pi21 eac) -> bis, ty, lits <= eac $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/mm0.mm1:2919:6:
|
2919 | $ f, c, p e. getInfix (pi21 eac) r -> p <= eac $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/mm0.mm1:2924:29:
|
2924 | theorem ptCheck_aux1_fin: $ finite {e | ptCheck_aux1 eac (ns ih) p pt e} $ =
| ^
error: finite is not a function
../examples/mm0.mm1:2967:1:
|
2967 | @_ local def ptCheck_aux (eac pt: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2968:11:
|
2968 | $ srec (\ ih, \. p e. upto (eac + 2), lower {e | ptCheck_aux1 eac ih p (size (Dom ih)) e}) pt $;
| ^
error: expecting (
../examples/mm0.mm1:2979:1:
|
2979 | @_ abstract def ptCheck (eac p pt e: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2980:24:
|
2980 | $ ptCheck_aux1 eac (\. pt1 e. upto pt, ptCheck_aux eac pt1) p pt e $;
| ^
error: expecting (
../examples/mm0.mm1:2989:1:
|
2989 | @_ abstract def ptCheckNotaLs (eac bis lits xs es p .pt1: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:2990:33:
|
2990 | $ ptCheckNotaLs_aux bis lits (\ pt1, ptCheck_aux eac pt1) xs es p $;
| ^
error: expecting (
../examples/mm0.mm1:2993:24:
|
2993 | $ ptCheck_aux eac pt = \. p e. upto (eac + 2), lower {e | ptCheck eac p pt e} $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:2997:24:
|
2997 | theorem ptCheck_fin: $ finite {e | ptCheck eac p pt e} $ = (named 'ptCheck_aux1_fin);
| ^
error: finite is not a function
../examples/mm0.mm1:2998:26:
|
2998 | theorem ptCheck_val: $ p <= suc eac -> (e e. ptCheck_aux eac pt @ p <-> ptCheck eac p pt e) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:3003:26:
|
3003 | theorem ptCheck_lem: $ p <= suc eac -> pt < pt1 ->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:3010:35:
|
3010 | (ptCheckNotaLs_aux bis lits (\. pt e. t, ptCheck_aux eac pt) xs es q <->
| ^
error: expecting (
../examples/mm0.mm1:3025:79:
|
3025 | pub theorem ptCheckVar {n: nat} (eac p v e: nat): $ ptCheck eac p (PTVar v) e <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:3028:35:
|
3028 | $ ptCheck eac p (PTParens pt) e <-> ptCheck eac (suc 0) pt e $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:3031:19:
|
3031 | $ ptCheck (env, ast, ctx) p (PTFunc f xs) e <->
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3042:36:
|
3042 | $ ptCheck eac p (PTPfx f c xs) e <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:3056:35:
|
3056 | $ ptCheck eac p (PTNota f xs) e <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:3070:41:
|
3070 | $ ptCheck eac p (PTInfix r f c x y) e <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:3084:33:
|
3084 | $ ptCheck eac p (PTCoe f x) e <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:3093:27:
|
3093 | $ ptCheckNotaLs eac bis 0 xs es q <-> xs = 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:3096:35:
|
3096 | $ ptCheckNotaLs eac bis (b0 (c, p) : lits) xs es q <->
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3104:21:
|
3104 | $ litsPrec lits q <= suc eac ->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:3130:1:
|
3130 | @_ def parseExpr (eac args f s .e .pt: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:3131:28:
|
3131 | $ {e | E. pt (ptToStr pt = f /\
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3140:1:
|
3140 | @_ def parseExprProv (eac args f .e .pt: nat): set =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:3141:28:
|
3141 | $ {e | E. pt (ptToStr pt = f /\
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3160:1:
|
3160 | @_ abstract def splitDummies (bis: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:3161:9:
|
3161 | $ rlrec 0 (\\ l, \\ a, \\ bis1, \ bis2,
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:3165:43:
|
3165 | pub theorem splitDummies0: $ splitDummies 0 = 0 $ = (named 'rlrec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:3167:20:
|
3167 | splitDummies bis = bis1, bis2 /\ bool c ->
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:3173:20:
|
3173 | splitDummies bis = bis1, bis2 ->
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:3184:1:
|
3184 | @_ abstract def checkDummies (ds bis: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:3185:5:
|
3185 | $ ds, bis e. all2 (S\ d, {bi | d e. S\ x, {t |
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/mm0.mm1:3188:54:
|
3188 | pub theorem checkDummies0 (bis: nat): $ checkDummies 0 bis <-> bis = 0 $ = (named 'all201);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:3190:23:
|
3190 | $ checkDummies ((x, t) : ds) bis <-> E. t2 E. bis2 (
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3202:1:
|
3202 | @_ def lookupVars (ctx .s .t: nat): set = $ S\ s, {t | lookupVar ctx s = suc t} $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:3202:48:
|
3202 | @_ def lookupVars (ctx .s .t: nat): set = $ S\ s, {t | lookupVar ctx s = suc t} $;
| ^
error: expecting (
../examples/mm0.mm1:3208:1:
|
3208 | @_ def elabType (ctx s out .t .vs .vs2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:3209:26:
|
3209 | $ E. t E. vs E. vs2 (s = b0 (t, vs) /\ out = t, vs2 /\
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/mm0.mm1:3212:1:
|
3212 | @_ local def elabTermBinders_aux (n: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:3213:15:
|
3213 | $ rlrec (suc 0) (\\ bis, \\ bi, \ ih,
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3224:1:
|
3224 | @_ abstract def elabTermBinders (ctx ctx2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:3225:27:
|
3225 | $ elabTermBinders_aux ctx = suc ctx2 $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:3227:21:
|
3227 | $ elabTermBinders 0 ctx <-> ctx = 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:3230:29:
|
3230 | $ elabTermBinders (bis |> (c, x, t)) ctx2 <->
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3254:1:
|
3254 | @_ def elabFmla (env ast ctx args f e s .f2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:3255:14:
|
3255 | $ E. f2 (f = b1 f2 /\ parseExpr (env, ast, ctx) args f2 s == sn e) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3262:1:
|
3262 | @_ def elabFmlaProv (env ast ctx args f e .f2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:3263:14:
|
3263 | $ E. f2 (f = b1 f2 /\ parseExprProv (env, ast, ctx) args f2 == sn e) $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3270:1:
|
3270 | @_ def elabHyps (env ast ctx args hyps hyps2 .hyp .hyp2 .x .f: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:3271:7:
|
3271 | $ hyps, hyps2 e. all2 (S\ hyp, {hyp2 | E. x E. f (hyp = 0, x, f /\
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/mm0.mm1:3280:1:
|
3280 | @_ abstract def elabDefO (env ast ctx s ds ds2 o o2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:3281:21:
|
3281 | $ o e. ocasep (ds = 0 /\ o2 = 0) {f | E. args2 E. e (
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3286:35:
|
3286 | $ elabDefO env ast ctx s ds ds2 0 o2 <-> ds = 0 /\ o2 = 0 $ = (named 'ocasep0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:3288:46:
|
3288 | $ elabDefO env ast ctx s ds ds2 (suc f) o2 <-> E. args2 E. e (
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:3294:1:
|
3294 | @_ local def Elaborate_aux (aste: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:3295:13:
|
3295 | $ srecp (S\ aste1, {ih | aste1 e. S\ e2, {ast2 | ifp (ast2 = 0) (e2 = 0) (
| ^
error: expecting (
../examples/mm0.mm1:3338:12:
|
3338 | (h: $ ih = sep (upto (e2, ast2)) {i | Elaborate_aux i} ->
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:3346:12:
|
3346 | (h: $ ih = sep (upto (e2, ast |> d)) {i | Elaborate_aux i} ->
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:3360:1:
|
3360 | @_ abstract def Elaborate (ast: nat): set = $ {e | Elaborate_aux (e, ast)} $;
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:3360:70:
|
3360 | @_ abstract def Elaborate (ast: nat): set = $ {e | Elaborate_aux (e, ast)} $;
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3362:43:
|
3362 | theorem elElaborate: $ e e. Elaborate ast <-> Elaborate_aux (e, ast) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/mm0.mm1:3365:33:
|
3365 | theorem Elaborate_aux_lem: $ e2 = e |> s \/ e = e2 ->
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/mm0.mm1:3372:37:
|
3372 | pub theorem Elaborate0: $ Elaborate 0 == sn 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/mm0.mm1:3376:23:
|
3376 | $ Elaborate (ast |> ASTSort (sd, x)) ==
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3384:29:
|
3384 | $ e2 e. Elaborate (ast |> ASTTerm (x, bis, ret)) <->
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3398:29:
|
3398 | $ e2 e. Elaborate (ast |> ASTAxiom (x, bis, ret)) <->
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3412:29:
|
3412 | $ e2 e. Elaborate (ast |> ASTDef (x, bis, ret, o)) <->
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3429:29:
|
3429 | $ e2 e. Elaborate (ast |> ASTThm (x, bis, ret)) <->
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3443:23:
|
3443 | $ Elaborate (ast |> ASTIO out n) == 0 $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3447:23:
|
3447 | $ Elaborate (ast |> ASTNota n) == Elaborate ast $ =
| ^
error: expecting ) or infix >= 0
../examples/mm0.mm1:3461:1:
|
3461 | @_ def Valid (s .ast .e: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/mm0.mm1:3462:31:
|
3462 | $ E. ast E. e (parse s ast /\ e e. Elaborate ast /\ ValidEnv e) $;
| ^
error: expecting ), infix >= 0, or infix >= max
=================== ERR =================== ../examples/mm0.mm1
=================== OK ==================== ../examples/peano_hex.mm0
../examples/peano_hex.mm1:11:3:
|
11 | @(add-eval 0) term x0: hex;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:13:3:
|
13 | @(add-eval 1) term x1: hex;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:15:3:
|
15 | @(add-eval 2) term x2: hex;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:17:3:
|
17 | @(add-eval 3) term x3: hex;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:19:3:
|
19 | @(add-eval 4) term x4: hex;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:21:3:
|
21 | @(add-eval 5) term x5: hex;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:23:3:
|
23 | @(add-eval 6) term x6: hex;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:25:3:
|
25 | @(add-eval 7) term x7: hex;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:27:3:
|
27 | @(add-eval 8) term x8: hex;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:29:3:
|
29 | @(add-eval 9) term x9: hex;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:31:3:
|
31 | @(add-eval 10) term xa: hex;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:33:3:
|
33 | @(add-eval 11) term xb: hex;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:35:3:
|
35 | @(add-eval 12) term xc: hex;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:37:3:
|
37 | @(add-eval 13) term xd: hex;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:39:3:
|
39 | @(add-eval 14) term xe: hex;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:41:3:
|
41 | @(add-eval 15) term xf: hex;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:50:3:
|
50 | @(add-eval @ fn (a b) {{16 * (eval a)} + (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:71:3:
|
71 | @(add-eval ())
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:74:3:
|
74 | @(add-eval @ fn (c) '(,c))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:77:3:
|
77 | @(add-eval @ fn (s t) (append (eval s) (eval t)))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:78:45:
|
78 | term sadd: string > string > string; infixr sadd: $'+$ prec 51;
| ^
error: term 'sadd' not declared
../examples/peano_hex.mm1:81:3:
|
81 | @(add-eval @ fn (c s) (cons (eval c) (eval s)))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:83:8:
|
83 | infixr scons: $':$ prec 53;
| ^
error: term 'scons' not declared
../examples/peano_hex.mm1:91:3:
|
91 | @(add-eval 11) def d11: nat = $suc 10$; prefix d11: $11$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:91:48:
|
91 | @(add-eval 11) def d11: nat = $suc 10$; prefix d11: $11$ prec max;
| ^
error: term 'd11' not declared
../examples/peano_hex.mm1:92:3:
|
92 | @(add-eval 12) def d12: nat = $suc 11$; prefix d12: $12$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:92:48:
|
92 | @(add-eval 12) def d12: nat = $suc 11$; prefix d12: $12$ prec max;
| ^
error: term 'd12' not declared
../examples/peano_hex.mm1:93:3:
|
93 | @(add-eval 13) def d13: nat = $suc 12$; prefix d13: $13$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:93:48:
|
93 | @(add-eval 13) def d13: nat = $suc 12$; prefix d13: $13$ prec max;
| ^
error: term 'd13' not declared
../examples/peano_hex.mm1:94:3:
|
94 | @(add-eval 14) def d14: nat = $suc 13$; prefix d14: $14$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:94:48:
|
94 | @(add-eval 14) def d14: nat = $suc 13$; prefix d14: $14$ prec max;
| ^
error: term 'd14' not declared
../examples/peano_hex.mm1:95:3:
|
95 | @(add-eval 15) def d15: nat = $suc 14$; prefix d15: $15$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:95:48:
|
95 | @(add-eval 15) def d15: nat = $suc 14$; prefix d15: $15$ prec max;
| ^
error: term 'd15' not declared
../examples/peano_hex.mm1:96:3:
|
96 | @(add-eval 16) def d16: nat = $suc 15$; prefix d16: $16$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:96:48:
|
96 | @(add-eval 16) def d16: nat = $suc 15$; prefix d16: $16$ prec max;
| ^
error: term 'd16' not declared
../examples/peano_hex.mm1:111:43:
|
111 | (def hexdigit @ on-hexstrings @ fn (s) (atom-app 'x s))
| ^
error: Reference to unbound variable 'atom-app'
../examples/peano_hex.mm1:119:3:
|
119 | @(add-eval eval)
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:120:31:
|
120 | term h2n: hex > nat; coercion h2n: hex > nat;
| ^
error: term 'h2n' not declared
../examples/peano_hex.mm1:125:27:
|
125 | axiom h2nlt (h: hex): $ h < 16 $;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:133:25:
|
133 | pub theorem d0lt16: $ 0 < 16 $ = prove-lt-16; @eval-check axiom h2n0: $ x0 = 0 $;
| ^
error: expecting (
../examples/peano_hex.mm1:133:50:
|
133 | pub theorem d0lt16: $ 0 < 16 $ = prove-lt-16; @eval-check axiom h2n0: $ x0 = 0 $;
| ^
error: Reference to unbound variable 'eval-check'
../examples/peano_hex.mm1:134:25:
|
134 | pub theorem d1lt16: $ 1 < 16 $ = prove-lt-16; @eval-check axiom h2n1: $ x1 = 1 $;
| ^
error: expecting (
../examples/peano_hex.mm1:134:50:
|
134 | pub theorem d1lt16: $ 1 < 16 $ = prove-lt-16; @eval-check axiom h2n1: $ x1 = 1 $;
| ^
error: Reference to unbound variable 'eval-check'
../examples/peano_hex.mm1:135:25:
|
135 | pub theorem d2lt16: $ 2 < 16 $ = prove-lt-16; @eval-check axiom h2n2: $ x2 = 2 $;
| ^
error: expecting (
../examples/peano_hex.mm1:135:50:
|
135 | pub theorem d2lt16: $ 2 < 16 $ = prove-lt-16; @eval-check axiom h2n2: $ x2 = 2 $;
| ^
error: Reference to unbound variable 'eval-check'
../examples/peano_hex.mm1:136:25:
|
136 | pub theorem d3lt16: $ 3 < 16 $ = prove-lt-16; @eval-check axiom h2n3: $ x3 = 3 $;
| ^
error: expecting (
../examples/peano_hex.mm1:136:50:
|
136 | pub theorem d3lt16: $ 3 < 16 $ = prove-lt-16; @eval-check axiom h2n3: $ x3 = 3 $;
| ^
error: Reference to unbound variable 'eval-check'
../examples/peano_hex.mm1:137:25:
|
137 | pub theorem d4lt16: $ 4 < 16 $ = prove-lt-16; @eval-check axiom h2n4: $ x4 = 4 $;
| ^
error: expecting (
../examples/peano_hex.mm1:137:50:
|
137 | pub theorem d4lt16: $ 4 < 16 $ = prove-lt-16; @eval-check axiom h2n4: $ x4 = 4 $;
| ^
error: Reference to unbound variable 'eval-check'
../examples/peano_hex.mm1:138:25:
|
138 | pub theorem d5lt16: $ 5 < 16 $ = prove-lt-16; @eval-check axiom h2n5: $ x5 = 5 $;
| ^
error: expecting (
../examples/peano_hex.mm1:138:50:
|
138 | pub theorem d5lt16: $ 5 < 16 $ = prove-lt-16; @eval-check axiom h2n5: $ x5 = 5 $;
| ^
error: Reference to unbound variable 'eval-check'
../examples/peano_hex.mm1:139:25:
|
139 | pub theorem d6lt16: $ 6 < 16 $ = prove-lt-16; @eval-check axiom h2n6: $ x6 = 6 $;
| ^
error: expecting (
../examples/peano_hex.mm1:139:50:
|
139 | pub theorem d6lt16: $ 6 < 16 $ = prove-lt-16; @eval-check axiom h2n6: $ x6 = 6 $;
| ^
error: Reference to unbound variable 'eval-check'
../examples/peano_hex.mm1:140:25:
|
140 | pub theorem d7lt16: $ 7 < 16 $ = prove-lt-16; @eval-check axiom h2n7: $ x7 = 7 $;
| ^
error: expecting (
../examples/peano_hex.mm1:140:50:
|
140 | pub theorem d7lt16: $ 7 < 16 $ = prove-lt-16; @eval-check axiom h2n7: $ x7 = 7 $;
| ^
error: Reference to unbound variable 'eval-check'
../examples/peano_hex.mm1:141:25:
|
141 | pub theorem d8lt16: $ 8 < 16 $ = prove-lt-16; @eval-check axiom h2n8: $ x8 = 8 $;
| ^
error: expecting (
../examples/peano_hex.mm1:141:50:
|
141 | pub theorem d8lt16: $ 8 < 16 $ = prove-lt-16; @eval-check axiom h2n8: $ x8 = 8 $;
| ^
error: Reference to unbound variable 'eval-check'
../examples/peano_hex.mm1:142:25:
|
142 | pub theorem d9lt16: $ 9 < 16 $ = prove-lt-16; @eval-check axiom h2n9: $ x9 = 9 $;
| ^
error: expecting (
../examples/peano_hex.mm1:142:50:
|
142 | pub theorem d9lt16: $ 9 < 16 $ = prove-lt-16; @eval-check axiom h2n9: $ x9 = 9 $;
| ^
error: Reference to unbound variable 'eval-check'
../examples/peano_hex.mm1:143:27:
|
143 | pub theorem d10lt16: $ 10 < 16 $ = prove-lt-16; @eval-check axiom h2na: $ xa = 10 $;
| ^
error: expecting (
../examples/peano_hex.mm1:143:50:
|
143 | pub theorem d10lt16: $ 10 < 16 $ = prove-lt-16; @eval-check axiom h2na: $ xa = 10 $;
| ^
error: Reference to unbound variable 'eval-check'
../examples/peano_hex.mm1:144:27:
|
144 | pub theorem d11lt16: $ 11 < 16 $ = prove-lt-16; @eval-check axiom h2nb: $ xb = 11 $;
| ^
error: expecting (
../examples/peano_hex.mm1:144:50:
|
144 | pub theorem d11lt16: $ 11 < 16 $ = prove-lt-16; @eval-check axiom h2nb: $ xb = 11 $;
| ^
error: Reference to unbound variable 'eval-check'
../examples/peano_hex.mm1:145:27:
|
145 | pub theorem d12lt16: $ 12 < 16 $ = prove-lt-16; @eval-check axiom h2nc: $ xc = 12 $;
| ^
error: expecting (
../examples/peano_hex.mm1:145:50:
|
145 | pub theorem d12lt16: $ 12 < 16 $ = prove-lt-16; @eval-check axiom h2nc: $ xc = 12 $;
| ^
error: Reference to unbound variable 'eval-check'
../examples/peano_hex.mm1:146:27:
|
146 | pub theorem d13lt16: $ 13 < 16 $ = prove-lt-16; @eval-check axiom h2nd: $ xd = 13 $;
| ^
error: expecting (
../examples/peano_hex.mm1:146:50:
|
146 | pub theorem d13lt16: $ 13 < 16 $ = prove-lt-16; @eval-check axiom h2nd: $ xd = 13 $;
| ^
error: Reference to unbound variable 'eval-check'
../examples/peano_hex.mm1:147:27:
|
147 | pub theorem d14lt16: $ 14 < 16 $ = prove-lt-16; @eval-check axiom h2ne: $ xe = 14 $;
| ^
error: expecting (
../examples/peano_hex.mm1:147:50:
|
147 | pub theorem d14lt16: $ 14 < 16 $ = prove-lt-16; @eval-check axiom h2ne: $ xe = 14 $;
| ^
error: Reference to unbound variable 'eval-check'
../examples/peano_hex.mm1:148:27:
|
148 | pub theorem d15lt16: $ 15 < 16 $ = prove-lt-16; @eval-check axiom h2nf: $ xf = 15 $;
| ^
error: expecting (
../examples/peano_hex.mm1:148:50:
|
148 | pub theorem d15lt16: $ 15 < 16 $ = prove-lt-16; @eval-check axiom h2nf: $ xf = 15 $;
| ^
error: Reference to unbound variable 'eval-check'
../examples/peano_hex.mm1:151:39:
|
151 | (def h2nn @ on-hexstrings @ fn (s) (atom-app 'h2n s))
| ^
error: Reference to unbound variable 'atom-app'
../examples/peano_hex.mm1:165:3:
|
165 | @(add-eval eval)
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:166:32:
|
166 | term c2n: char > nat; coercion c2n: char > nat;
| ^
error: term 'c2n' not declared
../examples/peano_hex.mm1:169:28:
|
169 | axiom c2nlt (c: char): $ c < 16 * 16 $;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:171:40:
|
171 | pub theorem chlt256 (hi lo: hex): $ hi * 16 + lo < 16 * 16 $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:174:38:
|
174 | axiom c2nch (hi lo: hex): $ ch hi lo = hi * 16 + lo $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:186:3:
|
186 | @(add-eval eval)
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:187:34:
|
187 | term s2n: string > nat; coercion s2n: string > nat;
| ^
error: term 's2n' not declared
../examples/peano_hex.mm1:188:1:
|
188 | @_ def isStr (s .c: nat): wff = $ all {c | c < 16 * 16} s $;
| ^
error: Unknown function 'annotate'
../examples/peano_hex.mm1:188:39:
|
188 | @_ def isStr (s .c: nat): wff = $ all {c | c < 16 * 16} s $;
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:191:29:
|
191 | axiom s2nstr (s: string): $ isStr s $;
| ^
error: isStr is not a function
../examples/peano_hex.mm1:192:28:
|
192 | pub theorem s0str: $ isStr 0 $ = (named 'all0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:193:19:
|
193 | axiom s2ns0: $ s0 = 0 $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:194:43:
|
194 | pub theorem s1str (c: char): $ isStr (c : 0) $ = '(mpbir all1 @ mpbir (elabe ,eqtac) c2nlt);
| ^
error: expecting ) or infix >= 0
../examples/peano_hex.mm1:195:31:
|
195 | axiom s2ns1 (c: char): $ s1 c = c : 0 $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:196:50:
|
196 | pub theorem saddstr (s t: string): $ isStr (s ++ t) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano_hex.mm1:198:34:
|
198 | axiom s2nsadd (s t: string): $ s '+ t = s ++ t $;
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/peano_hex.mm1:200:5:
|
200 | do (add-axiom-set! 'axs_string "String axioms" '(
| ^
error: Reference to unbound variable 'add-axiom-set!'
../examples/peano_hex.mm1:204:23:
|
204 | theorem s2nscons: $ c ': s = c : s $ =
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/peano_hex.mm1:206:24:
|
206 | theorem s2nscons0: $ c ': s0 = s1 c $ =
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/peano_hex.mm1:208:34:
|
208 | theorem sconseq1 (c1 c2 s): $ c1 = c2 -> c1 ': s = c2 ': s $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:210:34:
|
210 | theorem sconseq2 (c s1 s2): $ s1 = s2 -> c ': s1 = c ': s2 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:213:24:
|
213 | theorem s2n_A (h1: $ s = a $) (h2: $ t = b $): $ s '+ t = a ++ b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:215:23:
|
215 | theorem s2n_1 (h: $ c = a $): $ s1 c = a : 0 $ = '(eqtr s2ns1 @ conseq1 h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:216:24:
|
216 | theorem s2n_S (h1: $ c = a $) (h2: $ s = b $): $ c ': s = a : b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:218:24:
|
218 | theorem s2n_SE (h: $ s = a $): $ c ': s = c : a $ = '(s2n_S eqid h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:219:25:
|
219 | theorem s2n_SAE (h: $ s = a ++ b $): $ c ': s = c : a ++ b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:221:26:
|
221 | theorem s2n_SASE (h: $ s = a ++ b $): $ c ': s = (c ': a) ++ b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:223:27:
|
223 | theorem append01i (h: $ a = b $): $ a = 0 ++ b $ = '(eqtr4 h append0);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:224:22:
|
224 | theorem s2n_R0: $ s0 = repeat a 0 $ = '(eqtr4 s2ns0 repeat0);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:225:24:
|
225 | theorem s2n_R1 (h: $ c = a $): $ s1 c = repeat a 1 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:227:25:
|
227 | theorem s2n_RA (h1: $ s = repeat a m $) (h2: $ t = repeat a n $) (h3: $ m + n = p $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:229:25:
|
229 | theorem s2n_RS (h1: $ c = a $) (h2: $ s = repeat a n $) (h3: $ suc n = p $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:231:20:
|
231 | theorem saddS: $ c ': s '+ t = c ': (s '+ t) $ =
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/peano_hex.mm1:234:3:
|
234 | @(add-eval @ fn (a b) {{16 * (eval a)} + (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano_hex.mm1:236:8:
|
236 | infixl hex: $:x$ prec 120;
| ^
error: term 'hex' not declared
../examples/peano_hex.mm1:238:3:
|
238 | @(register-eqd 'hex) theorem hexeqd (G a1 a2 x1 x2)
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano_hex.mm1:241:22:
|
241 | theorem hexeq1: $ a1 = a2 -> hex a1 x = hex a2 x $ = '(hexeqd id eqidd);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:242:23:
|
242 | theorem hexeq2: $ _x1 = _x2 -> hex a _x1 = hex a _x2 $ = '(hexeqd eqidd id);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:244:26:
|
244 | theorem suc_xf: $ suc xf = 16 $ = '(suceq h2nf);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:246:21:
|
246 | theorem hex01_: $ 0 :x a = a $ = '(eqtr (addeq1 mul01) add01);
| ^
error: expecting (
../examples/peano_hex.mm1:247:21:
|
247 | theorem hex01: $ x0 :x a = a $ = '(eqtr (hexeq1 h2n0) hex01_);
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:248:20:
|
248 | theorem hex02: $ n :x x0 = n * 16 $ = '(eqtr (addeq2 h2n0) add0);
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:249:21:
|
249 | theorem hex10: $ x1 :x x0 = 16 $ = '(eqtr hex02 @ eqtr (muleq1 h2n1) mul11);
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:251:28:
|
251 | theorem c2nhex: $ ch h1 h2 = h1 :x h2 $ = 'c2nch;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:252:27:
|
252 | theorem c2nh2n: $ ch x0 a = h2n a $ = '(eqtr c2nhex hex01);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:259:30:
|
259 | theorem suchexf: $ suc (a :x xf) = suc a :x x0 $ =
| ^
error: expecting ) or infix >= 0
../examples/peano_hex.mm1:262:22:
|
262 | theorem addx01: $ x0 + a = a $ = '(eqtr (addeq1 h2n0) add01);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:263:21:
|
263 | theorem addx02: $ a + x0 = a $ = '(eqtr (addeq2 h2n0) add0);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:264:21:
|
264 | theorem addx12: $ a + x1 = suc a $ = '(eqtr (addeq2 h2n1) add12);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:265:22:
|
265 | theorem mulx01: $ x0 * a = x0 $ = '(eqtr (muleq1 h2n0) @ eqtr4 mul01 h2n0);
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:266:21:
|
266 | theorem mulx02: $ a * x0 = x0 $ = '(eqtr (muleq2 h2n0) @ eqtr4 mul0 h2n0);
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:267:22:
|
267 | theorem mulx11: $ x1 * a = a $ = '(eqtr (muleq1 h2n1) mul11);
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:268:21:
|
268 | theorem mulx12: $ a * x1 = a $ = '(eqtr (muleq2 h2n1) mul12);
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:269:21:
|
269 | theorem h2n10: $ 16 = x1 :x x0 $ = '(eqtr2 hex02 mulx11);
| ^
error: expecting (
../examples/peano_hex.mm1:310:27:
|
310 | (def decdigit->number @ lookup-fn @ rmap (range 0 16) @ fn (n) '[,(dn n) ,n])
| ^
error: Reference to unbound variable 'lookup-fn'
../examples/peano_hex.mm1:319:33:
|
319 | theorem decsuc_lem (h1: $ h2n a = d $) (h2: $ h2n b = suc d $): $ suc a = b $ = '(eqtr4 (suceq h1) h2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:320:27:
|
320 | theorem decsucf: $ suc xf = x1 :x x0 $ = '(eqtr4 suc_xf hex10);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:321:29:
|
321 | theorem decsucx (h: $ suc b = c $): $ suc (a :x b) = a :x c $ = '(eqtr3 addS2 @ addeq2 h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:322:30:
|
322 | theorem decsucxf (h: $ suc a = b $): $ suc (a :x xf) = b :x x0 $ = '(eqtr suchexf @ hexeq1 h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:327:30:
|
327 | @ let ([i (hex->number @ atom-app 'x s)] [name (atom-app 'dsuc s)])
| ^
error: Reference to unbound variable 'atom-app'
../examples/peano_hex.mm1:362:42:
|
362 | theorem declt_lem (a b: hex) (h: $ suc a = b $): $ a < b $ = '(mpbi (lteq2 h) ltsucid);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:363:25:
|
363 | theorem decltx1 (h: $ a < c $): $ a :x b < c :x d $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:365:25:
|
365 | theorem decltx2 (h: $ b < c $): $ a :x b < a :x c $ = '(mpbi ltadd2 h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:366:26:
|
366 | theorem declt0x (h: $ x0 < b $): $ h2n a < b :x c $ = '(mpbi (lteq1 hex01) @ decltx1 h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:375:6:
|
375 | (for 0 15 @ fn (a) (def b {a + 1}) @ f a b @ fn ()
| ^
error: Reference to unbound variable 'for'
../examples/peano_hex.mm1:415:29:
|
415 | theorem decadd_lem (h1: $ a + b = d $) (h2: $ suc b = c $) (h3: $ suc d = e $): $ a + c = e $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:417:29:
|
417 | theorem decadc_lem (h1: $ a + b = c $) (h2: $ suc c = d $): $ suc (a + b) = d $ = '(eqtr (suceq h1) h2);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:423:45:
|
423 | @ on-hexstrings @ fn (sa) @ let ([xa (atom-app 'x sa)] [a (hex->number xa)] [xa '(h2n @ ,xa)])
| ^
error: Reference to unbound variable 'atom-app'
../examples/peano_hex.mm1:454:26:
|
454 | theorem add_xx0 (h1: $ a + c = e $) (h2: $ b + d = f $): $ a :x b + c :x d = e :x f $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:456:33:
|
456 | theorem add_xx1 (h1: $ suc (a + c) = e $) (h2: $ b + d = x1 :x f $): $ a :x b + c :x d = e :x f $ =
| ^
error: expecting ) or infix >= 0
../examples/peano_hex.mm1:459:26:
|
459 | theorem adc_xx0 (h1: $ a + c = e $) (h2: $ suc (b + d) = f $): $ suc (a :x b + c :x d) = e :x f $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:461:33:
|
461 | theorem adc_xx1 (h1: $ suc (a + c) = e $) (h2: $ suc (b + d) = x1 :x f $): $ suc (a :x b + c :x d) = e :x f $
=
| ^
error: expecting ) or infix >= 0
../examples/peano_hex.mm1:464:25:
|
464 | theorem add_0x0 (h: $ a + c = d $): $ h2n a + b :x c = b :x d $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:466:30:
|
466 | theorem add_0x1 (h1: $ suc b = d $) (h2: $ a + c = x1 :x e $): $ h2n a + b :x c = d :x e $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:468:32:
|
468 | theorem adc_0x0 (h: $ suc (a + c) = d $): $ suc (h2n a + b :x c) = b :x d $ =
| ^
error: expecting ) or infix >= 0
../examples/peano_hex.mm1:470:30:
|
470 | theorem adc_0x1 (h1: $ suc b = d $) (h2: $ suc (a + c) = x1 :x e $): $ suc (h2n a + b :x c) = d :x e $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:472:25:
|
472 | theorem add_x00 (h: $ b + c = d $): $ a :x b + h2n c = a :x d $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:474:30:
|
474 | theorem add_x01 (h1: $ suc a = d $) (h2: $ b + c = x1 :x e $): $ a :x b + h2n c = d :x e $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:476:32:
|
476 | theorem adc_x00 (h: $ suc (b + c) = d $): $ suc (a :x b + h2n c) = a :x d $ =
| ^
error: expecting ) or infix >= 0
../examples/peano_hex.mm1:478:30:
|
478 | theorem adc_x01 (h1: $ suc a = d $) (h2: $ suc (b + c) = x1 :x e $): $ suc (a :x b + h2n c) = d :x e $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:515:23:
|
515 | theorem decb0 (h: $ a + a = b $): $ b0 a = b $ = 'h;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:516:30:
|
516 | theorem decb1 (h: $ suc (a + a) = b $): $ b1 a = b $ = 'h;
| ^
error: expecting ) or infix >= 0
../examples/peano_hex.mm1:523:29:
|
523 | theorem decmul_lem (h1: $ a * b = d $) (h2: $ suc b = c $) (h3: $ d + a = e $): $ a * c = e $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:530:45:
|
530 | @ on-hexstrings @ fn (sa) @ let ([xa (atom-app 'x sa)] [a (hex->number xa)] [xa '(h2n @ ,xa)])
| ^
error: Reference to unbound variable 'atom-app'
../examples/peano_hex.mm1:544:24:
|
544 | theorem mul_b1 (h: $ a * b = c $): $ a :x x0 * b = c :x x0 $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:546:24:
|
546 | theorem mul_b2 (h: $ a * b = c $): $ a * b :x x0 = c :x x0 $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:548:26:
|
548 | theorem mul_x1x (h1: $ a * c = d $) (h2: $ b * c = e :x f $) (h3: $ d + e = g $): $ a :x b * c = g :x f $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:551:26:
|
551 | theorem mul_x10 (h1: $ a * c = d $) (h2: $ b * c = e $): $ a :x b * c = d :x e $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:553:26:
|
553 | theorem mul_x2x (h1: $ a * b = d $) (h2: $ a * c = e :x f $) (h3: $ d + e = g $): $ a * b :x c = g :x f $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:555:26:
|
555 | theorem mul_x20 (h1: $ a * b = d $) (h2: $ a * c = e $): $ a * b :x c = d :x e $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:592:25:
|
592 | theorem suceql (ha: $ a = a2 $) (h: $ suc a2 = b $): $ suc a = b $ = '(eqtr (suceq ha) h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:593:25:
|
593 | theorem addeql (ha: $ a = a2 $) (hb: $ b = b2 $) (h: $ a2 + b2 = c $): $ a + b = c $ = '(eqtr (addeq ha hb) h
);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:594:25:
|
594 | theorem adceql (ha: $ a = a2 $) (hb: $ b = b2 $) (h: $ suc (a2 + b2) = c $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:596:25:
|
596 | theorem muleql (ha: $ a = a2 $) (hb: $ b = b2 $) (h: $ a2 * b2 = c $): $ a * b = c $ = '(eqtr (muleq ha hb) h
);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:597:25:
|
597 | theorem hexeql (ha: $ a = a2 $): $ a :x b = a2 :x b $ = '(hexeq1 ha);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:598:26:
|
598 | theorem hexeql0 (ha: $ a = x0 $): $ a :x b = b $ = '(eqtr (hexeql ha) hex01);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:599:24:
|
599 | theorem lteql (ha: $ a = a2 $) (hb: $ b = b2 $) (h: $ a2 < b2 $): $ a < b $ = '(mpbir (lteq ha hb) h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:600:24:
|
600 | theorem leeql (ha: $ a = a2 $) (hb: $ b = b2 $) (h: $ a2 <= b2 $): $ a <= b $ = '(mpbir (leeq ha hb) h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:601:24:
|
601 | theorem neeql (ha: $ a = a2 $) (hb: $ b = b2 $) (h: $ a2 != b2 $): $ a != b $ = '(mpbir (neeq ha hb) h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:602:24:
|
602 | theorem eqeql (ha: $ a = a2 $) (hb: $ b = b2 $) (h: $ a2 = b2 $): $ a = b $ = '(mpbir (eqeq ha hb) h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:603:24:
|
603 | theorem b0eql (ha: $ a = a2 $) (h: $ b0 a2 = b $): $ b0 a = b $ = '(eqtr (b0eq ha) h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:604:24:
|
604 | theorem b1eql (ha: $ a = a2 $) (h: $ b1 a2 = b $): $ b1 a = b $ = '(eqtr (b1eq ha) h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:619:12:
|
619 | [#undef @ refine t 'eqid])
| ^
error: expecting identifier char
../examples/peano_hex.mm1:702:25:
|
702 | theorem decdiv (ha: $ a = a2 $) (hb: $ b = b2 $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:705:25:
|
705 | theorem decmod (ha: $ a = a2 $) (hb: $ b = b2 $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:708:26:
|
708 | theorem decdiv0 (ha: $ a = a2 $) (hb: $ b = x0 $): $ a // b = x0 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:710:26:
|
710 | theorem decmod0 (ha: $ a = a2 $) (hb: $ b = x0 $): $ a % b = a2 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:713:9:
|
713 | (let ([((divmod zth sth) a b)
| ^
error: invalid syntax
../examples/peano_hex.mm1:732:20:
|
732 | theorem d0lt3: $ 0 < 3 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:733:20:
|
733 | theorem d0lt4: $ 0 < 4 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:734:20:
|
734 | theorem d1lt3: $ 1 < 3 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:735:20:
|
735 | theorem d1lt4: $ 1 < 4 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:736:20:
|
736 | theorem d1lt8: $ 1 < 8 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:737:20:
|
737 | theorem d2lt3: $ 2 < 3 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:738:20:
|
738 | theorem d2lt4: $ 2 < 4 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:739:20:
|
739 | theorem d2lt8: $ 2 < 8 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:740:20:
|
740 | theorem d3lt4: $ 3 < 4 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:741:20:
|
741 | theorem d4lt6: $ 4 < 6 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:742:20:
|
742 | theorem d4lt7: $ 4 < 7 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:743:20:
|
743 | theorem d4lt8: $ 4 < 8 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:744:20:
|
744 | theorem d6lt7: $ 6 < 7 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:745:20:
|
745 | theorem d8ne0: $ 8 != 0 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:746:21:
|
746 | theorem d8add8: $ 8 + 8 = 16 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:747:22:
|
747 | theorem d16ne0: $ 16 != 0 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:748:21:
|
748 | theorem d2mul2: $ 2 * 2 = 4 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:749:27:
|
749 | theorem pow22lem (h1: $ 2 * a = b $) (h2: $ 2 ^ a = c $): $ 2 ^ b = c * c $ =
| ^
error: expecting (
../examples/peano_hex.mm1:751:21:
|
751 | theorem d2pow2: $ 2 ^ 2 = 4 $ = '(eqtr pow22 d2mul2);
| ^
error: expecting (
../examples/peano_hex.mm1:752:21:
|
752 | theorem d2mul4: $ 2 * 4 = 8 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:753:21:
|
753 | theorem d4add4: $ 4 + 4 = 8 $ = '(eqtr3 mul21 d2mul4);
| ^
error: expecting (
../examples/peano_hex.mm1:754:21:
|
754 | theorem d2pow3: $ 2 ^ 3 = 8 $ = '(eqtr powS @ eqtr (muleq2 d2pow2) d2mul4);
| ^
error: expecting (
../examples/peano_hex.mm1:755:21:
|
755 | theorem d8mul2: $ 8 * 2 = 16 $ = norm_num;
| ^
error: expecting (
../examples/peano_hex.mm1:756:21:
|
756 | theorem d2pow4: $ 2 ^ 4 = 16 $ = '(eqtr4 (pow22lem d2mul2 d2pow2) ,norm_num);
| ^
error: expecting (
../examples/peano_hex.mm1:757:21:
|
757 | theorem d2pow8: $ 2 ^ 8 = 16 * 16 $ =
| ^
error: expecting (
../examples/peano_hex.mm1:759:22:
|
759 | theorem d2pow8x: $ 2 ^ 8 = ,256 $ = '(eqtr d2pow8 ,to_hex);
| ^
error: expecting (
../examples/peano_hex.mm1:760:23:
|
760 | theorem d2pow16x: $ 2 ^ 16 = ,0x10000 $ =
| ^
error: expecting (
../examples/peano_hex.mm1:762:23:
|
762 | theorem upto4: $ upto 4 = xf $ =
| ^
error: unexpected '4'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:764:24:
|
764 | theorem upto16: $ upto 16 = ,0xffff $ =
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:767:26:
|
767 | theorem xltmul16 (h: $ a < b $): $ a :x x < b * 16 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:769:28:
|
769 | theorem xlt16pow1: $ h2n x < 16 ^ suc k $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:771:27:
|
771 | theorem xlt16powS (h: $ a < 16 ^ k $): $ a :x x < 16 ^ suc k $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:774:22:
|
774 | theorem hexshl4: $ a :x b = shl a 4 + b $ = '(addeq1 @ muleq2 @ eqcom d2pow4);
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano_hex.mm1:775:30:
|
775 | theorem shrhex4: $ shr (a :x b) 4 = a $ =
| ^
error: expecting ) or infix >= 0
../examples/peano_hex.mm1:778:26:
|
778 | theorem x16powS (h: $ 16 ^ k = a $): $ 16 ^ suc k = a :x x0 $ =
| ^
error: expecting (
../examples/peano_hex.mm1:780:22:
|
780 | theorem x2pow0: $ x1 = 2 ^ 0 $ = '(eqtr2 pow0 dec1);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:781:22:
|
781 | theorem x2pow1: $ x2 = 2 ^ 1 $ = '(eqtr2 pow12 dec2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:782:22:
|
782 | theorem x2pow2: $ x4 = 2 ^ 2 $ = '(eqtr2 d2pow2 dec4);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:783:22:
|
783 | theorem x2pow3: $ x8 = 2 ^ 3 $ = '(eqtr2 d2pow3 dec8);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:784:24:
|
784 | theorem x2powS (h: $ a = 2 ^ k $): $ a :x x0 = 2 ^ (k + 4) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano_hex.mm1:791:4:
|
791 | (for 0 16 @ fn (a)
| ^
error: Reference to unbound variable 'for'
=================== ERR =================== ../examples/peano_hex.mm1
=================== OK ==================== ../examples/peano.mm0
../examples/peano.mm1:28:38:
|
28 | (def (for a b f) (if {a = b} #undef (begin (f a) (for {a + 1} b f))))
| ^
error: expecting identifier char
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:420:19:
|
420 | @ refine tgt (foldl ps (verb e) @ fn (acc p2) @ copy-span e '(ax_mp ,acc ,p2)))
| ^
error: Reference to unbound variable 'foldl'
../examples/peano.mm1:421:26:
|
421 | (def default-annotate (derive-eq))
| ^
error: Reference to unbound variable 'derive-eq'
../examples/peano.mm1:484:3:
|
484 | @(add-eval @ fn (a b) {(eval a) and (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:486:8:
|
486 | infixl an: $/\$ prec 34;
| ^
error: term 'an' not declared
../examples/peano.mm1:488:18:
|
488 | theorem anl: $ a /\ b -> a $ = '(con1 absurd);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:489:18:
|
489 | theorem anr: $ a /\ b -> b $ = '(con1 ax_1);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:490:22:
|
490 | theorem anli (h: $ a /\ b $): $ a $ = '(anl h);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:491:22:
|
491 | theorem anri (h: $ a /\ b $): $ b $ = '(anr h);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:492:28:
|
492 | theorem ian: $ a -> b -> a /\ b $ = '(con2d mpcom);
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 25
../examples/peano.mm1:493:58:
|
493 | theorem iand (h1: $ a -> b $) (h2: $ a -> c $): $ a -> b /\ c $ = '(sylc ian h1 h2);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:494:27:
|
494 | theorem anld (h: $ a -> b /\ c $): $ a -> b $ = '(syl anl h);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:495:27:
|
495 | theorem anrd (h: $ a -> b /\ c $): $ a -> c $ = '(syl anr h);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:496:43:
|
496 | theorem iani (h1: $ a $) (h2: $ b $): $ a /\ b $ = '(ian h1 h2);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:497:35:
|
497 | theorem anwl (h: $ a -> c $): $ a /\ b -> c $ = '(syl h anl);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:498:35:
|
498 | theorem anwr (h: $ b -> c $): $ a /\ b -> c $ = '(syl h anr);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:499:19:
|
499 | theorem anll: $ a /\ b /\ c -> a $ = '(anwl anl);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:500:19:
|
500 | theorem anlr: $ a /\ b /\ c -> b $ = '(anwl anr);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:501:19:
|
501 | theorem anrl: $ a /\ (b /\ c) -> b $ = '(anwr anl);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:502:19:
|
502 | theorem anrr: $ a /\ (b /\ c) -> c $ = '(anwr anr);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:503:36:
|
503 | theorem anwll (h: $ a -> d $): $ a /\ b /\ c -> d $ = '(anwl (anwl h));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:504:36:
|
504 | theorem anw3l (h: $ a -> e $): $ a /\ b /\ c /\ d -> e $ = '(anwll (anwl h));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:505:36:
|
505 | theorem anw4l (h: $ a -> f $): $ a /\ b /\ c /\ d /\ e -> f $ = '(anw3l (anwl h));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:506:36:
|
506 | theorem anw5l (h: $ a -> g $): $ a /\ b /\ c /\ d /\ e /\ f -> g $ = '(anw4l (anwl h));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:507:36:
|
507 | theorem anw6l (x: $ a -> h $): $ a /\ b /\ c /\ d /\ e /\ f /\ g -> h $ = '(anw5l (anwl x));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:508:36:
|
508 | theorem anw7l (x: $ a -> i $): $ a /\ b /\ c /\ d /\ e /\ f /\ g /\ h -> i $ = '(anw6l (anwl x));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:509:20:
|
509 | theorem anllr: $ a /\ b /\ c /\ d -> b $ = '(anwll anr);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:510:19:
|
510 | theorem an3l: $ a /\ b /\ c /\ d -> a $ = '(anwll anl);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:511:20:
|
511 | theorem an3lr: $ a /\ b /\ c /\ d /\ e -> b $ = '(anwl anllr);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:512:19:
|
512 | theorem an4l: $ a /\ b /\ c /\ d /\ e -> a $ = '(anwl an3l); -- TODO: automate these
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:513:20:
|
513 | theorem an4lr: $ a /\ b /\ c /\ d /\ e /\ f -> b $ = '(anwl an3lr);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:514:19:
|
514 | theorem an5l: $ a /\ b /\ c /\ d /\ e /\ f -> a $ = '(anwl an4l);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:515:20:
|
515 | theorem an5lr: $ a /\ b /\ c /\ d /\ e /\ f /\ g -> b $ = '(anwl an4lr);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:516:19:
|
516 | theorem an6l: $ a /\ b /\ c /\ d /\ e /\ f /\ g -> a $ = '(anwl an5l);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:517:20:
|
517 | theorem an6lr: $ a /\ b /\ c /\ d /\ e /\ f /\ g /\ h -> b $ = '(anwl an5lr);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:518:39:
|
518 | theorem imp (h: $ a -> b -> c $): $ a /\ b -> c $ = '(sylc h anl anr);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:519:21:
|
519 | theorem exp (h: $ a /\ b -> c $): $ a -> b -> c $ = '(syl6 h ian);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:520:42:
|
520 | theorem impcom (h: $ a -> b -> c $): $ b /\ a -> c $ = '(imp (com12 h));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:521:24:
|
521 | theorem expcom (h: $ a /\ b -> c $): $ b -> a -> c $ = '(com12 (exp h));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:522:47:
|
522 | theorem syla (h1: $ (b -> c) -> d $) (h2: $ a /\ b -> c $): $ a -> d $ = '(syl h1 @ exp h2);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:523:23:
|
523 | theorem sylan (h: $ b /\ c -> d $) (h1: $ a -> b $) (h2: $ a -> c $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:525:69:
|
525 | theorem animd (h1: $ a -> b -> c $) (h2: $ a -> d -> e $): $ a -> b /\ d -> c /\ e $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:527:47:
|
527 | theorem anim1d (h: $ a -> b -> c $): $ a -> b /\ d -> c /\ d $ = '(animd h idd);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:528:47:
|
528 | theorem anim2d (h: $ a -> c -> d $): $ a -> b /\ c -> b /\ d $ = '(animd idd h);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:529:32:
|
529 | theorem anim1: $ (a -> b) -> a /\ c -> b /\ c $ = '(anim1d id);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:530:32:
|
530 | theorem anim2: $ (b -> c) -> a /\ b -> a /\ c $ = '(anim2d id);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:531:43:
|
531 | theorem anim: $ (a -> b) -> (c -> d) -> a /\ c -> b /\ d $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 25
../examples/peano.mm1:533:42:
|
533 | theorem anim2a: $ (a -> b -> c) -> (a /\ b -> a /\ c) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:535:20:
|
535 | theorem ancom: $ a /\ b -> b /\ a $ = '(iand anr anl);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:536:25:
|
536 | theorem anrasss (h: $ a /\ b /\ c -> d $): $ a /\ c /\ b -> d $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:538:42:
|
538 | theorem anim1a: $ (a -> b -> c) -> (b /\ a -> c /\ a) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:540:26:
|
540 | theorem casesda (h1: $ a /\ b -> c $) (h2: $ a /\ ~b -> c $): $ a -> c $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:542:24:
|
542 | theorem inotda (h: $ a /\ b -> ~b $): $ a -> ~b $ = '(syla inot h);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:543:41:
|
543 | theorem mpand (h1: $ a -> b $) (h2: $ a /\ b -> c $): $ a -> c $ = '(mpd h1 (exp h2));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:544:42:
|
544 | theorem mtand (h1: $ a -> ~b $) (h2: $ a /\ c -> b $): $ a -> ~c $ = '(mtd h1 (exp h2));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:545:37:
|
545 | theorem mtani (h1: $ ~b $) (h2: $ a /\ c -> b $): $ a -> ~c $ = '(mtand (a1i h1) h2);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:548:3:
|
548 | @(add-eval @ fn (a b) {(eval a) == (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:550:8:
|
550 | infixl iff: $<->$ prec 20;
| ^
error: term 'iff' not declared
../examples/peano.mm1:552:23:
|
552 | theorem bi1: $ (a <-> b) -> a -> b $ = 'anl;
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:553:22:
|
553 | theorem bi1i (h: $ a <-> b $): $ a -> b $ = '(bi1 h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:554:32:
|
554 | theorem bi1d (h: $ a -> (b <-> c) $): $ a -> b -> c $ = '(syl bi1 h);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:555:32:
|
555 | theorem bi1a (h: $ a -> (b <-> c) $): $ a /\ b -> c $ = '(imp @ bi1d h);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:556:23:
|
556 | theorem bi2: $ (a <-> b) -> b -> a $ = 'anr;
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:557:22:
|
557 | theorem bi2i (h: $ a <-> b $): $ b -> a $ = '(bi2 h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:558:32:
|
558 | theorem bi2d (h: $ a -> (b <-> c) $): $ a -> c -> b $ = '(syl bi2 h);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:559:32:
|
559 | theorem bi2a (h: $ a -> (b <-> c) $): $ a /\ c -> b $ = '(imp @ bi2d h);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:560:53:
|
560 | theorem ibii (h1: $ a -> b $) (h2: $ b -> a $): $ a <-> b $ = '(iani h1 h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:561:73:
|
561 | theorem ibid (h1: $ a -> b -> c $) (h2: $ a -> c -> b $): $ a -> (b <-> c) $ = '(iand h1 h2);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:562:24:
|
562 | theorem ibida (h1: $ a /\ b -> c $) (h2: $ a /\ c -> b $): $ a -> (b <-> c) $ = '(ibid (exp h1) (exp h2));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:563:19:
|
563 | theorem biid: $ a <-> a $ = '(ibii id id);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:564:30:
|
564 | theorem biidd: $ a -> (b <-> b) $ = '(a1i biid);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:565:23:
|
565 | theorem mpbi (h1: $ a <-> b $) (h2: $ a $): $ b $ = '(bi1i h1 h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:566:24:
|
566 | theorem mpbir (h1: $ b <-> a $) (h2: $ a $): $ b $ = '(bi2i h1 h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:567:34:
|
567 | theorem mpbid (h1: $ a -> (b <-> c) $) (h2: $ a -> b $): $ a -> c $ = '(mpd h2 (bi1d h1));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:568:35:
|
568 | theorem mpbird (h1: $ a -> (c <-> b) $) (h2: $ a -> b $): $ a -> c $ = '(mpd h2 (bi2d h1));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:569:46:
|
569 | theorem mpbii (h1: $ b $) (h2: $ a -> (b <-> c) $): $ a -> c $ = '(mpbid h2 (a1i h1));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:570:47:
|
570 | theorem mpbiri (h1: $ b $) (h2: $ a -> (c <-> b) $): $ a -> c $ = '(mpbird h2 (a1i h1));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:571:23:
|
571 | theorem mtbi (h1: $ a <-> b $) (h2: $ ~a $): $ ~b $ = '(mt (bi2 h1) h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:572:24:
|
572 | theorem mtbir (h1: $ b <-> a $) (h2: $ ~a $): $ ~b $ = '(mt (bi1 h1) h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:573:34:
|
573 | theorem mtbid (h1: $ a -> (b <-> c) $) (h2: $ a -> ~b $): $ a -> ~c $ = '(mtd h2 (bi2d h1));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:574:35:
|
574 | theorem mtbird (h1: $ a -> (c <-> b) $) (h2: $ a -> ~b $): $ a -> ~c $ = '(mtd h2 (bi1d h1));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:575:26:
|
575 | theorem con1b: $ (~a <-> b) -> (~b <-> a) $ = '(ibid (con1d bi1) (con2d bi2));
| ^
error: expecting ), infix >= 0, or infix >= 41
../examples/peano.mm1:576:25:
|
576 | theorem con2b: $ (a <-> ~b) -> (b <-> ~a) $ = '(ibid (con2d bi1) (con1d bi2));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:577:25:
|
577 | theorem con3b: $ (a <-> b) -> (~a <-> ~b) $ = '(ibid (con3d bi2) (con3d bi1));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:578:26:
|
578 | theorem con4b: $ (~a <-> ~b) -> (a <-> b) $ = '(ibid (con4d bi2) (con4d bi1));
| ^
error: expecting ), infix >= 0, or infix >= 41
../examples/peano.mm1:579:27:
|
579 | theorem con1bb: $ (~a <-> b) <-> (~b <-> a) $ = '(ibii con1b con1b);
| ^
error: expecting ), infix >= 0, or infix >= 41
../examples/peano.mm1:580:26:
|
580 | theorem con2bb: $ (a <-> ~b) <-> (b <-> ~a) $ = '(ibii con2b con2b);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:581:26:
|
581 | theorem con3bb: $ (a <-> b) <-> (~a <-> ~b) $ = '(ibii con3b con4b);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:582:29:
|
582 | theorem con1bi: $ (~a -> b) <-> (~b -> a) $ = '(ibii con1 con1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:583:29:
|
583 | theorem con2bi: $ (a -> ~b) <-> (b -> ~a) $ = '(ibii con2 con2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:584:28:
|
584 | theorem con3bi: $ (a -> b) <-> (~b -> ~a) $ = '(ibii con3 ax_3);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:585:21:
|
585 | theorem notnot: $ a <-> ~~a $ = '(ibii notnot1 dne);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:586:64:
|
586 | theorem bithd (h1: $ a -> b $) (h2: $ a -> c $): $ a -> (b <-> c) $ = '(ibid (a1d h2) (a1d h1));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:587:67:
|
587 | theorem binthd (h1: $ a -> ~b $) (h2: $ a -> ~c $): $ a -> (b <-> c) $ = '(syl con4b @ bithd h1 h2);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:588:34:
|
588 | theorem bith: $ a -> b -> (a <-> b) $ = '(exp @ bithd anl anr);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:589:37:
|
589 | theorem binth: $ ~a -> ~b -> (a <-> b) $ = '(exp @ binthd anl anr);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:590:25:
|
590 | theorem bicom: $ (a <-> b) -> (b <-> a) $ = '(ibid bi2 bi1);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:591:26:
|
591 | theorem bicomb: $ (a <-> b) <-> (b <-> a) $ = '(ibii bicom bicom);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:592:34:
|
592 | theorem bicomd (h: $ a -> (b <-> c) $): $ a -> (c <-> b) $ = '(syl bicom h);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:593:34:
|
593 | theorem bitrd (h1: $ a -> (b <-> c) $) (h2: $ a -> (c <-> d) $): $ a -> (b <-> d) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:595:35:
|
595 | theorem bitr2d (h1: $ a -> (b <-> c) $) (h2: $ a -> (c <-> d) $): $ a -> (d <-> b) $ = '(bicomd (bitrd h1 h2)
);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:596:35:
|
596 | theorem bitr3d (h1: $ a -> (c <-> b) $) (h2: $ a -> (c <-> d) $): $ a -> (b <-> d) $ = '(bitrd (bicomd h1) h2
);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:597:35:
|
597 | theorem bitr4d (h1: $ a -> (b <-> c) $) (h2: $ a -> (d <-> c) $): $ a -> (b <-> d) $ = '(bitrd h1 (bicomd h2)
);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:598:24:
|
598 | theorem bitr: $ (a <-> b) -> (b <-> c) -> (a <-> c) $ = '(exp (bitrd anl anr));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:599:25:
|
599 | theorem bitr2: $ (a <-> b) -> (b <-> c) -> (c <-> a) $ = '(exp (bitr2d anl anr));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:600:25:
|
600 | theorem bitr3: $ (b <-> a) -> (b <-> c) -> (a <-> c) $ = '(exp (bitr3d anl anr));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:601:25:
|
601 | theorem bitr4: $ (a <-> b) -> (c <-> b) -> (a <-> c) $ = '(exp (bitr4d anl anr));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:602:24:
|
602 | theorem sylib (h1: $ b <-> c $) (h2: $ a -> b $): $ a -> c $ = '(syl (bi1i h1) h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:603:25:
|
603 | theorem sylibr (h1: $ c <-> b $) (h2: $ a -> b $): $ a -> c $ = '(syl (bi2i h1) h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:604:24:
|
604 | theorem sylbi (h1: $ a <-> b $) (h2: $ b -> c $): $ a -> c $ = '(syl h2 (bi1i h1));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:605:25:
|
605 | theorem sylbir (h1: $ b <-> a $) (h2: $ b -> c $): $ a -> c $ = '(syl h2 (bi2i h1));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:606:25:
|
606 | theorem syl5bb (h1: $ b <-> c $) (h2: $ a -> (c <-> d) $): $ a -> (b <-> d) $ = '(bitrd (a1i h1) h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:607:26:
|
607 | theorem syl5bbr (h1: $ c <-> b $) (h2: $ a -> (c <-> d) $): $ a -> (b <-> d) $ = '(syl5bb (bicom h1) h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:608:25:
|
608 | theorem syl6bb (h1: $ c <-> d $) (h2: $ a -> (b <-> c) $): $ a -> (b <-> d) $ = '(bitrd h2 (a1i h1));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:609:26:
|
609 | theorem syl6bbr (h1: $ d <-> c $) (h2: $ a -> (b <-> c) $): $ a -> (b <-> d) $ = '(syl6bb (bicom h1) h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:610:25:
|
610 | theorem syl5bi (h1: $ b <-> c $) (h2: $ a -> c -> d $): $ a -> b -> d $ = '(syl5 (bi1 h1) h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:611:26:
|
611 | theorem syl5bir (h1: $ c <-> b $) (h2: $ a -> c -> d $): $ a -> b -> d $ = '(syl5bi (bicom h1) h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:612:25:
|
612 | theorem syl6ib (h1: $ c <-> d $) (h2: $ a -> b -> c $): $ a -> b -> d $ = '(syl6 (bi1 h1) h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:613:26:
|
613 | theorem syl6ibr (h1: $ d <-> c $) (h2: $ a -> b -> c $): $ a -> b -> d $ = '(syl6 (bi2 h1) h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:614:39:
|
614 | theorem syl5ibrcom (h1: $ c -> (b <-> d) $) (h2: $ a -> d $): $ a -> c -> b $ = '(com12 @ syl5 h2 (bi2d h1));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:615:38:
|
615 | theorem syl5ibcom (h1: $ c -> (b <-> d) $) (h2: $ a -> b $): $ a -> c -> d $ = '(syl5ibrcom (bicomd h1) h2);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:616:35:
|
616 | theorem sylbid (h1: $ a -> (b <-> c) $) (h2: $ a -> c -> d $): $ a -> b -> d $ = '(syld (bi1d h1) h2);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:617:57:
|
617 | theorem sylibd (h1: $ a -> b -> c $) (h2: $ a -> (c <-> d) $): $ a -> b -> d $ = '(syld h1 (bi1d h2));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:618:36:
|
618 | theorem sylbird (h1: $ a -> (c <-> b) $) (h2: $ a -> c -> d $): $ a -> b -> d $ = '(syld (bi2d h1) h2);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:619:58:
|
619 | theorem sylibrd (h1: $ a -> b -> c $) (h2: $ a -> (d <-> c) $): $ a -> b -> d $ = '(syld h1 (bi2d h2));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:620:25:
|
620 | theorem bitr3g (h1: $ b <-> d $) (h2: $ c <-> e $) (h: $ a -> (b <-> c) $):
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:622:25:
|
622 | theorem bitr4g (h1: $ d <-> b $) (h2: $ e <-> c $) (h: $ a -> (b <-> c) $):
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:624:26:
|
624 | theorem bitr3gi (h1: $ a <-> c $) (h2: $ b <-> d $) (h: $ a <-> b $): $ c <-> d $ = '(bitr3 h1 @ bitr h h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:625:26:
|
625 | theorem bitr4gi (h1: $ c <-> a $) (h2: $ d <-> b $) (h: $ a <-> b $): $ c <-> d $ = '(bitr h1 @ bitr4 h h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:626:33:
|
626 | theorem impbi (h: $ a -> (b <-> c) $): $ a /\ b -> c $ = '(imp @ bi1d h);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:627:34:
|
627 | theorem impbir (h: $ a -> (c <-> b) $): $ a /\ b -> c $ = '(imp @ bi2d h);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:628:21:
|
628 | theorem ancomb: $ a /\ b <-> b /\ a $ = '(ibii ancom ancom);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:629:20:
|
629 | theorem anass: $ a /\ b /\ c <-> a /\ (b /\ c) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:631:37:
|
631 | theorem bian2a: $ (a -> b) -> (a /\ b <-> a) $ = '(ibid (a1i anl) (a2i ian));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:632:37:
|
632 | theorem bian1a: $ (b -> a) -> (a /\ b <-> b) $ = '(syl5bb ancomb bian2a);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:633:29:
|
633 | theorem bian1: $ a -> (a /\ b <-> b) $ = '(syl bian1a ax_1);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:634:29:
|
634 | theorem bian2: $ b -> (a /\ b <-> a) $ = '(syl bian2a ax_1);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:635:31:
|
635 | theorem bibi1: $ a -> ((a <-> b) <-> b) $ = '(ibid (com12 bi1) bith);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:636:31:
|
636 | theorem bibi2: $ b -> ((a <-> b) <-> a) $ = '(syl5bb bicomb bibi1);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:637:25:
|
637 | theorem noteq: $ (a <-> b) -> (~a <-> ~b) $ = 'con3b;
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:638:24:
|
638 | theorem noteqi (h: $ a <-> b $): $ ~a <-> ~b $ = '(noteq h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:639:3:
|
639 | @(register-eqd 'not) theorem noteqd (h: $ a -> (b <-> c) $): $ a -> (~b <-> ~c) $ = '(syl noteq h);
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano.mm1:640:34:
|
640 | theorem imeqd (h1: $ a -> (b <-> c) $) (h2: $ a -> (d <-> e) $): $ a -> (b -> d <-> c -> e) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:642:33:
|
642 | theorem bibin1: $ ~a -> ((a <-> b) <-> ~b) $ = '(ibid (com12 @ bi1d noteq) binth);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:643:33:
|
643 | theorem bibin2: $ ~b -> ((a <-> b) <-> ~a) $ = '(syl5bb bicomb bibin1);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:644:34:
|
644 | theorem imeq1d (h: $ a -> (b <-> c) $): $ a -> (b -> d <-> c -> d) $ = '(imeqd h biidd);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:645:34:
|
645 | theorem imeq2d (h: $ a -> (c <-> d) $): $ a -> (b -> c <-> b -> d) $ = '(imeqd biidd h);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:646:12:
|
646 | do (apply (register-eqd 'im) '(imeqd imeq1d imeq2d));
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano.mm1:647:24:
|
647 | theorem imeq1i (h: $ a <-> b $): $ a -> c <-> b -> c $ = '(imeq1d id h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:648:24:
|
648 | theorem imeq2i (h: $ b <-> c $): $ a -> b <-> a -> c $ = '(imeq2d id h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:649:24:
|
649 | theorem imeqi (h1: $ a <-> b $) (h2: $ c <-> d $): $ a -> c <-> b -> d $ = '(bitr (imeq1i h1) (imeq2i h2));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:650:34:
|
650 | theorem aneqd (h1: $ a -> (b <-> c) $) (h2: $ a -> (d <-> e) $): $ a -> (b /\ d <-> c /\ e) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:652:32:
|
652 | theorem imeq2a: $ (a -> (b <-> c)) -> (a -> b <-> a -> c) $ = '(ibid (a2d @ imim2i bi1) (a2d @ imim2i bi2));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:653:33:
|
653 | theorem imeq1a: $ (~c -> (a <-> b)) -> (a -> c <-> b -> c) $ = '(bitr4g con3bi con3bi @ syl imeq2a @ imim2i n
oteq);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:654:25:
|
654 | theorem imeq2da (h: $ G /\ a -> (b <-> c) $): $ G -> (a -> b <-> a -> c) $ = '(syl imeq2a @ exp h);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:655:34:
|
655 | theorem aneq1d (h: $ a -> (b <-> c) $): $ a -> (b /\ d <-> c /\ d) $ = '(aneqd h biidd);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:656:34:
|
656 | theorem aneq2d (h: $ a -> (c <-> d) $): $ a -> (b /\ c <-> b /\ d) $ = '(aneqd biidd h);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:657:12:
|
657 | do (apply (register-eqd 'an) '(aneqd aneq1d aneq2d));
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano.mm1:658:24:
|
658 | theorem aneq: $ (a <-> b) -> (c <-> d) -> (a /\ c <-> b /\ d) $ = '(exp @ aneqd anl anr);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:659:24:
|
659 | theorem aneq1i (h: $ a <-> b $): $ a /\ c <-> b /\ c $ = '(aneq1d id h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:660:24:
|
660 | theorem aneq2i (h: $ b <-> c $): $ a /\ b <-> a /\ c $ = '(aneq2d id h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:661:32:
|
661 | theorem aneq2a: $ (a -> (b <-> c)) -> (a /\ b <-> a /\ c) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:663:32:
|
663 | theorem aneq1a: $ (c -> (a <-> b)) -> (a /\ c <-> b /\ c) $ = '(syl5bb ancomb @ syl6bb ancomb aneq2a);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:664:25:
|
664 | theorem aneq1da (h: $ G /\ c -> (a <-> b) $): $ G -> (a /\ c <-> b /\ c) $ = '(syl aneq1a @ exp h);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:665:25:
|
665 | theorem aneq2da (h: $ G /\ a -> (b <-> c) $): $ G -> (a /\ b <-> a /\ c) $ = '(syl aneq2a @ exp h);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:666:21:
|
666 | theorem anlass: $ a /\ (b /\ c) <-> b /\ (a /\ c) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:668:21:
|
668 | theorem anrass: $ a /\ b /\ c <-> a /\ c /\ b $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:670:22:
|
670 | theorem an4: $ (a /\ b) /\ (c /\ d) <-> (a /\ c) /\ (b /\ d) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:672:29:
|
672 | theorem anroti (h: $ a -> b /\ d $): $ a /\ c -> b /\ c /\ d $ = '(sylib anrass @ anim1 h);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:673:25:
|
673 | theorem anrotri (h: $ b /\ d -> a $): $ b /\ c /\ d -> a /\ c $ = '(sylbi anrass @ anim1 h);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:674:25:
|
674 | theorem bian11i (h: $ a <-> b /\ c $): $ a /\ d <-> b /\ (c /\ d) $ = '(bitr (aneq1i h) anass);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:675:25:
|
675 | theorem bian21i (h: $ a <-> b /\ c $): $ a /\ d <-> (b /\ d) /\ c $ = '(bitr (aneq1i h) anrass);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:676:25:
|
676 | theorem bian12i (h: $ a <-> b /\ c $): $ d /\ a <-> b /\ (d /\ c) $ = '(bitr (aneq2i h) anlass);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:677:25:
|
677 | theorem bian22i (h: $ a <-> b /\ c $): $ d /\ a <-> (d /\ b) /\ c $ = '(bitr4 (aneq2i h) anass);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:678:35:
|
678 | theorem bian11d (h: $ G -> (a <-> b /\ c) $): $ G -> (a /\ d <-> b /\ (c /\ d)) $ = '(syl6bb anass (aneq1d h)
);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:679:35:
|
679 | theorem bian21d (h: $ G -> (a <-> b /\ c) $): $ G -> (a /\ d <-> (b /\ d) /\ c) $ = '(syl6bb anrass (aneq1d h
));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:680:35:
|
680 | theorem bian12d (h: $ G -> (a <-> b /\ c) $): $ G -> (d /\ a <-> b /\ (d /\ c)) $ = '(syl6bb anlass (aneq2d h
));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:681:35:
|
681 | theorem bian22d (h: $ G -> (a <-> b /\ c) $): $ G -> (d /\ a <-> (d /\ b) /\ c) $ = '(syl6bbr anass (aneq2d h
));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:682:26:
|
682 | theorem bian11da (h: $ G /\ d -> (a <-> b /\ c) $): $ G -> (a /\ d <-> b /\ (c /\ d)) $ = '(syl6bb anass (ane
q1da h));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:683:26:
|
683 | theorem bian21da (h: $ G /\ d -> (a <-> b /\ c) $): $ G -> (a /\ d <-> (b /\ d) /\ c) $ = '(syl6bb anrass (an
eq1da h));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:684:26:
|
684 | theorem bian12da (h: $ G /\ d -> (a <-> b /\ c) $): $ G -> (d /\ a <-> b /\ (d /\ c)) $ = '(syl6bb anlass (an
eq2da h));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:685:26:
|
685 | theorem bian22da (h: $ G /\ d -> (a <-> b /\ c) $): $ G -> (d /\ a <-> (d /\ b) /\ c) $ = '(syl6bbr anass (an
eq2da h));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:686:20:
|
686 | theorem anidm: $ a /\ a <-> a $ = '(ibii anl (iand id id));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:687:21:
|
687 | theorem anandi: $ a /\ (b /\ c) <-> (a /\ b) /\ (a /\ c) $ = '(bitr3 (aneq1i anidm) an4);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:688:26:
|
688 | theorem anandir: $ (a /\ b) /\ c <-> (a /\ c) /\ (b /\ c) $ = '(bitr3 (aneq2i anidm) an4);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:689:30:
|
689 | theorem imandi: $ (a -> b /\ c) <-> (a -> b) /\ (a -> c) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:691:22:
|
691 | theorem imancom: $ a /\ (b -> c) -> b -> a /\ c $ = '(com12 @ anim2d mpcom);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:692:24:
|
692 | theorem rbida (h1: $ a /\ c -> b $) (h2: $ a /\ d -> b $)
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:695:66:
|
695 | theorem rbid (h1: $ b -> a $) (h2: $ c -> a $) (h: $ a -> (b <-> c) $): $ b <-> c $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:697:34:
|
697 | theorem bieqd (h1: $ a -> (b <-> c) $) (h2: $ a -> (d <-> e) $): $ a -> ((b <-> d) <-> (c <-> e)) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:699:34:
|
699 | theorem bieq1d (h: $ a -> (b <-> c) $): $ a -> ((b <-> d) <-> (c <-> d)) $ = '(bieqd h biidd);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:700:34:
|
700 | theorem bieq2d (h: $ a -> (c <-> d) $): $ a -> ((b <-> c) <-> (b <-> d)) $ = '(bieqd biidd h);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:701:12:
|
701 | do (apply (register-eqd 'iff) '(bieqd bieq1d bieq2d));
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano.mm1:702:24:
|
702 | theorem bieq: $ (a <-> b) -> (c <-> d) -> ((a <-> c) <-> (b <-> d)) $ = '(exp (bieqd anl anr));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:703:25:
|
703 | theorem bieq1: $ (a <-> b) -> ((a <-> c) <-> (b <-> c)) $ = '(bieq1d id);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:704:25:
|
704 | theorem bieq2: $ (b <-> c) -> ((a <-> b) <-> (a <-> c)) $ = '(bieq2d id);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:705:25:
|
705 | theorem impexp: $ (a /\ b -> c) <-> (a -> b -> c) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:707:50:
|
707 | theorem impd (h: $ a -> b -> c -> d $): $ a -> b /\ c -> d $ = '(sylibr impexp h);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:708:27:
|
708 | theorem expd (h: $ a -> b /\ c -> d $): $ a -> b -> c -> d $ = '(sylib impexp h);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:709:33:
|
709 | theorem com12b: $ (a -> b -> c) <-> (b -> a -> c) $ = '(ibii (com23 id) (com23 id));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:712:3:
|
712 | @(add-eval @ fn (a b) {(eval a) or (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:714:8:
|
714 | infixl or: $\/$ prec 30;
| ^
error: term 'or' not declared
../examples/peano.mm1:716:23:
|
716 | theorem orl: $ a -> a \/ b $ = 'absurdr;
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:717:23:
|
717 | theorem orr: $ b -> a \/ b $ = 'ax_1;
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:718:53:
|
718 | theorem eori (h1: $ a -> c $) (h2: $ b -> c $): $ a \/ b -> c $ =
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:721:12:
|
721 | $ a -> b \/ c -> d $ = '(com12 (eori (com12 h1) (com12 h2)));
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:722:24:
|
722 | theorem eorda (h1: $ a /\ b -> d $) (h2: $ a /\ c -> d $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:724:40:
|
724 | theorem orld (h: $ a -> b $): $ a -> b \/ c $ = '(syl orl h);
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:725:40:
|
725 | theorem orrd (h: $ a -> c $): $ a -> b \/ c $ = '(syl orr h);
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:726:42:
|
726 | theorem eor: $ (a -> c) -> (b -> c) -> a \/ b -> c $ = '(exp (eord anl anr));
| ^
error: unexpected '\'
expecting '$', infix >= 0, or infix >= 25
../examples/peano.mm1:727:69:
|
727 | theorem orimd (h1: $ a -> b -> c $) (h2: $ a -> d -> e $): $ a -> b \/ d -> c \/ e $ =
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:729:47:
|
729 | theorem orim1d (h: $ a -> b -> c $): $ a -> b \/ d -> c \/ d $ = '(orimd h idd);
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:730:47:
|
730 | theorem orim2d (h: $ a -> c -> d $): $ a -> b \/ c -> b \/ d $ = '(orimd idd h);
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:731:32:
|
731 | theorem orim1: $ (a -> b) -> a \/ c -> b \/ c $ = '(orim1d id);
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:732:32:
|
732 | theorem orim2: $ (b -> c) -> a \/ b -> a \/ c $ = '(orim2d id);
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:733:24:
|
733 | theorem oreq1i (h: $ a <-> b $): $ a \/ c <-> b \/ c $ = '(oreq1d id h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:734:24:
|
734 | theorem oreq2i (h: $ b <-> c $): $ a \/ b <-> a \/ c $ = '(oreq2d id h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:735:43:
|
735 | theorem orim: $ (a -> b) -> (c -> d) -> a \/ c -> b \/ d $ = '(exp @ syld (anwl orim1) (anwr orim2));
| ^
error: unexpected '\'
expecting '$', infix >= 0, or infix >= 25
../examples/peano.mm1:736:24:
|
736 | theorem oreqi (h1: $ a <-> b $) (h2: $ c <-> d $): $ a \/ c <-> b \/ d $ = '(bitr (oreq1i h1) (oreq2i h2));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:737:20:
|
737 | theorem orcom: $ a \/ b -> b \/ a $ = 'con1;
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:738:21:
|
738 | theorem orcomb: $ a \/ b <-> b \/ a $ = '(ibii orcom orcom);
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:739:19:
|
739 | theorem or12: $ a \/ (b \/ c) <-> b \/ (a \/ c) $ = '(bitr3 impexp @ bitr (imeq1i ancomb) impexp);
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:740:20:
|
740 | theorem orass: $ a \/ b \/ c <-> a \/ (b \/ c) $ = '(bitr orcomb @ bitr or12 (oreq2 orcomb));
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:741:22:
|
741 | theorem or4: $ (a \/ b) \/ (c \/ d) <-> (a \/ c) \/ (b \/ d) $ = '(bitr4 orass @ bitr4 orass @ oreq2 or12);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:742:20:
|
742 | theorem oridm: $ a \/ a <-> a $ = '(ibii (eor id id) orl);
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:743:26:
|
743 | theorem notan2: $ ~(a /\ b) <-> a -> ~b $ = '(bicom notnot);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:744:25:
|
744 | theorem notan: $ ~(a /\ b) <-> (~a \/ ~b) $ = '(bitr notan2 (imeq1i notnot));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:745:25:
|
745 | theorem notor: $ ~(a \/ b) <-> (~a /\ ~b) $ = '(con1b (bitr4 notan (oreqi notnot notnot)));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:746:24:
|
746 | theorem iman: $ a -> b <-> ~(a /\ ~b) $ = '(bitr4 (imeq2i notnot) notan2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:747:24:
|
747 | theorem imor: $ ((a \/ b) -> c) <-> ((a -> c) /\ (b -> c)) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:749:19:
|
749 | theorem andi: $ a /\ (b \/ c) <-> a /\ b \/ a /\ c $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:751:24:
|
751 | theorem andir: $ (a \/ b) /\ c <-> a /\ c \/ b /\ c $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:753:19:
|
753 | theorem ordi: $ a \/ (b /\ c) <-> (a \/ b) /\ (a \/ c) $ =
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:755:24:
|
755 | theorem ordir: $ (a /\ b) \/ c <-> (a \/ c) /\ (b \/ c) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:757:33:
|
757 | theorem oreq2a: $ (~a -> (b <-> c)) -> (a \/ b <-> a \/ c) $ = 'imeq2a;
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:758:33:
|
758 | theorem oreq1a: $ (~c -> (a <-> b)) -> (a \/ c <-> b \/ c) $ = '(syl5bb orcomb @ syl6bb orcomb oreq2a);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:759:44:
|
759 | theorem biim1a: $ (~a -> b) -> (a -> b <-> b) $ = '(ibid (exp @ casesd anr anl) (a1i ax_1));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:760:44:
|
760 | theorem biim2a: $ (b -> ~a) -> (a -> b <-> ~a) $ = '(ibid (exp @ syl inot @ imp imim2) (a1i absurd));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:761:37:
|
761 | theorem bior1a: $ (a -> b) -> (a \/ b <-> b) $ = '(sylbi (imeq1i notnot) biim1a);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:762:37:
|
762 | theorem bior2a: $ (b -> a) -> (a \/ b <-> a) $ = '(syl5bb orcomb bior1a);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:763:35:
|
763 | theorem biim1: $ a -> (a -> b <-> b) $ = '(syl biim1a absurdr);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:764:36:
|
764 | theorem biim2: $ ~b -> (a -> b <-> ~a) $ = '(syl biim2a absurd);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:765:30:
|
765 | theorem bior1: $ ~a -> (a \/ b <-> b) $ = '(syl bior1a absurd);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:766:30:
|
766 | theorem bior2: $ ~b -> (a \/ b <-> a) $ = '(syl bior2a absurd);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:767:17:
|
767 | theorem em: $ p \/ ~p $ = 'id;
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/peano.mm1:768:19:
|
768 | theorem emr: $ ~p \/ p $ = '(orcom em);
| ^
error: unexpected '\'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:772:3:
|
772 | @(add-eval @ fn (a b c) (if (eval a) (eval b) (eval c)))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:775:56:
|
775 | pub theorem ifppos (p a b: wff): $ p -> (ifp p a b <-> a) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:777:57:
|
777 | pub theorem ifpneg (p a b: wff): $ ~p -> (ifp p a b <-> b) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:780:28:
|
780 | theorem ifpid: $ ifp p a a <-> a $ = '(cases ifppos ifpneg);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:781:32:
|
781 | theorem ifpnot: $ ifp (~p) a b <-> ifp p b a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:784:29:
|
784 | theorem ifpan1: $ ifp p a b /\ c <-> ifp p (a /\ c) (b /\ c) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:786:21:
|
786 | theorem ifpan2: $ c /\ ifp p a b <-> ifp p (c /\ a) (c /\ b) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:788:30:
|
788 | theorem ifpor: $ ifp p (a \/ b) (c \/ d) <-> ifp p a c \/ ifp p b d $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:791:34:
|
791 | theorem ifpeq2a: $ (p -> (a1 <-> a2)) -> (ifp p a1 b <-> ifp p a2 b) $ = '(oreq1d aneq2a);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:792:35:
|
792 | theorem ifpeq3a: $ (~p -> (b1 <-> b2)) -> (ifp p a b1 <-> ifp p a b2) $ = '(oreq2d aneq2a);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:794:35:
|
794 | theorem ifptreq (h: $ G -> (p <-> ifp a p0 p1) $)
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:799:40:
|
799 | theorem ifppos2: $ b -> (ifp a b c <-> a \/ c) $ = '(syl6bb (oreq2a bian1) (oreq1d bian2));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:800:40:
|
800 | theorem ifppos3: $ c -> (ifp a b c <-> ~a \/ b) $ = '(syl5bbr ifpnot ifppos2);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:801:41:
|
801 | theorem ifpneg3: $ ~c -> (ifp a b c <-> a /\ b) $ = '(syl bior2 @ con3 anr);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:802:41:
|
802 | theorem ifpneg2: $ ~b -> (ifp a b c <-> ~a /\ c) $ = '(syl5bbr ifpnot ifpneg3);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:805:3:
|
805 | @(add-eval #t)
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:806:23:
|
806 | term tru: wff; prefix tru: $T.$ prec max;
| ^
error: term 'tru' not declared
../examples/peano.mm1:808:18:
|
808 | axiom itru: $ T. $;
| ^
error: expecting (
../examples/peano.mm1:810:3:
|
810 | @(add-eval) def fal: wff = $ ~T. $; prefix fal: $F.$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:810:44:
|
810 | @(add-eval) def fal: wff = $ ~T. $; prefix fal: $F.$ prec max;
| ^
error: term 'fal' not declared
../examples/peano.mm1:812:5:
|
812 | do (add-axiom-set! 'axs_prop_calc "Propositional calculus" '(ax_1 ax_2 ax_3 ax_mp itru));
| ^
error: Reference to unbound variable 'add-axiom-set!'
../examples/peano.mm1:814:23:
|
814 | theorem trud (h: $ T. -> a $): $ a $ = '(h itru);
| ^
error: expecting (
../examples/peano.mm1:815:25:
|
815 | theorem eqtru: $ (a <-> T.) <-> a $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:817:23:
|
817 | theorem notfal: $ ~F. $ = '(notnot1 itru);
| ^
error: expecting prefix >= 0
../examples/peano.mm1:818:20:
|
818 | theorem efal: $ F. -> a $ = '(absurd notfal);
| ^
error: expecting (
../examples/peano.mm1:819:26:
|
819 | theorem imfal: $ (a -> F.) <-> ~a $ = '(ibii (mpi notfal con3) absurd);
| ^
error: expecting (
../examples/peano.mm1:820:25:
|
820 | theorem eqfal: $ (a <-> F.) <-> ~a $ = '(bitr (bian2 efal) imfal);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:821:27:
|
821 | theorem neqfal: $ (~a <-> F.) <-> a $ = '(bitr4 eqfal notnot);
| ^
error: expecting ), infix >= 0, or infix >= 41
../examples/peano.mm1:843:3:
|
843 | @(add-eval @ fn (a b) {(eval a) = (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:844:33:
|
844 | term eq (a b: nat): wff; infixl eq: $=$ prec 50;
| ^
error: term 'eq' not declared
../examples/peano.mm1:864:40:
|
864 | axiom ax_6 (a: nat) {x: nat}: $ E. x x = a $;
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:868:30:
|
868 | axiom ax_7 (a b c: nat): $ a = b -> a = c -> b = c $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:869:20:
|
869 | theorem eqtr3: $ b = a -> b = c -> a = c $ = 'ax_7;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:887:47:
|
887 | axiom ax_12 {x: nat} (a: nat) (p: wff x): $ x = a -> p -> A. x (x = a -> p) $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:889:5:
|
889 | do (add-axiom-set! 'axs_pred_calc "Predicate calculus"
| ^
error: Reference to unbound variable 'add-axiom-set!'
../examples/peano.mm1:896:19:
|
896 | theorem eqid: $ a = a $ = '(!! eex x (imidm ax_7) ax_6);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:897:20:
|
897 | theorem eqcom: $ a = b -> b = a $ = '(mpi eqid ax_7);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:898:19:
|
898 | theorem eqtr: $ a = b -> b = c -> a = c $ = '(syl ax_7 eqcom);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:899:20:
|
899 | theorem eqtr2: $ a = b -> b = c -> c = a $ = '(syl6 eqcom eqtr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:900:20:
|
900 | theorem eqtr4: $ a = b -> c = b -> a = c $ = '(syl5 eqcom eqtr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:901:21:
|
901 | theorem eqcomb: $ a = b <-> b = a $ = '(ibii eqcom eqcom);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:902:20:
|
902 | theorem eqeq1: $ a = b -> (a = c <-> b = c) $ = '(ibid eqtr3 eqtr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:903:20:
|
903 | theorem eqeq2: $ b = c -> (a = b <-> a = c) $ = '(ibid (com12 eqtr) (com12 eqtr4));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:904:29:
|
904 | theorem eqeq1d (h: $ G -> a = b $): $ G -> (a = c <-> b = c) $ = '(syl eqeq1 h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:905:29:
|
905 | theorem eqeq2d (h: $ G -> b = c $): $ G -> (a = b <-> a = c) $ = '(syl eqeq2 h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:906:29:
|
906 | theorem eqeqd (h1: $ G -> a = b $) (h2: $ G -> c = d $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:908:12:
|
908 | do (apply (register-eqd 'eq) '(eqeqd eqeq1d eqeq2d));
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano.mm1:909:19:
|
909 | theorem eqeq: $ a = b -> c = d -> (a = c <-> b = d) $ = '(exp (eqeqd anl anr));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:910:30:
|
910 | theorem eqtr2d (h1: $ G -> a = b $) (h2: $ G -> b = c $): $ G -> c = a $ = '(sylc eqtr2 h1 h2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:911:30:
|
911 | theorem eqtr3d (h1: $ G -> b = a $) (h2: $ G -> b = c $): $ G -> a = c $ = '(sylc eqtr3 h1 h2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:912:25:
|
912 | theorem eqidd: $ G -> a = a $ = '(a1i eqid);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:913:24:
|
913 | theorem eqcomi (h: $ a = b $): $ b = a $ = '(eqcom h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:914:29:
|
914 | theorem eqcomd (h: $ G -> a = b $): $ G -> b = a $ = '(syl eqcom h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:915:29:
|
915 | theorem eqtrd (h1: $ G -> a = b $) (h2: $ G -> b = c $): $ G -> a = c $ = '(sylc eqtr h1 h2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:916:25:
|
916 | theorem eqtr4i (h1: $ a = b $) (h2: $ c = b $): $ a = c $ = '(eqtr4 h1 h2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:917:30:
|
917 | theorem eqtr4d (h1: $ G -> a = b $) (h2: $ G -> c = b $): $ G -> a = c $ = '(sylc eqtr4 h1 h2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:918:25:
|
918 | theorem syl5eq (h1: $ a = b $) (h2: $ G -> b = c $): $ G -> a = c $ = '(eqtrd (a1i h1) h2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:919:26:
|
919 | theorem syl5eqr (h1: $ b = a $) (h2: $ G -> b = c $): $ G -> a = c $ = '(eqtr3d (a1i h1) h2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:920:25:
|
920 | theorem syl6eq (h1: $ b = c $) (h2: $ G -> a = b $): $ G -> a = c $ = '(eqtrd h2 (a1i h1));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:921:26:
|
921 | theorem syl6eqr (h1: $ c = b $) (h2: $ G -> a = b $): $ G -> a = c $ = '(eqtr4d h2 (a1i h1));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:922:25:
|
922 | theorem eqtr3g (h1: $ a = c $) (h2: $ b = d $) (h: $ G -> a = b $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:924:25:
|
924 | theorem eqtr4g (h1: $ c = a $) (h2: $ d = b $) (h: $ G -> a = b $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:927:42:
|
927 | theorem aleq (a b: wff x): $ A. x (a <-> b) -> (A. x a <-> A. x b) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:929:36:
|
929 | theorem aleqi (a b: wff x) (h: $ a <-> b $): $ A. x a <-> A. x b $ = '(aleq @ ax_gen h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:932:39:
|
932 | theorem raleqi (p a b: wff x) (h: $ a <-> b $): $ A. x (p -> a) <-> A. x (p -> b) $ = '(aleqi @ imeq2i h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:935:3:
|
935 | @(register-eqd 'al) theorem aleqd (G) {x} (a b: wff x) (h: $ G -> (a <-> b) $):
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano.mm1:937:45:
|
937 | theorem ialda (G: wff) (a b: wff x) (h: $ G /\ a -> b $): $ G -> A. x (a -> b) $ = '(iald @ exp h);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:938:44:
|
938 | theorem alcomb (a: wff x y): $ A. x A. y a <-> A. y A. x a $ = '(ibii alcom alcom);
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:939:41:
|
939 | theorem alan (a b: wff x): $ A. x (a /\ b) <-> A. x a /\ A. x b $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:941:49:
|
941 | theorem ralan (a b c: wff x): $ A. x (a -> b /\ c) <-> A. x (a -> b) /\ A. x (a -> c) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:945:42:
|
945 | theorem exeq (a b: wff x): $ A. x (a <-> b) -> (E. x a <-> E. x b) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:947:3:
|
947 | @(register-eqd 'ex) theorem exeqd (G) {x} (a b: wff x) (h: $ G -> (a <-> b) $):
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano.mm1:949:36:
|
949 | theorem exeqi (a b: wff x) (h: $ a <-> b $): $ E. x a <-> E. x b $ = '(exeq @ ax_gen h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:950:39:
|
950 | theorem rexeqi (p a b: wff x) (h: $ a <-> b $): $ E. x (p /\ a) <-> E. x (p /\ b) $ = '(exeqi @ aneq2i h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:951:49:
|
951 | theorem rexeqa (p a b: wff x) (h: $ p -> (a <-> b) $): $ E. x (p /\ a) <-> E. x (p /\ b) $ = '(exeqi @ aneq2a
h);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:952:49:
|
952 | theorem rexeqd (p a b: wff x) (h: $ G -> (a <-> b) $): $ G -> (E. x (p /\ a) <-> E. x (p /\ b)) $ = '(exeqd @
aneq2d h);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:953:40:
|
953 | theorem rexeqda (p a b: wff x) (h: $ G /\ p -> (a <-> b) $): $ G -> (E. x (p /\ a) <-> E. x (p /\ b)) $ = '(e
xeqd @ aneq2da h);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:955:18:
|
955 | '(!! eex y (rsyl eqcom @ syl6 (mpi ax_6 exim) ax_12) ax_6);
| ^
error: unknown theorem/hypothesis 'eqcom'
../examples/peano.mm1:956:39:
|
956 | theorem alanex (a b: wff x): $ A. x a /\ E. x b -> E. x (a /\ b) $ = '(imp @ syl exim @ alimi ian);
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:957:39:
|
957 | theorem exanal (a b: wff x): $ E. x a /\ A. x b -> E. x (a /\ b) $ = '(impcom @ syl exim @ alimi @ com12 ian)
;
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:958:37:
|
958 | theorem alnex (a: wff x): $ A. x ~a <-> ~(E. x a) $ = 'notnot;
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:960:35:
|
960 | theorem alex (a: wff x): $ A. x a <-> ~(E. x ~a) $ = '(bitr (aleqi notnot) alnex);
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:961:37:
|
961 | theorem exnal (a: wff x): $ E. x ~a <-> ~(A. x a) $ = '(con2b alex);
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:962:52:
|
962 | theorem eal (a: wff x): $ A. x a -> a $ = '(ax_3 @ sylib exnal iex);
| ^
error: unknown theorem/hypothesis 'sylib'
../examples/peano.mm1:963:24:
|
963 | theorem albi: $ A. x a <-> a $ = '(ibii eal ial);
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:964:24:
|
964 | theorem exbi: $ E. x a <-> a $ = '(con1b @ bicom albi);
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:965:40:
|
965 | theorem alan1 (b: wff x): $ A. x (a /\ b) <-> a /\ A. x b $ = '(bitr alan @ aneq1i albi);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:966:40:
|
966 | theorem alan2 (a: wff x): $ A. x (a /\ b) <-> A. x a /\ b $ = '(bitr alan @ aneq2i albi);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:967:41:
|
967 | theorem exor (a b: wff x): $ E. x (a \/ b) <-> E. x a \/ E. x b $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:970:44:
|
970 | theorem excomb (a: wff x y): $ E. x E. y a <-> E. y E. x a $ =
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:972:64:
|
972 | theorem excom (a: wff x y): $ E. x E. y a -> E. y E. x a $ = '(bi1 excomb);
| ^
error: unknown theorem/hypothesis 'bi1'
../examples/peano.mm1:973:54:
|
973 | theorem nexi (a: wff x) (h: $ ~a $): $ ~E. x a $ = '(mpbi alnex @ ax_gen h);
| ^
error: unknown theorem/hypothesis 'mpbi'
../examples/peano.mm1:974:64:
|
974 | theorem nexd (a: wff x) (h: $ G -> ~a $): $ G -> ~E. x a $ = '(sylib alnex @ iald h);
| ^
error: unknown theorem/hypothesis 'sylib'
../examples/peano.mm1:977:1:
|
977 | @_ local def nf {x: nat} (a: wff x): wff = $ A. x (a -> A. x a) $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:983:36:
|
983 | theorem nfeqi (a b: wff x) (h: $ a <-> b $): $ (F/ x a) <-> (F/ x b) $ = '(trud @ nfeqd @ a1i h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:984:35:
|
984 | theorem nfx (a b: wff x) (h1: $ a <-> b $) (h2: $ F/ x b $): $ F/ x a $ = '(bi2i (nfeqi h1) h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:993:71:
|
993 | theorem nfan (a b: wff x) (h1: $ F/ x a $) (h2: $ F/ x b $): $ F/ x a /\ b $ = '(nfnot @ nfim h1 @ nfnot h2);
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 10
../examples/peano.mm1:994:71:
|
994 | theorem nfor (a b: wff x) (h1: $ F/ x a $) (h2: $ F/ x b $): $ F/ x a \/ b $ = '(nfim (nfnot h1) h2);
| ^
error: unexpected '\'
expecting '$', infix >= 0, or infix >= 10
../examples/peano.mm1:995:71:
|
995 | theorem nfbi (a b: wff x) (h1: $ F/ x a $) (h2: $ F/ x b $): $ F/ x a <-> b $ = '(nfan (nfim h1 h2) (nfim h2
h1));
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 10
../examples/peano.mm1:998:47:
|
998 | theorem nfal1 (a: wff x): $ F/ x A. x a $ = '(nfx alex @ nfnot nfex1);
| ^
error: unknown theorem/hypothesis 'nfx'
../examples/peano.mm1:1006:11:
|
1006 | '(con1d @ exp @ ialdh (nfan h1 (nfnot h2)) (imp @ con3d h3));
| ^
error: unknown theorem/hypothesis 'exp'
../examples/peano.mm1:1009:66:
|
1009 | theorem aleqdh (G a b: wff x) (h1: $ F/ x G $) (h: $ G -> (a <-> b) $):
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1014:11:
|
1014 | (h: $ a /\ b -> c $): $ a -> E. x b -> c $ = '(eexd (exp h));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1015:51:
|
1015 | theorem eexb (a: wff x) (b: wff): $ (E. x a -> b) <-> A. x (a -> b) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1017:52:
|
1017 | theorem erexb (a b: wff x) (c: wff): $ (E. x (a /\ b) -> c) <-> A. x (a -> b -> c) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1020:11:
|
1020 | (e: $ x = a -> (b <-> c) $): $ c -> E. x b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1023:11:
|
1023 | (e: $ x = a -> (b <-> c) $): $ A. x b -> c $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1025:47:
|
1025 | theorem alim1 (a) (b: wff x): $ A. x (a -> b) <-> a -> A. x b $ =
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:1027:55:
|
1027 | theorem ralim1 (a) (p b: wff x): $ A. x (p -> a -> b) <-> a -> A. x (p -> b) $ =
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:1029:65:
|
1029 | theorem ralalcomb (p: wff x) (a: wff x y): $ A. x (p -> A. y a) <-> A. y A. x (p -> a) $ =
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:1032:31:
|
1032 | $ A. x (p -> A. y (q -> a)) <-> A. y (q -> A. x (p -> a)) $ =
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:1038:16:
|
1038 | $ E. x (a /\ A. y b) -> A. y E. x (a /\ b) $ = '(sylbir (exeqi alan1) @ exal);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1039:43:
|
1039 | theorem rexim1 (a c: wff x): $ E. x (a /\ (b -> c)) -> b -> E. x (a /\ c) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1042:16:
|
1042 | $ E. x (a /\ A. y (b -> c)) -> A. y (b -> E. x (a /\ c)) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1044:32:
|
1044 | theorem eqerd {x} (h: $ G -> a = x -> p $): $ G -> p $ = '(mpi ax_6 @ eexd @ syl5 eqcom h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1046:11:
|
1046 | (e: $ x = a -> (b <-> c) $): $ A. x b -> c $ = '(ealeh nfv e);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1048:11:
|
1048 | (e: $ G /\ x = a -> b $): $ G -> E. x b $ = '(mpi ax_6 (syl exim @ ialdh h (exp e)));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1050:11:
|
1050 | (e: $ G /\ x = a -> b $): $ G -> E. x b $ = '(iexdeh nfv e);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1052:11:
|
1052 | (e: $ G /\ x = a -> b -> c $): $ G -> b -> E. x c $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1054:43:
|
1054 | theorem iexie (a: nat) (b: wff x) (e: $ x = a -> b $): $ E. x b $ = '(trud @ iexde @ anwr e);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1056:11:
|
1056 | (e: $ x = a -> (b <-> c) $): $ c -> E. x b $ = '(iexde @ mpbird (anwr e) anl);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1058:11:
|
1058 | (e: $ G /\ x = a -> b -> c $): $ G -> A. x b -> c $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1061:11:
|
1061 | (e: $ x = a -> b -> c $): $ A. x b -> c $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1064:11:
|
1064 | (e: $ G /\ x = a -> b -> c $): $ G -> A. x b -> c $ = '(ealdeh nfv nfv e);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1065:43:
|
1065 | theorem ealie (a: nat) (b: wff x) (e: $ x = a -> b -> c $): $ A. x b -> c $ = '(ealieh nfv e);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1066:44:
|
1066 | theorem exan1 (a) (b: wff x): $ E. x (a /\ b) <-> a /\ E. x b $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1068:44:
|
1068 | theorem exan2 (a: wff x) (b): $ E. x (a /\ b) <-> E. x a /\ b $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1070:39:
|
1070 | theorem bian1exi (a c: wff x) (h: $ a <-> b /\ c $): $ E. x a <-> b /\ E. x c $ = '(bitr (exeqi h) exan1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1071:39:
|
1071 | theorem bian2exi (a b: wff x) (h: $ a <-> b /\ c $): $ E. x a <-> E. x b /\ c $ = '(bitr (exeqi h) exan2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1072:49:
|
1072 | theorem bian1exd (a c: wff x) (h: $ G -> (a <-> b /\ c) $): $ G -> (E. x a <-> b /\ E. x c) $ = '(syl6bb exa
n1 (exeqd h));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1073:49:
|
1073 | theorem bian2exd (a b: wff x) (h: $ G -> (a <-> b /\ c) $): $ G -> (E. x a <-> E. x b /\ c) $ = '(syl6bb exa
n2 (exeqd h));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1074:40:
|
1074 | theorem biexexi (a b: wff x y) (h: $ a <-> E. y b $): $ E. x a <-> E. y E. x b $ = '(bitr4 (exeqi h) excomb)
;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1075:49:
|
1075 | theorem biexan1a (a b: wff x) (h: $ c -> (a <-> E. x b) $): $ a /\ c <-> E. x (b /\ c) $ = '(bitr4 (aneq1a h
) exan2);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1076:49:
|
1076 | theorem biexan2a (b c: wff x) (h: $ a -> (b <-> E. x c) $): $ a /\ b <-> E. x (a /\ c) $ = '(bitr4 (aneq2a h
) exan1);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1077:39:
|
1077 | theorem biexan1i (a b: wff x) (h: $ a <-> E. x b $): $ a /\ c <-> E. x (b /\ c) $ = '(biexan1a @ a1i h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1078:39:
|
1078 | theorem biexan2i (b c: wff x) (h: $ b <-> E. x c $): $ a /\ b <-> E. x (a /\ c) $ = '(biexan2a @ a1i h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1080:16:
|
1080 | $ E. x (p /\ E. y a) <-> E. y E. x (p /\ a) $ = '(bitr3 (exeqi exan1) excomb);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1081:52:
|
1081 | theorem birexexi (a b: wff x y) (q: wff y) (h: $ a <-> E. y (q /\ b) $):
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1083:62:
|
1083 | theorem biexrexa (p: wff x) (a b: wff x y) (h: $ p -> (a <-> E. y b) $):
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1085:52:
|
1085 | theorem biexrexi (p: wff x) (a b: wff x y) (h: $ a <-> E. y b $):
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1088:16:
|
1088 | $ E. x (p /\ E. y (q /\ a)) <-> E. y (q /\ E. x (p /\ a)) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1090:52:
|
1090 | theorem birexan1a (p a b: wff x) (h: $ c -> (a <-> E. x (p /\ b)) $):
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1092:52:
|
1092 | theorem birexan2a (p b c: wff x) (h: $ a -> (b <-> E. x (p /\ c)) $):
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1094:74:
|
1094 | theorem birexrexa (q: wff y) (p: wff x) (a b: wff x y) (h: $ p -> (a <-> E. y (q /\ b)) $):
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1096:42:
|
1096 | theorem birexan1i (p a b: wff x) (h: $ a <-> E. x (p /\ b) $):
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1098:42:
|
1098 | theorem birexan2i (p b c: wff x) (h: $ b <-> E. x (p /\ c) $):
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1100:64:
|
1100 | theorem birexrexi (q: wff y) (p: wff x) (a b: wff x y) (h: $ a <-> E. y (q /\ b) $):
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1102:47:
|
1102 | theorem rexan1 (a) (p b: wff x): $ E. x (p /\ (a /\ b)) <-> a /\ E. x (p /\ b) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1104:47:
|
1104 | theorem rexan2 (p a: wff x) (b): $ E. x (p /\ (a /\ b)) <-> E. x (p /\ a) /\ b $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1106:52:
|
1106 | theorem bian1rexa (p a c: wff x) (h: $ p -> (a <-> b /\ c) $):
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1108:52:
|
1108 | theorem bian2rexa (p a b: wff x) (h: $ p -> (a <-> b /\ c) $):
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1110:42:
|
1110 | theorem bian1rexi (p a c: wff x) (h: $ a <-> b /\ c $):
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1112:42:
|
1112 | theorem bian2rexi (p a b: wff x) (h: $ a <-> b /\ c $):
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1114:63:
|
1114 | theorem alexan (a b: wff x): $ A. x a -> E. x b -> E. x (a /\ b) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1116:46:
|
1116 | theorem exifp (a b: wff x): $ E. x ifp p a b <-> ifp p (E. x a) (E. x b) $ =
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:1120:11:
|
1120 | (e: $ x = y -> (p <-> q) $): $ A. x p <-> A. y q $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1124:11:
|
1124 | (e: $ x = y -> (p <-> q) $): $ A. x p <-> A. y q $ = '(cbvalh nfv nfv e);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1127:11:
|
1127 | (e: $ x = y -> (p <-> q) $): $ E. x p <-> E. y q $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1130:11:
|
1130 | (e: $ x = y -> (p <-> q) $): $ E. x p <-> E. y q $ = '(cbvexh nfv nfv e);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1134:53:
|
1134 | local def pim {x: nat} (p q: wff x): wff = $ E. x p /\ A. x (p -> q) $;
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:1136:10:
|
1136 | notation pim {x} (p q) = ($P.$:10) x p ($->$:25) q;
| ^
error: term 'pim' not declared
../examples/peano.mm1:1138:35:
|
1138 | theorem pimex (p q: wff x): $ (P. x p -> q) -> E. x p $ = 'anl;
| ^
error: expecting (
../examples/peano.mm1:1139:35:
|
1139 | theorem pimal (p q: wff x): $ (P. x p -> q) -> A. x (p -> q) $ = 'anr;
| ^
error: expecting (
../examples/peano.mm1:1140:36:
|
1140 | theorem pimex2 (p q: wff x): $ (P. x p -> q) -> E. x q $ = '(impcom exim);
| ^
error: expecting (
../examples/peano.mm1:1141:37:
|
1141 | theorem pimex12 (p q: wff x): $ (P. x p -> q) -> E. x (p /\ q) $ =
| ^
error: expecting (
../examples/peano.mm1:1143:22:
|
1143 | theorem pimeq: $ (P. x p -> q) -> A. x (p -> q) $ = 'anr;
| ^
error: expecting (
../examples/peano.mm1:1145:18:
|
1145 | $ A. x (p1 <-> p2) -> ((P. x p1 -> q) <-> (P. x p2 -> q)) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1148:28:
|
1148 | $ A. x (q1 -> q2) -> (P. x p -> q1) -> (P. x p -> q2) $ =
| ^
error: expecting (
../examples/peano.mm1:1151:9:
|
1151 | $ (P. x p -> q1) -> (P. x p -> q2) $ = '(pimim2 @ ax_gen h);
| ^
error: expecting (
../examples/peano.mm1:1153:14:
|
1153 | $ G -> (P. x p -> q1) -> (P. x p -> q2) $ = '(syl pimim2 @ iald h);
| ^
error: expecting (
../examples/peano.mm1:1155:24:
|
1155 | $ A. x (p -> (q1 <-> q2)) -> ((P. x p -> q1) <-> (P. x p -> q2)) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1158:18:
|
1158 | $ A. x (q1 <-> q2) -> ((P. x p -> q1) <-> (P. x p -> q2)) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1161:23:
|
1161 | (h1: $ G -> (p1 <-> p2) $): $ G -> ((P. x p1 -> q) <-> (P. x p2 -> q)) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1164:23:
|
1164 | (h1: $ G -> (q1 <-> q2) $): $ G -> ((P. x p -> q1) <-> (P. x p -> q2)) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1167:13:
|
1167 | (h1: $ p1 <-> p2 $): $ (P. x p1 -> q) <-> (P. x p2 -> q) $ = '(trud @ pimeq1d @ a1i h1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1169:13:
|
1169 | (h1: $ q1 <-> q2 $): $ (P. x p -> q1) <-> (P. x p -> q2) $ = '(trud @ pimeq2d @ a1i h1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1171:23:
|
1171 | (h1: $ G -> (p1 <-> p2) $) (h2: $ G -> (q1 <-> q2) $):
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1174:12:
|
1174 | do (apply (register-eqd 'pim) '(pimeqd pimeq1d pimeq2d));
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano.mm1:1178:12:
|
1178 | (e1: $ x = y -> (p1 <-> p2) $) (e2: $ x = y -> (q1 <-> q2) $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1182:12:
|
1182 | (e1: $ x = y -> (p1 <-> p2) $) (e2: $ x = y -> (q1 <-> q2) $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1186:37:
|
1186 | theorem piman (a b c: wff x): $ (P. x a -> b) /\ (P. x a -> c) -> (P. x a -> b /\ c) $ =
| ^
error: expecting (
../examples/peano.mm1:1188:35:
|
1188 | theorem impim (a c: wff x): $ (P. x a -> b -> c) -> b -> (P. x a -> c) $ =
| ^
error: expecting (
../examples/peano.mm1:1190:51:
|
1190 | theorem expim (p: wff x) (q: wff x y): $ E. y (P. x p -> q) -> (P. x p -> E. y q) $ =
| ^
error: expecting (
../examples/peano.mm1:1193:16:
|
1193 | $ E. y (a /\ (P. x p -> q)) -> (P. x p -> E. y (a /\ q)) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1196:16:
|
1196 | $ E. x (a /\ (P. y b -> c)) -> (P. y b -> E. x (a /\ c)) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1199:21:
|
1199 | $ A. x (p1 -> (P. y p2 -> q1 -> q2)) -> (P. x p1 -> q1) -> (P. y p2 -> q2) $ =
| ^
error: expecting (
../examples/peano.mm1:1202:9:
|
1202 | $ (P. x p -> a) -> A. x (a -> (P. y q -> b)) -> (P. y E. x (p /\ q) -> b) $ =
| ^
error: expecting (
../examples/peano.mm1:1211:3:
|
1211 | @(add-eval @ fn (a b) (not {(eval a) = (eval b)}))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:1212:49:
|
1212 | @_ def ne (a b: nat): wff = $ ~ a = b $; infixl ne: $!=$ prec 50;
| ^
error: term 'ne' not declared
../examples/peano.mm1:1214:20:
|
1214 | theorem necom: $ a != b -> b != a $ = '(con3 eqcom);
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:1222:15:
|
1222 | $ A. y (y = a -> A. x (x = y -> p)) $;
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1223:10:
|
1223 | notation sb (a x p) = ($[$:41) a ($/$:0) x ($]$:0) p;
| ^
error: term 'sb' not declared
../examples/peano.mm1:1225:38:
|
1225 | theorem sbq (a: nat) (b: wff x): $ x = a -> (b <-> [a / x] b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1229:41:
|
1229 | theorem sbqcom (a: nat) (b: wff x): $ a = x -> ([a / x] b <-> b) $ = '(bicomd @ rsyl eqcom sbq);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1230:44:
|
1230 | theorem nfsb1 (a: nat) (b: wff x): $ F/ x [a / x] b $ =
| ^
error: expecting ( or infix >= max
../examples/peano.mm1:1232:63:
|
1232 | theorem nfsb (a: nat y) (b: wff x y) (h: $ F/ x b $): $ F/ x [a / y] b $ =
| ^
error: expecting ( or infix >= max
../examples/peano.mm1:1234:44:
|
1234 | theorem sbeq1 (a b: nat x) (c: wff x): $ a = b -> ([a / x] c <-> [b / x] c) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1236:64:
|
1236 | theorem sbeq1d (G: wff x) (a b: nat x) (c: wff x) (h: $ G -> a = b $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1238:6:
|
1238 | do ((derive-eq) 'sb);
| ^
error: Reference to unbound variable 'derive-eq'
../examples/peano.mm1:1239:48:
|
1239 | theorem sbeq2i (a: nat x) (b c: wff x) (h: $ b <-> c $):
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1243:15:
|
1243 | $ A. x (x = a -> (b <-> c)) -> ([a / x] b <-> c) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1247:11:
|
1247 | (e: $ x = a -> (b <-> c) $): $ [a / x] b <-> c $ = '(sbeht h (ax_gen e));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1249:15:
|
1249 | $ A. x (x = a -> (b <-> c)) -> ([a / x] b <-> c) $ = '(sbeht nfv);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1251:11:
|
1251 | (e: $ x = a -> (b <-> c) $): $ [a / x] b <-> c $ = '(sbeh nfv e);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1253:11:
|
1253 | (e: $ G /\ x = a -> (b <-> c) $): $ G -> ([a / x] b <-> c) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1255:39:
|
1255 | theorem dfsb2 (a: nat) (b: wff x): $ [a / x] b <-> A. x (x = a -> b) $ =
| ^
error: expecting (
../examples/peano.mm1:1259:39:
|
1259 | theorem dfsb3 (a: nat) (b: wff x): $ [a / x] b <-> E. x (x = a /\ b) $ =
| ^
error: expecting (
../examples/peano.mm1:1262:6:
|
1262 | $ [a / y] [y / x] b <-> [a / x] b $ = '(bitr dfsb2 (aleqi (imeq2i dfsb2)));
| ^
error: expecting (
../examples/peano.mm1:1263:29:
|
1263 | theorem sbid (a: wff x): $ [x / x] a <-> a $ =
| ^
error: expecting (
../examples/peano.mm1:1267:32:
|
1267 | theorem sbcom (p: wff x y): $ [a / x] [b / y] p <-> [b / y] [a / x] p $ =
| ^
error: expecting (
../examples/peano.mm1:1269:51:
|
1269 | theorem sbth (a: nat x) (p: wff x) (h: $ p $): $ [a / x] p $ =
| ^
error: expecting (
../examples/peano.mm1:1271:34:
|
1271 | theorem sbthd (p: wff x) (h: $ G /\ x = a -> p $): $ G -> [a / x] p $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1273:45:
|
1273 | theorem sbeth (p: wff x) (h: $ p $) (e: $ x = a -> (p <-> q) $): $ q $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1276:23:
|
1276 | (hp: $ p $) (e: $ x = a -> (p <-> q) $): $ q $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1279:11:
|
1279 | (e: $ x = y -> (p <-> q) $): $ [a / x] p <-> [a / y] q $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1282:11:
|
1282 | (e: $ x = y -> (p <-> q) $): $ [a / x] p <-> [a / y] q $ = '(cbvsbh nfv nfv e);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1285:11:
|
1285 | (e: $ x = a -> (p <-> q) $): $ A. x (x = a -> p) <-> q $ = '(bitr3 dfsb2 @ sbe e);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1287:11:
|
1287 | (e: $ G /\ x = a -> (p <-> q) $): $ G -> (A. x (x = a -> p) <-> q) $ = '(syl5bbr dfsb2 @ sbed e);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1289:11:
|
1289 | (e: $ x = a -> (p <-> q) $): $ E. x (x = a /\ p) <-> q $ = '(bitr3 dfsb3 @ sbe e);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1291:11:
|
1291 | (e: $ G /\ x = a -> (p <-> q) $): $ G -> (E. x (x = a /\ p) <-> q) $ = '(syl5bbr dfsb3 @ sbed e);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1293:11:
|
1293 | (e: $ G /\ x = a -> (p <-> q) $): $ G -> ((P. x x = a -> p) <-> q) $ = '(syl5bb (bian1 ax_6) @ aleqed e);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1295:11:
|
1295 | (e: $ x = a -> (p <-> q) $): $ (P. x x = a -> p) <-> q $ = '(trud @ pimeqed @ anwr e);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1296:37:
|
1296 | theorem cbvals (p: wff x): $ A. x p <-> A. y ([y / x] p) $ = '(cbvalh nfv nfsb1 sbq);
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:1297:37:
|
1297 | theorem cbvexs (p: wff x): $ E. x p <-> E. y ([y / x] p) $ = '(cbvexh nfv nfsb1 sbq);
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:1299:11:
|
1299 | (h: $ G /\ x = y -> (p <-> q) $): $ G -> (A. x p <-> A. y q) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1302:11:
|
1302 | (h: $ G /\ x = y -> (p <-> q) $): $ G -> (E. x p <-> E. y q) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1306:12:
|
1306 | (e1: $ G /\ x = a -> (p <-> p2) $)
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1344:48:
|
1344 | @ match (match (split-last vs) [() '(#undef)] [r r]) @ (r . vs)
| ^
error: expecting identifier char
../examples/peano.mm1:1497:57:
|
1497 | axiom elab (a: nat) {x: nat} (p: wff x): $ a e. {x | p} <-> [a / x] p $;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1503:37:
|
1503 | axiom ax_8 (a b: nat) (A: set): $ a = b -> a e. A -> b e. A $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1505:5:
|
1505 | do (add-axiom-set! 'axs_set "Sets and elements" '(elab ax_8));
| ^
error: Reference to unbound variable 'add-axiom-set!'
../examples/peano.mm1:1509:56:
|
1509 | def eqs (A B: set) {.x: nat}: wff = $ A. x (x e. A <-> x e. B) $;
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1510:8:
|
1510 | infixl eqs: $==$ prec 50;
| ^
error: term 'eqs' not declared
../examples/peano.mm1:1512:20:
|
1512 | theorem eqsid: $ A == A $ = '(!! ax_gen x biid);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1513:21:
|
1513 | theorem eqscom: $ A == B -> B == A $ = '(!! alimi x bicom);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1514:22:
|
1514 | theorem eqscomb: $ A == B <-> B == A $ = '(ibii eqscom eqscom);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1515:20:
|
1515 | theorem eqstr: $ A == B -> B == C -> A == C $ = '(!! al2imi x bitr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1516:21:
|
1516 | theorem eqstr2: $ A == B -> B == C -> C == A $ = '(syl6 eqscom eqstr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1517:21:
|
1517 | theorem eqstr3: $ B == A -> B == C -> A == C $ = '(syl eqstr eqscom);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1518:21:
|
1518 | theorem eqstr4: $ A == B -> C == B -> A == C $ = '(syl5 eqscom eqstr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1519:31:
|
1519 | theorem eqstr3d (h1: $ G -> B == A $) (h2: $ G -> B == C $): $ G -> A == C $ = '(sylc eqstr3 h1 h2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1520:32:
|
1520 | theorem eqsidd (G A): $ G -> A == A $ = '(a1i eqsid);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1521:30:
|
1521 | theorem eqscomd (h: $ G -> A == B $): $ G -> B == A $ = '(syl eqscom h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1522:30:
|
1522 | theorem eqstrd (h1: $ G -> A == B $) (h2: $ G -> B == C $): $ G -> A == C $ = '(sylc eqstr h1 h2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1523:31:
|
1523 | theorem eqstr4d (h1: $ G -> A == B $) (h2: $ G -> C == B $): $ G -> A == C $ = '(sylc eqstr4 h1 h2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1524:26:
|
1524 | theorem syl5eqs (h1: $ A == B $) (h2: $ G -> B == C $): $ G -> A == C $ = '(eqstrd (a1i h1) h2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1525:27:
|
1525 | theorem syl5eqsr (h1: $ B == A $) (h2: $ G -> B == C $): $ G -> A == C $ = '(eqstr3d (a1i h1) h2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1526:26:
|
1526 | theorem syl6eqs (h1: $ B == C $) (h2: $ G -> A == B $): $ G -> A == C $ = '(eqstrd h2 (a1i h1));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1527:27:
|
1527 | theorem syl6eqsr (h1: $ C == B $) (h2: $ G -> A == B $): $ G -> A == C $ = '(eqstr4d h2 (a1i h1));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1528:26:
|
1528 | theorem eqstr3g (h1: $ A == C $) (h2: $ B == D $) (h: $ G -> A == B $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1530:26:
|
1530 | theorem eqstr4g (h1: $ C == A $) (h2: $ D == B $) (h: $ G -> A == B $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1533:20:
|
1533 | theorem eleq1: $ a = b -> (a e. A <-> b e. A) $ = '(ibid ax_8 @ syl ax_8 eqcom);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1534:20:
|
1534 | theorem eleq2: $ A == B -> (a e. A <-> a e. B) $ = '(!! eale x @ bieqd eleq1 eleq1);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1535:39:
|
1535 | theorem eleq1d (G a b A) (h: $ G -> a = b $): $ G -> (a e. A <-> b e. A) $ = '(syl eleq1 h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1536:39:
|
1536 | theorem eleq2d (G a A B) (h: $ G -> A == B $): $ G -> (a e. A <-> a e. B) $ = '(syl eleq2 h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1537:41:
|
1537 | theorem eleqd (G a b A B) (h1: $ G -> a = b $) (h2: $ G -> A == B $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1539:14:
|
1539 | do { (apply (register-eqd 'el) '(eleqd eleq1d eleq2d)) ((derive-eq) 'eqs) };
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano.mm1:1541:42:
|
1541 | theorem abeq (p q: wff x): $ A. x (p <-> q) -> {x | p} == {x | q} $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1543:3:
|
1543 | @(register-eqd 'ab) theorem abeqd (G) {x} (p q: wff x)
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano.mm1:1545:36:
|
1545 | theorem abeqi (p q: wff x) (h: $ p <-> q $): $ {x | p} == {x | q} $ = '(trud @ abeqd @ a1i h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1546:31:
|
1546 | theorem eqri {x} (h: $ x e. A <-> x e. B $): $ A == B $ = '(ax_gen h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1547:45:
|
1547 | theorem eqrd (G) {x} (h: $ G -> (x e. A <-> x e. B) $): $ G -> A == B $ = '(iald h);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1549:11:
|
1549 | (e: $ x = y -> (p <-> q) $): $ {x | p} == {y | q} $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1552:11:
|
1552 | (e: $ x = y -> (p <-> q) $): $ {x | p} == {y | q} $ = '(cbvabh nfv nfv e);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1553:38:
|
1553 | theorem cbvabs (p: wff x): $ {x | p} == {y | [y / x] p} $ = '(cbvabh nfv nfsb1 sbq);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1555:11:
|
1555 | (h: $ G /\ x = y -> (p <-> q) $): $ G -> {x | p} == {y | q} $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1557:53:
|
1557 | theorem elab2 (a: nat x) (p: wff x): $ a e. {x | p} <-> [a / x] p $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1560:11:
|
1560 | (e: $ x = a -> (p <-> q) $): $ a e. {x | p} <-> q $ = '(bitr elab2 (sbe e));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1562:11:
|
1562 | (e: $ G /\ x = a -> (p <-> q) $): $ G -> (a e. {x | p} <-> q) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1565:11:
|
1565 | (h: $ G /\ x = a -> p -> q $): $ G -> a e. {x | p} -> q $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1569:9:
|
1569 | '(syl5 (iexe eleq1) @ !! eexd y @ ssabed @ anwl h);
| ^
error: unknown theorem/hypothesis 'iexe'
../examples/peano.mm1:1571:11:
|
1571 | (h: $ G /\ x = a -> p -> q /\ x e. A $): $ G -> a e. {x | p} -> q /\ a e. A $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1573:41:
|
1573 | theorem abid (p: wff x): $ x e. {x | p} <-> p $ = '(bitr elab2 sbid);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1574:31:
|
1574 | theorem abid2: $ {x | x e. A} == A $ = '(!! eqri y @ elabe eleq1);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1577:3:
|
1577 | @(derive-eq 'ss) def subset (A B: set): wff = $ A. x (x e. A -> x e. B) $;
| ^
error: Reference to unbound variable 'derive-eq'
../examples/peano.mm1:1578:8:
|
1578 | infixl subset: $C_$ prec 50;
| ^
error: term 'subset' not declared
../examples/peano.mm1:1580:24:
|
1580 | theorem dfss: $ A C_ B <-> A. x (x e. A -> x e. B) $ = 'biid;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1581:17:
|
1581 | theorem ssel: $ A C_ B -> a e. A -> a e. B $ = '(!! eale x @ imeqd eleq1 eleq1);
| ^
error: A is not a function
../examples/peano.mm1:1582:27:
|
1582 | theorem sseld (h1: $ G -> A C_ B $) (h2: $ G -> a e. A $): $ G -> a e. B $ = '(sylc ssel h1 h2);
| ^
error: A is not a function
../examples/peano.mm1:1583:17:
|
1583 | theorem ssid: $ A C_ A $ = '(!! ax_gen x id);
| ^
error: A is not a function
../examples/peano.mm1:1584:17:
|
1584 | theorem sstr: $ A C_ B -> B C_ C -> A C_ C $ =
| ^
error: A is not a function
../examples/peano.mm1:1586:19:
|
1586 | theorem eqss: $ A == B -> A C_ B $ = '(mpbii ssid sseq2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1587:20:
|
1587 | theorem eqssr: $ A == B -> B C_ A $ = '(mpbii ssid sseq1);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1588:41:
|
1588 | theorem ssasym: $ A C_ B -> B C_ A -> A == B $ = '(!! al2imi x ian);
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 25
../examples/peano.mm1:1589:29:
|
1589 | theorem ssasymd (h1: $ G -> A C_ B $) (h2: $ G -> B C_ A $): $ G -> A == B $ = '(sylc ssasym h1 h2);
| ^
error: A is not a function
../examples/peano.mm1:1590:22:
|
1590 | theorem ssasymb: $ A == B <-> A C_ B /\ B C_ A $ = '(ibii (iand eqss eqssr) (imp ssasym));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1593:3:
|
1593 | @(derive-eq 'in) def Inter (A B: set): set = $ {x | x e. A /\ x e. B} $;
| ^
error: Reference to unbound variable 'derive-eq'
../examples/peano.mm1:1594:8:
|
1594 | infixl Inter: $i^i$ prec 70;
| ^
error: term 'Inter' not declared
../examples/peano.mm1:1596:24:
|
1596 | theorem elin: $ a e. A i^i B <-> a e. A /\ a e. B $ = '(!! elabe x @ aneqd eleq1 eleq1);
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:1598:20:
|
1598 | theorem incom: $ A i^i B == B i^i A $ = '(!! eqri x @ bitr elin @ bitr4 ancomb elin);
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:1599:25:
|
1599 | theorem inass: $ (A i^i B) i^i C == A i^i (B i^i C) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1602:20:
|
1602 | theorem inss1: $ A i^i B C_ A $ = '(!! ax_gen x @ sylbi elin anl);
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:1603:20:
|
1603 | theorem inss2: $ A i^i B C_ B $ = '(mpbi (sseq1 incom) inss1);
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:1604:24:
|
1604 | theorem ssin: $ A C_ B i^i C <-> A C_ B /\ A C_ C $ =
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:1607:30:
|
1607 | theorem ssin1: $ A C_ B -> A i^i C C_ B i^i C $ = '(sylibr ssin @ iand (sstr inss1) (a1i inss2));
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:1608:30:
|
1608 | theorem ssin2: $ B C_ C -> A i^i B C_ A i^i C $ = '(sylibr ssin @ iand (a1i inss1) (sstr inss2));
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:1610:25:
|
1610 | theorem eqin1: $ A C_ B <-> A i^i B == A $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1612:25:
|
1612 | theorem eqin2: $ A C_ B <-> B i^i A == A $ = '(bitr eqin1 @ eqseq1 incom);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1615:3:
|
1615 | @(derive-eq 'un) def Union (A B: set): set = $ {x | x e. A \/ x e. B} $;
| ^
error: Reference to unbound variable 'derive-eq'
../examples/peano.mm1:1616:8:
|
1616 | infixl Union: $u.$ prec 64;
| ^
error: term 'Union' not declared
../examples/peano.mm1:1618:24:
|
1618 | theorem elun: $ a e. A u. B <-> a e. A \/ a e. B $ = '(!! elabe x @ oreqd eleq1 eleq1);
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/peano.mm1:1619:20:
|
1619 | theorem uncom: $ A u. B == B u. A $ = '(!! eqri x @ bitr elun @ bitr4 orcomb elun);
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/peano.mm1:1620:24:
|
1620 | theorem unass: $ (A u. B) u. C == A u. (B u. C) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1622:19:
|
1622 | theorem indi: $ A i^i (B u. C) == (A i^i B) u. (A i^i C) $ =
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:1624:24:
|
1624 | theorem indir: $ (A u. B) i^i C == (A i^i C) u. (B i^i C) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1626:21:
|
1626 | theorem inindi: $ A i^i (B i^i C) == (A i^i B) i^i (A i^i C) $ =
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:1628:19:
|
1628 | theorem undi: $ A u. (B i^i C) == (A u. B) i^i (A u. C) $ =
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/peano.mm1:1630:25:
|
1630 | theorem undir: $ (A i^i B) u. C == (A u. C) i^i (B u. C) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1633:25:
|
1633 | theorem ssun1: $ A C_ A u. B $ = '(!! ax_gen x @ sylibr elun orl);
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/peano.mm1:1634:25:
|
1634 | theorem ssun2: $ B C_ A u. B $ = '(mpbi (sseq2 uncom) ssun1);
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/peano.mm1:1635:35:
|
1635 | theorem elun1: $ a e. A -> a e. A u. B $ = '(ssel ssun1);
| ^
error: unexpected 'u'
expecting '$', infix >= 0, or infix >= 50
../examples/peano.mm1:1636:35:
|
1636 | theorem elun2: $ a e. B -> a e. A u. B $ = '(ssel ssun2);
| ^
error: unexpected 'u'
expecting '$', infix >= 0, or infix >= 50
../examples/peano.mm1:1637:19:
|
1637 | theorem unss: $ A u. B C_ C <-> A C_ C /\ B C_ C $ =
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/peano.mm1:1640:30:
|
1640 | theorem unss1: $ A C_ B -> A u. C C_ B u. C $ = '(sylibr unss @ iand (mpi ssun1 sstr) (a1i ssun2));
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/peano.mm1:1641:30:
|
1641 | theorem unss2: $ B C_ C -> A u. B C_ A u. C $ = '(sylibr unss @ iand (a1i ssun1) (mpi ssun2 sstr));
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/peano.mm1:1643:25:
|
1643 | theorem equn1: $ A C_ B <-> A u. B == B $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1645:25:
|
1645 | theorem equn2: $ A C_ B <-> B u. A == B $ = '(bitr equn1 @ eqseq1 uncom);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1648:3:
|
1648 | @(derive-eq 'cpl) def Compl (A: set): set = $ {x | ~x e. A} $;
| ^
error: Reference to unbound variable 'derive-eq'
../examples/peano.mm1:1650:31:
|
1650 | theorem elcpl: $ a e. Compl A <-> ~a e. A $ = '(!! elabe x @ noteqd eleq1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1652:25:
|
1652 | theorem sscpl: $ B C_ A <-> Compl A C_ Compl B $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1654:35:
|
1654 | theorem cplcpl: $ Compl (Compl A) == A $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1656:21:
|
1656 | theorem cplinj: $ A == B <-> Compl A == Compl B $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1658:31:
|
1658 | theorem cplin: $ Compl (A i^i B) == Compl A u. Compl B $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1660:30:
|
1660 | theorem cplun: $ Compl (A u. B) == Compl A i^i Compl B $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1664:26:
|
1664 | def Univ: set = $ {x | T.} $; prefix Univ: $_V$ prec max;
| ^
error: expecting (
../examples/peano.mm1:1664:38:
|
1664 | def Univ: set = $ {x | T.} $; prefix Univ: $_V$ prec max;
| ^
error: term 'Univ' not declared
../examples/peano.mm1:1666:30:
|
1666 | theorem elv: $ a e. _V $ = '(mpbir (!! elabe x biidd) itru);
| ^
error: unknown theorem/hypothesis 'mpbir'
../examples/peano.mm1:1667:20:
|
1667 | theorem inv1: $ _V i^i A == A $ = '(!! eqri x @ bitr elin @ bian1 elv);
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:1668:19:
|
1668 | theorem inv2: $ A i^i _V == A $ = '(eqstr incom inv1);
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:1669:21:
|
1669 | theorem uncpl2: $ A u. Compl A == _V $ =
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/peano.mm1:1671:27:
|
1671 | theorem uncpl1: $ Compl A u. A == _V $ = '(eqstr uncom uncpl2);
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/peano.mm1:1672:17:
|
1672 | theorem ssv2: $ A C_ _V $ = '(!! ax_gen x @ a1i elv);
| ^
error: A is not a function
../examples/peano.mm1:1673:25:
|
1673 | theorem ssv1: $ _V C_ A <-> A == _V $ = '(ibii (ssasym ssv2) (mpbiri ssid sseq2));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1674:20:
|
1674 | theorem eqval: $ A == _V <-> A. x x e. A $ = '(bitr3 ssv1 @ aleqi @ biim1 elv);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1678:59:
|
1678 | local def nfn {x: nat} (a: nat x): wff = $ A. y (F/ x y = a) $;
| ^
error: expecting ), infix >= 0, or infix >= 10
../examples/peano.mm1:1679:8:
|
1679 | prefix nfn: $FN/$ prec 10;
| ^
error: term 'nfn' not declared
../examples/peano.mm1:1681:50:
|
1681 | theorem nfsbid (G) {x} (A B: set x) (h: $ G -> A == B $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1683:50:
|
1683 | theorem nfnbid (G) {x} (a b: nat x) (h: $ G -> a = b $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1686:21:
|
1686 | theorem nfnv: $ FN/ x a $ = '(!! ax_gen y nfv);
| ^
error: expecting (
../examples/peano.mm1:1688:45:
|
1688 | theorem nfnri {x y} (a: nat x) (h: $ F/ x y = a $): $ FN/ x a $ = '(ax_gen h);
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 10
../examples/peano.mm1:1689:76:
|
1689 | theorem nfel2 (a: nat) (A: set x) (h: $ FS/ x A $): $ F/ x a e. A $ = '(!! eale y (nfeqd eleq1) h);
| ^
error: unknown theorem/hypothesis 'eale'
../examples/peano.mm1:1690:36:
|
1690 | theorem nfsx (A B: set x) (h1: $ A == B $) (h2: $ FS/ x B $): $ FS/ x A $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1692:39:
|
1692 | theorem nf_eq (a b: nat x) (h1: $ FN/ x a $) (h2: $ FN/ x b $): $ F/ x a = b $ =
| ^
error: expecting (
../examples/peano.mm1:1694:36:
|
1694 | theorem nfeq2 (b: nat x) (h: $ FN/ x b $): $ F/ x a = b $ = '(nf_eq nfnv h);
| ^
error: expecting (
../examples/peano.mm1:1695:48:
|
1695 | theorem nfsb1h (a: nat x) (b: wff x) (h: $ FN/ x a $): $ F/ x [a / x] b $ =
| ^
error: expecting (
../examples/peano.mm1:1697:52:
|
1697 | theorem nfsbh (a: nat x y) (b: wff x y) (h1: $ FN/ x a $) (h2: $ F/ x b $): $ F/ x [a / y] b $ =
| ^
error: expecting (
../examples/peano.mm1:1699:47:
|
1699 | theorem nfel (a: nat x) (A: set x) (h1: $ FN/ x a $) (h2: $ FS/ x A $): $ F/ x a e. A $ =
| ^
error: expecting (
../examples/peano.mm1:1701:64:
|
1701 | theorem nfab1 (p: wff x): $ FS/ x {x | p} $ = '(!! nfsri _ y @ nfx elab nfsb1);
| ^
error: unknown theorem/hypothesis 'nfx'
../examples/peano.mm1:1702:81:
|
1702 | theorem nfab (p: wff x y) (h: $ F/ x p $): $ FS/ x {y | p} $ = '(!! nfsri _ z @ nfx elab @ nfsb h);
| ^
error: unknown theorem/hypothesis 'nfx'
../examples/peano.mm1:1703:74:
|
1703 | theorem nfeqs (A B: set x) (h1: $ FS/ x A $) (h2: $ FS/ x B $): $ F/ x A == B $ =
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 10
../examples/peano.mm1:1705:36:
|
1705 | theorem nfnx (a b: nat x) (h1: $ a = b $) (h2: $ FN/ x b $): $ FN/ x a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1707:74:
|
1707 | theorem nfin (A B: set x) (h1: $ FS/ x A $) (h2: $ FS/ x B $): $ FS/ x A i^i B $ =
| ^
error: unexpected 'i'
expecting '$', infix >= 0, or infix >= 10
../examples/peano.mm1:1709:71:
|
1709 | theorem nfss (A B: set x) (h1: $ FS/ x A $) (h2: $ FS/ x B $): $ F/ x A C_ B $ =
| ^
error: A is not a function
../examples/peano.mm1:1712:43:
|
1712 | theorem abeqb (p q: wff x): $ A. x (p <-> q) <-> {x | p} == {x | q} $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1714:50:
|
1714 | theorem eqab2d (p: wff x) (h: $ G -> (x e. A <-> p) $): $ G -> A == {x | p} $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1716:40:
|
1716 | theorem eqab2i (p: wff x) (h: $ x e. A <-> p $): $ A == {x | p} $ = '(trud @ eqab2d @ a1i h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1717:45:
|
1717 | theorem eqab1d (p: wff x) (h: $ G -> (p <-> x e. A) $): $ G -> {x | p} == A $ = '(eqscomd @ eqab2d @ bicomd
h);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1718:35:
|
1718 | theorem eqab1i (p: wff x) (h: $ p <-> x e. A $): $ {x | p} == A $ = '(trud @ eqab1d @ a1i h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1719:44:
|
1719 | theorem ssab (p q: wff x): $ A. x (p -> q) <-> {x | p} C_ {x | q} $ =
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:1722:55:
|
1722 | theorem ssabi (p q: wff x) (h: $ p -> q $): $ {x | p} C_ {x | q} $ = '(mpbi ssab @ ax_gen h);
| ^
error: unexpected 'C'
expecting '$' or infix >= 0
../examples/peano.mm1:1723:65:
|
1723 | theorem ssabd (p q: wff x) (h: $ G -> p -> q $): $ G -> {x | p} C_ {x | q} $ = '(sylib ssab @ iald h);
| ^
error: unexpected 'C'
expecting '$' or infix >= 0
../examples/peano.mm1:1724:48:
|
1724 | theorem ssab1 (p: wff x): $ A. x (p -> x e. A) <-> {x | p} C_ A $ =
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:1726:48:
|
1726 | theorem ssab2 (p: wff x): $ A. x (x e. A -> p) <-> A C_ {x | p} $ =
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:1728:36:
|
1728 | theorem elabed1 (p: wff x) (e: $ G /\ x = a -> (a e. A <-> p) -> P $): $ G -> A == {x | p} -> P $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1731:36:
|
1731 | theorem elabed2 (p: wff x) (e: $ G /\ x = a -> (p <-> q) $): $ G -> A == {x | p} -> (a e. A <-> q) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1733:37:
|
1733 | theorem abeqv (p: wff x): $ {x | p} == _V <-> A. x p $ = '(bitr3 abeqb @ aleqi @ bibi2 itru);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1737:56:
|
1737 | def sbs (a: nat) {x .y: nat} (A: set x): set = $ {y | [a / x] y e. A} $;
| ^
error: expecting (
../examples/peano.mm1:1738:10:
|
1738 | notation sbs (a: nat) {x: nat} (A: set x): set = ($S[$:99) a ($/$:0) x ($]$:0) A;
| ^
error: term 'sbs' not declared
../examples/peano.mm1:1740:56:
|
1740 | theorem elsbs (a: nat x) (b: nat) (A: set x): $ b e. S[a / x] A <-> [a / x] b e. A $ =
| ^
error: expecting (
../examples/peano.mm1:1742:39:
|
1742 | theorem sbsq (a: nat) (A: set x): $ x = a -> A == S[a / x] A $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1744:49:
|
1744 | theorem nfsbs1h (a: nat x) (A: set x) (h: $ FN/ x a $): $ FS/ x S[a / x] A $ =
| ^
error: expecting (
../examples/peano.mm1:1746:47:
|
1746 | theorem nfsbs1 (a: nat) (A: set x): $ FS/ x S[a / x] A $ =
| ^
error: expecting ( or infix >= max
../examples/peano.mm1:1748:51:
|
1748 | theorem nfsbsh (a: nat x) (A: set x y) (h1: $ FN/ x a $) (h2: $ FS/ x A $): $ FS/ x S[a / y] A $ =
| ^
error: expecting (
../examples/peano.mm1:1750:65:
|
1750 | theorem nfsbs (a: nat) (A: set x y) (h: $ FS/ x A $): $ FS/ x S[a / y] A $ = '(nfsbsh nfnv h);
| ^
error: expecting ( or infix >= max
../examples/peano.mm1:1751:60:
|
1751 | theorem sbseq1d (G) {x} (a b: nat) (A: set x) (h: $ G -> a = b $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1754:16:
|
1754 | (h: $ G -> A == B $): $ G -> S[a / x] A == S[a / x] B $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1756:3:
|
1756 | @(register-eqd 'sbs) theorem sbseqd (G) {x} (a b: nat) (A B: set x)
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano.mm1:1759:12:
|
1759 | do (apply (register-eqd 'sbs) '(sbseqd sbseq1d sbseq2d));
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano.mm1:1761:15:
|
1761 | $ A. x (x = a -> A == B) -> S[a / x] A == B $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1763:40:
|
1763 | theorem sbsco (a: nat) (A: set x): $ S[a / y] S[y / x] A == S[a / x] A $ =
| ^
error: expecting (
../examples/peano.mm1:1766:11:
|
1766 | (e: $ x = a -> A == B $): $ S[a / x] A == B $ = '(sbseht h (ax_gen e));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1768:15:
|
1768 | $ A. x (x = a -> A == B) -> S[a / x] A == B $ = '(sbseht nfsv);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1770:11:
|
1770 | (e: $ x = a -> A == B $): $ S[a / x] A == B $ = '(sbseh nfsv e);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1772:11:
|
1772 | (e: $ G /\ x = a -> A == B $): $ G -> S[a / x] A == B $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:1774:31:
|
1774 | theorem sbsid (A: set x): $ S[x / x] A == A $ =
| ^
error: expecting (
../examples/peano.mm1:1777:11:
|
1777 | (e: $ y = a -> A == B $) (h: $ FN/ x a $): $ FS/ x B $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1780:1:
|
1780 | @_ local def If (p: wff) (A B: set): set = $ {n | ifp p (n e. A) (n e. B)} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:1780:51:
|
1780 | @_ local def If (p: wff) (A B: set): set = $ {n | ifp p (n e. A) (n e. B)} $;
| ^
error: ifp is not a function
../examples/peano.mm1:1782:32:
|
1782 | theorem Ifpos: $ p -> If p A B == A $ = '(!! eqab1d n ifppos);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1783:33:
|
1783 | theorem Ifneg: $ ~p -> If p A B == B $ = '(!! eqab1d n ifpneg);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1785:26:
|
1785 | theorem Ifid: $ If p A A == A $ = '(cases Ifpos Ifneg);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1786:30:
|
1786 | theorem Ifeq2a: $ (p -> A == B) -> If p A C == If p B C $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1788:31:
|
1788 | theorem Ifeq3a: $ (~p -> B == C) -> If p A B == If p A C $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1791:1:
|
1791 | @_ local def eu {x: nat} (p: wff x): wff = $ E. y A. x (p <-> x = y) $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:1791:63:
|
1791 | @_ local def eu {x: nat} (p: wff x): wff = $ E. y A. x (p <-> x = y) $;
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/peano.mm1:1794:3:
|
1794 | @(add-eval 0) term d0: nat; prefix d0: $0$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:1794:36:
|
1794 | @(add-eval 0) term d0: nat; prefix d0: $0$ prec max;
| ^
error: term 'd0' not declared
../examples/peano.mm1:1796:3:
|
1796 | @(add-eval @ fn (a) {(eval a) + 1})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:1799:3:
|
1799 | @(add-eval) def d1: nat = $suc 0$; prefix d1: $1$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:1799:44:
|
1799 | @(add-eval) def d1: nat = $suc 0$; prefix d1: $1$ prec max;
| ^
error: term 'd1' not declared
../examples/peano.mm1:1800:3:
|
1800 | @(add-eval) def d2: nat = $suc 1$; prefix d2: $2$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:1800:44:
|
1800 | @(add-eval) def d2: nat = $suc 1$; prefix d2: $2$ prec max;
| ^
error: term 'd2' not declared
../examples/peano.mm1:1801:3:
|
1801 | @(add-eval) def d3: nat = $suc 2$; prefix d3: $3$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:1801:44:
|
1801 | @(add-eval) def d3: nat = $suc 2$; prefix d3: $3$ prec max;
| ^
error: term 'd3' not declared
../examples/peano.mm1:1802:3:
|
1802 | @(add-eval) def d4: nat = $suc 3$; prefix d4: $4$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:1802:44:
|
1802 | @(add-eval) def d4: nat = $suc 3$; prefix d4: $4$ prec max;
| ^
error: term 'd4' not declared
../examples/peano.mm1:1803:3:
|
1803 | @(add-eval) def d5: nat = $suc 4$; prefix d5: $5$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:1803:44:
|
1803 | @(add-eval) def d5: nat = $suc 4$; prefix d5: $5$ prec max;
| ^
error: term 'd5' not declared
../examples/peano.mm1:1804:3:
|
1804 | @(add-eval) def d6: nat = $suc 5$; prefix d6: $6$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:1804:44:
|
1804 | @(add-eval) def d6: nat = $suc 5$; prefix d6: $6$ prec max;
| ^
error: term 'd6' not declared
../examples/peano.mm1:1805:3:
|
1805 | @(add-eval) def d7: nat = $suc 6$; prefix d7: $7$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:1805:44:
|
1805 | @(add-eval) def d7: nat = $suc 6$; prefix d7: $7$ prec max;
| ^
error: term 'd7' not declared
../examples/peano.mm1:1806:3:
|
1806 | @(add-eval) def d8: nat = $suc 7$; prefix d8: $8$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:1806:44:
|
1806 | @(add-eval) def d8: nat = $suc 7$; prefix d8: $8$ prec max;
| ^
error: term 'd8' not declared
../examples/peano.mm1:1807:3:
|
1807 | @(add-eval) def d9: nat = $suc 8$; prefix d9: $9$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:1807:44:
|
1807 | @(add-eval) def d9: nat = $suc 8$; prefix d9: $9$ prec max;
| ^
error: term 'd9' not declared
../examples/peano.mm1:1808:3:
|
1808 | @(add-eval) def d10: nat = $suc 9$; prefix d10: $10$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:1808:44:
|
1808 | @(add-eval) def d10: nat = $suc 9$; prefix d10: $10$ prec max;
| ^
error: term 'd10' not declared
../examples/peano.mm1:1811:32:
|
1811 | axiom peano1 (a: nat): $ suc a != 0 $;
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:1813:34:
|
1813 | axiom peano2 (a b: nat): $ suc a = suc b <-> a = b $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1817:6:
|
1817 | $ [0 / x] p -> A. x (p -> [suc x / x] p) -> A. x p $;
| ^
error: expecting (
../examples/peano.mm1:1819:20:
|
1819 | theorem d1ne0: $ 1 != 0 $ = 'peano1;
| ^
error: expecting (
../examples/peano.mm1:1820:20:
|
1820 | theorem d2ne0: $ 2 != 0 $ = 'peano1;
| ^
error: expecting (
../examples/peano.mm1:1821:20:
|
1821 | theorem suceq: $ a = b -> suc a = suc b $ = '(bi2 peano2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1822:3:
|
1822 | @(register-eqd 'suc) theorem suceqd
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano.mm1:1826:12:
|
1826 | (ha: $ x = a -> (px <-> pa) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1837:12:
|
1837 | (ha: $ x = a -> (px <-> pa) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1860:21:
|
1860 | theorem sucne0: $ a = suc b -> a != 0 $ = '(mpbiri peano1 neeq1);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1861:29:
|
1861 | theorem exsuc (a: nat): $ a != 0 <-> E. x a = suc x $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:1869:23:
|
1869 | theorem eqsucext: $ a = b <-> A. x (a = suc x <-> b = suc x) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1878:45:
|
1878 | axiom theid {x: nat} (A: set) (a: nat): $ A == {x | x = a} -> the A = a $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1880:43:
|
1880 | axiom the0 {x y: nat} (A: set): $ ~E. y A == {x | x = y} -> the A = 0 $;
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:1882:5:
|
1882 | do (add-axiom-set! 'axs_the "Definite description" '(theid the0));
| ^
error: Reference to unbound variable 'add-axiom-set!'
../examples/peano.mm1:1884:3:
|
1884 | @(register-eqd 'the) theorem theeqd (G A B)
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano.mm1:1889:20:
|
1889 | theorem theeq: $ A == B -> the A = the B $ = '(theeqd id);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1890:43:
|
1890 | theorem eqthed {x} (h: $ G -> (x e. A <-> x = a) $): $ G -> the A = a $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1892:47:
|
1892 | theorem eqtheabd (p: wff x) (h: $ G -> (p <-> x = a) $): $ G -> the {x | p} = a $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1896:44:
|
1896 | theorem eqthe0d {x} (h: $ G -> x e. A -> x = 0 $): $ G -> the A = 0 $ =
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 25
../examples/peano.mm1:1901:48:
|
1901 | theorem eqthe0abd (p: wff x) (h: $ G -> p -> x = 0 $): $ G -> the {x | p} = 0 $ =
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 25
../examples/peano.mm1:1905:21:
|
1905 | theorem eqtheb: $ a = the A <-> (A == {x | x = a} \/ ~E. y A == {x | x = y} /\ a = 0) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1913:50:
|
1913 | theorem nfthe (A: set x) (h: $ FS/ x A $): $ FN/ x the A $ =
| ^
error: expecting (
../examples/peano.mm1:1919:1:
|
1919 | @_ local def theo (A: set): nat = $ the {x | E. y (x = suc y /\ y e. A)} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:1919:41:
|
1919 | @_ local def theo (A: set): nat = $ the {x | E. y (x = suc y /\ y e. A)} $;
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/peano.mm1:1920:49:
|
1920 | theorem theoid1 {x: nat} (A: set) (a: nat): $ A == {x | x = a} -> theo A = suc a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1926:45:
|
1926 | theorem theo01 {x: nat} (A: set): $ ~E. y A == {x | x = y} -> theo A = 0 $ =
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:1937:48:
|
1937 | theorem theoid {x: nat} (A: set) (a: nat): $ A == {x | x = a} <-> theo A = suc a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1941:46:
|
1941 | theorem theo0 {x y: nat} (A: set): $ ~E. y A == {x | x = y} <-> theo A = 0 $ =
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:1944:1:
|
1944 | @_ local def subsn (A: set) = $ A. x A. y (x e. A -> y e. A -> x = y) $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:1944:68:
|
1944 | @_ local def subsn (A: set) = $ A. x A. y (x e. A -> y e. A -> x = y) $;
| ^
error: expecting ), infix >= 0, infix >= 25, or infix >= max
../examples/peano.mm1:1946:27:
|
1946 | theorem subsni (h: $ G -> subsn A $) (h1: $ G -> a e. A $) (h2: $ G -> b e. A $): $ G -> a = b $ =
| ^
error: subsn is not a function
../examples/peano.mm1:1950:20:
|
1950 | theorem subsnss: $ A C_ B -> subsn B -> subsn A $ =
| ^
error: A is not a function
../examples/peano.mm1:1953:27:
|
1953 | theorem subsnsn2: $ subsn {x | x = a} $ =
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/peano.mm1:1957:45:
|
1957 | theorem eqsubsnd {x} (h: $ G -> x e. A -> x = a $): $ G -> subsn A $ =
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 25
../examples/peano.mm1:1960:49:
|
1960 | theorem eqsubsnabd (p: wff x) (h: $ G -> p -> x = a $): $ G -> subsn {x | p} $ =
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 25
../examples/peano.mm1:1963:48:
|
1963 | theorem subsnthe: $ subsn A -> a e. A -> the A = a $ =
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 25
../examples/peano.mm1:1966:28:
|
1966 | theorem subsnex: $ subsn A <-> E. a A. x (x e. A -> x = a) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:1970:43:
|
1970 | theorem subsntheo: $ subsn A -> (theo A = suc a <-> a e. A) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:1977:51:
|
1977 | def sbn (a: nat) {x: nat} (b: nat x): nat = $ the {y | [a / x] y = b} $;
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/peano.mm1:1978:10:
|
1978 | notation sbn (a: nat) {x: nat} (b: nat x): nat = ($N[$:99) a ($/$:0) x ($]$:0) b;
| ^
error: term 'sbn' not declared
../examples/peano.mm1:1979:7:
|
1979 | do { (add-eqd-thm 'sbn) (add-eq-thm 'sbn) };
| ^
error: Reference to unbound variable 'add-eqd-thm'
../examples/peano.mm1:1981:39:
|
1981 | theorem sbnq (a: nat) (b: nat x): $ x = a -> b = N[a / x] b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1983:40:
|
1983 | theorem nfsbn1h (a b: nat x) (h: $ FN/ x a $): $ FN/ x N[a / x] b $ =
| ^
error: expecting (
../examples/peano.mm1:1985:43:
|
1985 | theorem nfsbn1 (a: nat) (b: nat x): $ FN/ x N[a / x] b $ =
| ^
error: expecting (
../examples/peano.mm1:1987:42:
|
1987 | theorem nfsbnh (a b: nat x y) (h1: $ FN/ x a $) (h2: $ FN/ x b $): $ FN/ x N[a / y] b $ =
| ^
error: expecting (
../examples/peano.mm1:1989:47:
|
1989 | theorem nfsbn (a: nat) (b: nat x y) (h: $ FN/ x b $): $ FN/ x N[a / y] b $ = '(nfsbnh nfnv h);
| ^
error: expecting (
../examples/peano.mm1:1991:16:
|
1991 | (h: $ G -> b = c $): $ G -> N[a / x] b = N[a / x] c $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:1993:48:
|
1993 | theorem sbneht (a: nat) (b c: nat x) (h: $ FN/ x c $):
| ^
error: expecting (
../examples/peano.mm1:1996:47:
|
1996 | theorem sbneh (a: nat) (b c: nat x) (h: $ FN/ x c $)
| ^
error: expecting (
../examples/peano.mm1:1999:15:
|
1999 | $ A. x (x = a -> b = c) -> N[a / x] b = c $ = '(sbneht nfnv);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2001:11:
|
2001 | (e: $ x = a -> b = c $): $ N[a / x] b = c $ = '(sbneh nfnv e);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2003:11:
|
2003 | (e: $ G /\ x = a -> b = c $): $ G -> N[a / x] b = c $ = '(syl sbnet @ ialda e);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:2004:36:
|
2004 | theorem sbneq1 (a b c: nat x): $ a = b -> N[a / x] c = N[b / x] c $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2007:16:
|
2007 | (h: $ G -> a = b $): $ G -> N[a / x] c = N[b / x] c $ = '(syl sbneq1 h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2008:31:
|
2008 | theorem sbnid (a: nat x): $ N[x / x] a = a $ = '(trud @ !! eqtheabd y @ a1i sbid);
| ^
error: expecting (
../examples/peano.mm1:2011:11:
|
2011 | (e: $ y = a -> b = c $) (h: $ FN/ x a $): $ FN/ x c $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2013:59:
|
2013 | theorem nfnlem2 {y z} (c: nat y z) (a b d: nat x) (e: $ y = a /\ z = b -> c = d $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2017:36:
|
2017 | theorem nfsuc (a: nat x) (h: $ FN/ x a $): $ FN/ x suc a $ = '(!! nfnlem _ y suceq h);
| ^
error: expecting (
../examples/peano.mm1:2020:3:
|
2020 | @(add-eval @ fn (a b) {(eval a) + (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:2021:34:
|
2021 | term add (a b: nat): nat; infixl add: $+$ prec 64;
| ^
error: term 'add' not declared
../examples/peano.mm1:2023:3:
|
2023 | @(add-eval @ fn (a b) {(eval a) * (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:2024:34:
|
2024 | term mul (a b: nat): nat; infixl mul: $*$ prec 70;
| ^
error: term 'mul' not declared
../examples/peano.mm1:2027:33:
|
2027 | axiom addeq (a b c d: nat): $ a = b -> c = d -> a + c = b + d $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2029:33:
|
2029 | axiom muleq (a b c d: nat): $ a = b -> c = d -> a * c = b * d $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2031:26:
|
2031 | axiom add0 (a: nat): $ a + 0 = a $;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2033:28:
|
2033 | axiom addS (a b: nat): $ a + suc b = suc (a + b) $;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2035:26:
|
2035 | axiom mul0 (a: nat): $ a * 0 = 0 $;
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2037:28:
|
2037 | axiom mulS (a b: nat): $ a * suc b = a * b + a $;
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2039:5:
|
2039 | do (add-axiom-set! 'axs_peano "Peano arithmetic"
| ^
error: Reference to unbound variable 'add-axiom-set!'
../examples/peano.mm1:2042:3:
|
2042 | @(register-eqd 'add) theorem addeqd (h1: $ G -> a = b $) (h2: $ G -> c = d $):
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano.mm1:2044:3:
|
2044 | @(register-eqd 'mul) theorem muleqd (h1: $ G -> a = b $) (h2: $ G -> c = d $):
| ^
error: Reference to unbound variable 'register-eqd'
../examples/peano.mm1:2046:7:
|
2046 | do { (add-eqN-thms 'add) (add-eqN-thms 'mul) };
| ^
error: Reference to unbound variable 'add-eqN-thms'
../examples/peano.mm1:2047:39:
|
2047 | theorem nfadd (a b: nat x) (h1: $ FN/ x a $) (h2: $ FN/ x b $):
| ^
error: expecting (
../examples/peano.mm1:2049:39:
|
2049 | theorem nfmul (a b: nat x) (h1: $ FN/ x a $) (h2: $ FN/ x b $):
| ^
error: expecting (
../examples/peano.mm1:2052:20:
|
2052 | theorem add02: $ a + 0 = a $ = 'add0;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2053:20:
|
2053 | theorem add01: $ 0 + a = a $ =
| ^
error: expecting (
../examples/peano.mm1:2059:20:
|
2059 | theorem addS2: $ a + suc b = suc (a + b) $ = 'addS;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2060:24:
|
2060 | theorem addS1: $ suc a + b = suc (a + b) $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2066:26:
|
2066 | theorem addSass: $ suc a + b = a + suc b $ = '(eqtr4 addS1 addS2);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2068:20:
|
2068 | theorem add12: $ a + 1 = suc a $ = '(eqtr addS (suceq add0));
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2069:20:
|
2069 | theorem add11: $ 1 + a = suc a $ = '(eqtr addS1 (suceq add01));
| ^
error: expecting (
../examples/peano.mm1:2070:20:
|
2070 | theorem add22: $ a + 2 = suc (suc a) $ = '(eqtr addS (suceq add12));
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2072:21:
|
2072 | theorem addcom: $ a + b = b + a $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2078:24:
|
2078 | theorem addass: $ (a + b) + c = a + (b + c) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2085:22:
|
2085 | theorem addlass: $ a + (b + c) = b + (a + c) $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2087:25:
|
2087 | theorem addrass: $ (a + b) + c = (a + c) + b $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2089:22:
|
2089 | theorem add4: $ (a + b) + (c + d) = (a + c) + (b + d) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2092:22:
|
2092 | theorem addcan1: $ a + c = b + c <-> a = b $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2097:22:
|
2097 | theorem addcan2: $ a + b = a + c <-> b = c $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2100:20:
|
2100 | theorem mul02: $ a * 0 = 0 $ = 'mul0;
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2101:20:
|
2101 | theorem mul01: $ 0 * a = 0 $ =
| ^
error: expecting (
../examples/peano.mm1:2106:20:
|
2106 | theorem mulS2: $ a * suc b = a * b + a $ = 'mulS;
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2107:24:
|
2107 | theorem mulS1: $ suc a * b = a * b + b $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2115:21:
|
2115 | theorem mulcom: $ a * b = b * a $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2121:20:
|
2121 | theorem mul12: $ a * 1 = a $ = '(eqtr mulS (eqtr (addeq1 mul0) add01));
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2122:20:
|
2122 | theorem mul11: $ 1 * a = a $ = '(eqtr mulcom mul12);
| ^
error: expecting (
../examples/peano.mm1:2123:20:
|
2123 | theorem mul22: $ a * 2 = a + a $ = '(eqtr mulS2 @ addeq1 mul12);
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2124:20:
|
2124 | theorem mul21: $ 2 * a = a + a $ = '(eqtr mulcom mul22);
| ^
error: expecting (
../examples/peano.mm1:2126:21:
|
2126 | theorem muladd: $ a * (b + c) = a * b + a * c $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2135:24:
|
2135 | theorem addmul: $ (a + b) * c = a * c + b * c $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2138:24:
|
2138 | theorem mulass: $ (a * b) * c = a * (b * c) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2145:22:
|
2145 | theorem mullass: $ a * (b * c) = b * (a * c) $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2147:25:
|
2147 | theorem mulrass: $ (a * b) * c = (a * c) * b $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2152:3:
|
2152 | @(add-eval @ fn (a b) {{(eval a) - (eval b)} max 0})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:2154:8:
|
2154 | infixl sub: $-$ prec 64;
| ^
error: term 'sub' not declared
../examples/peano.mm1:2156:21:
|
2156 | theorem eqsub2: $ a + b = c -> c - a = b $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2158:21:
|
2158 | theorem eqsub1: $ a + b = c -> c - b = a $ = '(sylbi (eqeq1 addcom) eqsub2);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2159:20:
|
2159 | theorem pncan: $ a + b - b = a $ = '(eqsub1 eqid);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2160:21:
|
2160 | theorem pncan2: $ a + b - a = b $ = '(eqsub2 eqid);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2161:20:
|
2161 | theorem sub02: $ a - 0 = a $ = '(eqsub1 add0);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:2162:20:
|
2162 | theorem subid: $ a - a = 0 $ = '(eqsub1 add01);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:2163:26:
|
2163 | theorem sucsub1: $ suc a - 1 = a $ = '(eqtr3 (subeq1 add12) pncan);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:2166:3:
|
2166 | @(add-eval @ fn (a b) {(eval a) <= (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:2168:8:
|
2168 | infixl le: $<=$ prec 50;
| ^
error: term 'le' not declared
../examples/peano.mm1:2170:19:
|
2170 | theorem dfle: $ a <= b <-> E. x a + x = b $ = '(!! cbvex y x (eqeq1d addeq2));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2172:19:
|
2172 | theorem leid: $ a <= a $ = '(!! iexe x (eqeq1d addeq2) add0);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2173:19:
|
2173 | theorem eqle: $ a = b -> a <= b $ = '(mpbii leid leeq2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2174:20:
|
2174 | theorem eqler: $ a = b -> b <= a $ = '(syl eqle eqcom);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2176:21:
|
2176 | theorem pncan3: $ a <= b -> a + (b - a) = b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2178:20:
|
2178 | theorem npcan: $ b <= a -> a - b + b = a $ = '(syl5eq addcom pncan3);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2179:21:
|
2179 | theorem subadd: $ b <= a -> (a - b = c <-> b + c = a) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2181:21:
|
2181 | theorem addsub: $ c <= a -> a + b - c = a - c + b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2183:21:
|
2183 | theorem sucsub: $ b <= a -> suc a - b = suc (a - b) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2186:23:
|
2186 | theorem leaddid1: $ a <= a + b $ = '(!! iexe x (eqeq1d addeq2) eqid);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2187:23:
|
2187 | theorem leaddid2: $ a <= b + a $ = '(mpbi (leeq eqid addcom) leaddid1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2189:22:
|
2189 | theorem lesucid: $ a <= suc a $ = '(mpbi (leeq2 add12) leaddid1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2191:19:
|
2191 | theorem le01: $ 0 <= a $ = '(mpbi (leeq2 add0) leaddid2);
| ^
error: expecting (
../examples/peano.mm1:2193:21:
|
2193 | theorem leadd1: $ a <= b <-> a + c <= b + c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2195:21:
|
2195 | theorem leadd2: $ b <= c <-> a + b <= a + c $ = '(bitr leadd1 (leeq addcom addcom));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2196:20:
|
2196 | theorem lesuc: $ a <= b <-> suc a <= suc b $ = '(bitr leadd1 (leeq add12 add12));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2198:29:
|
2198 | theorem letrd (h1: $ G -> a <= b $) (h2: $ G -> b <= c $): $ G -> a <= c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2203:19:
|
2203 | theorem letr: $ a <= b -> b <= c -> a <= c $ = '(exp (letrd anl anr));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2205:31:
|
2205 | theorem leasymd (h1: $ G -> a <= b $) (h2: $ G -> b <= a $): $ G -> a = b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2217:21:
|
2217 | theorem leasym: $ a <= b -> b <= a -> a = b $ = '(exp (leasymd anl anr));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2218:21:
|
2218 | theorem eqlele: $ a = b <-> a <= b /\ b <= a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2221:19:
|
2221 | theorem le02: $ a <= 0 <-> a = 0 $ = '(ibii (mpi le01 leasym) eqle);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2222:19:
|
2222 | theorem le11: $ 1 <= a <-> a != 0 $ = '(bitr4 (!! exeqi x (bitr eqcomb @ eqeq2 add11)) exsuc);
| ^
error: expecting (
../examples/peano.mm1:2224:21:
|
2224 | theorem addeq0: $ a + b = 0 <-> a = 0 /\ b = 0 $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2228:22:
|
2228 | theorem sub1can: $ a != 0 -> suc (a - 1) = a $ = '(sylbir le11 @ syl5eqr add12 npcan);
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2230:30:
|
2230 | theorem leaddd (h1: $ G -> a <= b $) (h2: $ G -> c <= d $): $ G -> a + c <= b + d $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2233:20:
|
2233 | theorem leadd: $ a <= b -> c <= d -> a + c <= b + d $ = '(exp @ leaddd anl anr);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2235:22:
|
2235 | theorem lemul1a: $ a <= b -> a * c <= b * c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2238:22:
|
2238 | theorem lemul2a: $ b <= c -> a * b <= a * c $ = '(sylib (leeq mulcom mulcom) lemul1a);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2239:30:
|
2239 | theorem lemuld (h1: $ G -> a <= b $) (h2: $ G -> c <= d $): $ G -> a * c <= b * d $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2243:3:
|
2243 | @(add-eval @ fn (a b) {(eval a) < (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:2245:8:
|
2245 | infixl lt: $<$ prec 50;
| ^
error: term 'lt' not declared
../examples/peano.mm1:2247:21:
|
2247 | theorem ltletr: $ a < b -> b <= c -> a < c $ = 'letr;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2248:31:
|
2248 | theorem ltletrd (h1: $ G -> a < b $) (h2: $ G -> b <= c $): $ G -> a < c $ = '(letrd h1 h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2250:19:
|
2250 | theorem ltle: $ a < b -> a <= b $ = '(letrd (a1i lesucid) id);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2251:23:
|
2251 | theorem ltlei (h: $ a < b $): $ a <= b $ = '(ltle h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2252:28:
|
2252 | theorem ltled (h: $ G -> a < b $): $ G -> a <= b $ = '(syl ltle h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2254:21:
|
2254 | theorem lelttr: $ a <= b -> b < c -> a < c $ = '(sylbi lesuc letr);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2255:31:
|
2255 | theorem lelttrd (h1: $ G -> a <= b $) (h2: $ G -> b < c $): $ G -> a < c $ = '(sylc lelttr h1 h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2257:19:
|
2257 | theorem lttr: $ a < b -> b < c -> a < c $ = '(syl lelttr ltle);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2258:24:
|
2258 | theorem lttri (h1: $ a < b $) (h2: $ b < c $): $ a < c $ = '(lttr h1 h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2259:29:
|
2259 | theorem lttrd (h1: $ G -> a < b $) (h2: $ G -> b < c $): $ G -> a < c $ = '(sylc lttr h1 h2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2261:22:
|
2261 | theorem ltsucid: $ a < suc a $ = 'leid;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2263:19:
|
2263 | theorem lt01: $ 0 < a <-> a != 0 $ = 'le11;
| ^
error: expecting (
../examples/peano.mm1:2264:21:
|
2264 | theorem lt02: $ ~ a < 0 $ = '(con3 (bi1 le02) peano1);
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:2265:20:
|
2265 | theorem lt01S: $ 0 < suc a $ = '(mpbir lt01 peano1);
| ^
error: expecting (
../examples/peano.mm1:2266:20:
|
2266 | theorem le11S: $ 1 <= suc a $ = 'lt01S;
| ^
error: expecting (
../examples/peano.mm1:2268:21:
|
2268 | theorem ltadd1: $ a < b <-> a + c < b + c $ = '(bitr leadd1 (leeq1 addS1));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2269:21:
|
2269 | theorem ltadd2: $ b < c <-> a + b < a + c $ = '(bitr ltadd1 (lteq addcom addcom));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2270:20:
|
2270 | theorem ltsuc: $ a < b <-> suc a < suc b $ = '(bitr ltadd1 (lteq add12 add12));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2271:22:
|
2271 | theorem leltsuc: $ a <= b <-> a < suc b $ = 'lesuc;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2273:32:
|
2273 | theorem leltaddd (h1: $ G -> a <= b $) (h2: $ G -> c < d $): $ G -> a + c < b + d $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2275:32:
|
2275 | theorem ltleaddd (h1: $ G -> a < b $) (h2: $ G -> c <= d $): $ G -> a + c < b + d $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2278:22:
|
2278 | theorem ltirr: $ ~ a < a $ = '(mtbi (bitr ltadd1 @ lteq add01 add01) lt02);
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:2279:19:
|
2279 | theorem ltne: $ a < b -> a != b $ = '(mpi ltirr @ con3d @ com12 @ bi1d lteq1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2280:20:
|
2280 | theorem ltner: $ a < b -> b != a $ = '(syl necom ltne);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2281:23:
|
2281 | theorem ltnei (h: $ a < b $): $ a != b $ = '(ltne h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2282:24:
|
2282 | theorem ltneri (h: $ a < b $): $ b != a $ = '(ltner h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2284:20:
|
2284 | theorem d0lt1: $ 0 < 1 $ = 'lt01S;
| ^
error: expecting (
../examples/peano.mm1:2285:20:
|
2285 | theorem d0lt2: $ 0 < 2 $ = 'lt01S;
| ^
error: expecting (
../examples/peano.mm1:2286:20:
|
2286 | theorem d1lt2: $ 1 < 2 $ = '(mpbi ltsuc d0lt1);
| ^
error: expecting (
../examples/peano.mm1:2287:19:
|
2287 | theorem lt12: $ a < 1 <-> a = 0 $ = '(bitr3 leltsuc le02);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2289:25:
|
2289 | theorem nlesubeq0: $ ~b <= a -> a - b = 0 $ =
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:2292:22:
|
2292 | theorem subleid: $ a - b <= a $ =
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:2294:22:
|
2294 | theorem subltid: $ 0 < a /\ 0 < b -> a - b < a $ =
| ^
error: expecting (
../examples/peano.mm1:2299:22:
|
2299 | theorem lesub1i: $ a <= b -> a - c <= b - c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2304:20:
|
2304 | theorem leloe: $ a <= b <-> a < b \/ a = b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2311:21:
|
2311 | theorem ltlene: $ a < b <-> a <= b /\ a != b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2313:22:
|
2313 | theorem ltlenle: $ a < b <-> a <= b /\ ~b <= a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2317:21:
|
2317 | theorem ltorle: $ a < b \/ b <= a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2323:21:
|
2323 | theorem leorlt: $ a <= b \/ b < a $ = '(orcom ltorle);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2325:20:
|
2325 | theorem ltnle: $ a < b <-> ~b <= a $ = '(ibii (sylbi ltlenle anr) leorlt);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2326:20:
|
2326 | theorem lenlt: $ a <= b <-> ~b < a $ = '(con2b ltnle);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2327:20:
|
2327 | theorem ltnlt: $ a < b -> ~b < a $ = '(sylbi ltnle (con3 ltle));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2328:21:
|
2328 | theorem leorle: $ a <= b \/ b <= a $ = '(syl ltle leorlt);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2330:21:
|
2330 | theorem neltlt: $ a != b <-> a < b \/ b < a $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2333:22:
|
2333 | theorem eqalle2: $ a = b <-> A. i (a <= i <-> b <= i) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2337:22:
|
2337 | theorem eqallt1: $ a = b <-> A. i (i < a <-> i < b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2340:23:
|
2340 | theorem ltsubeq0: $ a < b -> a - b = 0 $ = '(sylbi ltnle nlesubeq0);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2341:23:
|
2341 | theorem lesubeq0: $ a <= b <-> a - b = 0 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2346:21:
|
2346 | theorem subpos: $ a < b <-> 0 < b - a $ = '(bitr ltnle @ bitr4 (noteq lesubeq0) lt01);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2348:24:
|
2348 | theorem lesubadd2: $ a - b <= c <-> a <= b + c $ =
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:2353:23:
|
2353 | theorem lesubadd: $ a - b <= c <-> a <= c + b $ = '(bitr lesubadd2 (leeq2 addcom));
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:2355:23:
|
2355 | theorem ltaddsub: $ a + b < c <-> a < c - b $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2358:24:
|
2358 | theorem ltaddsub2: $ a + b < c <-> b < c - a $ = '(bitr (lteq1 addcom) ltaddsub);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2360:23:
|
2360 | theorem ltsubadd: $ b <= a -> (a - b < c <-> a < c + b) $ = '(syl5bb ltadd1 @ lteq1d npcan);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2361:24:
|
2361 | theorem ltsubadd2: $ b <= a -> (a - b < c <-> a < b + c) $ = '(syl6bb (lteq2 addcom) ltsubadd);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2363:23:
|
2363 | theorem leaddsub: $ b <= c -> (a + b <= c <-> a <= c - b) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2365:24:
|
2365 | theorem leaddsub2: $ a <= c -> (a + b <= c <-> b <= c - a) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2367:24:
|
2367 | theorem leaddsubi: $ a + b <= c -> a <= c - b $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2369:25:
|
2369 | theorem leaddsub2i: $ a + b <= c -> b <= c - a $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2372:21:
|
2372 | theorem mulsub: $ a * (b - c) = a * b - a * c $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2377:24:
|
2377 | theorem submul: $ (a - b) * c = a * c - b * c $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2380:21:
|
2380 | theorem ltmul1: $ 0 < c -> (a < b <-> a * c < b * c) $ =
| ^
error: expecting (
../examples/peano.mm1:2387:21:
|
2387 | theorem ltmul2: $ 0 < a -> (b < c <-> a * b < a * c) $ =
| ^
error: expecting (
../examples/peano.mm1:2389:21:
|
2389 | theorem lemul1: $ 0 < c -> (a <= b <-> a * c <= b * c) $ =
| ^
error: expecting (
../examples/peano.mm1:2391:21:
|
2391 | theorem lemul2: $ 0 < a -> (b <= c <-> a * b <= a * c) $ =
| ^
error: expecting (
../examples/peano.mm1:2393:30:
|
2393 | theorem ltmuld (h1: $ G -> a < b $) (h2: $ G -> c < d $): $ G -> a * c < b * d $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2396:22:
|
2396 | theorem mulcan1: $ c != 0 -> (a * c = b * c <-> a = b) $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2401:22:
|
2401 | theorem mulcan2: $ a != 0 -> (a * b = a * c <-> b = c) $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2404:21:
|
2404 | theorem mulpos: $ 0 < a * b <-> 0 < a /\ 0 < b $ =
| ^
error: expecting (
../examples/peano.mm1:2410:21:
|
2410 | theorem mulne0: $ a * b != 0 <-> a != 0 /\ b != 0 $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2413:20:
|
2413 | theorem sub01: $ 0 - a = 0 $ =
| ^
error: expecting (
../examples/peano.mm1:2416:25:
|
2416 | theorem pnpcan2: $ (a + c) - (b + c) = a - b $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2421:25:
|
2421 | theorem pnpcan1: $ (a + b) - (a + c) = b - c $ = '(eqtr (subeq addcom addcom) pnpcan2);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2422:24:
|
2422 | theorem subSS: $ suc a - suc b = a - b $ = '(eqtr3 (subeq add12 add12) pnpcan2);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:2423:21:
|
2423 | theorem subsub: $ a - b - c = a - (b + c) $ =
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:2430:12:
|
2430 | (ha: $ x = a -> (px <-> pa) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2440:12:
|
2440 | (ha: $ x = a -> (px <-> pa) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2451:3:
|
2451 | @(derive-eq 'fin) def finite (A: set): wff = $ E. n A. x (x e. A -> x < n) $;
| ^
error: Reference to unbound variable 'derive-eq'
../examples/peano.mm1:2453:51:
|
2453 | theorem nffin (A: set x) (h: $ FS/ x A $): $ F/ x finite A $ =
| ^
error: finite is not a function
../examples/peano.mm1:2456:18:
|
2456 | theorem finss: $ A C_ B -> finite B -> finite A $ =
| ^
error: A is not a function
../examples/peano.mm1:2459:25:
|
2459 | theorem ltfin: $ finite {x | x < n} $ =
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/peano.mm1:2462:25:
|
2462 | theorem lefin: $ finite {x | x <= n} $ =
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/peano.mm1:2465:25:
|
2465 | theorem snfin: $ finite {x | x = n} $ =
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/peano.mm1:2468:45:
|
2468 | theorem infin1: $ finite A -> finite (A i^i B) $ = '(finss inss1);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2469:45:
|
2469 | theorem infin2: $ finite B -> finite (A i^i B) $ = '(finss inss2);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2473:3:
|
2473 | @(add-eval @ fn (a b c) (if (eval a) (eval b) (eval c)))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:2476:56:
|
2476 | pub theorem ifpos (p: wff) (a b: nat): $ p -> if p a b = a $ = '(!! eqtheabd n ifppos);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2477:57:
|
2477 | pub theorem ifneg (p: wff) (a b: nat): $ ~p -> if p a b = b $ = '(!! eqtheabd n ifpneg);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2479:26:
|
2479 | theorem ifid: $ if p a a = a $ = '(cases ifpos ifneg);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2480:29:
|
2480 | theorem ifeq2a: $ (p -> a = b) -> if p a c = if p b c $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2482:30:
|
2482 | theorem ifeq3a: $ (~p -> b = c) -> if p a b = if p a c $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2486:19:
|
2486 | (ea: $ if p a b = a -> (q <-> qa) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2491:23:
|
2491 | theorem ifT: $ a e. A /\ b e. A -> if p a b e. A $ = '(ifbothd eleq1 eleq1 anll anlr);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:2494:3:
|
2494 | @(add-eval @ fn (a) {(eval a) != 0})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:2497:3:
|
2497 | @(add-eval @ fn (a) {(eval a) < 2})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:2500:3:
|
2500 | @(add-eval @ fn (a) (if (eval a) 1 0))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:2503:23:
|
2503 | theorem true1: $ true 1 $ = 'd1ne0;
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/peano.mm1:2504:25:
|
2504 | theorem true0: $ ~ true 0 $ = '(notnot1 eqid);
| ^
error: unexpected '0'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:2506:21:
|
2506 | theorem letrue: $ a <= b -> true a -> true b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2509:30:
|
2509 | theorem truemul: $ true (a * b) <-> true a /\ true b $ = 'mulne0;
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2511:23:
|
2511 | theorem bool0: $ bool 0 $ = 'd0lt2;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:2512:23:
|
2512 | theorem bool1: $ bool 1 $ = 'd1lt2;
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/peano.mm1:2513:26:
|
2513 | theorem bool01: $ bool n <-> n = 0 \/ n = 1 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2516:27:
|
2516 | theorem boolle1: $ bool n <-> n <= 1 $ = '(bicom leltsuc);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2518:21:
|
2518 | theorem lebool: $ a <= b -> bool b -> bool a $ = 'lelttr;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2520:36:
|
2520 | theorem letrueb: $ bool a -> (a <= b <-> (true a -> true b)) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2525:42:
|
2525 | theorem dftrue2: $ bool n -> (true n <-> n = 1) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2528:20:
|
2528 | theorem boolnat: $ bool (nat p) $ =
| ^
error: bool is not a function
../examples/peano.mm1:2531:33:
|
2531 | theorem truenat: $ true (nat p) <-> p $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2533:25:
|
2533 | theorem nateq1: $ nat p = 1 <-> p $ = '(bitr3 (dftrue2 boolnat) truenat);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2534:25:
|
2534 | theorem nateq0: $ nat p = 0 <-> ~p $ = '(con2b @ bicom truenat);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2535:21:
|
2535 | theorem nat1: $ nat T. = 1 $ = '(mpbir nateq1 itru);
| ^
error: unexpected 'T'
expecting '$' or infix >= 0
../examples/peano.mm1:2536:21:
|
2536 | theorem nat0: $ nat F. = 0 $ = '(mpbir nateq0 notfal);
| ^
error: unexpected 'F'
expecting '$' or infix >= 0
../examples/peano.mm1:2537:43:
|
2537 | theorem nattrue: $ bool n -> nat (true n) = n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2542:27:
|
2542 | theorem natle: $ (p -> q) <-> nat p <= nat q $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2544:26:
|
2544 | theorem natinj: $ (p <-> q) <-> nat p = nat q $ = '(bitr4 (aneq natle natle) eqlele);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2546:25:
|
2546 | theorem natle1: $ nat p <= 1 $ = '(mpbi boolle1 boolnat);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2548:35:
|
2548 | theorem nattruele: $ nat (true n) <= n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2551:53:
|
2551 | theorem boolext: $ bool a -> bool b -> ((true a <-> true b) <-> a = b) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2557:3:
|
2557 | @(add-eval @ fn (a b) {(eval a) min (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:2560:3:
|
2560 | @(add-eval @ fn (a b) {(eval a) max (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:2564:14:
|
2564 | (h1: $ FN/ x a $) (h2: $ FN/ x b $): $ FN/ x max a b $ =
| ^
error: expecting (
../examples/peano.mm1:2567:21:
|
2567 | theorem eqmin1: $ a <= b -> min a b = a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2569:21:
|
2569 | theorem eqmax2: $ a <= b -> max a b = b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2572:27:
|
2572 | theorem mincom: $ min a b = min b a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2574:27:
|
2574 | theorem maxcom: $ max a b = max b a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2577:21:
|
2577 | theorem eqmin2: $ b <= a -> min a b = b $ = '(syl5eq mincom eqmin1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2578:21:
|
2578 | theorem eqmax1: $ b <= a -> max a b = a $ = '(syl5eq maxcom eqmax2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2580:27:
|
2580 | theorem minle1: $ min a b <= a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2582:27:
|
2582 | theorem minle2: $ min a b <= b $ = '(mpbi (leeq1 mincom) minle1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2583:20:
|
2583 | theorem lemin: $ a <= min b c <-> a <= b /\ a <= c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2587:20:
|
2587 | theorem ltmin: $ a < min b c <-> a < b /\ a < c $ = 'lemin;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2589:27:
|
2589 | theorem subaddmin: $ (a - b) + min a b = a $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2592:30:
|
2592 | theorem minaddsub: $ min a b + (a - b) = a $ = '(eqtr addcom subaddmin);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2594:21:
|
2594 | theorem submin: $ a - min a b = a - b $ =
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:2598:21:
|
2598 | theorem lemax1: $ a <= max a b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2600:21:
|
2600 | theorem lemax2: $ b <= max a b $ = '(mpbi (leeq2 maxcom) lemax1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2601:26:
|
2601 | theorem maxle: $ max a b <= c <-> a <= c /\ b <= c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2606:20:
|
2606 | theorem ltmax: $ a < max b c <-> a < b \/ a < c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2609:28:
|
2609 | theorem minadd1: $ min a b + c = min (a + c) (b + c) $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2612:28:
|
2612 | theorem maxadd1: $ max a b + c = max (a + c) (b + c) $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:2616:31:
|
2616 | theorem minS: $ suc (min a b) = min (suc a) (suc b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2618:31:
|
2618 | theorem maxS: $ suc (max a b) = max (suc a) (suc b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2621:26:
|
2621 | theorem maxlt: $ max a b < c <-> a < c /\ b < c $ = '(bitr (leeq1 maxS) maxle);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2622:20:
|
2622 | theorem lemax: $ a <= max b c <-> a <= b \/ a <= c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2625:55:
|
2625 | theorem unfin: $ finite A -> finite B -> finite (A u. B) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2636:3:
|
2636 | @(add-eval @ fn (a b) {(eval a) // (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:2638:8:
|
2638 | infixl div: $//$ prec 70;
| ^
error: term 'div' not declared
../examples/peano.mm1:2642:3:
|
2642 | @(add-eval @ fn (a b) {(eval a) % (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:2644:8:
|
2644 | infixl mod: $%$ prec 70;
| ^
error: term 'mod' not declared
../examples/peano.mm1:2646:32:
|
2646 | pub theorem div0 (a: nat): $ a // 0 = 0 $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:2648:19:
|
2648 | theorem mod0: $ a % 0 = a $ = '(eqtr (subeq2 mul01) sub02);
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/peano.mm1:2651:18:
|
2651 | (h1: $ G -> r1 < b $) (h2: $ G -> r2 < b $)
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2659:31:
|
2659 | theorem divlem2 (h1: $ G -> R < b $) (h2: $ G -> b * Q + R = a $):
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2670:22:
|
2670 | theorem divlem3: $ b != 0 -> E. q E. r (r < b /\ b * q + r = a) $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2688:32:
|
2688 | theorem eqdivmod (h1: $ G -> R < b $) (h2: $ G -> b * Q + R = a $):
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2695:36:
|
2695 | pub theorem divmod (a b: nat): $ b * (a // b) + a % b = a $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2705:35:
|
2705 | pub theorem modlt (a b: nat): $ b != 0 -> a % b < b $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2709:21:
|
2709 | theorem modle1: $ a % b <= a $ = '(mpbi (leeq2 divmod) leaddid2);
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/peano.mm1:2711:20:
|
2711 | theorem div01: $ 0 // a = 0 $ =
| ^
error: expecting (
../examples/peano.mm1:2714:20:
|
2714 | theorem mod01: $ 0 % a = 0 $ =
| ^
error: expecting (
../examples/peano.mm1:2718:20:
|
2718 | theorem mod12: $ a % 1 = 0 $ = '(mpbi lt12 @ modlt d1ne0);
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/peano.mm1:2719:20:
|
2719 | theorem div12: $ a // 1 = a $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:2722:25:
|
2722 | theorem muladddiv2: $ b != 0 -> (b * a + c) // b = a + c // b $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2724:25:
|
2724 | theorem muladddiv1: $ b != 0 -> (a * b + c) // b = a + c // b $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2726:25:
|
2726 | theorem muladdmod2: $ b != 0 -> (b * a + c) % b = c % b $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2728:25:
|
2728 | theorem muladdmod1: $ b != 0 -> (a * b + c) % b = c % b $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2731:27:
|
2731 | theorem muladddiv2lt: $ b != 0 /\ c < b -> (b * a + c) // b = a $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2733:27:
|
2733 | theorem muladddiv1lt: $ b != 0 /\ c < b -> (a * b + c) // b = a $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2735:27:
|
2735 | theorem muladdmod2lt: $ b != 0 /\ c < b -> (b * a + c) % b = c $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2737:27:
|
2737 | theorem muladdmod1lt: $ b != 0 /\ c < b -> (a * b + c) % b = c $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2740:22:
|
2740 | theorem muldiv2: $ b != 0 -> b * a // b = a $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2742:22:
|
2742 | theorem muldiv1: $ b != 0 -> a * b // b = a $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2744:22:
|
2744 | theorem mulmod1: $ b * a % b = 0 $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2748:22:
|
2748 | theorem mulmod2: $ a * b % b = 0 $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2750:20:
|
2750 | theorem divid: $ a != 0 -> a // a = 1 $ = '(syl5eqr (diveq1 mul12) muldiv2);
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2751:20:
|
2751 | theorem modid: $ a % a = 0 $ = '(eqtr3 (modeq1 mul12) mulmod1);
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/peano.mm1:2753:23:
|
2753 | theorem divlteq0: $ a < b -> a // b = 0 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2755:22:
|
2755 | theorem modltid: $ a < b -> a % b = a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2758:21:
|
2758 | theorem lediv1: $ a <= b -> a // c <= b // c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2762:23:
|
2762 | theorem muldivle: $ b * (a // b) <= a $ = '(mpbi (leeq2 divmod) leaddid1);
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2763:22:
|
2763 | theorem divleid: $ a // b <= a $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:2767:24:
|
2767 | theorem ledivmul1: $ c != 0 -> (a <= b // c <-> c * a <= b) $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2772:24:
|
2772 | theorem ledivmul2: $ c != 0 -> (a <= b // c <-> a * c <= b) $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2774:24:
|
2774 | theorem divltmul1: $ b != 0 -> (a // b < c <-> a < b * c) $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2776:24:
|
2776 | theorem divltmul2: $ b != 0 -> (a // b < c <-> a < c * b) $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2779:25:
|
2779 | theorem divlemul1r: $ b != 0 -> a <= b * c -> a // b <= c $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2781:25:
|
2781 | theorem divlemul2r: $ b != 0 -> a <= c * b -> a // b <= c $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2784:21:
|
2784 | theorem diveq0: $ b != 0 -> (a // b = 0 <-> a < b) $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2787:21:
|
2787 | theorem divdiv: $ a // b // c = a // (b * c) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:2798:22:
|
2798 | theorem divmod1: $ a // b % c = a % (b * c) // b $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:2807:22:
|
2807 | theorem divmod2: $ a // b % c = a % (c * b) // b $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:2810:26:
|
2810 | theorem divmoddilem: $ a != 0 ->
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2819:22:
|
2819 | theorem mdmcan1: $ a != 0 -> (a * b) // (a * c) = b // c $ = '(anld divmoddilem);
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2820:22:
|
2820 | theorem mdmcan2: $ c != 0 -> (a * c) // (b * c) = a // b $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2823:23:
|
2823 | theorem mulmoddi: $ a * (b % c) = (a * b) % (a * c) $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2828:27:
|
2828 | theorem mulmoddir: $ (a % b) * c = (a * c) % (b * c) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2833:3:
|
2833 | @(add-eval @ fn (a b) {{(eval b) % (eval a)} = 0})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:2835:8:
|
2835 | infixl dvd: $||$ prec 50;
| ^
error: term 'dvd' not declared
../examples/peano.mm1:2837:19:
|
2837 | theorem idvd: $ c * a = b -> a || b $ = '(!! iexe x @ eqeq1d muleq1);
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2838:20:
|
2838 | theorem idvd2: $ a * c = b -> a || b $ = '(sylbi (eqeq1 mulcom) idvd);
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:2840:21:
|
2840 | theorem divmul: $ b || a -> a // b * b = a $ =
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:2844:22:
|
2844 | theorem muldiv3: $ b || a -> b * (a // b) = a $ = '(syl5eq mulcom divmul);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:2846:22:
|
2846 | theorem dvdadd1: $ n || a -> (n || b <-> n || a + b) $ =
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:2858:22:
|
2858 | theorem dvdadd2: $ n || a -> (n || b <-> n || b + a) $ =
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:2861:22:
|
2861 | theorem dvdmul1: $ a || b * a $ = '(idvd eqid);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:2862:22:
|
2862 | theorem dvdmul2: $ a || a * b $ = '(mpbi (dvdeq2 mulcom) dvdmul1);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:2864:20:
|
2864 | theorem dvdtr: $ a || b -> b || c -> a || c $ =
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:2867:23:
|
2867 | theorem dvdmul12: $ a || b -> a || c * b $ = '(mpi dvdmul1 dvdtr);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:2868:23:
|
2868 | theorem dvdmul11: $ a || b -> a || b * c $ = '(mpi dvdmul2 dvdtr);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:2870:21:
|
2870 | theorem modeq0: $ a % n = 0 <-> n || a $ =
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/peano.mm1:2876:20:
|
2876 | theorem dvd02: $ a || 0 $ = '(idvd mul01);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:2877:20:
|
2877 | theorem dvd01: $ 0 || a <-> a = 0 $ =
| ^
error: expecting (
../examples/peano.mm1:2880:20:
|
2880 | theorem dvdid: $ a || a $ = '(idvd mul11);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:2882:29:
|
2882 | theorem dvdle (h1: $ G -> b != 0 $) (h2: $ G -> a || b $): $ G -> a <= b $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:2887:32:
|
2887 | theorem dvdasymd (h1: $ G -> a || b $) (h2: $ G -> b || a $): $ G -> a = b $ =
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:2892:20:
|
2892 | theorem dvd11: $ 1 || a $ = '(idvd mul12);
| ^
error: expecting (
../examples/peano.mm1:2893:20:
|
2893 | theorem dvd12: $ a || 1 <-> a = 1 $ =
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:2898:22:
|
2898 | theorem d2dvd1: $ ~2 || 1 $ = '(mt (dvdle (a1i d1ne0) id) @ mpbi ltnle d1lt2);
| ^
error: expecting prefix >= 0
../examples/peano.mm1:2900:21:
|
2900 | theorem d2dvdS: $ 2 || suc n <-> ~2 || n $ =
| ^
error: expecting (
../examples/peano.mm1:2907:22:
|
2907 | theorem modlteq: $ a < n -> a % n = a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2910:23:
|
2910 | theorem modmodid: $ a % n % n = a % n $ =
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/peano.mm1:2913:24:
|
2913 | theorem dvdsubmod: $ n || a - a % n $ = '(idvd2 @ eqcom @ eqsub1 @ divmod);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:2915:21:
|
2915 | theorem div2lt: $ 0 < n -> n // 2 < n $ =
| ^
error: expecting (
../examples/peano.mm1:2918:31:
|
2918 | theorem boolmod2: $ bool (n % 2) $ = '(modlt d2ne0);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:2920:3:
|
2920 | @(add-eval @ fn (n a b) (def e (eval n)) {{(eval a) % e} = {(eval b) % e}})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:2922:10:
|
2922 | notation eqm (n a b) = ($mod($:50) n ($):$:50) a ($=$:50) b;
| ^
error: term 'eqm' not declared
../examples/peano.mm1:2924:22:
|
2924 | theorem eqmid: $ mod(n): a = a $ = 'eqid;
| ^
error: expecting (
../examples/peano.mm1:2925:22:
|
2925 | theorem eqmtr: $ mod(n): a = b -> mod(n): b = c -> mod(n): a = c $ = 'eqtr;
| ^
error: expecting (
../examples/peano.mm1:2926:23:
|
2926 | theorem eqmcom: $ mod(n): a = b -> mod(n): b = a $ = 'eqcom;
| ^
error: expecting (
../examples/peano.mm1:2927:24:
|
2927 | theorem eqmcomb: $ mod(n): a = b <-> mod(n): b = a $ = '(ibii eqmcom eqmcom);
| ^
error: expecting (
../examples/peano.mm1:2929:20:
|
2929 | theorem eqeqm: $ a = b -> mod(n): a = b $ = '(mpbii eqmid eqmeq3);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2930:29:
|
2930 | theorem eqeqmd (h: $ G -> a = b $): $ G -> mod(n): a = b $ = '(syl eqeqm h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2932:32:
|
2932 | theorem eqmeq23d (h1: $ G -> a = b $) (h2: $ G -> c = d $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:2935:35:
|
2935 | theorem eqmeqm23d (h1: $ G -> mod(n): a = b $) (h2: $ G -> mod(n): c = d $):
| ^
error: expecting (
../examples/peano.mm1:2941:23:
|
2941 | theorem eqmmod: $ mod(n): a % n = a $ = 'modmodid;
| ^
error: expecting (
../examples/peano.mm1:2943:22:
|
2943 | theorem eqm03: $ mod(n): a = 0 <-> n || a $ = '(bitr (eqeq2 mod01) modeq0);
| ^
error: expecting (
../examples/peano.mm1:2944:23:
|
2944 | theorem eqmid0: $ mod(n): n = 0 $ = '(mpbir eqm03 dvdid);
| ^
error: expecting (
../examples/peano.mm1:2946:24:
|
2946 | theorem eqmdvdsub: $ a <= b -> (mod(n): a = b <-> n || b - a) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2964:24:
|
2964 | theorem eqmaddlem: $ a <= b -> (mod(n): a + c = b + c <-> mod(n): a = b) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:2967:24:
|
2967 | theorem eqmadd1: $ mod(n): a + c = b + c <-> mod(n): a = b $ =
| ^
error: expecting (
../examples/peano.mm1:2969:24:
|
2969 | theorem eqmadd2: $ mod(n): a + b = a + c <-> mod(n): b = c $ =
| ^
error: expecting (
../examples/peano.mm1:2971:23:
|
2971 | theorem eqmsuc: $ mod(n): suc a = suc b <-> mod(n): a = b $ =
| ^
error: expecting (
../examples/peano.mm1:2974:33:
|
2974 | theorem eqmadd1d (h: $ G -> mod(n): a = b $): $ G -> mod(n): a + c = b + c $ =
| ^
error: expecting (
../examples/peano.mm1:2976:33:
|
2976 | theorem eqmadd2d (h: $ G -> mod(n): b = c $): $ G -> mod(n): a + b = a + c $ =
| ^
error: expecting (
../examples/peano.mm1:2979:33:
|
2979 | theorem eqmaddd (h1: $ G -> mod(n): a = b $) (h2: $ G -> mod(n): c = d $):
| ^
error: expecting (
../examples/peano.mm1:2983:23:
|
2983 | theorem eqmdvd: $ mod(n): a = b -> (n || a <-> n || b) $ = '(bitr3g eqm03 eqm03 eqeq1);
| ^
error: expecting (
../examples/peano.mm1:2985:24:
|
2985 | theorem eqmaddn: $ mod(n): a + n = a $ =
| ^
error: expecting (
../examples/peano.mm1:2988:30:
|
2988 | theorem dvdeqm (h1: $ G -> m || n $)
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:2996:21:
|
2996 | theorem modmod: $ m || n -> a % n % m = a % m $ = '(dvdeqm id @ a1i eqmmod);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:2998:22:
|
2998 | theorem eqm11: $ mod(1): a = b $ = '(eqtr4 mod12 mod12);
| ^
error: expecting (
../examples/peano.mm1:2999:22:
|
2999 | theorem eqm01: $ mod(0): a = b <-> a = b $ = '(eqeq mod0 mod0);
| ^
error: expecting (
../examples/peano.mm1:3005:3:
|
3005 | @(add-eval @ fn (a) {(eval a) shl 1})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:3012:3:
|
3012 | @(add-eval @ fn (a) {{(eval a) shl 1} + 1})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:3016:3:
|
3016 | @(add-eval @ fn (a) {{(eval a) band 1} = 1})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:3019:19:
|
3019 | theorem b00: $ b0 0 = 0 $ = 'add0;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:3020:19:
|
3020 | theorem b10: $ b1 0 = 1 $ = '(suceq b00);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:3022:22:
|
3022 | theorem b0mul21: $ 2 * n = b0 n $ = 'mul21;
| ^
error: expecting (
../examples/peano.mm1:3023:22:
|
3023 | theorem b0mul22: $ n * 2 = b0 n $ = 'mul22;
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:3025:23:
|
3025 | theorem b0ne0: $ b0 n != 0 <-> n != 0 $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:3028:23:
|
3028 | theorem b1ne0: $ b1 n != 0 $ = 'peano1;
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:3030:22:
|
3030 | theorem b1mul21: $ 2 * n + 1 = b1 n $ = '(eqtr (addeq1 b0mul21) add12);
| ^
error: expecting (
../examples/peano.mm1:3032:21:
|
3032 | theorem b0dvd2: $ 2 || b0 n $ = '(idvd b0mul22);
| ^
error: expecting (
../examples/peano.mm1:3033:22:
|
3033 | theorem b1dvd2: $ ~2 || b1 n $ = '(mpbi (con2b d2dvdS) b0dvd2);
| ^
error: expecting prefix >= 0
../examples/peano.mm1:3035:25:
|
3035 | theorem dfodd2: $ odd n <-> true (n % 2) $ = '(bicom @ dftrue2 boolmod2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3036:25:
|
3036 | theorem odddvd: $ odd n <-> ~ 2 || n $ = '(bitr dfodd2 @ noteq modeq0);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3037:41:
|
3037 | theorem boolodd: $ bool n -> (odd n <-> true n) $ = '(syl5bb dfodd2 @ trueeqd modlteq);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3039:19:
|
3039 | theorem b0odd: $ ~odd (b0 n) $ = '(mpbi (con2b odddvd) b0dvd2);
| ^
error: odd is not a function
../examples/peano.mm1:3040:18:
|
3040 | theorem b1odd: $ odd (b1 n) $ = '(mpbir odddvd b1dvd2);
| ^
error: odd is not a function
../examples/peano.mm1:3041:31:
|
3041 | theorem oddnat: $ odd (nat p) <-> p $ = '(bitr (boolodd boolnat) truenat);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3043:24:
|
3043 | theorem b0mod2: $ b0 n % 2 = 0 $ = '(mpbir modeq0 b0dvd2);
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/peano.mm1:3044:24:
|
3044 | theorem b1mod2: $ b1 n % 2 = 1 $ = 'b1odd;
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/peano.mm1:3046:24:
|
3046 | theorem b0div2: $ b0 n // 2 = n $ = '(eqtr3 (diveq1 b0mul21) (muldiv2 d2ne0));
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3047:24:
|
3047 | theorem b1div2: $ b1 n // 2 = n $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3049:23:
|
3049 | theorem b0can: $ b0 a = b0 b <-> a = b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3051:23:
|
3051 | theorem b1can: $ b1 a = b1 b <-> a = b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3053:24:
|
3053 | theorem b1neb0: $ b1 a != b0 b $ = '(mt (mpbii b1odd oddeq) b0odd);
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:3054:24:
|
3054 | theorem b0neb1: $ b0 a != b1 b $ = '(necom b1neb0);
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:3056:29:
|
3056 | theorem sucb0: $ suc (b0 a) = b1 a $ = 'eqid;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3057:29:
|
3057 | theorem sucb1: $ suc (b1 a) = b0 (suc a) $ = '(eqtr2 addS1 @ suceq addS);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3058:24:
|
3058 | theorem addb00: $ b0 a + b0 b = b0 (a + b) $ = 'add4;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:3059:24:
|
3059 | theorem addb01: $ b0 a + b1 b = b1 (a + b) $ = '(eqtr addS @ suceq addb00);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:3060:24:
|
3060 | theorem addb10: $ b1 a + b0 b = b1 (a + b) $ = '(eqtr addcom @ eqtr addb01 @ b1eq addcom);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:3061:24:
|
3061 | theorem addb11: $ b1 a + b1 b = b0 (suc (a + b)) $ = '(eqtr addS @ eqtr (suceq addb10) sucb1);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:3063:19:
|
3063 | theorem b0le: $ a <= b <-> b0 a <= b0 b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3065:19:
|
3065 | theorem b1le: $ a <= b <-> b1 a <= b1 b $ = '(bitr b0le lesuc);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3067:19:
|
3067 | theorem b0lt: $ a < b <-> b0 a < b0 b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3069:19:
|
3069 | theorem b1lt: $ a < b <-> b1 a < b1 b $ = '(bitr b0lt ltsuc);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3070:24:
|
3070 | theorem b0ltb1: $ b0 a < b1 b <-> a <= b $ = '(bicom b1le);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3071:24:
|
3071 | theorem b1ltb0: $ b1 a < b0 b <-> a < b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3073:24:
|
3073 | theorem b0leb1: $ b0 a <= b1 b <-> a <= b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3075:24:
|
3075 | theorem b1leb0: $ b1 a <= b0 b <-> a < b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3078:21:
|
3078 | theorem b0orb1: $ n = b0 (n // 2) \/ n = b1 (n // 2) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3082:21:
|
3082 | theorem b0leid: $ n <= b0 n $ = 'leaddid1;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3083:21:
|
3083 | theorem b1ltid: $ n < b1 n $ = '(mpbi leltsuc b0leid);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3084:21:
|
3084 | theorem b1leid: $ n <= b1 n $ = '(ltle b1ltid);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3085:21:
|
3085 | theorem b0ltid: $ n != 0 <-> n < b0 n $ = '(bitr3 lt01 @ bitr ltadd2 @ lteq1 add0);
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:3087:24:
|
3087 | theorem ltb0tr (h: $ a < b $): $ a < b0 b $ = '(ltletr h b0leid);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3088:24:
|
3088 | theorem ltb1tr (h: $ a <= b $): $ a < b1 b $ = '(lelttr h b1ltid);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3089:24:
|
3089 | theorem leb0tr (h: $ a <= b $): $ a <= b0 b $ = '(letr h b0leid);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3090:24:
|
3090 | theorem leb1tr (h: $ a <= b $): $ a <= b1 b $ = '(ltle @ ltb1tr h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3092:25:
|
3092 | theorem eqb0: $ ~ odd n <-> n = b0 (n // 2) $ =
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:3094:23:
|
3094 | theorem eqb1: $ odd n <-> n = b1 (n // 2) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3097:30:
|
3097 | theorem splitb (h0: $ G -> a = b0 (a // 2) -> p $) (h1: $ G -> a = b1 (a // 2) -> p $): $ G -> p $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3100:30:
|
3100 | theorem splitb0 (h: $ G -> a = b0 c -> p $): $ G -> b = c -> a = b0 b -> p $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3103:30:
|
3103 | theorem splitb1 (h: $ G -> a = b1 c -> p $): $ G -> b = c -> a = b1 b -> p $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3106:23:
|
3106 | theorem odd0: $ ~ odd 0 $ = '(mtbir (eqeq1 mod01) (mt eqcom d1ne0));
| ^
error: unexpected '0'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:3107:29:
|
3107 | theorem oddS: $ odd (suc n) <-> ~odd n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3109:21:
|
3109 | theorem odd1: $ odd 1 $ = '(mpbir oddS odd0);
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/peano.mm1:3115:3:
|
3115 | @(add-eval @ fn (a b) (cons (eval a) (eval b)))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:3117:8:
|
3117 | infixr pr: $,$ prec 55;
| ^
error: term 'pr' not declared
../examples/peano.mm1:3119:38:
|
3119 | theorem nfpr (a b: nat x) (h1: $ FN/ x a $) (h2: $ FN/ x b $): $ FN/ x a, b $ =
| ^
error: expecting (
../examples/peano.mm1:3122:21:
|
3122 | theorem preqadd: $ a, b = (a + b, 0) + b $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3125:21:
|
3125 | theorem prlem1: $ 2 || n * suc n $ = '(cases dvdmul11 @ sylbir d2dvdS dvdmul12);
| ^
error: expecting (
../examples/peano.mm1:3127:20:
|
3127 | theorem prlem2: $ a, c <= b, d -> a + c <= b + d $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3137:18:
|
3137 | theorem prth: $ a, c = b, d <-> a = b /\ c = d $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3147:21:
|
3147 | theorem prltsuc: $ a, b < suc (a + b), 0 $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3150:22:
|
3150 | theorem addlepr: $ a + b <= a, b $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:3156:22:
|
3156 | theorem leprid1: $ a <= a, b $ = '(letr leaddid1 addlepr);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3157:22:
|
3157 | theorem leprid2: $ b <= a, b $ = '(letr leaddid2 addlepr);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3159:25:
|
3159 | theorem lepr1tr (h: $ a <= b $): $ a <= b, c $ = '(letr h leprid1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3160:25:
|
3160 | theorem lepr2tr (h: $ a <= c $): $ a <= b, c $ = '(letr h leprid2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3161:25:
|
3161 | theorem ltpr1tr (h: $ a < b $): $ a < b, c $ = '(ltletr h leprid1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3162:25:
|
3162 | theorem ltpr2tr (h: $ a < c $): $ a < b, c $ = '(ltletr h leprid2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3164:20:
|
3164 | theorem lepr1: $ a <= b <-> a, c <= b, c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3169:20:
|
3169 | theorem lepr2: $ b <= c <-> a, b <= a, c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3175:20:
|
3175 | theorem ltpr1: $ a < b <-> a, c < b, c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3177:20:
|
3177 | theorem ltpr2: $ b < c <-> a, b < a, c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3187:3:
|
3187 | @(add-eval @ fn (a) (eval-fst (eval a)))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:3190:3:
|
3190 | @(add-eval @ fn (a) (eval-snd (eval a)))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:3193:21:
|
3193 | pub theorem pr0: $ 0, 0 = 0 $ =
| ^
error: expecting (
../examples/peano.mm1:3196:29:
|
3196 | theorem expr: $ E. x E. y a = x, y $ =
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:3223:36:
|
3223 | theorem splitpr {x y} (h: $ G -> a = x, y -> p $): $ G -> p $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3226:31:
|
3226 | theorem splitpr1 (h: $ G -> a = x, y -> p $): $ G -> b = x -> a = b, y -> p $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3229:31:
|
3229 | theorem splitpr2 (h: $ G -> a = x, y -> p $): $ G -> b = y -> a = x, b -> p $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3232:32:
|
3232 | theorem splitopt (h0: $ G -> a = 0 -> p $) (h1: $ G -> a = suc (a - 1) -> p $): $ G -> p $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3235:32:
|
3235 | theorem splitoptS (h: $ G -> a = suc c -> p $): $ G -> b = c -> a = suc b -> p $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3283:41:
|
3283 | pub theorem fstpr (a b: nat): $ fst (a, b) = a $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3287:41:
|
3287 | pub theorem sndpr (a b: nat): $ snd (a, b) = b $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3291:37:
|
3291 | pub theorem fstsnd (a: nat): $ fst a, snd a = a $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3294:26:
|
3294 | theorem fstleid: $ fst a <= a $ = '(mpbi (leeq2 fstsnd) leprid1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3295:26:
|
3295 | theorem sndleid: $ snd a <= a $ = '(mpbi (leeq2 fstsnd) leprid2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3297:21:
|
3297 | theorem axext2: $ A == B <-> A. x A. y (x, y e. A <-> x, y e. B) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3300:40:
|
3300 | theorem eqrd2 (G) {x y} (h: $ G -> (x, y e. A <-> x, y e. B) $): $ G -> A == B $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3302:28:
|
3302 | theorem eqri2 {x y} (h: $ x, y e. A <-> x, y e. B $): $ A == B $ = '(trud @ eqrd2 @ a1i h);
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3303:25:
|
3303 | theorem ssal2: $ A C_ B <-> A. x A. y (x, y e. A -> x, y e. B) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3306:37:
|
3306 | theorem ssrd2 (G) {x y} (h: $ G -> x, y e. A -> x, y e. B $): $ G -> A C_ B $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3308:28:
|
3308 | theorem ssri2 {x y} (h: $ x, y e. A -> x, y e. B $): $ A C_ B $ = '(trud @ ssrd2 @ a1i h);
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3310:21:
|
3310 | theorem fst0: $ fst 0 = 0 $ = '(eqtr3 (fsteq pr0) fstpr);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:3311:21:
|
3311 | theorem snd0: $ snd 0 = 0 $ = '(eqtr3 (sndeq pr0) sndpr);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:3314:3:
|
3314 | @(add-eval @ fn (a) (eval-fst @ eval-fst @ eval a))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:3317:3:
|
3317 | @(add-eval @ fn (a) (eval-snd @ eval-fst @ eval a))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:3320:3:
|
3320 | @(add-eval @ fn (a) (eval-fst @ eval-snd @ eval a))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:3323:3:
|
3323 | @(add-eval @ fn (a) (eval-snd @ eval-snd @ eval a))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:3326:3:
|
3326 | @(add-eval @ fn (a) (eval-fst @ eval-snd @ eval-snd @ eval a))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:3329:3:
|
3329 | @(add-eval @ fn (a) (eval-snd @ eval-snd @ eval-snd @ eval a))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:3332:29:
|
3332 | theorem pi11pr: $ pi11 ((a, b), c) = a $ = '(eqtr (fsteq fstpr) fstpr);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3333:29:
|
3333 | theorem pi12pr: $ pi12 ((a, b), c) = b $ = '(eqtr (sndeq fstpr) sndpr);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3334:28:
|
3334 | theorem pi21pr: $ pi21 (a, b, c) = b $ = '(eqtr (fsteq sndpr) fstpr);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3335:28:
|
3335 | theorem pi22pr: $ pi22 (a, b, c) = c $ = '(eqtr (sndeq sndpr) sndpr);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3336:30:
|
3336 | theorem pi221pr: $ pi221 (a, b, c, d) = c $ = '(eqtr (fsteq pi22pr) fstpr);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3337:30:
|
3337 | theorem pi222pr: $ pi222 (a, b, c, d) = d $ = '(eqtr (sndeq pi22pr) sndpr);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3341:3:
|
3341 | @(derive-eq 'isf) def isfun (A: set): wff =
| ^
error: Reference to unbound variable 'derive-eq'
../examples/peano.mm1:3344:52:
|
3344 | theorem nfisf (F: set x) (hF: $ FS/ x F $): $ F/ x isfun F $ =
| ^
error: isfun is not a function
../examples/peano.mm1:3347:26:
|
3347 | theorem isfd (h1: $ G -> isfun F $)
| ^
error: isfun is not a function
../examples/peano.mm1:3354:27:
|
3354 | theorem isfbd (h1: $ G -> isfun F $) (h2: $ G -> a, b e. F $):
| ^
error: isfun is not a function
../examples/peano.mm1:3358:18:
|
3358 | theorem isfss: $ A C_ B -> isfun B -> isfun A $ =
| ^
error: A is not a function
../examples/peano.mm1:3370:1:
|
3370 | @_ def sab {x: nat} (A: set x): set = $ {z | snd z e. S[fst z / x] A} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:3370:57:
|
3370 | @_ def sab {x: nat} (A: set x): set = $ {z | snd z e. S[fst z / x] A} $;
| ^
error: expecting (
../examples/peano.mm1:3371:10:
|
3371 | notation sab {x: nat} (A: set x): set = ($S\$:100) x ($,$:55) A;
| ^
error: term 'sab' not declared
../examples/peano.mm1:3373:57:
|
3373 | theorem nfsab (A: set x y) (h: $ FS/ y A $): $ FS/ y S\ x, A $ =
| ^
error: expecting ( or infix >= max
../examples/peano.mm1:3375:39:
|
3375 | theorem nfsab1 (A: set x): $ FS/ x S\ x, A $ =
| ^
error: expecting ( or infix >= max
../examples/peano.mm1:3377:38:
|
3377 | theorem sabeq (A B: set x): $ A. x A == B -> S\ x, A == S\ x, B $ =
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:3379:37:
|
3379 | theorem sabeqi (A B: set x) (h: $ A == B $): $ S\ x, A == S\ x, B $ = '(sabeq @ ax_gen h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3381:34:
|
3381 | theorem cbvsabs (A: set x): $ S\ x, A == S\ y, (S[y / x] A) $ =
| ^
error: expecting (
../examples/peano.mm1:3384:11:
|
3384 | (h: $ G /\ x = y -> A == B $): $ G -> S\ x, A == S\ y, B $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3387:31:
|
3387 | theorem elsabs (A: set x): $ a, b e. S\ x, A <-> b e. S[a / x] A $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3390:34:
|
3390 | theorem elsab (A: set x) (h: $ x = a -> A == B $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3394:36:
|
3394 | theorem elsabed (A: set x) (h: $ G /\ x = a -> (b e. A <-> p) $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3399:35:
|
3399 | theorem elsabe (A: set x) (h: $ x = a -> (b e. A <-> p) $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3403:18:
|
3403 | $ G -> y e. S\ x, A -> p $ =
| ^
error: expecting (
../examples/peano.mm1:3409:34:
|
3409 | theorem sabss (A B: set x): $ S\ x, A C_ S\ x, B <-> A. x A C_ B $ =
| ^
error: expecting (
../examples/peano.mm1:3415:35:
|
3415 | theorem sabssi (A B: set x) (h: $ A C_ B $): $ S\ x, A C_ S\ x, B $ = '(mpbir sabss @ ax_gen h);
| ^
error: A is not a function
../examples/peano.mm1:3416:40:
|
3416 | theorem sabssd (A B: set x) (h: $ G -> A C_ B $): $ G -> S\ x, A C_ S\ x, B $ = '(sylibr sabss @ iald h);
| ^
error: A is not a function
../examples/peano.mm1:3420:1:
|
3420 | @_ def xab {x: nat} (A: set) (B: set x): set =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:3421:22:
|
3421 | $ {z | fst z e. A /\ snd z e. S[fst z / x] B} $;
| ^
error: expecting infix >= 1 or }
../examples/peano.mm1:3422:10:
|
3422 | notation xab {x: nat} (A: set) (B: set x): set = ($X\$:100) x ($e.$:50) A ($,$:55) B;
| ^
error: term 'xab' not declared
../examples/peano.mm1:3424:78:
|
3424 | theorem nfxab (A B: set x y) (h1: $ FS/ y A $) (h2: $ FS/ y B $): $ FS/ y X\ x e. A, B $ =
| ^
error: expecting ( or infix >= max
../examples/peano.mm1:3426:59:
|
3426 | theorem nfxab1 (A B: set x) (h1: $ FS/ x A $): $ FS/ x X\ x e. A, B $ =
| ^
error: expecting ( or infix >= max
../examples/peano.mm1:3429:39:
|
3429 | theorem xabeq2da (B C: set x) (h: $ G /\ x e. A -> B == C $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3435:34:
|
3435 | theorem cbvxabs (B: set x): $ X\ x e. A, B == X\ y e. A, (S[y / x] B) $ =
| ^
error: expecting (
../examples/peano.mm1:3439:6:
|
3439 | $ a, b e. X\ x e. A, B <-> a e. A /\ b e. S[a / x] B $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3443:34:
|
3443 | theorem elxab (B: set x) (h: $ x = a -> B == C $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3447:36:
|
3447 | theorem elxabed (B: set x) (h: $ G /\ x = a -> (b e. B <-> p) $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3452:35:
|
3452 | theorem elxabe (B: set x) (h: $ x = a -> (b e. B <-> p) $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3456:36:
|
3456 | theorem elxabe2 (B: set x) (h: $ x = fst a -> (snd a e. B <-> p) $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3460:37:
|
3460 | theorem xabssd (B C: set x) (h: $ G /\ x e. A -> B C_ C $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3467:13:
|
3467 | $ G -> S\ x, B == X\ x e. A, B $ =
| ^
error: expecting (
../examples/peano.mm1:3473:3:
|
3473 | @(derive-eq 'xp) def Xp (A B: set): set = $ X\ x e. A, B $;
| ^
error: Reference to unbound variable 'derive-eq'
../examples/peano.mm1:3475:72:
|
3475 | theorem nfxp (A B: set x) (h1: $ FS/ x A $) (h2: $ FS/ x B $): $ FS/ x Xp A B $ =
| ^
error: Xp is not a function
../examples/peano.mm1:3477:20:
|
3477 | theorem prelxp: $ a, b e. Xp A B <-> a e. A /\ b e. B $ = '(!! elxab x eqsidd);
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3478:29:
|
3478 | theorem elxp: $ a e. Xp A B <-> fst a e. A /\ snd a e. B $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3480:26:
|
3480 | theorem xpvv: $ Xp _V _V == _V $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3482:36:
|
3482 | theorem cplxpv1: $ Compl (Xp _V A) == Xp _V (Compl A) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3485:36:
|
3485 | theorem cplxpv2: $ Compl (Xp A _V) == Xp (Compl A) _V $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3488:18:
|
3488 | theorem xpss1: $ A C_ B -> Xp A C C_ Xp B C $ =
| ^
error: A is not a function
../examples/peano.mm1:3490:18:
|
3490 | theorem xpss2: $ B C_ C -> Xp A B C_ Xp A C $ =
| ^
error: B is not a function
../examples/peano.mm1:3492:28:
|
3492 | theorem xpundi: $ Xp (A u. B) C == Xp A C u. Xp B C $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3495:31:
|
3495 | theorem xpundir: $ Xp A (B u. C) == Xp A B u. Xp A C $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3498:29:
|
3498 | theorem xpindi: $ Xp (A i^i B) C == Xp A C i^i Xp B C $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3501:32:
|
3501 | theorem xpindir: $ Xp A (B i^i C) == Xp A B i^i Xp A C $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3504:23:
|
3504 | theorem xpfst: $ a e. Xp A B -> fst a e. A $ = '(sylbi elxp anl);
| ^
error: Xp is not a function
../examples/peano.mm1:3505:23:
|
3505 | theorem xpsnd: $ a e. Xp A B -> snd a e. B $ = '(sylbi elxp anr);
| ^
error: Xp is not a function
../examples/peano.mm1:3506:21:
|
3506 | theorem prelxp1: $ a, b e. Xp A B -> a e. A $ = '(sylbi prelxp anl);
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3507:21:
|
3507 | theorem prelxp2: $ a, b e. Xp A B -> b e. B $ = '(sylbi prelxp anr);
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3508:67:
|
3508 | theorem xpTd (h1: $ G -> a e. A $) (h2: $ G -> b e. B $): $ G -> a, b e. Xp A B $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3511:24:
|
3511 | theorem xppi11: $ a e. Xp (Xp A B) C -> pi11 a e. A $ = '(rsyl xpfst xpfst);
| ^
error: Xp is not a function
../examples/peano.mm1:3512:24:
|
3512 | theorem xppi12: $ a e. Xp (Xp A B) C -> pi12 a e. B $ = '(rsyl xpfst xpsnd);
| ^
error: Xp is not a function
../examples/peano.mm1:3513:24:
|
3513 | theorem xppi21: $ a e. Xp A (Xp B C) -> pi21 a e. B $ = '(rsyl xpsnd xpfst);
| ^
error: Xp is not a function
../examples/peano.mm1:3514:24:
|
3514 | theorem xppi22: $ a e. Xp A (Xp B C) -> pi22 a e. C $ = '(rsyl xpsnd xpsnd);
| ^
error: Xp is not a function
../examples/peano.mm1:3515:25:
|
3515 | theorem xppi221: $ a e. Xp A (Xp B (Xp C D)) -> pi221 a e. C $ = '(rsyl xppi22 xpfst);
| ^
error: Xp is not a function
../examples/peano.mm1:3516:25:
|
3516 | theorem xppi222: $ a e. Xp A (Xp B (Xp C D)) -> pi222 a e. D $ = '(rsyl xppi22 xpsnd);
| ^
error: Xp is not a function
../examples/peano.mm1:3518:18:
|
3518 | theorem xpfin: $ finite A -> finite B -> finite (Xp A B) $ =
| ^
error: finite is not a function
../examples/peano.mm1:3528:24:
|
3528 | theorem xabconst: $ X\ x e. A, B == Xp A B $ =
| ^
error: expecting (
../examples/peano.mm1:3532:11:
|
3532 | (h: $ G /\ x = fst a -> snd a e. B -> p /\ x e. A /\ snd a e. C $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3537:37:
|
3537 | theorem sabssxpe (B: set x) (h: $ x = fst a -> snd a e. B -> x e. A /\ snd a e. C $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3543:3:
|
3543 | @(derive-eq 'dm) def Dom (A: set): set = $ {x | E. y x, y e. A} $;
| ^
error: Reference to unbound variable 'derive-eq'
../examples/peano.mm1:3546:3:
|
3546 | @(derive-eq 'rn) def Ran (A: set): set = $ {y | E. x x, y e. A} $;
| ^
error: Reference to unbound variable 'derive-eq'
../examples/peano.mm1:3550:3:
|
3550 | @(derive-eq 'ima) def Im (F A: set): set = $ {y | E. x (x e. A /\ x, y e. F)} $;
| ^
error: Reference to unbound variable 'derive-eq'
../examples/peano.mm1:3551:8:
|
3551 | infixl Im: $''$ prec 80;
| ^
error: term 'Im' not declared
../examples/peano.mm1:3553:51:
|
3553 | theorem nfdm (A: set x) (h: $ FS/ x A $): $ FS/ x Dom A $ = (named '(nfab @ nfex @ nfel2 h));
| ^
error: Dom is not a function
../examples/peano.mm1:3554:51:
|
3554 | theorem nfrn (A: set x) (h: $ FS/ x A $): $ FS/ x Ran A $ = (named '(nfab @ nfex @ nfel2 h));
| ^
error: Ran is not a function
../examples/peano.mm1:3555:28:
|
3555 | theorem eldm: $ a e. Dom A <-> E. y a, y e. A $ = '(!! elabe x @ exeqd @ eleq1d preq1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3556:28:
|
3556 | theorem elrn: $ a e. Ran A <-> E. x x, a e. A $ = '(!! elabe y @ exeqd @ eleq1d preq2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3557:20:
|
3557 | theorem preldm: $ a, b e. A -> a e. Dom A $ = '(sylibr eldm @ !! iexe y @ eleq1d preq2);
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3558:20:
|
3558 | theorem prelrn: $ a, b e. A -> b e. Ran A $ = '(sylibr elrn @ !! iexe x @ eleq1d preq1);
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3559:30:
|
3559 | theorem fsteldm: $ p e. A -> fst p e. Dom A $ = '(sylbir (eleq1 fstsnd) preldm);
| ^
error: fst is not a function
../examples/peano.mm1:3560:30:
|
3560 | theorem sndelrn: $ p e. A -> snd p e. Ran A $ = '(sylbir (eleq1 fstsnd) prelrn);
| ^
error: snd is not a function
../examples/peano.mm1:3562:27:
|
3562 | theorem dmun: $ Dom (A u. B) == Dom A u. Dom B $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3564:27:
|
3564 | theorem rnun: $ Ran (A u. B) == Ran A u. Ran B $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3566:17:
|
3566 | theorem dmss: $ A C_ B -> Dom A C_ Dom B $ = '(sylibr equn1 @ sylbi equn1 @ syl5eqsr dmun dmeq);
| ^
error: A is not a function
../examples/peano.mm1:3567:17:
|
3567 | theorem rnss: $ A C_ B -> Ran A C_ Ran B $ = '(sylibr equn1 @ sylbi equn1 @ syl5eqsr rnun rneq);
| ^
error: A is not a function
../examples/peano.mm1:3569:28:
|
3569 | theorem ssdm: $ Dom R C_ A <-> R C_ Xp A _V $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3572:28:
|
3572 | theorem ssrn: $ Ran R C_ A <-> R C_ Xp _V A $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3576:18:
|
3576 | theorem dmfin: $ finite A -> finite (Dom A) $ =
| ^
error: finite is not a function
../examples/peano.mm1:3579:18:
|
3579 | theorem rnfin: $ finite A -> finite (Ran A) $ =
| ^
error: finite is not a function
../examples/peano.mm1:3583:25:
|
3583 | theorem elima: $ b e. F '' A <-> E. x (x e. A /\ x, b e. F) $ =
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/peano.mm1:3585:20:
|
3585 | theorem elimai: $ a, b e. F -> a e. A -> b e. F '' A $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3587:18:
|
3587 | theorem imv: $ F '' _V == Ran F $ =
| ^
error: unexpected '''
expecting '$' or infix >= 0
../examples/peano.mm1:3591:1:
|
3591 | @_ def cnv (A: set): set = $ S\ x, {y | y, x e. A} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:3591:33:
|
3591 | @_ def cnv (A: set): set = $ S\ x, {y | y, x e. A} $;
| ^
error: expecting (
../examples/peano.mm1:3593:19:
|
3593 | theorem prcnv: $ x, y e. cnv A <-> y, x e. A $ = '(elsabe @ elabed ,eqtac);
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3595:41:
|
3595 | theorem cnvopab (p: wff x y): $ cnv (S\ x, {y | p}) == S\ y, {x | p} $ =
| ^
error: expecting (
../examples/peano.mm1:3605:3:
|
3605 | @(derive-eq 'co) def comp (F G: set): set =
| ^
error: Reference to unbound variable 'derive-eq'
../examples/peano.mm1:3607:8:
|
3607 | infixr comp: $o>$ prec 91;
| ^
error: term 'comp' not declared
../examples/peano.mm1:3609:18:
|
3609 | theorem prco: $ x, z e. A o> B <-> E. y (x, y e. A /\ y, z e. B) $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3614:1:
|
3614 | @_ def res (A B: set): set = $ A i^i Xp B _V $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:3614:34:
|
3614 | @_ def res (A B: set): set = $ A i^i Xp B _V $;
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:3615:8:
|
3615 | infixl res: $|`$ prec 54;
| ^
error: term 'res' not declared
../examples/peano.mm1:3617:75:
|
3617 | theorem nfres (A B: set x) (h1: $ FS/ x A $) (h2: $ FS/ x B $): $ FS/ x A |` B $ =
| ^
error: unexpected '|'
expecting '$', infix >= 0, or infix >= 10
../examples/peano.mm1:3619:25:
|
3619 | theorem elres: $ a e. A |` B <-> a e. A /\ fst a e. B $ =
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:3621:21:
|
3621 | theorem prelres: $ a, b e. A |` B <-> a, b e. A /\ a e. B $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3623:20:
|
3623 | theorem resss: $ A |` B C_ A $ = 'inss1;
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:3624:19:
|
3624 | theorem resv: $ F |` _V == F $ = '(eqstr (ineq2 xpvv) inv2);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:3625:44:
|
3625 | theorem resfin: $ finite F -> finite (F |` A) $ = '(finss resss);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3626:42:
|
3626 | theorem resisf: $ isfun F -> isfun (F |` A) $ = '(isfss resss);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3627:28:
|
3627 | theorem dmres: $ Dom (F |` A) == Dom F i^i A $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3630:28:
|
3630 | theorem rnres: $ Ran (F |` A) == F '' A $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3632:24:
|
3632 | theorem unres: $ (F u. G) |` A == (F |` A) u. (G |` A) $ = 'indir;
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3633:20:
|
3633 | theorem resun: $ F |` (A u. B) == (F |` A) u. (F |` B) $ = '(eqstr (ineq2 xpundi) indi);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:3634:29:
|
3634 | theorem eqres: $ Dom F C_ A <-> F |` A == F $ = '(bitr ssdm eqin1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3635:20:
|
3635 | theorem resdm: $ F |` Dom F == F $ = '(mpbi eqres ssid);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:3636:21:
|
3636 | theorem resres: $ F |` A |` B == F |` A i^i B $ = '(eqstr4 inass @ ineq2 xpindi);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:3640:1:
|
3640 | @_ def lam {x: nat} (a: nat x): set = $ {p | E. x p = x, a} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:3640:55:
|
3640 | @_ def lam {x: nat} (a: nat x): set = $ {p | E. x p = x, a} $;
| ^
error: expecting infix >= 1, infix >= 41, or }
../examples/peano.mm1:3641:10:
|
3641 | notation lam {x: nat} (a: nat x): set = ($\$:53) x ($,$:55) a;
| ^
error: term 'lam' not declared
../examples/peano.mm1:3643:36:
|
3643 | theorem ellam (a: nat x): $ p e. \ x, a <-> E. x p = x, a $ =
| ^
error: expecting (
../examples/peano.mm1:3645:33:
|
3645 | theorem prellams (v: nat x): $ a, b e. \ x, v <-> b = N[a / x] v $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3648:37:
|
3648 | theorem prellame (a: nat x) (h: $ x = y -> a = b $): $ y, z e. \ x, a <-> z = b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3650:38:
|
3650 | theorem lameq (a b: nat x): $ A. x a = b -> \ x, a == \ x, b $ =
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:3652:37:
|
3652 | theorem lameqi (a b: nat x) (h: $ a = b $): $ \ x, a == \ x, b $ = '(lameq @ ax_gen h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3653:38:
|
3653 | theorem nflam1 (a: nat x): $ FS/ x \ x, a $ = '(!! nfab _ p nfex1);
| ^
error: expecting ( or infix >= max
../examples/peano.mm1:3654:38:
|
3654 | theorem nflam (a: nat x y) (h: $ FN/ x a $): $ FS/ x \ y, a $ =
| ^
error: expecting (
../examples/peano.mm1:3656:43:
|
3656 | theorem cbvlamh (a b: nat x y) (h1: $ FN/ y a $) (h2: $ FN/ x b $)
| ^
error: expecting (
../examples/peano.mm1:3662:11:
|
3662 | (e: $ x = y -> a = b $): $ \ x, a == \ y, b $ = '(cbvlamh nfnv nfnv e);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3663:33:
|
3663 | theorem cbvlams (a: nat x): $ \ x, a == \ y, N[y / x] a $ = '(cbvlamh nfnv nfsbn1 sbnq);
| ^
error: expecting (
../examples/peano.mm1:3665:11:
|
3665 | (h: $ G /\ x = y -> a = b $): $ G -> \ x, a == \ y, b $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3668:39:
|
3668 | theorem lamisf (a: nat x): $ isfun (\ x, a) $ =
| ^
error: expecting (
../examples/peano.mm1:3676:53:
|
3676 | theorem finlam (v: nat x): $ finite A -> finite ((\ x, v) |` A) $ =
| ^
error: expecting (
../examples/peano.mm1:3693:65:
|
3693 | theorem finlamh (A: set x) (v: nat x): $ finite A -> finite ((\ x, v) |` A) $ =
| ^
error: expecting (
../examples/peano.mm1:3696:40:
|
3696 | theorem ellamima (v: nat x): $ a e. (\ x, v) '' A <-> E. x (x e. A /\ a = v) $ =
| ^
error: expecting (
../examples/peano.mm1:3700:53:
|
3700 | theorem ellamimaab (v: nat x) (p: wff x): $ a e. (\ x, v) '' {x | p} <-> E. x (p /\ a = v) $ =
| ^
error: expecting (
../examples/peano.mm1:3704:56:
|
3704 | theorem finlamima (v: nat x): $ finite A -> finite ((\ x, v) '' A) $ =
| ^
error: expecting (
../examples/peano.mm1:3707:39:
|
3707 | theorem lameqb (a b: nat x): $ A. x a = b <-> \ x, a == \ x, b $ =
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:3718:25:
|
3718 | $ A. x (x e. A -> a = b) -> (\ x, a) |` A == (\ x, b) |` A $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3724:36:
|
3724 | theorem dmlam (a: nat x): $ Dom (\ x, a) == _V $ =
| ^
error: expecting (
../examples/peano.mm1:3728:51:
|
3728 | theorem dmreslam (A: set x) (a: nat x): $ Dom ((\ x, a) |` A) == A $ =
| ^
error: expecting (
../examples/peano.mm1:3731:1:
|
3731 | @_ local def rapp (F: set) (x: nat): set = $ {y | x, y e. F} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:3731:54:
|
3731 | @_ local def rapp (F: set) (x: nat): set = $ {y | x, y e. F} $;
| ^
error: expecting infix >= 1 or }
../examples/peano.mm1:3732:8:
|
3732 | infixl rapp: $@'$ prec 200;
| ^
error: term 'rapp' not declared
../examples/peano.mm1:3734:67:
|
3734 | theorem nfrapp (F: set x) (a: nat x) (h1: $ FS/ x F $) (h2: $ FN/ x a $):
| ^
error: expecting (
../examples/peano.mm1:3737:26:
|
3737 | theorem elrapp: $ b e. F @' a <-> a, b e. F $ = '(elabe ,eqtac);
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/peano.mm1:3739:36:
|
3739 | theorem rappsabs (A: set x): $ (S\ x, A) @' a == S[a / x] A $ =
| ^
error: expecting (
../examples/peano.mm1:3742:35:
|
3742 | theorem rappsab (A: set x): $ (S\ x, A) @' x == A $ =
| ^
error: expecting (
../examples/peano.mm1:3745:38:
|
3745 | theorem rappsabed (A: set x) (h: $ G /\ x = a -> A == B $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3750:37:
|
3750 | theorem rappsabe (A: set x) (h: $ x = a -> A == B $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3753:39:
|
3753 | theorem rappsabed1 (A: set x) (e: $ G /\ x = a -> F @' a == A -> P $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3758:11:
|
3758 | (e: $ G /\ x = a -> A == B $): $ G -> F == S\ x, A -> F @' a == B $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3761:31:
|
3761 | theorem rappss: $ A C_ B -> A @' a C_ B @' a $ = (named '(ssabd ssel));
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/peano.mm1:3762:27:
|
3762 | theorem rappssb: $ A C_ B <-> A. x A @' x C_ B @' x $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3764:22:
|
3764 | theorem eqrappb: $ A == B <-> A. x A @' x == B @' x $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3770:1:
|
3770 | @_ def app (F: set) (x: nat): nat = $ the {y | x, y e. F} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:3770:43:
|
3770 | @_ def app (F: set) (x: nat): nat = $ the {y | x, y e. F} $;
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/peano.mm1:3771:8:
|
3771 | infixl app: $@$ prec 200;
| ^
error: term 'app' not declared
../examples/peano.mm1:3773:66:
|
3773 | theorem nfapp (F: set x) (a: nat x) (h1: $ FS/ x F $) (h2: $ FN/ x a $):
| ^
error: expecting (
../examples/peano.mm1:3776:29:
|
3776 | theorem isfappd (h1: $ G -> isfun F $) (h2: $ G -> a, b e. F $):
| ^
error: isfun is not a function
../examples/peano.mm1:3780:35:
|
3780 | theorem isfappb: $ isfun F -> (a, b e. F <-> a e. Dom F /\ F @ a = b) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3785:27:
|
3785 | theorem eqapp: $ A. y (a, y e. F <-> a, y e. G) -> F @ a = G @ a $ = '(theeqd abeq);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3787:36:
|
3787 | theorem ndmapp: $ ~a e. Dom F -> F @ a = 0 $ = '(!! eqthe0abd y @ syl5 preldm absurd);
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/peano.mm1:3789:47:
|
3789 | theorem appelrn: $ isfun F -> a e. Dom F -> F @ a e. Ran F $ =
| ^
error: unexpected '@'
expecting '$', infix >= 0, or infix >= 25
../examples/peano.mm1:3792:45:
|
3792 | theorem isfrn: $ isfun F -> (y e. Ran F <-> E. x (x e. Dom F /\ F @ x = y)) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3795:47:
|
3795 | theorem isfrnss: $ isfun F -> (Ran F C_ A <-> A. x (x e. Dom F -> F @ x e. A)) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3799:26:
|
3799 | theorem eqisf: $ isfun F /\ isfun G ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3806:35:
|
3806 | theorem resapp: $ a e. A -> (F |` A) @ a = F @ a $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3810:15:
|
3810 | (h1: $ G -> isfun F $) (h2: $ G -> a e. Dom F $) (h3: $ G -> a e. A $):
| ^
error: isfun is not a function
../examples/peano.mm1:3815:36:
|
3815 | theorem applams (a b: nat x): $ (\ x, a) @ b = N[b / x] a $ =
| ^
error: expecting (
../examples/peano.mm1:3821:33:
|
3821 | theorem applam (a: nat x): $ (\ x, a) @ x = a $ = '(eqtr applams sbnid);
| ^
error: expecting (
../examples/peano.mm1:3822:36:
|
3822 | theorem applame (a: nat x) (e: $ x = b -> a = c $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3824:37:
|
3824 | theorem applamed (a: nat x) (e: $ G /\ x = b -> a = c $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3826:38:
|
3826 | theorem applamed1 (a: nat x) (e: $ G /\ x = b -> F @ b = a -> P $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3831:11:
|
3831 | (e: $ G /\ x = b -> a = c $): $ G -> F == \ x, a -> F @ b = c $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3834:23:
|
3834 | theorem lamapp2: $ (\ x, F @ x) |` A == F <-> isfun F /\ Dom F == A $ =
| ^
error: expecting (
../examples/peano.mm1:3842:22:
|
3842 | theorem lamapp: $ (\ x, F @ x) |` Dom F == F <-> isfun F $ = '(bitr lamapp2 @ bian2 eqsid);
| ^
error: expecting (
../examples/peano.mm1:3848:1:
|
3848 | @_ def case (A B: set): set =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:3849:5:
|
3849 | $ \ n, if (odd n) (B @ (n // 2)) (A @ (n // 2)) $;
| ^
error: expecting (
../examples/peano.mm1:3851:51:
|
3851 | pub theorem casel (A B: set) (n: nat): $ case A B @ b0 n = A @ n $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/peano.mm1:3855:51:
|
3855 | pub theorem caser (A B: set) (n: nat): $ case A B @ b1 n = B @ n $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/peano.mm1:3863:1:
|
3863 | @_ abstract def Sum (A B: set): set =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:3864:26:
|
3864 | $ {n | ifp (odd n) (n // 2 e. B) (n // 2 e. A)} $;
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3865:57:
|
3865 | pub theorem Suml (A B: set) (n: nat): $ b0 n e. Sum A B <-> n e. A $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3869:57:
|
3869 | pub theorem Sumr (A B: set) (n: nat): $ b1 n e. Sum A B <-> n e. B $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3873:44:
|
3873 | theorem Sumld (h: $ G -> a e. A $): $ G -> b0 a e. Sum A B $ = '(sylibr Suml h);
| ^
error: b0 is not a function
../examples/peano.mm1:3874:44:
|
3874 | theorem Sumrd (h: $ G -> b e. B $): $ G -> b1 b e. Sum A B $ = '(sylibr Sumr h);
| ^
error: b1 is not a function
../examples/peano.mm1:3876:28:
|
3876 | theorem Sumssd (h1: $ G -> A1 C_ A2 $) (h2: $ G -> B1 C_ B2 $): $ G -> Sum A1 B1 C_ Sum A2 B2 $ =
| ^
error: A1 is not a function
../examples/peano.mm1:3882:1:
|
3882 | @_ local def Fst (A: set): set = $ {n | b0 n e. A} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:3882:41:
|
3882 | @_ local def Fst (A: set): set = $ {n | b0 n e. A} $;
| ^
error: b0 is not a function
../examples/peano.mm1:3884:1:
|
3884 | @_ local def Snd (A: set): set = $ {n | b1 n e. A} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:3884:41:
|
3884 | @_ local def Snd (A: set): set = $ {n | b1 n e. A} $;
| ^
error: b1 is not a function
../examples/peano.mm1:3886:29:
|
3886 | theorem elFst: $ a e. Fst A <-> b0 a e. A $ = '(elabe ,eqtac);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3887:29:
|
3887 | theorem elSnd: $ a e. Snd A <-> b1 a e. A $ = '(elabe ,eqtac);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3889:33:
|
3889 | theorem FstSum: $ Fst (Sum A B) == A $ = (named '(ax_gen @ bitr elFst Suml));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3890:33:
|
3890 | theorem SndSum: $ Snd (Sum A B) == B $ = (named '(ax_gen @ bitr elSnd Sumr));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3891:39:
|
3891 | theorem FstSnd: $ Sum (Fst A) (Snd A) == A $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3895:18:
|
3895 | theorem Fstss: $ A C_ B -> Fst A C_ Fst B $ = (named '(ssabd ssel));
| ^
error: A is not a function
../examples/peano.mm1:3896:18:
|
3896 | theorem Sndss: $ A C_ B -> Snd A C_ Snd B $ = (named '(ssabd ssel));
| ^
error: A is not a function
../examples/peano.mm1:3907:1:
|
3907 | @_ local def slam {x: nat} (A: set x): set = $ S\ p, {y | snd p, y e. S[fst p / x] A} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:3907:51:
|
3907 | @_ local def slam {x: nat} (A: set x): set = $ S\ p, {y | snd p, y e. S[fst p / x] A} $;
| ^
error: expecting (
../examples/peano.mm1:3908:10:
|
3908 | notation slam {x: nat} (A: set x): set = ($\\$:30) x ($,$:55) A;
| ^
error: term 'slam' not declared
../examples/peano.mm1:3910:37:
|
3910 | theorem prelslams (A: set x): $ (a, b), y e. (\\ x, A) <-> b, y e. S[a / x] A $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:3915:37:
|
3915 | theorem rappslams (A: set x): $ (\\ x, A) @' (a, b) == (S[a / x] A) @' b $ =
| ^
error: expecting (
../examples/peano.mm1:3918:36:
|
3918 | theorem appslams (A: set x): $ (\\ x, A) @ (a, b) = (S[a / x] A) @ b $ =
| ^
error: expecting (
../examples/peano.mm1:3921:37:
|
3921 | theorem rappslam (A: set x) (h: $ x = a -> A == B $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3925:36:
|
3925 | theorem appslam (A: set x) (h: $ x = a -> A == B $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3929:39:
|
3929 | theorem rappslamed (A: set x) (h: $ G /\ x = a -> A @' b == C $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3934:38:
|
3934 | theorem appslamed (A: set x) (h: $ G /\ x = a -> A @ b = c $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:3939:38:
|
3939 | theorem rappslame (A: set x) (h: $ x = a -> A @' b == C $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3942:37:
|
3942 | theorem appslame (A: set x) (h: $ x = a -> A @ b = c $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3945:1:
|
3945 | @_ local def least (A: set): nat = $ the {x | x e. A /\ A. y (y e. A -> x <= y)} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:3945:42:
|
3945 | @_ local def least (A: set): nat = $ the {x | x e. A /\ A. y (y e. A -> x <= y)} $;
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/peano.mm1:3947:44:
|
3947 | theorem leastlem: $ a e. A -> least A e. A /\ A. z (z e. A -> least A <= z) $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/peano.mm1:3972:30:
|
3972 | theorem leastel: $ a e. A -> least A e. A $ = '(anld @ !! leastlem x);
| ^
error: least is not a function
../examples/peano.mm1:3974:38:
|
3974 | theorem leastle: $ a e. A -> least A <= a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:3977:43:
|
3977 | theorem least0: $ ~E. x x e. A -> least A = 0 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3980:21:
|
3980 | theorem subsnfin: $ subsn A -> finite A $ =
| ^
error: subsn is not a function
../examples/peano.mm1:3984:1:
|
3984 | @_ local def sapp (F: set) (x: nat): set = $ S\ y, F @' (x, y) $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:3984:49:
|
3984 | @_ local def sapp (F: set) (x: nat): set = $ S\ y, F @' (x, y) $;
| ^
error: expecting (
../examples/peano.mm1:3985:8:
|
3985 | infixl sapp: $@@$ prec 200;
| ^
error: term 'sapp' not declared
../examples/peano.mm1:3987:67:
|
3987 | theorem nfsapp (F: set x) (a: nat x) (h1: $ FS/ x F $) (h2: $ FN/ x a $):
| ^
error: expecting (
../examples/peano.mm1:3990:23:
|
3990 | theorem sapprapp: $ F @@ a @' b == F @' (a, b) $ = '(!! eqab1i y @ elsabe ,eqtac);
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/peano.mm1:3991:22:
|
3991 | theorem sappapp: $ F @@ a @ b = F @ (a, b) $ = (named '(theeq sapprapp));
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/peano.mm1:3992:22:
|
3992 | theorem prelsapp: $ b, y e. F @@ a <-> (a, b), y e. F $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:3995:37:
|
3995 | theorem sappslams (A: set x): $ (\\ x, A) @@ a == S[a / x] A $ =
| ^
error: expecting (
../examples/peano.mm1:3997:37:
|
3997 | theorem sappslam (A: set x) (h: $ x = a -> A == B $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:3999:39:
|
3999 | theorem sappslamed (A: set x) (h: $ G /\ x = a -> A == B $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:4003:38:
|
4003 | theorem sappslame (A: set x) (h: $ x = a -> A == B $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4011:4:
|
4011 | (set-merge-strategy evalZ-map merge-map)
| ^
error: Reference to unbound variable 'set-merge-strategy'
../examples/peano.mm1:4026:3:
|
4026 | @(add-evalZ @ fn (m n) {(eval m) - (eval n)})
| ^
error: Reference to unbound variable 'add-evalZ'
../examples/peano.mm1:4028:8:
|
4028 | infixl znsub: $-ZN$ prec 64;
| ^
error: term 'znsub' not declared
../examples/peano.mm1:4030:23:
|
4030 | theorem znsubneg: $ m < n -> m -ZN n = b1 (n - suc m) $ = 'ifpos;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4031:23:
|
4031 | theorem znsubpos: $ n <= m -> m -ZN n = b0 (m - n) $ = '(sylbi lenlt ifneg);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4032:22:
|
4032 | theorem znsubid: $ m -ZN m = 0 $ = '(eqtr (znsubpos leid) @ eqtr (b0eq subid) b00);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4033:22:
|
4033 | theorem znsub02: $ a -ZN 0 = b0 a $ = '(eqtr (znsubpos le01) @ b0eq sub02);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4034:32:
|
4034 | theorem znsubodd: $ odd (a -ZN b) <-> a < b $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4037:3:
|
4037 | @(add-eval @ fn (n) {(evalZ n) max 0})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:4039:3:
|
4039 | @(add-eval @ fn (n) {(- (evalZ n)) max 0})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:4042:31:
|
4042 | theorem zfstb0: $ zfst (b0 n) = n $ = (named '(eqtr casel @ applame id));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4043:31:
|
4043 | theorem zfstb1: $ zfst (b1 n) = 0 $ = (named '(eqtr caser @ applame eqidd));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4044:31:
|
4044 | theorem zsndb0: $ zsnd (b0 n) = 0 $ = (named '(eqtr casel @ applame eqidd));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4045:31:
|
4045 | theorem zsndb1: $ zsnd (b1 n) = suc n $ = (named '(eqtr caser @ applame suceq));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4047:23:
|
4047 | theorem zfst0: $ zfst 0 = 0 $ = '(eqtr3 (zfsteq b00) zfstb0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:4048:23:
|
4048 | theorem zsnd0: $ zsnd 0 = 0 $ = '(eqtr3 (zsndeq b00) zsndb0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:4050:27:
|
4050 | theorem zfstsnd: $ zfst n -ZN zsnd n = n $ =
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4062:30:
|
4062 | theorem zfstsndeq0: $ zfst n = 0 /\ zsnd n = 0 <-> n = 0 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4066:34:
|
4066 | theorem zfstznsub: $ zfst (m -ZN n) = m - n $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4071:28:
|
4071 | theorem zfstsnd0: $ zfst n = 0 \/ zsnd n = 0 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4074:30:
|
4074 | theorem zfstsubsnd: $ zfst n - zsnd n = zfst n $ =
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4077:30:
|
4077 | theorem zneqb (a b c d): $ a -ZN c = b -ZN d <-> a + d = b + c $ =
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4095:27:
|
4095 | theorem znpnpcan1: $ (a + c) -ZN (b + c) = a -ZN b $ = '(mpbir zneqb @ eqtr addrass addass);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4096:27:
|
4096 | theorem znpnpcan2: $ (a + b) -ZN (a + c) = b -ZN c $ = '(mpbir zneqb @ eqtr addass addlass);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4098:3:
|
4098 | @(add-evalZ @ fn (n) (- (evalZ n)))
| ^
error: Reference to unbound variable 'add-evalZ'
../examples/peano.mm1:4100:8:
|
4100 | prefix zneg: $-uZ$ prec 100;
| ^
error: term 'zneg' not declared
../examples/peano.mm1:4102:23:
|
4102 | theorem znegzn: $ -uZ (a -ZN b) = b -ZN a $ =
| ^
error: expecting (
../examples/peano.mm1:4105:24:
|
4105 | theorem znegneg: $ -uZ -uZ n = n $ = '(eqtr znegzn zfstsnd);
| ^
error: expecting (
../examples/peano.mm1:4107:30:
|
4107 | theorem zfstneg: $ zfst (-uZ n) = zsnd n $ =
| ^
error: expecting (
../examples/peano.mm1:4112:30:
|
4112 | theorem zsndneg: $ zsnd (-uZ n) = zfst n $ = '(eqtr3 zfstneg @ zfsteq znegneg);
| ^
error: expecting (
../examples/peano.mm1:4114:22:
|
4114 | theorem zneg0: $ -uZ 0 = 0 $ =
| ^
error: expecting (
../examples/peano.mm1:4117:34:
|
4117 | theorem zsndznsub: $ zsnd (m -ZN n) = n - m $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4120:23:
|
4120 | theorem znegb1: $ -uZ b1 n = b0 (suc n) $ =
| ^
error: expecting (
../examples/peano.mm1:4123:3:
|
4123 | @(add-evalZ @ fn (m n) {(evalZ m) + (evalZ n)})
| ^
error: Reference to unbound variable 'add-evalZ'
../examples/peano.mm1:4125:8:
|
4125 | infixl zadd: $+Z$ prec 64;
| ^
error: term 'zadd' not declared
../examples/peano.mm1:4127:26:
|
4127 | theorem zaddzn: $ (a -ZN c) +Z (b -ZN d) = (a + b) -ZN (c + d) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4131:24:
|
4131 | theorem zaddb0: $ b0 m +Z b0 n = b0 (m + n) $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:4134:22:
|
4134 | theorem zaddcom: $ a +Z b = b +Z a $ = '(znsubeq addcom addcom);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:4135:26:
|
4135 | theorem zaddass: $ (a +Z b) +Z c = a +Z (b +Z c) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4138:23:
|
4138 | theorem zaddlass: $ a +Z (b +Z c) = b +Z (a +Z c) $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:4140:27:
|
4140 | theorem zaddrass: $ (a +Z b) +Z c = (a +Z c) +Z b $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4143:21:
|
4143 | theorem zadd02: $ a +Z 0 = a $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:4145:21:
|
4145 | theorem zadd01: $ 0 +Z a = a $ = '(eqtr zaddcom zadd02);
| ^
error: expecting (
../examples/peano.mm1:4147:21:
|
4147 | theorem znegid: $ a +Z -uZ a = 0 $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:4149:24:
|
4149 | theorem znegid1: $ -uZ a +Z a = 0 $ = '(eqtr zaddcom znegid);
| ^
error: expecting (
../examples/peano.mm1:4151:3:
|
4151 | @(add-evalZ @ fn (m n) {(evalZ m) - (evalZ n)})
| ^
error: Reference to unbound variable 'add-evalZ'
../examples/peano.mm1:4153:8:
|
4153 | infixl zsub: $-Z$ prec 64;
| ^
error: term 'zsub' not declared
../examples/peano.mm1:4155:24:
|
4155 | theorem zsubb0: $ b0 m -Z b0 n = m -ZN n $ =
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4158:22:
|
4158 | theorem zsubpos: $ n <= m -> b0 m -Z b0 n = b0 (m - n) $ = '(syl5eq zsubb0 znsubpos);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4160:21:
|
4160 | theorem zsubid: $ a -Z a = 0 $ = 'znegid;
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4161:21:
|
4161 | theorem zsub01: $ 0 -Z a = -uZ a $ = 'zadd01;
| ^
error: expecting (
../examples/peano.mm1:4162:21:
|
4162 | theorem zsub02: $ a -Z 0 = a $ = '(eqtr (zaddeq2 zneg0) zadd02);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4163:21:
|
4163 | theorem zpncan: $ a +Z b -Z b = a $ = '(eqtr zaddass @ eqtr (zaddeq2 znegid) zadd02);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:4164:22:
|
4164 | theorem zpncan2: $ a +Z b -Z a = b $ = '(eqtr (zsubeq1 zaddcom) zpncan);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:4165:21:
|
4165 | theorem znpcan: $ a -Z b +Z b = a $ = '(eqtr zaddass @ eqtr (zaddeq2 znegid1) zadd02);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4166:22:
|
4166 | theorem zpncan3: $ a +Z (b -Z a) = b $ = '(eqtr zaddcom znpcan);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:4167:25:
|
4167 | theorem zaddsubass: $ a +Z b -Z c = a +Z (b -Z c) $ = 'zaddass;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:4168:22:
|
4168 | theorem zaddsub: $ a +Z b -Z c = a -Z c +Z b $ = 'zaddrass;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:4170:23:
|
4170 | theorem zaddcan1: $ a +Z c = b +Z c <-> a = b $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:4172:23:
|
4172 | theorem zaddcan2: $ a +Z b = a +Z c <-> b = c $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:4175:21:
|
4175 | theorem eqzsub: $ a -Z c = b <-> b +Z c = a $ =
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4177:22:
|
4177 | theorem eqzsub2: $ a -Z b = c <-> b +Z c = a $ = '(bitr eqzsub @ eqeq1 zaddcom);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4178:23:
|
4178 | theorem eqzneg: $ -uZ a = b <-> a +Z b = 0 $ = '(bitr3 (eqeq1 zsub01) eqzsub2);
| ^
error: expecting (
../examples/peano.mm1:4179:26:
|
4179 | theorem znegeqcom: $ -uZ a = b <-> -uZ b = a $ = '(bitr4 eqzneg @ bitr4 eqzneg @ eqeq1 zaddcom);
| ^
error: expecting (
../examples/peano.mm1:4180:24:
|
4180 | theorem eqznegcom: $ a = -uZ b <-> b = -uZ a $ = '(bitr eqcomb @ bitr znegeqcom eqcomb);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4181:22:
|
4181 | theorem zsubeq0: $ a -Z b = 0 <-> a = b $ = '(bitr eqzsub @ bitr (eqeq1 zadd01) eqcomb);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4182:25:
|
4182 | theorem znegadd2: $ -uZ (a +Z b) = -uZ a -Z b $ =
| ^
error: expecting (
../examples/peano.mm1:4184:24:
|
4184 | theorem znegadd: $ -uZ (a +Z b) = -uZ a +Z -uZ b $ = 'znegadd2;
| ^
error: expecting (
../examples/peano.mm1:4185:22:
|
4185 | theorem zsubsub: $ a -Z b -Z c = a -Z (b +Z c) $ = '(eqtr4 zaddsubass @ zaddeq2 znegadd2);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4186:26:
|
4186 | theorem znpncan: $ (a -Z b) +Z (b -Z c) = a -Z c $ = '(eqtr3 zaddsubass @ zsubeq1 znpcan);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4187:27:
|
4187 | theorem znpncan2: $ (b -Z c) +Z (a -Z b) = a -Z c $ = '(eqtr zaddcom znpncan);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4188:27:
|
4188 | theorem zpnpcan2: $ (a +Z b) -Z (a +Z c) = b -Z c $ = '(eqtr3 zsubsub @ zsubeq1 zpncan2);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4189:27:
|
4189 | theorem zpnpcan1: $ (a +Z c) -Z (b +Z c) = a -Z b $ = '(eqtr (zsubeq zaddcom zaddcom) zpnpcan2);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4190:24:
|
4190 | theorem znegsub: $ -uZ (a -Z b) = b -Z a $ = '(eqtr znegadd2 @ eqtr zaddcom @ zaddeq1 znegneg);
| ^
error: expecting (
../examples/peano.mm1:4191:23:
|
4191 | theorem zsubsub2: $ a -Z (b -Z c) = a +Z (c -Z b) $ = '(zaddeq2 znegsub);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4192:22:
|
4192 | theorem zsubadd: $ a -Z b +Z c = a -Z (b -Z c) $ = '(eqtr3 zaddsub @ eqtr4 zaddsubass zsubsub2);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4193:23:
|
4193 | theorem zsubneg2: $ a -Z -uZ b = a +Z b $ = '(zaddeq2 znegneg);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4194:25:
|
4194 | theorem znegsub2: $ -uZ a -Z -uZ b = b -Z a $ = '(eqtr zsubneg2 zaddcom);
| ^
error: expecting (
../examples/peano.mm1:4195:24:
|
4195 | theorem znegb0S: $ -uZ b0 (suc n) = b1 n $ = '(mpbi znegeqcom znegb1);
| ^
error: expecting (
../examples/peano.mm1:4197:3:
|
4197 | @(add-evalZ @ fn (m n) {(evalZ m) < (evalZ n)})
| ^
error: Reference to unbound variable 'add-evalZ'
../examples/peano.mm1:4199:8:
|
4199 | infixr zlt: $<Z$ prec 50;
| ^
error: term 'zlt' not declared
../examples/peano.mm1:4200:3:
|
4200 | @(add-evalZ @ fn (m n) {(evalZ m) <= (evalZ n)})
| ^
error: Reference to unbound variable 'add-evalZ'
../examples/peano.mm1:4202:8:
|
4202 | infixr zle: $<=Z$ prec 50;
| ^
error: term 'zle' not declared
../examples/peano.mm1:4204:21:
|
4204 | theorem zlenlt: $ a <=Z b <-> ~b <Z a $ = 'biid;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4205:21:
|
4205 | theorem zltnle: $ a <Z b <-> ~b <=Z a $ = '(con2b zlenlt);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4206:20:
|
4206 | theorem zlt01: $ a <Z 0 <-> odd a $ = '(oddeq zsub02);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4207:20:
|
4207 | theorem zle02: $ 0 <=Z a <-> ~odd a $ = '(noteq zlt01);
| ^
error: expecting (
../examples/peano.mm1:4208:21:
|
4208 | theorem zle0b0: $ 0 <=Z b0 a $ = '(mpbir zle02 b0odd);
| ^
error: expecting (
../examples/peano.mm1:4209:24:
|
4209 | theorem zltb10: $ b1 a <Z 0 $ = '(mpbir zlt01 b1odd);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4210:22:
|
4210 | theorem zle0b1: $ ~0 <=Z b1 a $ = '(mpbi zltnle zltb10);
| ^
error: expecting prefix >= 0
../examples/peano.mm1:4211:25:
|
4211 | theorem zltb00: $ ~b0 a <Z 0 $ = 'zle0b0;
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:4212:22:
|
4212 | theorem zlt01eq: $ a <Z 0 <-> a = b1 (a // 2) $ = '(bitr zlt01 eqb1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4213:22:
|
4213 | theorem zle02eq: $ 0 <=Z a <-> a = b0 (a // 2) $ = '(bitr zle02 eqb0);
| ^
error: expecting (
../examples/peano.mm1:4214:23:
|
4214 | theorem zltb0: $ b0 a <Z b0 b <-> a < b $ = '(bitr (oddeq zsubb0) znsubodd);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4215:23:
|
4215 | theorem zleb0: $ b0 a <=Z b0 b <-> a <= b $ = '(bitr4 (noteq zltb0) lenlt);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4216:22:
|
4216 | theorem zltadd1: $ a <Z b <-> a +Z c <Z b +Z c $ = '(oddeq @ eqcom zpnpcan1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4217:22:
|
4217 | theorem zltadd2: $ b <Z c <-> a +Z b <Z a +Z c $ = '(oddeq @ eqcom zpnpcan2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4218:22:
|
4218 | theorem zleadd1: $ a <=Z b <-> a +Z c <=Z b +Z c $ = '(noteq zltadd1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4219:22:
|
4219 | theorem zleadd2: $ b <=Z c <-> a +Z b <=Z a +Z c $ = '(noteq zltadd2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4220:24:
|
4220 | theorem zltaddsub: $ a +Z b <Z c <-> a <Z c -Z b $ = '(bitr2 zltadd1 @ zlteq2 znpcan);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:4221:24:
|
4221 | theorem zltsubadd: $ a -Z b <Z c <-> a <Z c +Z b $ = '(bitr2 zltadd1 @ zlteq2 zpncan);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4222:22:
|
4222 | theorem zlt0neg: $ 0 <Z -uZ a <-> a <Z 0 $ = '(oddeq @ eqtr4 zsub01 @ eqtr4 zsub02 znegneg);
| ^
error: expecting (
../examples/peano.mm1:4223:24:
|
4223 | theorem zltneg0: $ -uZ a <Z 0 <-> 0 <Z a $ = '(bitr3 zlt0neg @ zlteq2 znegneg);
| ^
error: expecting (
../examples/peano.mm1:4224:22:
|
4224 | theorem zle0neg: $ 0 <=Z -uZ a <-> a <=Z 0 $ = '(noteq zltneg0);
| ^
error: expecting (
../examples/peano.mm1:4225:24:
|
4225 | theorem zleneg0: $ -uZ a <=Z 0 <-> 0 <=Z a $ = '(noteq zlt0neg);
| ^
error: expecting (
../examples/peano.mm1:4226:22:
|
4226 | theorem zlt0sub: $ 0 <Z a -Z b <-> b <Z a $ = '(bitr3 zltaddsub @ zlteq1 zadd01);
| ^
error: expecting (
../examples/peano.mm1:4227:22:
|
4227 | theorem zltsub0: $ a -Z b <Z 0 <-> a <Z b $ = '(bitr3 zlt0neg @ bitr (zlteq2 znegsub) zlt0sub);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4228:22:
|
4228 | theorem zle0sub: $ 0 <=Z a -Z b <-> b <=Z a $ = '(noteq zltsub0);
| ^
error: expecting (
../examples/peano.mm1:4229:22:
|
4229 | theorem zlesub0: $ a -Z b <=Z 0 <-> a <=Z b $ = '(noteq zlt0sub);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4230:24:
|
4230 | theorem zlt0znsub: $ 0 <Z a -ZN b <-> b < a $ = '(bitr3 (zlteq2 zsubb0) @ bitr zlt0sub zltb0);
| ^
error: expecting (
../examples/peano.mm1:4231:24:
|
4231 | theorem zltznsub0: $ a -ZN b <Z 0 <-> a < b $ = '(bitr3 (zlteq1 zsubb0) @ bitr zltsub0 zltb0);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4232:24:
|
4232 | theorem zle0znsub: $ 0 <=Z a -ZN b <-> b <= a $ = '(bitr4 (noteq zltznsub0) lenlt);
| ^
error: expecting (
../examples/peano.mm1:4233:24:
|
4233 | theorem zleznsub0: $ a -ZN b <=Z 0 <-> a <= b $ = '(bitr4 (noteq zlt0znsub) lenlt);
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/peano.mm1:4234:27:
|
4234 | theorem zsndeq0: $ zsnd a = 0 <-> 0 <=Z a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4238:27:
|
4238 | theorem zfsteq0: $ zfst a = 0 <-> a <=Z 0 $ = '(bitr3 (eqeq1 zsndneg) @ bitr zsndeq0 zle0neg);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4239:22:
|
4239 | theorem zleorle: $ a <=Z b \/ b <=Z a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4241:20:
|
4241 | theorem zltle: $ a <Z b -> a <=Z b $ = '(sylbi zltnle zleorle);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4242:23:
|
4242 | theorem zleasymb: $ a = b <-> a <=Z b /\ b <=Z a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4244:22:
|
4244 | theorem zleasym: $ a <=Z b -> b <=Z a -> a = b $ = '(exp @ bi2i zleasymb);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4245:22:
|
4245 | theorem zaddpos: $ 0 <=Z a -> 0 <=Z b -> 0 <=Z a +Z b $ =
| ^
error: expecting (
../examples/peano.mm1:4248:20:
|
4248 | theorem zletr: $ a <=Z b -> b <=Z c -> a <=Z c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4250:22:
|
4250 | theorem zlelttr: $ a <=Z b -> b <Z c -> a <Z c $ = '(con4d @ com12 zletr);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4251:22:
|
4251 | theorem zltletr: $ a <Z b -> b <=Z c -> a <Z c $ = '(com12 @ con4d zletr);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4252:20:
|
4252 | theorem zlttr: $ a <Z b -> b <Z c -> a <Z c $ = '(syl zlelttr zltle);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4253:25:
|
4253 | theorem zb0orb0div: $ a = b0 (a // 2) \/ a = -uZ (b0 (-uZ a // 2)) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4256:3:
|
4256 | @(add-evalZ @ fn (m n) {(evalZ m) * (evalZ n)})
| ^
error: Reference to unbound variable 'add-evalZ'
../examples/peano.mm1:4260:8:
|
4260 | infixl zmul: $*Z$ prec 70;
| ^
error: term 'zmul' not declared
../examples/peano.mm1:4263:13:
|
4263 | (h1: $ a1 + c2 = a2 + c1 $) (h2: $ b1 + d2 = b2 + d1 $):
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:4286:26:
|
4286 | theorem zmulzn: $ (a -ZN c) *Z (b -ZN d) = (a * b + c * d) -ZN (a * d + b * c) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4289:22:
|
4289 | theorem zmulcom: $ a *Z b = b *Z a $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:4291:26:
|
4291 | theorem zmulass: $ (a *Z b) *Z c = a *Z (b *Z c) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4303:22:
|
4303 | theorem zmuladd: $ a *Z (b +Z c) = a *Z b +Z a *Z c $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:4307:26:
|
4307 | theorem zaddmul: $ (a +Z b) *Z c = a *Z c +Z b *Z c $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4310:22:
|
4310 | theorem zmulsub: $ a *Z (b -Z c) = a *Z b -Z a *Z c $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:4312:26:
|
4312 | theorem zsubmul: $ (a -Z b) *Z c = a *Z c -Z b *Z c $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4315:21:
|
4315 | theorem zmul01: $ 0 *Z a = 0 $ = '(eqtr3 (zmuleq1 @ ! zsubid d0) @ eqtr zsubmul zsubid);
| ^
error: expecting (
../examples/peano.mm1:4316:21:
|
4316 | theorem zmul02: $ a *Z 0 = 0 $ = '(eqtr zmulcom zmul01);
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:4317:22:
|
4317 | theorem zmul11: $ b0 1 *Z a = a $ =
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/peano.mm1:4320:21:
|
4320 | theorem zmul12: $ a *Z b0 1 = a $ = '(eqtr zmulcom zmul11);
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:4322:25:
|
4322 | theorem zmulneg1: $ -uZ a *Z b = -uZ (a *Z b) $ =
| ^
error: expecting (
../examples/peano.mm1:4324:23:
|
4324 | theorem zmulneg2: $ a *Z -uZ b = -uZ (a *Z b) $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:4326:25:
|
4326 | theorem zmul2neg: $ -uZ a *Z -uZ b = a *Z b $ =
| ^
error: expecting (
../examples/peano.mm1:4329:24:
|
4329 | theorem zmulb0: $ b0 a *Z b0 b = b0 (a * b) $ =
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:4333:3:
|
4333 | @(add-eval @ fn (n) (def x (evalZ n)) (if {x >= 0} x (- x)))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:4336:31:
|
4336 | theorem zabsb0: $ zabs (b0 n) = n $ = '(eqtr (addeq zfstb0 zsndb0) add0);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4337:30:
|
4337 | theorem zabsneg: $ zabs (-uZ n) = zabs n $ = '(eqtr addcom @ addeq zsndneg zfstneg);
| ^
error: expecting (
../examples/peano.mm1:4338:31:
|
4338 | theorem zabszn: $ zabs (m -ZN n) = (m - n) + (n - m) $ = '(addeq zfstznsub zsndznsub);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4339:23:
|
4339 | theorem lezabszn: $ n <= m -> zabs (m -ZN n) = m - n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4341:32:
|
4341 | theorem zabscom: $ zabs (m -ZN n) = zabs (n -ZN m) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4343:27:
|
4343 | theorem zabseq0: $ zabs n = 0 <-> n = 0 $ = '(bitr addeq0 zfstsndeq0);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4344:31:
|
4344 | theorem b0zabs: $ b0 (zabs a) = a <-> 0 <=Z a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4347:22:
|
4347 | theorem zb0orb0: $ a = b0 (zabs a) \/ a = -uZ (b0 (zabs a)) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4350:31:
|
4350 | theorem zabsmul: $ zabs (m *Z n) = zabs m * zabs n $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4361:27:
|
4361 | theorem eqmdvdsub2: $ mod(n): a = b <-> n || zabs (b -ZN a) $ =
| ^
error: expecting (
../examples/peano.mm1:4367:27:
|
4367 | theorem eqmdvdsub3: $ mod(n): zfst a = zsnd a <-> n || zabs a $ =
| ^
error: expecting (
../examples/peano.mm1:4370:3:
|
4370 | @(add-eval @ fn (m n) {{(evalZ n) % (evalZ m)} = 0})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:4372:8:
|
4372 | infixl zdvd: $|Z$ prec 50;
| ^
error: term 'zdvd' not declared
../examples/peano.mm1:4374:21:
|
4374 | theorem zdvdid: $ a |Z a $ = 'dvdid;
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4375:21:
|
4375 | theorem zdvdtr: $ a |Z b -> b |Z c -> a |Z c $ = 'dvdtr;
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4376:24:
|
4376 | theorem zdvdb0: $ b0 a |Z b0 b <-> a || b $ = '(dvdeq zabsb0 zabsb0);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4377:25:
|
4377 | theorem zdvdb01: $ b0 a |Z b <-> a || zabs b $ = '(dvdeq1 zabsb0);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4378:22:
|
4378 | theorem zdvdb02: $ a |Z b0 b <-> zabs a || b $ = '(dvdeq2 zabsb0);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4379:25:
|
4379 | theorem zdvdneg1: $ -uZ a |Z b <-> a |Z b $ = '(dvdeq1 zabsneg);
| ^
error: expecting (
../examples/peano.mm1:4380:23:
|
4380 | theorem zdvdneg2: $ a |Z -uZ b <-> a |Z b $ = '(dvdeq2 zabsneg);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4381:27:
|
4381 | theorem eqmzdvdsub: $ mod(n): a = b <-> b0 n |Z b -ZN a $ =
| ^
error: expecting (
../examples/peano.mm1:4383:21:
|
4383 | theorem zdvd01: $ 0 |Z a <-> a = 0 $ = '(bitr3 (zdvdeq1 b00) @ bitr zdvdb01 @ bitr dvd01 zabseq0);
| ^
error: expecting (
../examples/peano.mm1:4384:21:
|
4384 | theorem zdvd02: $ a |Z 0 $ = '(mpbi (zdvdeq2 b00) @ mpbir zdvdb02 dvd02);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4385:22:
|
4385 | theorem zdvd11: $ b0 1 |Z a $ = '(mpbir zdvdb01 dvd11);
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/peano.mm1:4386:21:
|
4386 | theorem zdvd12: $ a |Z b0 1 <-> zabs a = 1 $ = '(bitr zdvdb02 dvd12);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4388:23:
|
4388 | theorem zdvdmul1: $ a |Z b *Z a $ = '(mpbir (dvdeq2 zabsmul) dvdmul1);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4389:23:
|
4389 | theorem zdvdmul2: $ a |Z a *Z b $ = '(mpbi (zdvdeq2 zmulcom) zdvdmul1);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4391:20:
|
4391 | theorem izdvd: $ c *Z a = b -> a |Z b $ = '(mpbii zdvdmul1 zdvdeq2);
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:4392:21:
|
4392 | theorem izdvd2: $ a *Z c = b -> a |Z b $ = '(mpbii zdvdmul2 zdvdeq2);
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/peano.mm1:4394:22:
|
4394 | theorem zdvddef: $ a |Z b <-> E. c c *Z a = b $ =
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4406:23:
|
4406 | theorem zdvdadd1: $ n |Z a -> (n |Z b <-> n |Z a +Z b) $ =
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4417:23:
|
4417 | theorem zdvdadd2: $ n |Z a -> (n |Z b <-> n |Z b +Z a) $ =
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4420:24:
|
4420 | theorem zdvdmul12: $ a |Z b -> a |Z c *Z b $ = '(mpi zdvdmul1 zdvdtr);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4421:24:
|
4421 | theorem zdvdmul11: $ a |Z b -> a |Z b *Z c $ = '(mpi zdvdmul2 zdvdtr);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4423:3:
|
4423 | @(add-eval @ fn (a n) @ let ([a (evalZ a)] [n (eval n)])
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:4426:8:
|
4426 | infixl zmod: $%Z$ prec 70;
| ^
error: term 'zmod' not declared
../examples/peano.mm1:4428:21:
|
4428 | theorem zmod02: $ a %Z 0 = zabs a $ =
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/peano.mm1:4430:25:
|
4430 | theorem zmodb00: $ b0 a %Z 0 = a $ = '(eqtr zmod02 zabsb0);
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/peano.mm1:4432:22:
|
4432 | theorem zmodn02: $ n != 0 -> a %Z n = (zfst a + n - zsnd a % n) % n $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:4436:24:
|
4436 | theorem zmodb0: $ b0 a %Z n = a % n $ =
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/peano.mm1:4442:21:
|
4442 | theorem zmodb1: $ a < n -> b1 a %Z n = n - suc a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4451:21:
|
4451 | theorem zmod01: $ 0 %Z a = 0 $ = '(eqtr3 (zmodeq1 b00) @ eqtr zmodb0 mod01);
| ^
error: expecting (
../examples/peano.mm1:4453:24:
|
4453 | theorem zmodmodid: $ a %Z n % n = a %Z n $ = 'modmodid;
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/peano.mm1:4455:22:
|
4455 | theorem zmodeq0: $ a %Z n = 0 <-> b0 n |Z a $ =
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/peano.mm1:4459:3:
|
4459 | @(add-eval @ fn (n a b) {{{(evalZ a) - (evalZ b)} % (eval n)} = 0})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:4461:10:
|
4461 | notation zeqm (n a b) = ($modZ($:50) n ($):$:50) a ($=$:50) b;
| ^
error: term 'zeqm' not declared
../examples/peano.mm1:4463:24:
|
4463 | theorem zeqmid: $ modZ(n): a = a $ = '(mpbir (zdvdeq2 zsubid) zdvd02);
| ^
error: expecting (
../examples/peano.mm1:4464:30:
|
4464 | theorem zeqmidd: $ G -> modZ(n): a = a $ = '(a1i zeqmid);
| ^
error: expecting (
../examples/peano.mm1:4465:24:
|
4465 | theorem zeqmtr: $ modZ(n): a = b -> modZ(n): b = c -> modZ(n): a = c $ =
| ^
error: expecting (
../examples/peano.mm1:4467:34:
|
4467 | theorem zeqmtrd (h1: $ G -> modZ(n): a = b $) (h2: $ G -> modZ(n): b = c $):
| ^
error: expecting (
../examples/peano.mm1:4469:26:
|
4469 | theorem zeqmcomb: $ modZ(n): a = b <-> modZ(n): b = a $ =
| ^
error: expecting (
../examples/peano.mm1:4471:25:
|
4471 | theorem zeqmcom: $ modZ(n): a = b -> modZ(n): b = a $ = '(bi1i zeqmcomb);
| ^
error: expecting (
../examples/peano.mm1:4472:34:
|
4472 | theorem zeqmcomd (h: $ G -> modZ(n): a = b $): $ G -> modZ(n): b = a $ = '(syl zeqmcom h);
| ^
error: expecting (
../examples/peano.mm1:4473:35:
|
4473 | theorem zeqmtr4d (h1: $ G -> modZ(n): a = b $) (h2: $ G -> modZ(n): c = b $):
| ^
error: expecting (
../examples/peano.mm1:4475:35:
|
4475 | theorem zeqmtr3d (h1: $ G -> modZ(n): b = a $) (h2: $ G -> modZ(n): b = c $):
| ^
error: expecting (
../examples/peano.mm1:4477:21:
|
4477 | theorem eqzeqm: $ a = b -> modZ(n): a = b $ = '(mpbii zeqmid zeqmeq3);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4478:30:
|
4478 | theorem eqzeqmd (h: $ G -> a = b $): $ G -> modZ(n): a = b $ = '(syl eqzeqm h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4479:25:
|
4479 | theorem zeqmeqm: $ modZ(n): b0 a = b0 b <-> mod(n): a = b $ =
| ^
error: expecting (
../examples/peano.mm1:4481:24:
|
4481 | theorem zeqm03: $ modZ(n): a = 0 <-> b0 n |Z a $ = '(zdvdeq2 zsub02);
| ^
error: expecting (
../examples/peano.mm1:4482:27:
|
4482 | theorem zeqmznsub: $ modZ(n): a -ZN b = 0 <-> mod(n): a = b $ =
| ^
error: expecting (
../examples/peano.mm1:4484:25:
|
4484 | theorem zeqmsub: $ modZ(n): a -Z b = 0 <-> modZ(n): a = b $ = '(zdvdeq2 zsub02);
| ^
error: expecting (
../examples/peano.mm1:4485:25:
|
4485 | theorem zeqmid0: $ modZ(n): b0 n = 0 $ = '(mpbir zeqm03 zdvdid);
| ^
error: expecting (
../examples/peano.mm1:4486:24:
|
4486 | theorem zeqm01: $ modZ(0): a = b <-> a = b $ =
| ^
error: expecting (
../examples/peano.mm1:4489:37:
|
4489 | theorem zeqmeqm23d (h1: $ G -> modZ(n): a = b $) (h2: $ G -> modZ(n): c = d $):
| ^
error: expecting (
../examples/peano.mm1:4494:26:
|
4494 | theorem zeqmeqm2: $ modZ(n): a = b -> (modZ(n): a = c <-> modZ(n): b = c) $ =
| ^
error: expecting (
../examples/peano.mm1:4496:26:
|
4496 | theorem zeqmeqm3: $ modZ(n): b = c -> (modZ(n): a = b <-> modZ(n): a = c) $ =
| ^
error: expecting (
../examples/peano.mm1:4499:26:
|
4499 | theorem zeqmadd1: $ modZ(n): a +Z c = b +Z c <-> modZ(n): a = b $ = '(zdvdeq2 zpnpcan1);
| ^
error: expecting (
../examples/peano.mm1:4500:26:
|
4500 | theorem zeqmadd2: $ modZ(n): a +Z b = a +Z c <-> modZ(n): b = c $ = '(zdvdeq2 zpnpcan2);
| ^
error: expecting (
../examples/peano.mm1:4502:35:
|
4502 | theorem zeqmadd1d (h: $ G -> modZ(n): a = b $): $ G -> modZ(n): a +Z c = b +Z c $ =
| ^
error: expecting (
../examples/peano.mm1:4504:35:
|
4504 | theorem zeqmadd2d (h: $ G -> modZ(n): b = c $): $ G -> modZ(n): a +Z b = a +Z c $ =
| ^
error: expecting (
../examples/peano.mm1:4507:35:
|
4507 | theorem zeqmaddd (h1: $ G -> modZ(n): a = b $) (h2: $ G -> modZ(n): c = d $):
| ^
error: expecting (
../examples/peano.mm1:4511:25:
|
4511 | theorem zeqmneg: $ modZ(n): -uZ a = -uZ b <-> modZ(n): a = b $ =
| ^
error: expecting (
../examples/peano.mm1:4514:26:
|
4514 | theorem zeqmsub1: $ modZ(n): a -Z c = b -Z c <-> modZ(n): a = b $ = 'zeqmadd1;
| ^
error: expecting (
../examples/peano.mm1:4515:26:
|
4515 | theorem zeqmsub2: $ modZ(n): a -Z b = a -Z c <-> modZ(n): b = c $ = '(bitr zeqmadd2 zeqmneg);
| ^
error: expecting (
../examples/peano.mm1:4516:35:
|
4516 | theorem zeqmsubd (h1: $ G -> modZ(n): a = b $) (h2: $ G -> modZ(n): c = d $):
| ^
error: expecting (
../examples/peano.mm1:4520:28:
|
4520 | theorem zeqmznsub1: $ modZ(n): a -ZN c = b -ZN c <-> mod(n): a = b $ =
| ^
error: expecting (
../examples/peano.mm1:4522:28:
|
4522 | theorem zeqmznsub2: $ modZ(n): a -ZN b = a -ZN c <-> mod(n): b = c $ =
| ^
error: expecting (
../examples/peano.mm1:4525:36:
|
4525 | theorem zeqmznsubd (h1: $ G -> mod(n): a = b $) (h2: $ G -> mod(n): c = d $):
| ^
error: expecting (
../examples/peano.mm1:4529:26:
|
4529 | theorem zeqmaddn: $ modZ(n): a +Z b0 n = a $ =
| ^
error: expecting (
../examples/peano.mm1:4532:22:
|
4532 | theorem zeqmmod: $ n != 0 -> modZ(n): b0 (a %Z n) = a $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:4538:24:
|
4538 | theorem zmodeqmod: $ n != 0 -> (a %Z n = b %Z n <-> modZ(n): a = b) $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:4542:31:
|
4542 | theorem dvdzeqm (h1: $ G -> m || n $)
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4546:24:
|
4546 | theorem zeqm11: $ modZ(1): a = b $ = 'zdvd11;
| ^
error: expecting (
../examples/peano.mm1:4550:3:
|
4550 | @(add-eval @ fn (a b) (gcd (eval a) (eval b)))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:4553:27:
|
4553 | theorem gcdcom: $ gcd a b = gcd b a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4557:36:
|
4557 | theorem eqgcd {x} (h: $ G -> (x || d <-> x || a /\ x || b) $):
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4568:22:
|
4568 | theorem gcd00: $ gcd 0 0 = 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:4571:3:
|
4571 | @(add-eval @ fn (a b) (def a (eval a)) @ if {a = 0} 0 (gcd a (eval b)))
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:4574:28:
|
4574 | theorem dfbgcd: $ bgcd a b = least {d | 0 < d /\ E. x E. y x * a = y * b + d} $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4578:24:
|
4578 | theorem bgcd01: $ bgcd 0 b = 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:4585:22:
|
4585 | theorem bgcdlem: $ a != 0 -> 0 < bgcd a b /\ E. x E. y x * a = y * b + bgcd a b $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:4594:22:
|
4594 | theorem bgcdpos: $ a != 0 -> 0 < bgcd a b $ = '(anld @ ! bgcdlem a b x y);
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:4596:35:
|
4596 | theorem bgcdbezout: $ E. x E. y x * a = y * b + bgcd a b $ =
| ^
error: unexpected '*'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:4602:30:
|
4602 | theorem bgcdled (h: $ G -> 0 < d $) (h2: $ G -> x * a = y * b + d $):
| ^
error: expecting (
../examples/peano.mm1:4608:26:
|
4608 | theorem bgcd02: $ bgcd a 0 = a $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:4617:22:
|
4617 | theorem dvdbgcd: $ d || a /\ d || b -> d || bgcd a b $ =
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4622:35:
|
4622 | theorem bgcddvd1lem (h1: $ G -> a != 0 $) (h2: $ G -> x * a = y * b + d $)
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:4644:35:
|
4644 | theorem bgcddvd2lem (h1: $ G -> a != 0 $) (h2: $ G -> x * a = y * b + d $)
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:4660:30:
|
4660 | theorem bgcddvd1: $ bgcd a b || a $ =
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4667:23:
|
4667 | theorem bgcddvd2: $ a != 0 -> bgcd a b || b $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:4673:23:
|
4673 | theorem dvdbgcdb: $ a != 0 -> (d || bgcd a b <-> d || a /\ d || b) $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:4678:22:
|
4678 | theorem gcdbgcd: $ a != 0 -> gcd a b = bgcd a b $ = '(!! eqgcd d dvdbgcdb);
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:4680:22:
|
4680 | theorem gcd01: $ gcd 0 b = b $ = '(trud @ !! eqgcd d @ a1i @ bicom @ bian1 dvd02);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:4682:40:
|
4682 | theorem dvdgcdlem {x} (h: $ G -> (x || d <-> x || a /\ x || b) $):
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4687:21:
|
4687 | theorem dvdgcd: $ d || gcd a b <-> d || a /\ d || b $ =
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4689:28:
|
4689 | theorem gcddvd1: $ gcd a b || a $ = '(anl @ mpbi dvdgcd dvdid);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4690:28:
|
4690 | theorem gcddvd2: $ gcd a b || b $ = '(anr @ mpbi dvdgcd dvdid);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:4692:24:
|
4692 | theorem gcd02: $ gcd a 0 = a $ = '(eqtr gcdcom gcd01);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:4694:21:
|
4694 | theorem bezout: $ a != 0 -> E. x E. y x * a = y * b + gcd a b $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:4697:3:
|
4697 | @(add-eval @ fn (a b) {(gcd (eval a) (eval b)) = 1})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:4700:31:
|
4700 | theorem copcom: $ coprime a b <-> coprime b a $ = '(eqeq1 gcdcom);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4702:28:
|
4702 | theorem dvdcop (h1: $ G -> coprime a b $)
| ^
error: coprime is not a function
../examples/peano.mm1:4706:31:
|
4706 | theorem dfcop2: $ coprime a b <-> A. x (x || a -> x || b -> x = 1) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4714:31:
|
4714 | theorem copbezout (h1: $ G -> coprime a b $) (h2: $ G -> a != 0 $):
| ^
error: coprime is not a function
../examples/peano.mm1:4718:32:
|
4718 | theorem copdvdmul2 (h1: $ G -> coprime a b $) (h2: $ G -> a || b * c $): $ G -> a || c $ =
| ^
error: coprime is not a function
../examples/peano.mm1:4727:32:
|
4727 | theorem copdvdmul1 (h1: $ G -> coprime a c $) (h2: $ G -> a || b * c $): $ G -> a || b $ =
| ^
error: coprime is not a function
../examples/peano.mm1:4730:1:
|
4730 | @_ local def invm (a n: nat): nat = $ least {b | mod(n): a * b = 1} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:4730:45:
|
4730 | @_ local def invm (a n: nat): nat = $ least {b | mod(n): a * b = 1} $;
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/peano.mm1:4732:35:
|
4732 | theorem mulinvmlem (h: $ G -> mod(n): a * b = 1 $): $ G -> mod(n): a * invm a n = 1 $ =
| ^
error: expecting (
../examples/peano.mm1:4735:28:
|
4735 | theorem mulinvm (h: $ G -> coprime a n $):
| ^
error: coprime is not a function
../examples/peano.mm1:4743:1:
|
4743 | @_ local def pset (a: nat): set = $ {n | 0 < fst a /\ 0 < snd a /\
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:4743:44:
|
4743 | @_ local def pset (a: nat): set = $ {n | 0 < fst a /\ 0 < snd a /\
| ^
error: expecting (
../examples/peano.mm1:4746:33:
|
4746 | theorem elpset: $ n e. pset (m, v) <-> 0 < m /\ 0 < v /\
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4752:35:
|
4752 | theorem elpset1: $ ~n e. pset (m, 1) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4757:39:
|
4757 | theorem psetSlem1 (h1: $ G -> A. x (0 < x /\ x < n -> x || m) $)
| ^
error: expecting (
../examples/peano.mm1:4773:39:
|
4773 | theorem psetSlem2 (h1: $ G -> A. x (0 < x /\ x < n -> x || m) $) (h2: $ G -> a != b $)
| ^
error: expecting (
../examples/peano.mm1:4780:29:
|
4780 | theorem psetS (h1: $ G -> 0 < m $) (h2: $ G -> 0 < v $)
| ^
error: expecting (
../examples/peano.mm1:4801:26:
|
4801 | theorem lcmex: $ E. m (0 < m /\ A. x (0 < x /\ x <= n -> x || m)) $ =
| ^
error: expecting (
../examples/peano.mm1:4812:43:
|
4812 | theorem psetsep (p: wff x): $ E. b pset b == {x | x < n /\ p} $ =
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:4838:28:
|
4838 | theorem expset: $ finite A <-> E. a pset a == A $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4851:48:
|
4851 | $ finite {x | p} -> E. a A. x (p -> pset a @ x = v) $ =
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/peano.mm1:4860:1:
|
4860 | @_ abstract def rec (z: nat) (S: set) (n: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:4861:7:
|
4861 | $ the {v | E. a (pset a @ 0 = z /\ pset a @ n = v /\
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/peano.mm1:4865:22:
|
4865 | (h1: $ G -> pset a @ 0 = z $) (h2: $ G -> pset a @ n = v $)
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/peano.mm1:4884:47:
|
4884 | pub theorem rec0 (z: nat) (S: set): $ rec z S 0 = z $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:4891:21:
|
4891 | $ rec z S (suc n) = S @ rec z S n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4922:1:
|
4922 | @_ local def recnaux (z: nat) (S: set) (n: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:4923:9:
|
4923 | $ rec (0, z) (\ p, suc (fst p), S @ p) n $;
| ^
error: expecting (
../examples/peano.mm1:4925:33:
|
4925 | theorem recnaux0: $ recnaux z S 0 = 0, z $ = (named 'rec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:4927:42:
|
4927 | theorem recnauxS2: $ recnaux z S (suc n) =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4932:43:
|
4932 | theorem recnauxfst: $ fst (recnaux z S n) = n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4940:1:
|
4940 | @_ local def recn (z: nat) (S: set) (n: nat): nat = $ snd (recnaux z S n) $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:4940:55:
|
4940 | @_ local def recn (z: nat) (S: set) (n: nat): nat = $ snd (recnaux z S n) $;
| ^
error: snd is not a function
../examples/peano.mm1:4942:27:
|
4942 | theorem recn0: $ recn z S 0 = z $ = (named '(eqtr (sndeq rec0) sndpr));
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:4943:35:
|
4943 | theorem recnS: $ recn z S (suc n) = S @ (n, recn z S n) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4947:1:
|
4947 | @_ local def ocase (z: nat) (S: set): set = $ \ n, recn z (\ i, S @ fst i) n $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:4947:49:
|
4947 | @_ local def ocase (z: nat) (S: set): set = $ \ n, recn z (\ i, S @ fst i) n $;
| ^
error: expecting (
../examples/peano.mm1:4948:31:
|
4948 | theorem ocaseval: $ ocase z S @ n = recn z (\ i, S @ fst i) n $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/peano.mm1:4950:29:
|
4950 | theorem ocase0: $ ocase z S @ 0 = z $ = (named '(eqtr ocaseval recn0));
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/peano.mm1:4951:29:
|
4951 | theorem ocaseS: $ ocase z S @ suc n = S @ n $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/peano.mm1:4955:1:
|
4955 | @_ local def ocasep (z: wff) (S: set): set = $ {n | ifp (n = 0) z (n - 1 e. S)} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:4955:62:
|
4955 | @_ local def ocasep (z: wff) (S: set): set = $ {n | ifp (n = 0) z (n - 1 e. S)} $;
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:4956:22:
|
4956 | theorem ocasep0: $ 0 e. ocasep z S <-> z $ = (named '(elabe ifppos));
| ^
error: expecting (
../examples/peano.mm1:4957:40:
|
4957 | theorem ocasepS: $ suc n e. ocasep z S <-> n e. S $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4961:1:
|
4961 | @_ local def Tail (S: set): set = $ {n | suc n e. S} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:4961:42:
|
4961 | @_ local def Tail (S: set): set = $ {n | suc n e. S} $;
| ^
error: suc is not a function
../examples/peano.mm1:4962:31:
|
4962 | theorem elTail: $ n e. Tail S <-> suc n e. S $ = '(elabe ,eqtac);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:4963:42:
|
4963 | theorem Tail_ocasep: $ Tail (ocasep z S) == S $ = (named '(ax_gen @ bitr elTail ocasepS));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4964:34:
|
4964 | theorem ocasep_Tail: $ ocasep (0 e. S) (Tail S) == S $ =
| ^
error: expecting (
../examples/peano.mm1:4972:1:
|
4972 | @_ abstract def obind (a: nat) (F: set): nat = $ ocase 0 F @ a $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:4972:56:
|
4972 | @_ abstract def obind (a: nat) (F: set): nat = $ ocase 0 F @ a $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:4973:38:
|
4973 | pub theorem obind0 (F: set): $ obind 0 F = 0 $ = 'ocase0;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:4974:57:
|
4974 | pub theorem obindS (n: nat) (F: set): $ obind (suc n) F = F @ n $ = 'ocaseS;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4976:31:
|
4976 | theorem obindS2: $ obind n (\ x, suc x) = n $ =
| ^
error: expecting (
../examples/peano.mm1:4980:31:
|
4980 | theorem obindeqS: $ obind n F = suc a <-> E. m (n = suc m /\ F @ m = suc a) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:4991:3:
|
4991 | @(add-eval @ fn (a b) {(eval a) ^ (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:4993:8:
|
4993 | infixr pow: $^$ prec 81;
| ^
error: term 'pow' not declared
../examples/peano.mm1:4995:23:
|
4995 | pub theorem pow0: $ a ^ 0 = 1 $ = (named 'rec0);
| ^
error: unexpected '^'
expecting '$' or infix >= 0
../examples/peano.mm1:4996:23:
|
4996 | pub theorem powS: $ a ^ suc b = a * a ^ b $ =
| ^
error: unexpected '^'
expecting '$' or infix >= 0
../examples/peano.mm1:4998:20:
|
4998 | theorem powS2: $ a ^ suc b = a ^ b * a $ = '(eqtr powS mulcom);
| ^
error: unexpected '^'
expecting '$' or infix >= 0
../examples/peano.mm1:4999:20:
|
4999 | theorem pow12: $ a ^ 1 = a $ = '(eqtr powS @ eqtr (muleq2 pow0) mul12);
| ^
error: unexpected '^'
expecting '$' or infix >= 0
../examples/peano.mm1:5000:20:
|
5000 | theorem pow22: $ a ^ 2 = a * a $ = '(eqtr powS @ muleq2 pow12);
| ^
error: unexpected '^'
expecting '$' or infix >= 0
../examples/peano.mm1:5002:20:
|
5002 | theorem pow11: $ 1 ^ b = 1 $ =
| ^
error: expecting (
../examples/peano.mm1:5006:21:
|
5006 | theorem powpos: $ 0 < a -> 0 < a ^ b $ =
| ^
error: expecting (
../examples/peano.mm1:5010:21:
|
5010 | theorem powne0: $ a != 0 -> a ^ b != 0 $ = '(sylbir lt01 @ sylib lt01 powpos);
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:5011:22:
|
5011 | theorem pow2ne0: $ 2 ^ b != 0 $ = '(powne0 d2ne0);
| ^
error: expecting (
../examples/peano.mm1:5013:23:
|
5013 | theorem powltid2: $ 1 < a -> b < a ^ b $ =
| ^
error: expecting (
../examples/peano.mm1:5019:21:
|
5019 | theorem powadd: $ a ^ (b + c) = a ^ b * a ^ c $ =
| ^
error: unexpected '^'
expecting '$' or infix >= 0
../examples/peano.mm1:5024:21:
|
5024 | theorem powmul: $ a ^ (b * c) = (a ^ b) ^ c $ =
| ^
error: unexpected '^'
expecting '$' or infix >= 0
../examples/peano.mm1:5029:21:
|
5029 | theorem powdvd: $ b <= c -> a ^ b || a ^ c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5031:22:
|
5031 | theorem powdvd1: $ 0 < b -> a || a ^ b $ = '(sylib (dvdeq1 pow12) powdvd);
| ^
error: expecting (
../examples/peano.mm1:5032:22:
|
5032 | theorem lepow2a: $ a != 0 -> b <= c -> a ^ b <= a ^ c $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:5034:21:
|
5034 | theorem ltpow2: $ 1 < a -> (b < c <-> a ^ b < a ^ c) $ =
| ^
error: expecting (
../examples/peano.mm1:5040:21:
|
5040 | theorem lepow2: $ 1 < a -> (b <= c <-> a ^ b <= a ^ c) $ =
| ^
error: expecting (
../examples/peano.mm1:5044:3:
|
5044 | @(add-eval @ fn (a b) {(eval a) shl (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:5047:3:
|
5047 | @(add-eval @ fn (a b) {(eval a) shr (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:5050:22:
|
5050 | theorem shl01: $ shl 0 b = 0 $ = 'mul01;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5051:24:
|
5051 | theorem shl02: $ shl a 0 = a $ = '(eqtr (muleq2 pow0) mul12);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5052:22:
|
5052 | theorem shl11: $ shl 1 b = 2 ^ b $ = 'mul11;
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/peano.mm1:5053:24:
|
5053 | theorem shl12: $ shl a 1 = b0 a $ = '(eqtr (muleq2 pow12) b0mul22);
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/peano.mm1:5054:35:
|
5054 | theorem shlshl: $ shl (shl a b) c = shl a (b + c) $ = '(eqtr4 mulass (muleq2 powadd));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5055:28:
|
5055 | theorem shladd: $ shl (a + b) c = shl a c + shl b c $ = 'addmul;
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5056:25:
|
5056 | theorem shlpow2dvd: $ 2 ^ b || shl a b $ = 'dvdmul1;
| ^
error: expecting (
../examples/peano.mm1:5057:22:
|
5057 | theorem shl2dvd: $ 0 < b -> 2 || shl a b $ =
| ^
error: expecting (
../examples/peano.mm1:5060:22:
|
5060 | theorem shr01: $ shr 0 b = 0 $ = 'div01;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5061:24:
|
5061 | theorem shr02: $ shr a 0 = a $ = '(eqtr (diveq2 pow0) div12);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5062:24:
|
5062 | theorem shr12: $ shr a 1 = a // 2 $ = '(diveq2 pow12);
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/peano.mm1:5063:35:
|
5063 | theorem shrshr: $ shr (shr a b) c = shr a (b + c) $ = '(eqtr4 divdiv (diveq2 powadd));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5064:32:
|
5064 | theorem shrmodadd1: $ shr (a % 2 ^ (b + c)) b = shr a b % 2 ^ c $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5066:32:
|
5066 | theorem shrmodadd2: $ shr (a % 2 ^ (b + c)) c = shr a c % 2 ^ b $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5068:24:
|
5068 | theorem shrmodsub: $ c <= b -> shr (a % 2 ^ b) c = shr a c % 2 ^ (b - c) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5070:37:
|
5070 | theorem shrshladd: $ shr (shl a b + c) b = a + shr c b $ = '(muladddiv1 pow2ne0);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5071:26:
|
5071 | theorem shrshladdid: $ c < 2 ^ b -> shr (shl a b + c) b = a $ = '(exp muladddiv1lt pow2ne0);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5072:37:
|
5072 | theorem shrshlid: $ shr (shl a b) b = a $ = '(muldiv1 pow2ne0);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5073:22:
|
5073 | theorem shrshl1: $ c <= b -> shr (shl a b) c = shl a (b - c) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5075:22:
|
5075 | theorem shrshl2: $ b <= c -> shr (shl a b) c = shr a (c - b) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5078:27:
|
5078 | theorem shreq0: $ shr a b = 0 <-> a < 2 ^ b $ = '(diveq0 pow2ne0);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5085:1:
|
5085 | @_ def ns (a .x: nat): set = $ {x | odd (shr a x)} $; coercion ns: nat > set;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5085:37:
|
5085 | @_ def ns (a .x: nat): set = $ {x | odd (shr a x)} $; coercion ns: nat > set;
| ^
error: odd is not a function
../examples/peano.mm1:5085:64:
|
5085 | @_ def ns (a .x: nat): set = $ {x | odd (shr a x)} $; coercion ns: nat > set;
| ^
error: term 'ns' not declared
../examples/peano.mm1:5087:25:
|
5087 | theorem elnel: $ a e. b <-> odd (shr b a) $ = '(elabe ,eqtac);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5088:30:
|
5088 | theorem elneqd (h1: $ G -> a = b $) (h2: $ G -> c = d $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5090:30:
|
5090 | theorem elneq2d (h: $ G -> b = c $): $ G -> (a e. b <-> a e. c) $ = '(elneqd eqidd h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5091:21:
|
5091 | theorem elneq2: $ b = c -> (a e. b <-> a e. c) $ = '(elneq2d id);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5092:20:
|
5092 | theorem elneq: $ a = b -> c = d -> (a e. c <-> b e. d) $ = '(exp @ elneqd anl anr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5093:31:
|
5093 | theorem appneq1d (h: $ G -> f = g $): $ G -> f @ x = g @ x $ = '(appeq1d @ nseqd h);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5094:22:
|
5094 | theorem appneq1: $ f = g -> f @ x = g @ x $ = '(appneq1d id);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5095:35:
|
5095 | theorem nfns (a: nat x) (h: $ FN/ x a $): $ FS/ x a $ = (named '(nfslem nseq h));
| ^
error: expecting (
../examples/peano.mm1:5097:19:
|
5097 | theorem el01: $ 0 e. a <-> odd a $ = '(bitr elnel @ oddeq shr02);
| ^
error: expecting (
../examples/peano.mm1:5099:31:
|
5099 | theorem elshr: $ a e. shr b c <-> a + c e. b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5102:31:
|
5102 | theorem elshl: $ a e. shl b c <-> c <= a /\ a - c e. b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5108:29:
|
5108 | theorem elmodpow2: $ x e. a % 2 ^ n <-> x < n /\ x e. a $ =
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/peano.mm1:5116:18:
|
5116 | theorem shrss: $ a C_ b -> shr a n C_ shr b n $ =
| ^
error: a is not a function
../examples/peano.mm1:5118:25:
|
5118 | theorem shlss: $ a C_ b <-> shl a n C_ shl b n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5122:26:
|
5122 | theorem eldiv2: $ a e. b // 2 <-> suc a e. b $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:5124:27:
|
5124 | theorem elb0: $ a e. b0 b <-> 0 < a /\ a - 1 e. b $ = '(bitr3 (elneq2 shl12) elshl);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5125:27:
|
5125 | theorem elb1: $ a e. b1 b <-> a = 0 \/ a - 1 e. b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5129:21:
|
5129 | theorem elb00: $ ~0 e. b0 b $ = '(mt (sylbi elb0 anl) ltirr);
| ^
error: expecting prefix >= 0
../examples/peano.mm1:5130:20:
|
5130 | theorem elb10: $ 0 e. b1 b $ = '(mpbir elb1 @ orl eqid);
| ^
error: expecting (
../examples/peano.mm1:5131:32:
|
5131 | theorem elb0S: $ suc a e. b0 b <-> a e. b $ = '(bitr elb0 @ bitr (bian1 lt01S) (eleq1 sucsub1));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5132:32:
|
5132 | theorem elb1S: $ suc a e. b1 b <-> a e. b $ = '(bitr elb1 @ bitr (bior1 peano1) (eleq1 sucsub1));
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5135:15:
|
5135 | $ A. x (x < n -> x e. a -> x e. b) -> a % 2 ^ n <= b % 2 ^ n $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5148:29:
|
5148 | theorem bndext: $ A. x (x < n -> (x e. a <-> x e. b)) -> mod(2 ^ n): a = b $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5151:29:
|
5151 | theorem ssle: $ a C_ b -> a <= b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5157:24:
|
5157 | pub theorem axext: $ a == b -> a = b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5159:20:
|
5159 | theorem nsinj: $ a == b <-> a = b $ = '(ibii axext nseq);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5161:33:
|
5161 | pub theorem ellt: $ a e. b -> a < b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5166:25:
|
5166 | theorem el02: $ ~a e. 0 $ = '(mt ellt lt02);
| ^
error: expecting (
../examples/peano.mm1:5167:29:
|
5167 | pub theorem nel0: $ ~a e. 0 $ = 'el02;
| ^
error: expecting (
../examples/peano.mm1:5169:19:
|
5169 | theorem ss01: $ 0 C_ A $ = '(!! ax_gen x @ absurd el02);
| ^
error: expecting (
../examples/peano.mm1:5170:22:
|
5170 | theorem ss02: $ A C_ 0 <-> A == 0 $ = '(ibii (mpi ss01 ssasym) (mpbiri ss01 sseq1));
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5171:20:
|
5171 | theorem eq0al: $ A == 0 <-> A. x ~ x e. A $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5173:30:
|
5173 | theorem sseq0: $ A C_ B -> B == 0 -> A == 0 $ = '(syl6ib ss02 @ com12 @ bi1d sseq2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5174:19:
|
5174 | theorem in01: $ 0 i^i A == 0 $ = '(mpbi eqin1 ss01);
| ^
error: expecting (
../examples/peano.mm1:5175:19:
|
5175 | theorem in02: $ A i^i 0 == 0 $ = '(mpbi eqin2 ss01);
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:5176:20:
|
5176 | theorem inidm: $ A i^i A == A $ = '(mpbi eqin2 ssid);
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:5177:19:
|
5177 | theorem un01: $ 0 u. A == A $ = '(mpbi equn1 ss01);
| ^
error: expecting (
../examples/peano.mm1:5178:19:
|
5178 | theorem un02: $ A u. 0 == A $ = '(mpbi equn2 ss01);
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/peano.mm1:5179:20:
|
5179 | theorem unidm: $ A u. A == A $ = '(mpbi equn2 ssid);
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/peano.mm1:5180:20:
|
5180 | theorem uneq0: $ A u. B == 0 <-> A == 0 /\ B == 0 $ =
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/peano.mm1:5182:26:
|
5182 | theorem cplv: $ Compl _V == 0 $ = '(!! eqri x @ binth (con2 (bi1 elcpl) elv) el02);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5183:23:
|
5183 | theorem cpl0: $ Compl 0 == _V $ = '(eqstr3 (cpleq cplv) cplcpl);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5184:21:
|
5184 | theorem incpl2: $ A i^i Compl A == 0 $ = '(mpbir cplinj @ eqstr cplin @ eqstr4 uncpl2 cpl0);
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:5185:27:
|
5185 | theorem incpl1: $ Compl A i^i A == 0 $ = '(eqstr incom incpl2);
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:5186:23:
|
5186 | theorem incpleq0: $ A i^i Compl B == 0 <-> A C_ B $ =
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:5188:20:
|
5188 | theorem ineq0: $ A i^i B == 0 <-> A C_ Compl B $ = '(bitr3 (eqseq1 @ ineq2 cplcpl) incpleq0);
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:5189:21:
|
5189 | theorem ineq0r: $ A i^i B == 0 <-> B C_ Compl A $ = '(bitr (eqseq1 incom) ineq0);
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:5190:32:
|
5190 | theorem sscpl2: $ A C_ Compl B <-> B C_ Compl A $ = '(bitr3 ineq0 ineq0r);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5191:22:
|
5191 | theorem inincpl: $ A i^i (B i^i Compl A) == 0 $ = '(sseq0 (ssin2 inss2) incpl2);
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:5192:22:
|
5192 | theorem unincpl: $ A u. (B i^i Compl A) == A u. B $ =
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/peano.mm1:5194:20:
|
5194 | theorem xp01: $ Xp 0 A == 0 $ = '(mpbir eq0al @ !! ax_gen x @ mt xpfst el02);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5195:22:
|
5195 | theorem xp02: $ Xp A 0 == 0 $ = '(mpbir eq0al @ !! ax_gen x @ mt xpsnd el02);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5196:24:
|
5196 | theorem dmeq0: $ Dom A == 0 <-> A == 0 $ = '(bitr3 ss02 @ bitr ssdm @ bitr (sseq2 xp01) ss02);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5197:24:
|
5197 | theorem rneq0: $ Ran A == 0 <-> A == 0 $ = '(bitr3 ss02 @ bitr ssrn @ bitr (sseq2 xp02) ss02);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5198:20:
|
5198 | theorem dm0: $ Dom 0 == 0 $ = '(mpbir dmeq0 eqsid);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5199:20:
|
5199 | theorem rn0: $ Ran 0 == 0 $ = '(mpbir rneq0 eqsid);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5200:22:
|
5200 | theorem the01: $ the 0 = 0 $ = '(trud @ !! eqthe0d x @ a1i @ absurd el02);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5201:23:
|
5201 | theorem isf0: $ isfun 0 $ = '(!! ax_gen x @ !! ax_gen y @ !! ax_gen z @ absurd el02);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5202:21:
|
5202 | theorem rapp01: $ 0 @' a == 0 $ = '(mpbir eq0al @ !! ax_gen x @ mtbir elrapp el02);
| ^
error: expecting (
../examples/peano.mm1:5203:21:
|
5203 | theorem sapp01: $ 0 @@ a == 0 $ =
| ^
error: expecting (
../examples/peano.mm1:5205:20:
|
5205 | theorem app01: $ 0 @ a = 0 $ = (named '(eqtr (theeq rapp01) the01));
| ^
error: expecting (
../examples/peano.mm1:5206:21:
|
5206 | theorem Fst0: $ Fst 0 == 0 $ = '(mpbir eq0al @ !! ax_gen x @ mtbir elFst el02);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5207:21:
|
5207 | theorem Snd0: $ Snd 0 == 0 $ = '(mpbir eq0al @ !! ax_gen x @ mtbir elSnd el02);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5208:21:
|
5208 | theorem Sum0: $ Sum 0 0 == 0 $ = '(eqstr3 (Sumeq Fst0 Snd0) FstSnd);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5210:30:
|
5210 | theorem disjne (h1: $ G -> A i^i B == 0 $)
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:5216:24:
|
5216 | theorem unisf: $ Dom A i^i Dom B == 0 -> (isfun (A u. B) <-> isfun A /\ isfun B) $ =
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:5225:25:
|
5225 | theorem reseq0: $ Dom F i^i A == 0 <-> F |` A == 0 $ =
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:5228:26:
|
5228 | theorem dmdisj1: $ Dom A i^i Dom B == 0 -> A i^i B == 0 $ =
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:5232:31:
|
5232 | theorem dmdisj: $ isfun (A u. B) -> (Dom A i^i Dom B == 0 <-> A i^i B == 0) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5239:23:
|
5239 | theorem appleid1: $ f @ x <= f $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/peano.mm1:5245:35:
|
5245 | theorem elobind: $ x e. obind n F <-> E. y (n = suc y /\ x e. F @ y) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5253:24:
|
5253 | theorem el12: $ a e. 1 <-> a = 0 $ =
| ^
error: expecting (
../examples/peano.mm1:5256:26:
|
5256 | theorem elpow2: $ a e. 2 ^ n <-> a = n $ =
| ^
error: expecting (
../examples/peano.mm1:5260:27:
|
5260 | theorem finns (a: nat): $ finite a $ =
| ^
error: finite is not a function
../examples/peano.mm1:5267:1:
|
5267 | @_ def lower (A: set): nat = $ the {n | n == A} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5267:36:
|
5267 | @_ def lower (A: set): nat = $ the {n | n == A} $;
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/peano.mm1:5268:52:
|
5268 | theorem nflower (A: set x) (h: $ FS/ x A $): $ FN/ x lower A $ =
| ^
error: expecting (
../examples/peano.mm1:5271:33:
|
5271 | pub theorem eqlower: $ finite A <-> A == lower A $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5298:50:
|
5298 | theorem ellower: $ finite A -> (a e. lower A <-> a e. A) $ = '(bicomd @ eleq2d @ bi1 eqlower);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5300:28:
|
5300 | theorem lowerns: $ lower a = a $ = '(eqcom @ axext @ mpbi eqlower finns);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5302:39:
|
5302 | theorem eqlower1: $ finite A -> (A == a <-> lower A = a) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5304:39:
|
5304 | theorem eqlower2: $ finite A -> (a == A <-> a = lower A) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5306:51:
|
5306 | theorem lowerinj: $ finite A -> finite B -> (A == B <-> lower A = lower B) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5308:40:
|
5308 | theorem lower0: $ ~finite A -> lower A = 0 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5310:20:
|
5310 | theorem lowerss: $ lower A C_ A $ =
| ^
error: lower is not a function
../examples/peano.mm1:5314:1:
|
5314 | @_ abstract def sn (a: nat): nat = $ 2 ^ a $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5314:40:
|
5314 | @_ abstract def sn (a: nat): nat = $ 2 ^ a $;
| ^
error: expecting (
../examples/peano.mm1:5315:42:
|
5315 | pub theorem elsn (a b: nat): $ a e. sn b <-> a = b $ = 'elpow2;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5316:22:
|
5316 | theorem snid: $ a e. sn a $ = '(mpbir elsn eqid);
| ^
error: sn is not a function
../examples/peano.mm1:5318:27:
|
5318 | theorem snss: $ sn a C_ A <-> a e. A $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5321:24:
|
5321 | theorem sndisj: $ sn a i^i A == 0 <-> ~a e. A $ = '(bitr ineq0 @ bitr snss elcpl);
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:5323:20:
|
5323 | theorem subsnsn: $ subsn (sn a) $ =
| ^
error: subsn is not a function
../examples/peano.mm1:5326:29:
|
5326 | theorem thesn: $ the (sn a) = a $ = (named '(trud @ eqthed @ a1i elsn));
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5328:23:
|
5328 | theorem sninj: $ sn a = sn b <-> a = b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5331:30:
|
5331 | theorem subsnsssn: $ subsn A <-> E. a A C_ sn a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5334:18:
|
5334 | theorem isfsn: $ isfun (sn x) $ =
| ^
error: isfun is not a function
../examples/peano.mm1:5338:29:
|
5338 | theorem dmsn: $ Dom (sn (x, y)) == sn x $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5341:29:
|
5341 | theorem rnsn: $ Ran (sn (x, y)) == sn y $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5347:1:
|
5347 | @_ abstract def ins (a b: nat): nat = $ lower {x | x = a \/ x e. b} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5347:47:
|
5347 | @_ abstract def ins (a b: nat): nat = $ lower {x | x = a \/ x e. b} $;
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/peano.mm1:5348:8:
|
5348 | infixr ins: $;$ prec 85;
| ^
error: term 'ins' not declared
../examples/peano.mm1:5349:42:
|
5349 | pub theorem elins (a b c: nat): $ a e. b ; c <-> a = b \/ a e. c $ =
| ^
error: unexpected ';'
expecting '$' or infix >= 0
../examples/peano.mm1:5355:21:
|
5355 | theorem inscom: $ a ; b ; c = b ; a ; c $ =
| ^
error: unexpected ';'
expecting '$' or infix >= 0
../examples/peano.mm1:5359:26:
|
5359 | theorem b0ins: $ b0 (a ; b) = suc a ; b0 b $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5365:23:
|
5365 | theorem b1ins: $ b1 n = 0 ; b0 n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5369:29:
|
5369 | theorem insdiv2: $ (suc a ; b) // 2 = a ; (b // 2) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5375:22:
|
5375 | theorem insunsn: $ a ; b == sn a u. b $ =
| ^
error: unexpected ';'
expecting '$' or infix >= 0
../examples/peano.mm1:5378:20:
|
5378 | theorem ins02: $ a ; 0 = sn a $ = '(axext @ eqstr insunsn un02);
| ^
error: unexpected ';'
expecting '$' or infix >= 0
../examples/peano.mm1:5380:20:
|
5380 | theorem insss: $ a ; b C_ A <-> a e. A /\ b C_ A $ =
| ^
error: unexpected ';'
expecting '$' or infix >= 0
../examples/peano.mm1:5383:25:
|
5383 | theorem ssins: $ A C_ a ; b -> a e. A \/ A C_ b $ =
| ^
error: unexpected ';'
expecting '$' or infix >= 0
../examples/peano.mm1:5388:3:
|
5388 | @(add-eval @ fn (n) {{1 shl (eval n)} - 1})
| ^
error: Reference to unbound variable 'add-eval'
../examples/peano.mm1:5391:23:
|
5391 | theorem upto0: $ upto 0 = 0 $ = '(eqtr (subeq1 pow0) subid);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5392:28:
|
5392 | theorem uptoadd1: $ upto n + 1 = 2 ^ n $ = '(npcan @ powpos d0lt2);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:5393:33:
|
5393 | theorem sucupto: $ suc (upto n) = 2 ^ n $ = '(eqtr3 add12 uptoadd1);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5394:31:
|
5394 | theorem uptoS: $ upto (suc n) = b1 (upto n) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5398:35:
|
5398 | theorem uptolem: $ shr (upto n) a = upto (n - a) /\ upto n % 2 ^ a = upto (min n a) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5410:35:
|
5410 | theorem shrupto: $ shr (upto n) a = upto (n - a) $ = '(anl uptolem);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5412:35:
|
5412 | theorem shlupto: $ shl (upto n) a + upto a = upto (n + a) $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:5416:46:
|
5416 | pub theorem elupto (k n: nat): $ k e. upto n <-> k < n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5423:36:
|
5423 | theorem uptoss: $ upto a C_ upto b <-> a <= b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5428:35:
|
5428 | theorem uptoS_ins: $ upto (suc a) = a ; upto a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5432:26:
|
5432 | theorem upto1_sn: $ upto 1 = sn 0 $ = '(eqtr uptoS_ins @ eqtr (inseq2 upto0) ins02);
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/peano.mm1:5434:21:
|
5434 | theorem leupto: $ a <= b <-> upto a <= upto b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5437:28:
|
5437 | theorem dffin2: $ finite A <-> E. n A C_ upto n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5440:1:
|
5440 | @_ local def size (A: set): nat = $ least {k | A C_ upto k} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5440:37:
|
5440 | @_ local def size (A: set): nat = $ least {k | A C_ upto k} $;
| ^
error: least is not a function
../examples/peano.mm1:5442:28:
|
5442 | theorem sssize: $ finite A <-> A C_ upto (size A) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5447:42:
|
5447 | theorem sizess1: $ A C_ upto k -> size A <= k $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5449:48:
|
5449 | theorem sizess: $ finite A -> (A C_ upto k <-> size A <= k) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5451:35:
|
5451 | theorem sizeupto: $ size (upto n) = n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5455:21:
|
5455 | def Bool: nat = $ 0 ; sn 1 $;
| ^
error: expecting (
../examples/peano.mm1:5457:29:
|
5457 | theorem elBool: $ n e. Bool <-> bool n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5459:20:
|
5459 | theorem Bool0: $ 0 e. Bool $ = '(mpbir elBool bool0);
| ^
error: expecting (
../examples/peano.mm1:5460:20:
|
5460 | theorem Bool1: $ 1 e. Bool $ = '(mpbir elBool bool1);
| ^
error: expecting (
../examples/peano.mm1:5461:26:
|
5461 | theorem Bool0d: $ G -> 0 e. Bool $ = '(a1i Bool0);
| ^
error: expecting (
../examples/peano.mm1:5462:26:
|
5462 | theorem Bool1d: $ G -> 1 e. Bool $ = '(a1i Bool1);
| ^
error: expecting (
../examples/peano.mm1:5463:20:
|
5463 | theorem boolfin: $ finite Bool $ = '(mpbir (fineq @ !! eqab2i n elBool) ltfin);
| ^
error: finite is not a function
../examples/peano.mm1:5467:1:
|
5467 | @_ def Option (A: set): set = $ {n | n = 0 \/ n - 1 e. A} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5467:42:
|
5467 | @_ def Option (A: set): set = $ {n | n = 0 \/ n - 1 e. A} $;
| ^
error: expecting infix >= 1 or }
../examples/peano.mm1:5469:32:
|
5469 | theorem elopt: $ a e. Option A <-> a = 0 \/ a - 1 e. A $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5472:19:
|
5472 | theorem opt0: $ 0 e. Option A $ = '(mpbir elopt (orl eqid));
| ^
error: expecting (
../examples/peano.mm1:5473:35:
|
5473 | theorem optS: $ suc a e. Option A <-> a e. A $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5475:25:
|
5475 | theorem opt0d: $ G -> 0 e. Option A $ = '(a1i opt0);
| ^
error: expecting (
../examples/peano.mm1:5476:44:
|
5476 | theorem optSd (h: $ G -> a e. A $): $ G -> suc a e. Option A $ = '(sylibr optS h);
| ^
error: suc is not a function
../examples/peano.mm1:5478:39:
|
5478 | theorem optss: $ Option A C_ Option B <-> A C_ B $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5482:19:
|
5482 | theorem optfin: $ finite A -> finite (Option A) $ =
| ^
error: finite is not a function
../examples/peano.mm1:5488:27:
|
5488 | theorem optns: $ Option n == b1 n $ = '(!! ax_gen x @ bitr4 elopt elb1);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5489:36:
|
5489 | theorem optupto: $ Option (upto n) == upto (suc n) $ = '(eqstr4 optns @ nseq uptoS);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5492:1:
|
5492 | @_ def Power (A: set): set = $ {x | x C_ A} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5492:37:
|
5492 | @_ def Power (A: set): set = $ {x | x C_ A} $;
| ^
error: inferred two types nat, wff for x
../examples/peano.mm1:5494:33:
|
5494 | theorem elPower: $ a e. Power A <-> a C_ A $ = '(!! elabe x @ sseq1d nseq);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5496:21:
|
5496 | theorem powerfin: $ finite A -> finite (Power A) $ =
| ^
error: finite is not a function
../examples/peano.mm1:5501:1:
|
5501 | @_ def power (a: nat): nat = $ lower (Power a) $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5501:32:
|
5501 | @_ def power (a: nat): nat = $ lower (Power a) $;
| ^
error: lower is not a function
../examples/peano.mm1:5503:44:
|
5503 | theorem elpower (a b: nat): $ a e. power b <-> a C_ b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5506:46:
|
5506 | theorem powerupto (a: nat): $ power (upto a) = upto (2 ^ a) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5513:3:
|
5513 | @(derive-eq 'uni) def sUnion (A: set): set = $ {x | E. y (x e. y /\ y e. A)} $;
| ^
error: Reference to unbound variable 'derive-eq'
../examples/peano.mm1:5515:32:
|
5515 | theorem eluni: $ a e. sUnion A <-> E. x (a e. x /\ x e. A) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5517:34:
|
5517 | theorem elunii: $ a e. A -> b e. a -> b e. sUnion A $ =
| ^
error: inferred two types nat, set for a
../examples/peano.mm1:5519:30:
|
5519 | theorem elssuni: $ a e. A -> a C_ sUnion A $ = (named '(iald elunii));
| ^
error: inferred two types nat, wff for a
../examples/peano.mm1:5521:19:
|
5521 | theorem finuni: $ finite A -> finite (sUnion A) $ =
| ^
error: finite is not a function
../examples/peano.mm1:5525:38:
|
5525 | theorem xabfin (B: set x) (h: $ G -> finite A $) (h2: $ G /\ x e. A -> finite B $):
| ^
error: finite is not a function
../examples/peano.mm1:5536:34:
|
5536 | theorem xabfini (B: set x) (h: $ finite A $) (h2: $ x e. A -> finite B $):
| ^
error: finite is not a function
../examples/peano.mm1:5540:15:
|
5540 | (hA: $ G -> finite A $) (hB: $ G /\ x e. A -> finite B $): $ G -> finite (S\ x, B) $ =
| ^
error: finite is not a function
../examples/peano.mm1:5545:1:
|
5545 | @_ def cons (a b: nat): nat = $ suc (a, b) $; infixr cons: $:$ prec 91;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5545:41:
|
5545 | @_ def cons (a b: nat): nat = $ suc (a, b) $; infixr cons: $:$ prec 91;
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5545:54:
|
5545 | @_ def cons (a b: nat): nat = $ suc (a, b) $; infixr cons: $:$ prec 91;
| ^
error: term 'cons' not declared
../examples/peano.mm1:5547:22:
|
5547 | theorem consne0: $ a : b != 0 $ = 'peano1;
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:5548:24:
|
5548 | theorem ltconsid1: $ a < a : b $ = '(mpbi leltsuc leprid1);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5549:24:
|
5549 | theorem ltconsid2: $ b < a : b $ = '(mpbi leltsuc leprid2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5550:25:
|
5550 | theorem consfstsnd: $ a != 0 -> fst (a - 1) : snd (a - 1) = a $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:5552:21:
|
5552 | theorem excons: $ a != 0 <-> E. x E. y a = x : y $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:5557:22:
|
5557 | theorem consinj: $ a : c = b : d <-> a = b /\ c = d $ = '(bitr peano2 prth);
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:5558:23:
|
5558 | theorem conscan1: $ a : c = b : c <-> a = b $ = '(bitr consinj @ bian2 eqid);
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:5559:23:
|
5559 | theorem conscan2: $ a : b = a : c <-> b = c $ = '(bitr consinj @ bian1 eqid);
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:5560:30:
|
5560 | theorem consfst: $ fst ((a : b) - 1) = a $ = '(eqtr (fsteq sucsub1) fstpr);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5561:30:
|
5561 | theorem conssnd: $ snd ((a : b) - 1) = b $ = '(eqtr (sndeq sucsub1) sndpr);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5563:22:
|
5563 | theorem lecons1: $ a <= b <-> a : c <= b : c $ = '(bitr lepr1 lesuc);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5564:22:
|
5564 | theorem lecons2: $ b <= c <-> a : b <= a : c $ = '(bitr lepr2 lesuc);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5565:22:
|
5565 | theorem ltcons1: $ a < b <-> a : c < b : c $ = '(bitr ltpr1 ltsuc);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5566:22:
|
5566 | theorem ltcons2: $ b < c <-> a : b < a : c $ = '(bitr ltpr2 ltsuc);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5572:1:
|
5572 | @_ abstract def sep (n: nat) (A: set): nat = $ lower (n i^i A) $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5572:61:
|
5572 | @_ abstract def sep (n: nat) (A: set): nat = $ lower (n i^i A) $;
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5574:18:
|
5574 | $ a e. sep n A <-> a e. n /\ a e. A $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5577:1:
|
5577 | @_ local def func (F A B: set): wff = $ isfun F /\ Dom F == A /\ Ran F C_ B $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5577:49:
|
5577 | @_ local def func (F A B: set): wff = $ isfun F /\ Dom F == A /\ Ran F C_ B $;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:5580:65:
|
5580 | (hF: $ FS/ x F $) (hA: $ FS/ x A $) (hB: $ FS/ x B $): $ F/ x func F A B $ =
| ^
error: func is not a function
../examples/peano.mm1:5582:20:
|
5582 | theorem funcisf: $ func F A B -> isfun F $ = 'anll;
| ^
error: func is not a function
../examples/peano.mm1:5583:39:
|
5583 | theorem funcdm: $ func F A B -> Dom F == A $ = 'anlr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5584:19:
|
5584 | theorem funcrn: $ func F A B -> Ran F C_ B $ = 'anr;
| ^
error: func is not a function
../examples/peano.mm1:5585:20:
|
5585 | theorem funcss3: $ B C_ C -> func F A B -> func F A C $ = '(anim2d @ com12 sstr);
| ^
error: B is not a function
../examples/peano.mm1:5587:30:
|
5587 | theorem funcal: $ func F A B <-> isfun F /\ Dom F == A /\ A. x (x e. A -> F @ x e. B) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5590:31:
|
5590 | theorem funcres: $ func F A B /\ C C_ A -> func (F |` C) C B $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:5595:21:
|
5595 | theorem funcssxp: $ func F A B -> F C_ Xp A B $ =
| ^
error: func is not a function
../examples/peano.mm1:5599:20:
|
5599 | theorem funcfin: $ func F A B -> finite A -> finite B -> finite F $ =
| ^
error: func is not a function
../examples/peano.mm1:5602:29:
|
5602 | theorem funcT: $ func F A B /\ x e. A -> F @ x e. B $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:5605:30:
|
5605 | theorem eqfunc: $ func F A B /\ func G A C ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:5611:40:
|
5611 | theorem funceq0: $ func F A B -> (F == 0 <-> A == 0) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5614:26:
|
5614 | theorem func02: $ func F 0 B <-> F == 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5617:28:
|
5617 | theorem func03: $ func F A 0 <-> F == 0 /\ A == 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5622:31:
|
5622 | theorem unfunc (h0: $ G -> A1 i^i A2 == 0 $)
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/peano.mm1:5631:39:
|
5631 | theorem funcappb: $ func F A B -> (a, b e. F <-> a e. A /\ F @ a = b) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5636:1:
|
5636 | @_ def Arrow (A B: set) (.f: nat): set =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5637:19:
|
5637 | $ {f | isfun f /\ Dom f == A /\ Ran f C_ B} $;
| ^
error: expecting infix >= 1 or }
../examples/peano.mm1:5639:35:
|
5639 | theorem elArrow: $ f e. Arrow A B <-> func f A B $ = '(elabe ,eqtac);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5640:26:
|
5640 | theorem Arrowisf: $ f e. Arrow A B -> isfun f $ = '(sylbi elArrow funcisf);
| ^
error: Arrow is not a function
../examples/peano.mm1:5641:44:
|
5641 | theorem Arrowdm: $ f e. Arrow A B -> Dom f == A $ = '(sylbi elArrow funcdm);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5642:25:
|
5642 | theorem Arrowrn: $ f e. Arrow A B -> Ran f C_ B $ = '(sylbi elArrow funcrn);
| ^
error: Arrow is not a function
../examples/peano.mm1:5644:22:
|
5644 | theorem Arrowssxp: $ Arrow A B C_ Power (Xp A B) $ =
| ^
error: Arrow is not a function
../examples/peano.mm1:5646:21:
|
5646 | theorem Arrowfin: $ finite A -> finite B -> finite (Arrow A B) $ =
| ^
error: finite is not a function
../examples/peano.mm1:5649:32:
|
5649 | theorem appT: $ f e. Arrow A B /\ x e. A -> f @ x e. B $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:5652:26:
|
5652 | theorem Arrow01: $ Arrow 0 B == sn 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5654:23:
|
5654 | theorem Arrow02: $ ~A == 0 -> Arrow A 0 == 0 $ =
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:5659:1:
|
5659 | @_ def rlam {x: nat} (a: nat) (v: nat x): nat = $ lower ((\ x, v) |` a) $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5659:61:
|
5659 | @_ def rlam {x: nat} (a: nat) (v: nat x): nat = $ lower ((\ x, v) |` a) $;
| ^
error: expecting (
../examples/peano.mm1:5660:10:
|
5660 | notation rlam {x: nat} (a: nat) (v: nat x): nat = ($\.$:53) x ($e.$:50) a ($,$:55) v;
| ^
error: term 'rlam' not declared
../examples/peano.mm1:5662:37:
|
5662 | theorem rlameq1 (a b c: nat x): $ a = b -> \. x e. a, c = \. x e. b, c $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5664:36:
|
5664 | theorem rlameqs (a b: nat x): $ \. x e. a, b == (\ x, b) |` a $ =
| ^
error: expecting (
../examples/peano.mm1:5666:47:
|
5666 | theorem elrlam (a: nat) (b: nat x): $ p e. \. x e. a, b <-> E. x (x e. a /\ p = x, b) $ =
| ^
error: expecting (
../examples/peano.mm1:5670:54:
|
5670 | theorem rlameq2a (v w: nat x): $ A. x (x e. a -> v = w) -> \. x e. a, v = \. x e. a, w $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5673:40:
|
5673 | theorem rlameq2da (v w: nat x) (h: $ G /\ x e. a -> v = w $): $ G -> \. x e. a, v = \. x e. a, w $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:5675:41:
|
5675 | theorem nfrlam1 (a b: nat x) (h1: $ FN/ x a $): $ FN/ x \. x e. a, b $ =
| ^
error: expecting (
../examples/peano.mm1:5677:42:
|
5677 | theorem nfrlam (a b: nat x y) (h1: $ FN/ x a $) (h2: $ FN/ x b $): $ FN/ x \. y e. a, b $ =
| ^
error: expecting (
../examples/peano.mm1:5679:46:
|
5679 | theorem cbvrlamh (a b c: nat x y) (h1: $ FN/ y b $) (h2: $ FN/ x c $)
| ^
error: expecting (
../examples/peano.mm1:5683:11:
|
5683 | (e: $ x = y -> b = c $): $ \. x e. a, b = \. y e. a, c $ = '(cbvrlamh nfnv nfnv e);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5684:48:
|
5684 | theorem cbvrlams (a: nat x y) (b: nat x): $ \. x e. a, b = \. y e. a, N[y / x] b $ =
| ^
error: expecting (
../examples/peano.mm1:5687:11:
|
5687 | (h: $ G /\ x = y -> b = c $): $ G -> \. x e. a, b = \. y e. a, c $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:5690:35:
|
5690 | theorem rlamss (a b: nat x): $ \. x e. a, b C_ \ x, b $ = '(mpbir (sseq1 rlameqs) resss);
| ^
error: expecting (
../examples/peano.mm1:5691:43:
|
5691 | theorem rlamisf (a b: nat x): $ isfun (\. x e. a, b) $ = '(isfss rlamss lamisf);
| ^
error: expecting (
../examples/peano.mm1:5692:40:
|
5692 | theorem dmrlam (a b: nat x): $ Dom (\. x e. a, b) == a $ = '(eqstr (dmeq rlameqs) dmreslam);
| ^
error: expecting (
../examples/peano.mm1:5693:38:
|
5693 | theorem rnrlam (b: nat x): $ Ran (\. x e. a, b) == (\ x, b) '' a $ = '(eqstr (rneq rlameqs) rnres);
| ^
error: expecting (
../examples/peano.mm1:5694:40:
|
5694 | theorem rlamrnss (b: nat x): $ Ran (\. x e. a, b) C_ B <-> A. x (x e. a -> b e. B) $ =
| ^
error: expecting (
../examples/peano.mm1:5698:41:
|
5698 | theorem rlamfunc (b: nat x): $ func (\. x e. a, b) a B <-> A. x (x e. a -> b e. B) $ =
| ^
error: expecting (
../examples/peano.mm1:5700:35:
|
5700 | theorem rlamfunc2 (b: nat x): $ A == a ->
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5704:8:
|
5704 | $ \. x e. a, b e. Arrow a B <-> A. x (x e. a -> b e. B) $ = '(bitr elArrow rlamfunc);
| ^
error: expecting (
../examples/peano.mm1:5706:9:
|
5706 | $ (\. x e. a, v) u. (\. x e. b, v) == \. x e. c, v <-> a u. b == c $ =
| ^
error: expecting (
../examples/peano.mm1:5712:48:
|
5712 | theorem apprlams (b c: nat x): $ c e. a -> (\. x e. a, b) @ c = N[c / x] b $ =
| ^
error: expecting (
../examples/peano.mm1:5714:45:
|
5714 | theorem apprlam (b: nat x): $ x e. a -> (\. x e. a, b) @ x = b $ = '(syl6eq sbnid apprlams);
| ^
error: expecting (
../examples/peano.mm1:5715:37:
|
5715 | theorem apprlame (b: nat x) (e: $ x = c -> b = d $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5717:38:
|
5717 | theorem apprlamed (b: nat x) (e: $ G /\ x = c -> b = d $) (h: $ G -> c e. a $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:5719:60:
|
5719 | theorem apprlamed1 (b: nat x) (h: $ G -> c e. a $) (e: $ G /\ x = c -> f @ c = b -> P $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:5725:11:
|
5725 | (e: $ G /\ x = c -> b = d $): $ G -> f = \. x e. a, b -> f @ c = d $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/peano.mm1:5727:37:
|
5727 | theorem rlameq2b (v w: nat x): $ \. x e. a, v = \. x e. a, w <-> A. x (x e. a -> v = w) $ =
| ^
error: expecting (
../examples/peano.mm1:5730:49:
|
5730 | theorem apprlam0 (b c: nat x): $ ~c e. a -> (\. x e. a, b) @ c = 0 $ =
| ^
error: expecting (
../examples/peano.mm1:5732:42:
|
5732 | theorem rlamrcl (b c: nat x): $ d e. (\. x e. a, b) @ c -> c e. a $ =
| ^
error: expecting (
../examples/peano.mm1:5734:23:
|
5734 | theorem rlamapp: $ \. x e. a, F @ x == F <-> isfun F /\ Dom F == a $ =
| ^
error: expecting (
../examples/peano.mm1:5736:33:
|
5736 | theorem eqsrlam (b: nat x): $ F == \. x e. a, b <->
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5741:32:
|
5741 | theorem eqrlam (b: nat x): $ f = \. x e. a, b <->
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5744:36:
|
5744 | theorem funcsn2: $ func F a (sn b) <-> F == \. x e. a, b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5746:36:
|
5746 | theorem Arrowsn2: $ Arrow a (sn b) == sn (\. x e. a, b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5751:1:
|
5751 | @_ def write (F: set) (a b: nat): set =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5752:6:
|
5752 | $ S\ x, {y | ifp (x = a) (y = b) (x, y e. F)} $;
| ^
error: expecting (
../examples/peano.mm1:5755:6:
|
5755 | $ x, y e. write F a b <-> ifp (x = a) (y = b) (x, y e. F) $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:5758:44:
|
5758 | pub theorem writeEq (F a b): $ write F a b @ a = b $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/peano.mm1:5760:36:
|
5760 | pub theorem writeNe (F a b x): $ x != a -> write F a b @ x = F @ x $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:5763:21:
|
5763 | theorem writeisf: $ isfun F -> isfun (write F a b) $ =
| ^
error: isfun is not a function
../examples/peano.mm1:5768:33:
|
5768 | theorem writeres: $ write F a b == (F |` {x | x != a}) u. sn (a, b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5773:21:
|
5773 | theorem writefin: $ finite F -> finite (write F a b) $ =
| ^
error: finite is not a function
../examples/peano.mm1:5776:38:
|
5776 | theorem dmwrite: $ Dom (write F a b) == Dom F u. sn a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5784:47:
|
5784 | theorem rnwrite: $ Ran (write F a b) C_ Ran F u. sn b $ =
| ^
error: unexpected 'u'
expecting '$' or infix >= 0
../examples/peano.mm1:5790:20:
|
5790 | (hf: $ G -> f e. Arrow A B $) (ha: $ G -> a e. A $) (hb: $ G -> b e. B $)
| ^
error: Arrow is not a function
../examples/peano.mm1:5799:1:
|
5799 | @_ local def srecaux (S: set) (n: nat) {.a .b: nat}: nat =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5800:8:
|
5800 | $ recn 0 (\\ a, \ b, lower (write b a (S @ b))) n $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5802:31:
|
5802 | theorem srecaux0: $ srecaux S 0 = 0 $ = (named 'recn0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5803:39:
|
5803 | theorem srecauxS: $ srecaux S (suc n) ==
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5809:40:
|
5809 | theorem dmsrecaux: $ Dom (srecaux S n) == upto n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5816:23:
|
5816 | theorem srecauxisf: $ isfun (srecaux S n) $ =
| ^
error: isfun is not a function
../examples/peano.mm1:5823:1:
|
5823 | @_ abstract def srec (S: set) (n: nat): nat = $ srecaux S (suc n) @ n $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5823:67:
|
5823 | @_ abstract def srec (S: set) (n: nat): nat = $ srecaux S (suc n) @ n $;
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/peano.mm1:5825:25:
|
5825 | theorem srecauxapp: $ a < n -> srecaux S n @ a = srec S a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5832:30:
|
5832 | theorem srecval2: $ srec S n = S @ srecaux S n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5835:23:
|
5835 | theorem srecres: $ (\ i, srec S i) |` upto n == srecaux S n $ =
| ^
error: expecting (
../examples/peano.mm1:5839:24:
|
5839 | theorem srecrlam: $ \. i e. upto n, srec S i = srecaux S n $ =
| ^
error: expecting (
../examples/peano.mm1:5843:7:
|
5843 | $ f = \. x e. upto n, a -> size (Dom f) = n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5847:7:
|
5847 | $ f = \. x e. upto n, a -> b < n -> f @ b = N[b / x] a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5852:43:
|
5852 | pub theorem srecval {i} (S n): $ srec S n = S @ (\. i e. upto n, srec S i) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5855:1:
|
5855 | @_ local def srecpaux (A n) (.f: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5856:11:
|
5856 | $ srec (\ f, nat (size (Dom f), lower {x | true (f @ x)} e. A)) n $;
| ^
error: expecting (
../examples/peano.mm1:5860:1:
|
5860 | @_ abstract def srecp (A: set) (n: nat): wff = $ true (srecpaux A n) $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5860:50:
|
5860 | @_ abstract def srecp (A: set) (n: nat): wff = $ true (srecpaux A n) $;
| ^
error: true is not a function
../examples/peano.mm1:5863:18:
|
5863 | $ srecpaux A n = nat (n, sep (upto n) {i | srecp A i} e. A) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5875:15:
|
5875 | $ srecp A n <-> n, sep (upto n) {i | srecp A i} e. A $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:5879:1:
|
5879 | @_ abstract def card (s .f: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5880:11:
|
5880 | $ srec (\ f, f @ (size (Dom f) // 2) + size (Dom f) % 2) s $;
| ^
error: expecting (
../examples/peano.mm1:5882:30:
|
5882 | theorem cardvallem: $ card n = ((\ i, card i) |` upto n) @ (n // 2) + n % 2 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5887:27:
|
5887 | pub theorem card0: $ card 0 = 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5891:22:
|
5891 | theorem cardval: $ n != 0 -> card n = card (n // 2) + n % 2 $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:5895:31:
|
5895 | theorem cardb0: $ card (b0 n) = card n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5899:31:
|
5899 | theorem cardb1: $ card (b1 n) = suc (card n) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5902:54:
|
5902 | pub theorem cardS (a s: nat): $ ~a e. s -> card (a ; s) = suc (card s) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5938:1:
|
5938 | @_ abstract def lrec (z: nat) (S: set) (n: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5939:11:
|
5939 | $ srec (\ f, N[size (Dom f) / i]
| ^
error: expecting (
../examples/peano.mm1:5942:31:
|
5942 | theorem lrecval: $ lrec z S n =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5953:49:
|
5953 | pub theorem lrec0 (z: nat) (S: set): $ lrec z S 0 = z $ = '(eqtr lrecval @ ifpos eqid);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5955:19:
|
5955 | $ lrec z S (a : b) = S @ (a, b, lrec z S b) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5960:12:
|
5960 | (hn: $ x = n -> (px <-> pn) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5974:12:
|
5974 | (hn: $ x = n -> (px <-> pn) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:5984:1:
|
5984 | @_ abstract def lmems (l: nat): nat = $ lrec 0 (\\ x, \\ z, \ y, x ; y) l $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5984:46:
|
5984 | @_ abstract def lmems (l: nat): nat = $ lrec 0 (\\ x, \\ z, \ y, x ; y) l $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5985:29:
|
5985 | pub theorem lmems0: $ lmems 0 = 0 $ = (named 'lrec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:5986:45:
|
5986 | pub theorem lmemsS (a l: nat): $ lmems (a : l) = a ; lmems l $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5989:31:
|
5989 | theorem lmemssn: $ lmems (a : 0) = sn a $ = '(eqtr lmemsS @ eqtr (inseq2 lmems0) ins02);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:5994:1:
|
5994 | @_ def lmem (a l: nat): wff = $ a e. lmems l $; infixl lmem: $IN$ prec 50;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:5994:38:
|
5994 | @_ def lmem (a l: nat): wff = $ a e. lmems l $; infixl lmem: $IN$ prec 50;
| ^
error: lmems is not a function
../examples/peano.mm1:5994:56:
|
5994 | @_ def lmem (a l: nat): wff = $ a e. lmems l $; infixl lmem: $IN$ prec 50;
| ^
error: term 'lmem' not declared
../examples/peano.mm1:5996:25:
|
5996 | theorem lmem0: $ ~ a IN 0 $ = '(mtbir (elneq2 lmems0) el02);
| ^
error: unexpected '0'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:5997:25:
|
5997 | theorem lmemS: $ a IN b : l <-> a = b \/ a IN l $ = '(bitr (elneq2 lmemsS) elins);
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:5998:25:
|
5998 | theorem lmem1: $ a IN b : 0 <-> a = b $ = '(bitr lmemS @ bior2 lmem0);
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:6000:30:
|
6000 | theorem lmemconsid: $ a IN a : l $ = '(mpbir lmemS (orl eqid));
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:6002:31:
|
6002 | theorem lmemlt: $ a IN l -> a < l $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6007:1:
|
6007 | @_ def all (A: set) (l: nat): wff = $ lmems l C_ A $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6007:39:
|
6007 | @_ def all (A: set) (l: nat): wff = $ lmems l C_ A $;
| ^
error: lmems is not a function
../examples/peano.mm1:6009:32:
|
6009 | theorem all0 (A: set): $ all A 0 $ = '(!! ax_gen x @ absurd lmem0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6010:48:
|
6010 | theorem allS (A: set) (a b: nat): $ all A (a : b) <-> a e. A /\ all A b $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6013:46:
|
6013 | theorem all1 (A: set) (a: nat): $ all A (a : 0) <-> a e. A $ = '(bitr allS @ bian2 all0);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6015:27:
|
6015 | theorem allal2: $ all A l <-> A. x (x IN l -> x e. A) $ = 'biid;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6016:43:
|
6016 | theorem allal (p: wff x): $ all {x | p} l <-> A. x (x IN l -> p) $ = '(bicom ssab2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6018:18:
|
6018 | theorem elall: $ all A l -> x IN l -> x e. A $ = (named '(eale @ imeqd eleq1 eleq1));
| ^
error: all is not a function
../examples/peano.mm1:6020:18:
|
6020 | theorem ssall: $ A C_ B -> all A l -> all B l $ = (named '(alimd @ imim2d ssel));
| ^
error: A is not a function
../examples/peano.mm1:6026:1:
|
6026 | @_ def List (A: set) (.n: nat): set = $ {n | all A n} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6026:46:
|
6026 | @_ def List (A: set) (.n: nat): set = $ {n | all A n} $;
| ^
error: all is not a function
../examples/peano.mm1:6028:31:
|
6028 | theorem elList: $ l e. List A <-> all A l $ = '(!! elabe n alleq2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6030:22:
|
6030 | theorem elList0: $ 0 e. List A $ = '(mpbir elList all0);
| ^
error: expecting (
../examples/peano.mm1:6031:22:
|
6031 | theorem elListS: $ a : b e. List A <-> a e. A /\ b e. List A $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:6033:31:
|
6033 | theorem elListHd (h: $ G -> a : b e. List A $): $ G -> a e. A $ = '(anld @ sylib elListS h);
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:6034:31:
|
6034 | theorem elListTl (h: $ G -> a : b e. List A $): $ G -> b e. List A $ = '(anrd @ sylib elListS h);
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:6035:22:
|
6035 | theorem elList1: $ a : 0 e. List A <-> a e. A $ = '(bitr elListS @ bian2 elList0);
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:6036:19:
|
6036 | theorem Listss: $ A C_ B -> List A C_ List B $ =
| ^
error: A is not a function
../examples/peano.mm1:6042:1:
|
6042 | @_ abstract def len (l: nat): nat = $ lrec 0 (\\ x, \\ z, \ y, suc y) l $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6042:44:
|
6042 | @_ abstract def len (l: nat): nat = $ lrec 0 (\\ x, \\ z, \ y, suc y) l $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6043:25:
|
6043 | pub theorem len0: $ len 0 = 0 $ = (named 'lrec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6044:41:
|
6044 | pub theorem lenS (a b: nat): $ len (a : b) = suc (len b) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6048:26:
|
6048 | theorem len1: $ len (a : 0) = 1 $ = '(eqtr lenS @ suceq len0);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6050:25:
|
6050 | theorem leneq0: $ len n = 0 <-> n = 0 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6054:26:
|
6054 | theorem lenleid: $ len l <= l $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6061:1:
|
6061 | @_ def Array (A: set) (n .l: nat): set = $ {l | l e. List A /\ len l = n} $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6061:64:
|
6061 | @_ def Array (A: set) (n .l: nat): set = $ {l | l e. List A /\ len l = n} $;
| ^
error: expecting infix >= 1 or }
../examples/peano.mm1:6063:35:
|
6063 | theorem elArray: $ l e. Array A n <-> l e. List A /\ len l = n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6066:29:
|
6066 | theorem elArrayList: $ l e. Array A n -> l e. List A $ = '(sylbi elArray anl);
| ^
error: Array is not a function
../examples/peano.mm1:6067:24:
|
6067 | theorem ArrayssList: $ Array A n C_ List A $ = (named '(ax_gen elArrayList));
| ^
error: Array is not a function
../examples/peano.mm1:6068:47:
|
6068 | theorem elArraylen: $ l e. Array A n -> len l = n $ = '(sylbi elArray anr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6070:35:
|
6070 | theorem elArray02: $ l e. Array A 0 <-> l = 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6072:23:
|
6072 | theorem elArray0: $ 0 e. Array A 0 $ = '(mpbir elArray02 eqid);
| ^
error: expecting (
../examples/peano.mm1:6073:23:
|
6073 | theorem elArrayS: $ a : b e. Array A (suc n) <-> a e. A /\ b e. Array A n $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:6076:23:
|
6076 | theorem elArray1: $ a : 0 e. Array A 1 <-> a e. A $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:6078:50:
|
6078 | theorem elArraySne0: $ l e. Array A (suc n) -> l != 0 $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:6080:43:
|
6080 | theorem elArrayS2: $ l e. Array A (suc n) <-> E. a E. b (a e. A /\ b e. Array A n /\ l = a : b) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6084:21:
|
6084 | theorem Arrayfin: $ finite A -> finite (Array A n) $ =
| ^
error: finite is not a function
../examples/peano.mm1:6097:1:
|
6097 | @_ abstract def append (l1 l2: nat): nat = $ lrec l2 (\\ x, \\ z, \ y, x : y) l1 $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6097:58:
|
6097 | @_ abstract def append (l1 l2: nat): nat = $ lrec l2 (\\ x, \\ z, \ y, x : y) l1 $;
| ^
error: expecting (
../examples/peano.mm1:6098:8:
|
6098 | infixr append: $++$ prec 85;
| ^
error: term 'append' not declared
../examples/peano.mm1:6099:35:
|
6099 | pub theorem append0 (l: nat): $ 0 ++ l = l $ = (named 'lrec0);
| ^
error: expecting (
../examples/peano.mm1:6100:42:
|
6100 | pub theorem appendS (a l r: nat): $ (a : l) ++ r = a : (l ++ r) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6104:26:
|
6104 | theorem appendSi (h: $ a ++ b = c $): $ x : a ++ b = x : c $ = '(eqtr appendS @ conseq2 h);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:6105:22:
|
6105 | theorem append1: $ a : 0 ++ l = a : l $ = '(appendSi append0);
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:6107:23:
|
6107 | theorem append02: $ a ++ 0 = a $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:6110:29:
|
6110 | theorem appendass: $ (l1 ++ l2) ++ l3 = l1 ++ (l2 ++ l3) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6115:33:
|
6115 | theorem appendlen: $ len (l1 ++ l2) = len l1 + len l2 $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6120:24:
|
6120 | theorem leappend2: $ b <= c <-> a ++ b <= a ++ c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6125:24:
|
6125 | theorem ltappend2: $ b < c <-> a ++ b < a ++ c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6128:25:
|
6128 | theorem appendcan1: $ a ++ b = a ++ c <-> b = c $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:6131:26:
|
6131 | theorem leappendid1: $ a <= a ++ b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6134:26:
|
6134 | theorem leappendid2: $ a <= b ++ a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6138:26:
|
6138 | theorem ltappendid1: $ b != 0 <-> a < a ++ b $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:6141:26:
|
6141 | theorem ltappendid2: $ b != 0 <-> a < b ++ a $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:6147:24:
|
6147 | theorem appendeq0: $ a ++ b = 0 <-> a = 0 /\ b = 0 $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:6150:30:
|
6150 | theorem lmemappend: $ x IN a ++ b <-> x IN a \/ x IN b $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:6154:34:
|
6154 | theorem allappend: $ all A (a ++ b) <-> all A a /\ all A b $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6158:22:
|
6158 | theorem appendT: $ a ++ b e. List A <-> a e. List A /\ b e. List A $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:6161:62:
|
6161 | theorem appendArray: $ a e. Array A m -> b e. Array A n -> a ++ b e. Array A (m + n) $ =
| ^
error: unexpected '+'
expecting '$', infix >= 0, or infix >= 25
../examples/peano.mm1:6170:1:
|
6170 | @_ abstract def snoc (l a: nat): nat = $ l ++ (a : 0) $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6170:44:
|
6170 | @_ abstract def snoc (l a: nat): nat = $ l ++ (a : 0) $;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:6171:8:
|
6171 | infixl snoc: $|>$ prec 84;
| ^
error: term 'snoc' not declared
../examples/peano.mm1:6172:33:
|
6172 | pub theorem snoc0 (a: nat): $ 0 |> a = a : 0 $ = 'append0;
| ^
error: expecting (
../examples/peano.mm1:6173:40:
|
6173 | pub theorem snocS (a b c: nat): $ (a : b) |> c = a : (b |> c) $ = 'appendS;
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6174:36:
|
6174 | pub theorem snoclt (a b: nat): $ a < a |> b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6179:22:
|
6179 | theorem lesnoc2: $ b <= c <-> a |> b <= a |> c $ = '(bitr lecons1 leappend2);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6180:26:
|
6180 | theorem appendsnoc: $ l1 ++ (l2 |> b) = l1 ++ l2 |> b $ = '(eqcom appendass);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:6181:23:
|
6181 | theorem conssnoc: $ a : (l |> b) = a : l |> b $ = '(eqcom appendS);
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:6182:30:
|
6182 | theorem snoclen: $ len (a |> b) = suc (len a) $ = '(eqtr appendlen @ eqtr (addeq2 len1) add12);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6183:28:
|
6183 | theorem lmemsnoc: $ x IN a |> b <-> x IN a \/ x = b $ = '(bitr lmemappend @ oreq2i lmem1);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:6184:30:
|
6184 | theorem lmemsnocid: $ a IN l |> a $ = '(mpbir lmemsnoc (orr eqid));
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:6185:32:
|
6185 | theorem allsnoc: $ all A (a |> b) <-> all A a /\ b e. A $ = '(bitr allappend @ aneq2i all1);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6186:22:
|
6186 | theorem snocne0: $ a |> b != 0 $ = '(mt (syl6eq len0 leneq) @ sucne0 snoclen);
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:6188:20:
|
6188 | theorem snocT: $ a |> b e. List A <-> a e. List A /\ b e. A $ =
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:6191:1:
|
6191 | @_ local def listfn (l .f: nat): nat = $ lrec 0 (\\ a, \\ z, \ f,
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6191:47:
|
6191 | @_ local def listfn (l .f: nat): nat = $ lrec 0 (\\ a, \\ z, \ f,
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6194:27:
|
6194 | theorem listfn0: $ listfn 0 = 0 $ = (named 'lrec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6195:33:
|
6195 | theorem listfnS2: $ listfn (a : l) =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6201:36:
|
6201 | theorem dmlistfn: $ Dom (listfn l) == upto (len l) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6207:22:
|
6207 | theorem listfnisf: $ isfun (listfn l) $ =
| ^
error: isfun is not a function
../examples/peano.mm1:6212:32:
|
6212 | theorem listfnS: $ listfn (a : l) =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6216:25:
|
6216 | theorem listfnSval: $ n < suc (len l) ->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6221:33:
|
6221 | theorem listfnS0: $ listfn (a : l) @ 0 = a $ = '(eqtr (listfnSval lt01S) (ifpos eqid));
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6223:33:
|
6223 | theorem listfnSS: $ listfn (a : l) @ suc n = listfn l @ n $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6238:1:
|
6238 | @_ abstract def nth (n l: nat): nat = $ if (n < len l) (suc (listfn l @ n)) 0 $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6238:49:
|
6238 | @_ abstract def nth (n l: nat): nat = $ if (n < len l) (suc (listfn l @ n)) 0 $;
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6240:36:
|
6240 | pub theorem nth0 (n: nat): $ nth n 0 = 0 $ = '(ifneg @ mtbir (lteq2 len0) lt02);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6241:36:
|
6241 | pub theorem nthZ (a l: nat): $ nth 0 (a : l) = suc a $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6243:51:
|
6243 | pub theorem nthS (n a l: nat): $ nth (suc n) (a : l) = nth n l $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6248:27:
|
6248 | theorem nthne0: $ nth n l != 0 <-> n < len l $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:6251:27:
|
6251 | theorem nthSlt: $ nth n l = suc a -> n < len l $ = '(sylib nthne0 sucne0);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6253:27:
|
6253 | theorem ntheq0: $ nth n l = 0 <-> len l <= n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6256:27:
|
6256 | theorem lmemnth: $ a IN l <-> E. n nth n l = suc a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6265:27:
|
6265 | theorem allnth: $ all A l <-> A. n A. x (nth n l = suc x -> x e. A) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6268:28:
|
6268 | theorem nthlmem: $ nth n l = suc a -> a IN l $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6271:25:
|
6271 | theorem appendnth1: $ i < len l1 -> nth i (l1 ++ l2) = nth i l1 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6283:38:
|
6283 | theorem appendnth2_: $ nth (len l1 + i) (l1 ++ l2) = nth i l2 $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6288:30:
|
6288 | theorem appendnth2: $ len l1 <= i -> nth i (l1 ++ l2) = nth (i - len l1) l2 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6294:1:
|
6294 | @_ abstract def repeat (a n: nat): nat = $ rec 0 (\ x, a : x) n $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6294:48:
|
6294 | @_ abstract def repeat (a n: nat): nat = $ rec 0 (\ x, a : x) n $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6295:42:
|
6295 | pub theorem repeat0 (a: nat): $ repeat a 0 = 0 $ = (named 'rec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6296:52:
|
6296 | pub theorem repeatS (a n: nat): $ repeat a (suc n) = a : repeat a n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6298:29:
|
6298 | theorem repeat1: $ repeat a 1 = a : 0 $ =
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/peano.mm1:6301:39:
|
6301 | theorem repeatlen: $ len (repeat a n) = n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6305:36:
|
6305 | theorem repeatadd: $ repeat a (m + n) = repeat a m ++ repeat a n $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6311:30:
|
6311 | theorem repeatT: $ a e. A -> repeat a n e. List A $ =
| ^
error: repeat is not a function
../examples/peano.mm1:6316:34:
|
6316 | theorem repeatArray: $ a e. A -> repeat a n e. Array A n $ =
| ^
error: repeat is not a function
../examples/peano.mm1:6319:1:
|
6319 | @_ local def grecaux1 (K: set) (x z n: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6320:14:
|
6320 | $ recn z (\\ u, \ i, K @ (x - suc u, i)) n $;
| ^
error: expecting (
../examples/peano.mm1:6322:37:
|
6322 | theorem grecaux10: $ grecaux1 K x k 0 = k $ = (named 'recn0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6323:45:
|
6323 | theorem grecaux1S: $ grecaux1 K x k (suc n) =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6328:52:
|
6328 | theorem grecaux1Sx: $ grecaux1 K (suc x) k (suc n) = grecaux1 K x (K @ (x, k)) n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6333:1:
|
6333 | @_ local def grecaux2 (z: nat) (K F: set) (x n k: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6334:14:
|
6334 | $ recn z (\\ u, \ i, F @ (u, grecaux1 K x k (x - suc u), i)) n $;
| ^
error: expecting (
../examples/peano.mm1:6336:39:
|
6336 | theorem grecaux20: $ grecaux2 z K F x 0 k = z $ = (named 'recn0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6337:49:
|
6337 | theorem grecaux2S: $ grecaux2 z K F x (suc n) k =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6343:25:
|
6343 | theorem grecaux2Sx: $ n <= x -> grecaux2 z K F (suc x) n k = grecaux2 z K F x n (K @ (x, k)) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6354:1:
|
6354 | @_ local def grec (z: nat) (K F: set) (n k: nat): nat = $ grecaux2 z K F n n k $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6354:59:
|
6354 | @_ local def grec (z: nat) (K F: set) (n k: nat): nat = $ grecaux2 z K F n n k $;
| ^
error: grecaux2 is not a function
../examples/peano.mm1:6356:29:
|
6356 | theorem grec0: $ grec z K F 0 k = z $ = 'grecaux20;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6358:39:
|
6358 | theorem grecS: $ grec z K F (suc n) k = F @ (n, k, grec z K F n (K @ (n, k))) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6361:1:
|
6361 | @_ local def rev (l: nat): nat = $ lrec 0 (\\ a, \\ z, \ ih, ih |> a) l $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6361:41:
|
6361 | @_ local def rev (l: nat): nat = $ lrec 0 (\\ a, \\ z, \ ih, ih |> a) l $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6363:21:
|
6363 | theorem rev0: $ rev 0 = 0 $ = (named 'lrec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6364:26:
|
6364 | theorem revS: $ rev (a : l) = rev l |> a $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6368:27:
|
6368 | theorem revsn: $ rev (a : 0) = a : 0 $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6371:33:
|
6371 | theorem revappend: $ rev (l1 ++ l2) = rev l2 ++ rev l1 $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6377:30:
|
6377 | theorem revsnoc: $ rev (l |> a) = a : rev l $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6380:31:
|
6380 | theorem revrev: $ rev (rev l) = l $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6385:31:
|
6385 | theorem revlen: $ len (rev l) = len l $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6389:25:
|
6389 | theorem revinj: $ rev l = rev l2 <-> l = l2 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6392:25:
|
6392 | theorem reveq0: $ rev l = 0 <-> l = 0 $ = '(bitr3 (eqeq2 rev0) revinj);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6394:21:
|
6394 | theorem exsnoc: $ l != 0 <-> E. l2 E. a l = l2 |> a $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/peano.mm1:6400:23:
|
6400 | theorem snocinj: $ l1 |> a = l2 |> b <-> l1 = l2 /\ a = b $ =
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:6404:25:
|
6404 | theorem appendcan2: $ a ++ c = b ++ c <-> a = b $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:6407:21:
|
6407 | theorem revnth: $ i < len l -> nth i (rev l) = nth (len l - suc i) l $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6424:1:
|
6424 | @_ abstract def map (F: set) (l: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6425:8:
|
6425 | $ lrec 0 (\\ a, \\ z, \ ih, F @ a : ih) l $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6426:36:
|
6426 | pub theorem map0 (F: set): $ map F 0 = 0 $ = (named 'lrec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6428:16:
|
6428 | $ map F (a : l) = F @ a : map F l $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6432:33:
|
6432 | theorem maplen: $ len (map F l) = len l $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6437:27:
|
6437 | theorem mapnth: $ nth n l = suc a -> nth n (map F l) = suc (F @ a) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6450:36:
|
6450 | theorem mapnthb: $ nth n (map F l) = suc b <-> E. a (nth n l = suc a /\ b = F @ a) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6456:33:
|
6456 | theorem lmemmapi: $ a IN l -> F @ a IN map F l $ =
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/peano.mm1:6459:33:
|
6459 | theorem lmemmap: $ b IN map F l <-> E. a (a IN l /\ b = F @ a) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6468:1:
|
6468 | @_ abstract def ljoin (L: nat): nat = $ lrec 0 (\\ a, \\ z, \ ih, a ++ ih) L $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6468:46:
|
6468 | @_ abstract def ljoin (L: nat): nat = $ lrec 0 (\\ a, \\ z, \ ih, a ++ ih) L $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6469:29:
|
6469 | pub theorem ljoin0: $ ljoin 0 = 0 $ = (named 'lrec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6470:45:
|
6470 | pub theorem ljoinS (l L: nat): $ ljoin (l : L) = l ++ ljoin L $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6474:30:
|
6474 | theorem ljoin1: $ ljoin (l : 0) = l $ = '(eqtr ljoinS @ eqtr (appendeq2 ljoin0) append02);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6476:37:
|
6476 | theorem ljoinappend: $ ljoin (L1 ++ L2) = ljoin L1 ++ ljoin L2 $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6481:34:
|
6481 | theorem ljoinsnoc: $ ljoin (L |> l) = ljoin L ++ l $ = '(eqtr ljoinappend @ appendeq2 ljoin1);
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6483:38:
|
6483 | theorem ljoinT: $ L e. List (List A) <-> ljoin L e. List A $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6487:75:
|
6487 | theorem ljoinArray: $ L e. Array (Array A n) m -> ljoin L e. Array A (n * m) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6496:1:
|
6496 | @_ local def nztails (L: nat): nat = $ lrec 0 (\\ a, \\ z, \ ih, (a, z) : ih) L $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6496:45:
|
6496 | @_ local def nztails (L: nat): nat = $ lrec 0 (\\ a, \\ z, \ ih, (a, z) : ih) L $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6497:29:
|
6497 | theorem nztails0: $ nztails 0 = 0 $ = (named 'lrec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6498:45:
|
6498 | theorem nztailsS (l L: nat): $ nztails (l : L) = (l, L) : nztails L $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6502:1:
|
6502 | @_ local def lfnaux (F: set) (k n: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6503:8:
|
6503 | $ grec 0 (\\ _1, \ x, suc x) (\\ _2, \\ i, \ ih, F @ i : ih) n k $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6504:31:
|
6504 | theorem lfnaux0: $ lfnaux F k 0 = 0 $ = (named 'grec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6505:39:
|
6505 | theorem lfnauxS: $ lfnaux F k (suc n) = F @ k : lfnaux F (suc k) n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6512:13:
|
6512 | $ A. i F1 @ (k1 + i) = F2 @ (k2 + i) ->
| ^
error: unexpected '@'
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:6530:41:
|
6530 | theorem lfnauxlen: $ len (lfnaux F k n) = n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6539:24:
|
6539 | theorem lfnauxnth: $ i < n -> nth i (lfnaux F k n) = suc (F @ (k + i)) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6554:1:
|
6554 | @_ local def lfn (F: set) (n: nat): nat = $ lfnaux F 0 n $;
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6554:54:
|
6554 | @_ local def lfn (F: set) (n: nat): nat = $ lfnaux F 0 n $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6556:23:
|
6556 | theorem lfn0: $ lfn F 0 = 0 $ = 'lfnaux0;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6557:31:
|
6557 | theorem lfnS: $ lfn F (suc n) = F @ 0 : lfn (\ i, F @ suc i) n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6561:33:
|
6561 | theorem lenlfn: $ len (lfn F n) = n $ = 'lfnauxlen;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6562:21:
|
6562 | theorem nthlfn: $ i < n -> nth i (lfn F n) = suc (F @ i) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6565:26:
|
6565 | theorem lfnnth: $ lfn (\ i, nth i l - 1) (len l) = l $ =
| ^
error: expecting (
../examples/peano.mm1:6577:22:
|
6577 | (h1: $ G -> len l1 = n $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6587:35:
|
6587 | theorem nthext2 {i} (h1: $ len l1 = n $) (h2: $ len l2 = n $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6591:22:
|
6591 | theorem nthext: $ l1 = l2 <-> A. n nth n l1 = nth n l2 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6596:1:
|
6596 | @_ local def zip (l1 l2: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6597:10:
|
6597 | $ lfn (\ i, nth i l1 - 1, nth i l2 - 1) (min (len l1) (len l2)) $;
| ^
error: expecting (
../examples/peano.mm1:6599:35:
|
6599 | theorem ziplen: $ len (zip l1 l2) = min (len l1) (len l2) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6602:37:
|
6602 | theorem zipnth (h1: $ G -> nth i l1 = suc a $) (h2: $ G -> nth i l2 = suc b $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6611:22:
|
6611 | theorem zip01: $ zip 0 l = 0 $ = '(mpbi leneq0 @ eqtr ziplen @ eqtr (mineq1 len0) @ eqmin1 le01);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6612:24:
|
6612 | theorem zip02: $ zip l 0 = 0 $ = '(mpbi leneq0 @ eqtr ziplen @ eqtr (mineq2 len0) @ eqmin2 le01);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6613:26:
|
6613 | theorem zipS: $ zip (a : l1) (b : l2) = (a, b) : zip l1 l2 $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6625:1:
|
6625 | @_ local def take (l n: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6626:10:
|
6626 | $ lfn (\ i, nth i l - 1) (min (len l) n) $;
| ^
error: expecting (
../examples/peano.mm1:6628:1:
|
6628 | @_ local def drop (l n: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6629:10:
|
6629 | $ lfn (\ i, nth (i + n) l - 1) (len l - n) $;
| ^
error: expecting (
../examples/peano.mm1:6631:35:
|
6631 | theorem takelen: $ len (take l n) = min (len l) n $ = (named 'lenlfn);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6632:35:
|
6632 | theorem droplen: $ len (drop l n) = len l - n $ = (named 'lenlfn);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6634:22:
|
6634 | theorem takenth: $ i < n -> nth i (take l n) = nth i l $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6643:23:
|
6643 | theorem takenth0: $ n <= i -> nth i (take l n) = 0 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6646:37:
|
6646 | theorem dropnth: $ nth i (drop l n) = nth (i + n) l $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6654:30:
|
6654 | theorem takedrop: $ take l n ++ drop l n = l $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:6663:24:
|
6663 | theorem takeArray: $ m <= n /\ l e. Array A n -> take l m e. Array A m $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6668:40:
|
6668 | theorem dropArray: $ l e. Array A (m + n) -> drop l m e. Array A n $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6673:25:
|
6673 | theorem take0: $ take l 0 = 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6676:25:
|
6676 | theorem drop0: $ drop l 0 = l $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6679:26:
|
6679 | theorem dropall: $ len l <= n -> drop l n = 0 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6682:26:
|
6682 | theorem takeall: $ len l <= n -> take l n = l $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6685:43:
|
6685 | theorem takemin: $ take l (min (len l) n) = take l n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6689:26:
|
6689 | theorem takeappend1: $ n <= len l1 -> take (l1 ++ l2) n = take l1 n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6695:30:
|
6695 | theorem appendinj1: $ len l1 = len r1 -> (l1 ++ l2 = r1 ++ r2 <-> l1 = r1 /\ l2 = r2) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6702:30:
|
6702 | theorem appendinj2: $ len l2 = len r2 -> (l1 ++ l2 = r1 ++ r2 <-> l1 = r1 /\ l2 = r2) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6708:31:
|
6708 | theorem eqappendlem: $ len r1 <= len l1 /\ l1 ++ l2 = r1 ++ r2 ->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/peano.mm1:6721:24:
|
6721 | theorem eqappend: $ l1 ++ l2 = r1 ++ r2 <->
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:6733:1:
|
6733 | @_ def sublistAt (n L1 L2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6734:19:
|
6734 | $ E. l E. r (L1 = l ++ L2 ++ r /\ len l = n) $;
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/peano.mm1:6736:23:
|
6736 | theorem sublistAtT: $ sublistAt n L1 L2 -> L1 e. List A -> L2 e. List A $ =
| ^
error: sublistAt is not a function
../examples/peano.mm1:6741:26:
|
6741 | $ sublistAt n l (l1 ++ l2) <-> sublistAt n l l1 /\ sublistAt (n + len l1) l l2 $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6753:52:
|
6753 | theorem sublistAt_len_le: $ sublistAt n L1 L2 -> n + len L2 <= len L1 $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/peano.mm1:6757:67:
|
6757 | theorem sublistAt_left: $ sublistAt n L1 L2 -> sublistAt n (L1 ++ l) L2 $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6761:68:
|
6761 | theorem sublistAt_right: $ sublistAt n L1 L2 -> sublistAt (len l + n) (l ++ L1) L2 $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6765:35:
|
6765 | theorem sublistAt_id: $ sublistAt 0 L L $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6773:1:
|
6773 | @_ def all2 (R: set) {.l1 .l2 .x .y .n: nat}: set =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6774:6:
|
6774 | $ S\ l1, {l2 | len l1 = len l2 /\ A. n A. x A. y
| ^
error: expecting (
../examples/peano.mm1:6778:7:
|
6778 | $ l1, l2 e. all2 R <-> len l1 = len l2 /\ A. n A. x A. y
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:6783:7:
|
6783 | $ l1, l2 e. all2 R <-> len l1 = len l2 /\ A. n A. x
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:6788:27:
|
6788 | $ A. x A. y (x IN l1 /\ y IN l2 -> x, y e. R -> x, y e. S) ->
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/peano.mm1:6793:19:
|
6793 | theorem all2ss: $ R C_ S -> all2 R C_ all2 S $ =
| ^
error: R is not a function
../examples/peano.mm1:6797:27:
|
6797 | $ A. x A. y (x IN l1 /\ y IN l2 -> (x, y e. R <-> x, y e. S)) ->
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/peano.mm1:6802:22:
|
6802 | theorem all2len: $ l1, l2 e. all2 R -> len l1 = len l2 $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:6806:24:
|
6806 | (h1: $ G -> nth n l1 = suc a $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6813:22:
|
6813 | theorem all2com: $ l1, l2 e. all2 (cnv R) <-> l2, l1 e. all2 R $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:6817:33:
|
6817 | theorem all2cnv: $ all2 (cnv R) == cnv (all2 R) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6820:23:
|
6820 | theorem all2rev1: $ l1, l2 e. all2 R -> rev l1, rev l2 e. all2 R $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:6828:26:
|
6828 | theorem all2rev: $ rev l1, rev l2 e. all2 R <-> l1, l2 e. all2 R $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:6831:19:
|
6831 | theorem all20: $ 0, 0 e. all2 R $ =
| ^
error: expecting (
../examples/peano.mm1:6835:20:
|
6835 | theorem all201: $ 0, l e. all2 R <-> l = 0 $ =
| ^
error: expecting (
../examples/peano.mm1:6838:20:
|
6838 | theorem all202: $ l, 0 e. all2 R <-> l = 0 $ = '(bitr3 all2com all201);
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:6840:20:
|
6840 | theorem all2S: $ a : l1, b : l2 e. all2 R <->
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:6855:21:
|
6855 | theorem all2S1: $ a : l1, l2 e. all2 R <->
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/peano.mm1:6862:25:
|
6862 | theorem all2snoc1: $ l1 |> a, l2 e. all2 R <->
| ^
error: unexpected '|'
expecting '$' or infix >= 0
../examples/peano.mm1:6871:23:
|
6871 | theorem all2all2: $ l1, l2 e. all2 (S\ x, A) -> all A l2 $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:6877:23:
|
6877 | theorem all2all1: $ l1, l2 e. all2 (S\ x, {y | x e. A}) -> all A l1 $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:6884:1:
|
6884 | @_ def ex2 (R: set) {.l1 .l2 .x .y .n: nat}: set =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6885:6:
|
6885 | $ S\ l1, {l2 | len l1 = len l2 /\ E. n E. x E. y
| ^
error: expecting (
../examples/peano.mm1:6889:7:
|
6889 | $ l1, l2 e. ex2 R <-> len l1 = len l2 /\ E. n E. x E. y
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:6894:7:
|
6894 | $ l1, l2 e. ex2 R <-> len l1 = len l2 /\ E. n E. x
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:6899:27:
|
6899 | $ A. x A. y (x IN l1 /\ y IN l2 -> x, y e. R -> x, y e. S) ->
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/peano.mm1:6905:27:
|
6905 | $ A. x A. y (x IN l1 /\ y IN l2 -> (x, y e. R <-> x, y e. S)) ->
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/peano.mm1:6910:18:
|
6910 | theorem ex2ss: $ R C_ S -> ex2 R C_ ex2 S $ =
| ^
error: R is not a function
../examples/peano.mm1:6913:21:
|
6913 | theorem ex2len: $ l1, l2 e. ex2 R -> len l1 = len l2 $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:6916:21:
|
6916 | theorem ex2com: $ l1, l2 e. ex2 (cnv R) <-> l2, l1 e. ex2 R $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:6920:31:
|
6920 | theorem ex2cnv: $ ex2 (cnv R) == cnv (ex2 R) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6923:21:
|
6923 | theorem ex201: $ ~ 0, l e. ex2 R $ =
| ^
error: expecting prefix >= 0
../examples/peano.mm1:6926:21:
|
6926 | theorem ex202: $ ~ l, 0 e. ex2 R $ = '(mtbi ex2com ex201);
| ^
error: unexpected ','
expecting '$', infix >= 0, or infix >= 41
../examples/peano.mm1:6929:7:
|
6929 | $ l1, l2 e. all2 (Compl R) <-> len l1 = len l2 /\ ~l1, l2 e. ex2 R $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:6936:7:
|
6936 | $ l1, l2 e. ex2 R <-> len l1 = len l2 /\ ~l1, l2 e. all2 (Compl R) $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:6940:7:
|
6940 | $ l1, l2 e. ex2 (Compl R) <-> len l1 = len l2 /\ ~l1, l2 e. all2 R $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/peano.mm1:6943:23:
|
6943 | theorem mapeqg: $ all {x | F @ x = G @ x} l -> map F l = map G l $ =
| ^
error: unexpected '{'
expecting '$' or infix >= 0
../examples/peano.mm1:6950:1:
|
6950 | @_ local def rlrec (z: nat) (S: set) (n: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/peano.mm1:6951:14:
|
6951 | $ lrec z (\\ a, \\ l, \ ih, S @ (rev l, a, ih)) (rev n) $;
| ^
error: expecting (
../examples/peano.mm1:6952:29:
|
6952 | theorem rlrec0: $ rlrec z S 0 = z $ = (named '(eqtr (lreceq3 rev0) lrec0));
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/peano.mm1:6953:35:
|
6953 | theorem rlrecS: $ rlrec z S (l |> a) = S @ (l, a, rlrec z S l) $ =
| ^
error: expecting ) or infix >= 0
../examples/peano.mm1:6959:12:
|
6959 | (hn: $ x = n -> (px <-> pn) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/peano.mm1:6973:12:
|
6973 | (hn: $ x = n -> (px <-> pn) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
=================== ERR =================== ../examples/peano.mm1
depth limit exceeded
=================== ERR =================== ../examples/separation_logic.mm1
=================== OK ==================== ../examples/set.mm0
=================== OK ==================== ../examples/set.mm1
../examples/string.mm0:28:1:
|
28 | input string: input;
| ^
warning: unimplemented
../examples/string.mm0:29:1:
|
29 | output string: $ input $;
| ^
warning: unimplemented
../examples/string.mm0:32:1:
|
32 | output string: $ hello $;
| ^
warning: unimplemented
=================== OK ==================== ../examples/string.mm0
../examples/test3.mm1:1:1:
|
1 | import "test.mm1";
| ^
error: ../examples/test.mm1: openFile: does not exist (No such file or directory)
=================== ERR =================== ../examples/test3.mm1
=================== OK ==================== ../examples/unprovable.mm0
../examples/verifier.mm0:12:30:
|
12 | theorem Verifier_basicElf: $ isBasicElf Verifier $;
| ^
error: isBasicElf is not a function
../examples/verifier.mm0:19:5:
|
19 | $ initialConfig Verifier k ->
| ^
error: initialConfig is not a function
../examples/verifier.mm0:28:5:
|
28 | $ initialConfig Verifier k /\ succeeds k mm0_file 0 ->
| ^
error: initialConfig is not a function
=================== ERR =================== ../examples/verifier.mm0
depth limit exceeded
=================== ERR =================== ../examples/verifier.mm1
../examples/x86_determ.mm1:36:61:
|
36 | [$ E. _ ,val $ @ match (find-bits val) [#undef] [(p pr) '(,p (eex ,pr))]]
| ^
error: expecting identifier char
../examples/x86_determ.mm1:77:11:
|
77 | (h: $ p <-> ifp a p1 p0 $)
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:83:13:
|
83 | (h0: $ a0 <-> F. $) (h1: $ a1 <-> b $):
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:86:13:
|
86 | (h0: $ a0 <-> b $) (h1: $ a1 <-> F. $):
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:90:13:
|
90 | (h0: $ b0 <-> ifp a c0 d0 $)
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:95:42:
|
95 | theorem bitsplit_bit0 (h: $ a -> bit v i = 0 $): $ a <-> ifp (i e. v) F. a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86_determ.mm1:97:42:
|
97 | theorem bitsplit_bit1 (h: $ a -> bit v i = 1 $): $ a <-> ifp (i e. v) a F. $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86_determ.mm1:99:26:
|
99 | theorem bitsplit_id: $ b <-> ifp a b b $ = '(bicom ifpid);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:101:23:
|
101 | (h1: $ b -> bit v i = 0 $) (h2: $ a <-> ifp (i e. v) c d $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86_determ.mm1:105:23:
|
105 | (h1: $ b -> bit v i = 1 $) (h2: $ a <-> ifp (i e. v) c d $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86_determ.mm1:109:37:
|
109 | theorem ifp_bit0 (h: $ G -> bit v i = 0 $) (h2: $ G -> (b <-> c) $): $ G -> (ifp (i e. v) a b <-> c) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86_determ.mm1:111:37:
|
111 | theorem ifp_bit1 (h: $ G -> bit v i = 1 $) (h2: $ G -> (a <-> c) $): $ G -> (ifp (i e. v) a b <-> c) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86_determ.mm1:132:16:
|
132 | [#undef
| ^
error: expecting identifier char
../examples/x86_determ.mm1:188:42:
|
188 | theorem orifp_disj: $ (b -> ~p) -> (p /\ a \/ b <-> ifp p a b) $ = '(oreq2d @ bicomd bian1a);
| ^
error: expecting ) or infix >= 0
../examples/x86_determ.mm1:190:36:
|
190 | theorem orifp_bd (h1: $ (q -> j <= n) /\ (q <-> r) $) (h2: $ i < j $):
| ^
error: expecting ) or infix >= 0
../examples/x86_determ.mm1:196:34:
|
196 | theorem orifp_anr (h: $ (b -> c) /\ (b <-> d) $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:200:26:
|
200 | theorem orifp_eq (h: $ a <-> b $) (h2: $ (b -> c) /\ (b <-> d) $):
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:204:31:
|
204 | theorem orifp_ass (h: $ (a \/ (b \/ c) -> d) /\ (a \/ (b \/ c) <-> e) $):
| ^
error: expecting ) or infix >= 0
../examples/x86_determ.mm1:208:26:
|
208 | theorem orifp_id: $ (n = i /\ p -> i <= n) /\ (n = i /\ p <-> n = i /\ p) $ =
| ^
error: expecting ) or infix >= 0
../examples/x86_determ.mm1:211:41:
|
211 | theorem determ_eqeq (h1: $ a -> (p1 <-> p2) $) (h2: $ p1 /\ p2 -> a $):
| ^
error: expecting ) or infix >= 0
../examples/x86_determ.mm1:216:12:
|
216 | (h1: $ x = a -> (p1 <-> p2) $) (h2: $ p1 /\ p2 -> x = a $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86_determ.mm1:221:12:
|
221 | (h1: $ x = a /\ b -> (p1 <-> p2) $) (h2: $ x = a -> (b /\ q1 <-> q2) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86_determ.mm1:226:12:
|
226 | (h1: $ x = a -> (p1 <-> p2) $) (h2: $ x = a -> (q1 <-> q2) $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86_determ.mm1:231:13:
|
231 | (h1: $ a1 /\ a2 -> c $): $ E. x1 a1 /\ E. x2 a2 -> c $ = '(imp @ eex @ eexda h1);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:234:12:
|
234 | (h: $ a1 /\ a2 -> c $): $ a1 /\ b1 /\ (a2 /\ b2) -> c $ = '(syl h @ anim anl anl);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:236:12:
|
236 | (h: $ b1 /\ b2 -> c $): $ a1 /\ b1 /\ (a2 /\ b2) -> c $ = '(syl h @ anim anr anr);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:237:25:
|
237 | theorem determ_eql: $ a = b /\ c = b -> a = c $ = '(imp eqtr4);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86_determ.mm1:238:25:
|
238 | theorem determ_eqr: $ b = a /\ b = c -> a = c $ = '(imp eqtr3);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86_determ.mm1:240:26:
|
240 | theorem determ_cons: $ l = a : r /\ l ++ l2 = b : r2 -> a = b /\ r2 = r ++ l2 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86_determ.mm1:244:33:
|
244 | (h: $ splitBits bs1 (shr b k) /\ splitBits bs2 (shr b k) -> p $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:250:33:
|
250 | (h: $ splitBits bs1 (shr b k) /\ splitBits bs2 (shr b k) -> p $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:254:20:
|
254 | $ splitBits ((k, a1) : bs1) b /\ splitBits ((k, a2) : bs2) b ->
| ^
error: expecting ) or infix >= 0
../examples/x86_determ.mm1:257:40:
|
257 | theorem determ_subst2 (a2 b2) (h1: $ a /\ b -> e $)
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:261:39:
|
261 | theorem determ_subst (a2 b2) (h1: $ a /\ b -> e $)
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:267:17:
|
267 | (he: $ G -> 8 * n = m $)
| ^
error: expecting (
../examples/x86_determ.mm1:280:17:
|
280 | (he: $ G -> 8 * n = m $)
| ^
error: expecting (
../examples/x86_determ.mm1:285:47:
|
285 | theorem u32Bytes_determ2 (h1: $ G -> a e. u32 /\ b e. u32 $)
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86_determ.mm1:289:46:
|
289 | theorem u64Bytes_determ (h1: $ G -> a e. u64 /\ b e. u64 $)
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86_determ.mm1:293:29:
|
293 | theorem decode_no_prefix: $ readPrefixes rex l -> b IN l -> ~decodeAux rex2 a b l2 $ =
| ^
error: readPrefixes is not a function
../examples/x86_determ.mm1:301:13:
|
301 | (h1: $ a1 /\ a2 -> c $) (h2: $ b1 /\ b2 -> c $):
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:307:24:
|
307 | $ readPrefixes rex l /\ readPrefixes rex2 l -> rex = rex2 $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:321:28:
|
321 | $ readDisplacement mod q l <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:331:33:
|
331 | $ decodeHiAux v sz r hi n ast l <-> ifp (true hi)
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86_determ.mm1:370:37:
|
370 | @ match (splitBits bs) [#undef] [x '(determ_splitBits_skip ,x)]]
| ^
error: expecting identifier char
../examples/x86_determ.mm1:722:49:
|
722 | theorem decode_step: $ readMemX k (readRIP k) l /\ decode ast l ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
=================== ERR =================== ../examples/x86_determ.mm1
=================== OK ==================== ../examples/x86.mm0
../examples/x86.mm1:3:3:
|
3 | @(add-eval @ fn (b n) (def a {(eval n) shl 1}) @ if (eval b) {a + 1} a)
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:6:3:
|
6 | @(add-eval @ fn (n i) {{{(eval n) shr (eval i)} band 1} = 1})
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:8:32:
|
8 | pub theorem bitT (n i: nat): $ bool (bit n i) $ = 'boolnat;
| ^
error: bool is not a function
../examples/x86.mm1:10:22:
|
10 | theorem bit01: $ bit 0 i = 0 $ = '(mpbir nateq0 nel0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:11:30:
|
11 | theorem bitb00: $ bit (b0 n) 0 = 0 $ = '(mpbir nateq0 elb00);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:12:30:
|
12 | theorem bitb10: $ bit (b1 n) 0 = 1 $ = '(mpbir nateq1 elb10);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:13:38:
|
13 | theorem bitb0S: $ bit (b0 n) (suc i) = bit n i $ = '(nateq elb0S);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:14:38:
|
14 | theorem bitb1S: $ bit (b1 n) (suc i) = bit n i $ = '(nateq elb1S);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:16:36:
|
16 | theorem bit_shr: $ bit (shr a k) i = bit a (i + k) $ = '(nateq elshr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:18:25:
|
18 | theorem bitb00i (h: $ a = b0 b $): $ bit a 0 = 0 $ = '(eqtr (biteq1 h) bitb00);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:19:25:
|
19 | theorem bitb10i (h: $ a = b1 b $): $ bit a 0 = 1 $ = '(eqtr (biteq1 h) bitb10);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:20:25:
|
20 | theorem bitb0Si (h: $ a = b0 b $) (h2: $ bit b n = c $): $ bit a (suc n) = c $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:22:25:
|
22 | theorem bitb1Si (h: $ a = b1 b $) (h2: $ bit b n = c $): $ bit a (suc n) = c $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:31:4:
|
31 | (for 0 16 @ fn (n) @ for 0 4 @ fn (i)
| ^
error: Reference to unbound variable 'for'
../examples/x86.mm1:42:3:
|
42 | @(add-eval @ fn (a b) {(eval a) band (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:44:47:
|
44 | pub theorem bitAndEq (a b: nat): $ bitAnd a b == a i^i b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:47:37:
|
47 | theorem elbitAnd: $ i e. bitAnd a b <-> i e. a /\ i e. b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:50:34:
|
50 | theorem bitAnd_sym: $ bitAnd a b = bitAnd b a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:52:45:
|
52 | theorem bitAnd_ass: $ bitAnd (bitAnd a b) c = bitAnd a (bitAnd b c) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:56:37:
|
56 | theorem bitAnd01 (a: nat): $ bitAnd 0 a = 0 $ = '(axext @ eqstr bitAndEq in01);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:57:39:
|
57 | theorem bitAnd02 (a: nat): $ bitAnd a 0 = 0 $ = '(eqtr bitAnd_sym bitAnd01);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:58:43:
|
58 | theorem bitAnd_idm (a: nat): $ bitAnd a a = a $ = '(axext @ eqstr bitAndEq inidm);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:60:38:
|
60 | theorem bitAndb0l: $ bitAnd (b0 a) b = b0 (bitAnd a (b // 2)) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:64:38:
|
64 | theorem bitAndb0r: $ bitAnd a (b0 b) = b0 (bitAnd (a // 2) b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:67:43:
|
67 | theorem bitAndb00: $ bitAnd (b0 a) (b0 b) = b0 (bitAnd a b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:69:43:
|
69 | theorem bitAndb01: $ bitAnd (b0 a) (b1 b) = b0 (bitAnd a b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:71:43:
|
71 | theorem bitAndb10: $ bitAnd (b1 a) (b0 b) = b0 (bitAnd a b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:73:43:
|
73 | theorem bitAndb11: $ bitAnd (b1 a) (b1 b) = b1 (bitAnd a b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:77:3:
|
77 | @(add-eval @ fn (a b) {(eval a) bor (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:79:45:
|
79 | pub theorem bitOrEq (a b: nat): $ bitOr a b == a u. b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:82:35:
|
82 | theorem elbitOr: $ i e. bitOr a b <-> i e. a \/ i e. b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:85:32:
|
85 | theorem bitOr_sym: $ bitOr a b = bitOr b a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:87:42:
|
87 | theorem bitOr_ass: $ bitOr (bitOr a b) c = bitOr a (bitOr b c) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:90:43:
|
90 | theorem bitAnd_di: $ bitAnd a (bitOr b c) = bitOr (bitAnd a b) (bitAnd a c) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:94:35:
|
94 | theorem bitOr01 (a: nat): $ bitOr 0 a = a $ = '(axext @ eqstr bitOrEq un01);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:95:37:
|
95 | theorem bitOr02 (a: nat): $ bitOr a 0 = a $ = '(eqtr bitOr_sym bitOr01);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:96:41:
|
96 | theorem bitOr_idm (a: nat): $ bitOr a a = a $ = '(axext @ eqstr bitOrEq unidm);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:98:36:
|
98 | theorem bitOrb1l: $ bitOr (b1 a) b = b1 (bitOr a (b // 2)) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:102:36:
|
102 | theorem bitOrb1r: $ bitOr a (b1 b) = b1 (bitOr (a // 2) b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:105:41:
|
105 | theorem bitOrb00: $ bitOr (b0 a) (b0 b) = b0 (bitOr a b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:108:41:
|
108 | theorem bitOrb01: $ bitOr (b0 a) (b1 b) = b1 (bitOr a b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:110:41:
|
110 | theorem bitOrb10: $ bitOr (b1 a) (b0 b) = b1 (bitOr a b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:112:41:
|
112 | theorem bitOrb11: $ bitOr (b1 a) (b1 b) = b1 (bitOr a b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:115:40:
|
115 | theorem bitAnd_add_bitOr: $ bitAnd a b + bitOr a b = a + b $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:137:37:
|
137 | theorem bitOr_eq_add2: $ bitAnd a b = 0 -> bitOr a b = a + b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:140:27:
|
140 | theorem bitOr_eq_add: $ a i^i b == 0 -> bitOr a b = a + b $ =
| ^
error: unexpected 'i'
expecting '$' or infix >= 0
../examples/x86.mm1:143:3:
|
143 | @(add-eval @ fn (a b) {(eval a) band (bnot (eval b))})
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:145:47:
|
145 | pub theorem bitDifEq (a b: nat): $ bitDif a b == a i^i Compl b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:147:50:
|
147 | theorem elbitDif (a b i: nat): $ i e. bitDif a b <-> i e. a /\ ~i e. b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:150:28:
|
150 | theorem bitDif01: $ bitDif 0 a = 0 $ = '(axext @ eqstr bitDifEq in01);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:151:30:
|
151 | theorem bitDif02: $ bitDif a 0 = a $ = '(axext @ eqstr bitDifEq @ eqstr (ineq2 cpl0) inv2);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:152:32:
|
152 | theorem bitDifid: $ bitDif a a = 0 $ = '(axext @ eqstr bitDifEq incpl2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:153:33:
|
153 | theorem bitDifeq0: $ bitDif a b = 0 <-> a C_ b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:156:56:
|
156 | theorem bitDifAndss: $ a C_ c -> bitDif a (bitAnd c b) = bitDif a b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:159:46:
|
159 | theorem bitDifAndid: $ bitDif a (bitAnd a b) = bitDif a b $ = '(bitDifAndss ssid);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:161:44:
|
161 | theorem bitDifAnd: $ bitDif (bitAnd a b) c = bitAnd a (bitDif b c) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:165:43:
|
165 | theorem bitDifadd: $ b C_ a -> bitDif a b + b = a $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:170:43:
|
170 | theorem bitDifsub: $ b C_ a -> bitDif a b = a - b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:173:42:
|
173 | theorem bitDif_upto: $ bitDif a (upto n) = shl (shr a n) n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:178:3:
|
178 | @(add-eval @ fn (a b) {(eval a) bxor (eval b)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:180:56:
|
180 | pub theorem bitXor_mem (a b i: nat): $ i e. bitXor a b <-> ~(i e. a <-> i e. b) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:187:3:
|
187 | @(add-eval 32) @_ def d32: nat = $ 2 ^ 5 $; prefix d32: $32$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:187:52:
|
187 | @(add-eval 32) @_ def d32: nat = $ 2 ^ 5 $; prefix d32: $32$ prec max;
| ^
error: term 'd32' not declared
../examples/x86.mm1:188:3:
|
188 | @(add-eval 64) @_ def d64: nat = $ 2 ^ 6 $; prefix d64: $64$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:188:52:
|
188 | @(add-eval 64) @_ def d64: nat = $ 2 ^ 6 $; prefix d64: $64$ prec max;
| ^
error: term 'd64' not declared
../examples/x86.mm1:189:3:
|
189 | @(add-eval 256) @_ def d256: nat = $ 2 ^ 8 $; prefix d256: $256$ prec max;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:189:54:
|
189 | @(add-eval 256) @_ def d256: nat = $ 2 ^ 8 $; prefix d256: $256$ prec max;
| ^
error: term 'd256' not declared
../examples/x86.mm1:191:22:
|
191 | theorem d2mul16: $ 2 * 16 = 32 $ = '(eqtr2 powS @ muleq2 d2pow4);
| ^
error: expecting (
../examples/x86.mm1:192:22:
|
192 | theorem d2mul32: $ 2 * 32 = 64 $ = '(eqcom powS);
| ^
error: expecting (
../examples/x86.mm1:193:24:
|
193 | theorem d16mul16: $ 16 * 16 = 256 $ = '(eqcom @ pow22lem d2mul4 d2pow4);
| ^
error: expecting (
../examples/x86.mm1:194:21:
|
194 | theorem dec32: $ 32 = ,32 $ = '(eqtr3 d2mul16 ,to_hex);
| ^
error: expecting (
../examples/x86.mm1:195:13:
|
195 | do (insert! tohex-map 'd32 @ fn () '((hex (h2n (x2)) (x0)) (dec32)));
| ^
error: Reference to unbound variable 'tohex-map'
../examples/x86.mm1:196:21:
|
196 | theorem d8mul4: $ 8 * 4 = 32 $ = norm_num;
| ^
error: expecting (
../examples/x86.mm1:197:22:
|
197 | theorem d32ne0: $ 32 != 0 $ = 'pow2ne0;
| ^
error: expecting (
../examples/x86.mm1:198:22:
|
198 | theorem d64ne0: $ 64 != 0 $ = 'pow2ne0;
| ^
error: expecting (
../examples/x86.mm1:199:24:
|
199 | theorem d256ne0: $ 256 != 0 $ = 'pow2ne0;
| ^
error: expecting (
../examples/x86.mm1:200:21:
|
200 | theorem dec64: $ 64 = ,64 $ = '(eqtr3 d2mul32 ,to_hex);
| ^
error: expecting (
../examples/x86.mm1:201:23:
|
201 | theorem dec256: $ 256 = ,256 $ = '(eqtr3 d16mul16 ,to_hex);
| ^
error: expecting (
../examples/x86.mm1:202:13:
|
202 | do (insert! tohex-map 'd64 @ fn () '((hex (h2n (x4)) (x0)) (dec64)));
| ^
error: Reference to unbound variable 'tohex-map'
../examples/x86.mm1:203:13:
|
203 | do (insert! tohex-map 'd256 @ fn () '((hex (hex (h2n (x1)) (x0)) (x0)) (dec256)));
| ^
error: Reference to unbound variable 'tohex-map'
../examples/x86.mm1:204:21:
|
204 | theorem d8mul8: $ 8 * 8 = 64 $ = norm_num;
| ^
error: expecting (
../examples/x86.mm1:206:33:
|
206 | theorem c2nlt256 (c: char): $ c < 256 $ = '(mpbi (lteq2 d16mul16) c2nlt);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:207:36:
|
207 | theorem c2nlt256pow (c: char): $ c < 256 ^ suc k $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:210:21:
|
210 | theorem d8le32: $ 8 <= 32 $ = norm_num;
| ^
error: expecting (
../examples/x86.mm1:211:21:
|
211 | theorem d8le64: $ 8 <= 64 $ = norm_num;
| ^
error: expecting (
../examples/x86.mm1:212:21:
|
212 | theorem d8lt32: $ 8 < 32 $ = norm_num;
| ^
error: expecting (
../examples/x86.mm1:213:21:
|
213 | theorem d8lt64: $ 8 < 64 $ = norm_num;
| ^
error: expecting (
../examples/x86.mm1:214:23:
|
214 | theorem d16lt32: $ 16 < 32 $ = norm_num;
| ^
error: expecting (
../examples/x86.mm1:215:23:
|
215 | theorem d16lt64: $ 16 < 64 $ = norm_num;
| ^
error: expecting (
../examples/x86.mm1:216:23:
|
216 | theorem d16le64: $ 16 <= 64 $ = '(ltle d16lt64);
| ^
error: expecting (
../examples/x86.mm1:217:23:
|
217 | theorem d32le64: $ 32 <= 64 $ = norm_num;
| ^
error: expecting (
../examples/x86.mm1:219:1:
|
219 | @_ def Bits (k: nat): nat = $ upto (2 ^ k) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:219:39:
|
219 | @_ def Bits (k: nat): nat = $ upto (2 ^ k) $;
| ^
error: expecting (
../examples/x86.mm1:221:34:
|
221 | theorem Bitsle (m n v: nat): $ m <= n -> v e. Bits m -> v e. Bits n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:224:32:
|
224 | theorem Bitsss (m n: nat): $ m <= n -> Bits m C_ Bits n $ = '(!! iald x Bitsle);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:226:33:
|
226 | theorem Bits_eq_power: $ Bits n = power (upto n) $ = '(eqcom powerupto);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:228:31:
|
228 | theorem elBits: $ a e. Bits n <-> a C_ upto n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:230:32:
|
230 | theorem elBits2: $ a e. Bits n <-> a < 2 ^ n $ = 'elupto;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:232:61:
|
232 | theorem elBitsS_el: $ a e. Bits (suc n) -> (a e. Bits n <-> ~n e. a) $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:236:18:
|
236 | theorem uptoT: $ upto n e. Bits n $ = '(mpbir elBits ssid);
| ^
error: upto is not a function
../examples/x86.mm1:238:36:
|
238 | theorem elBits8mul: $ n e. Bits (8 * k) <-> n < 256 ^ k $ =
| ^
error: expecting (
../examples/x86.mm1:241:22:
|
241 | theorem Bitsle1: $ v <= w -> w e. Bits n -> v e. Bits n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:244:38:
|
244 | theorem Bits_mod: $ a e. Bits n -> a % 2 ^ n = a $ = '(sylbi elBits2 modlteq);
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/x86.mm1:245:33:
|
245 | theorem Bits_eqm: $ a e. Bits n /\ b e. Bits n -> (mod(2 ^ n): a = b <-> a = b) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:247:34:
|
247 | theorem Bits_zeqm: $ a e. Bits n /\ b e. Bits n -> (modZ(2 ^ n): b0 a = b0 b <-> a = b) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:249:30:
|
249 | theorem elBits0: $ a e. Bits 0 <-> a = 0 $ = '(bitr elBits2 @ bitr (lteq2 pow0) lt12);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:250:23:
|
250 | theorem elBits01: $ 0 e. Bits n $ = '(mpbir elBits ss01);
| ^
error: expecting (
../examples/x86.mm1:251:28:
|
251 | theorem elBitsx01: $ x0 e. Bits n $ = '(mpbi (eleq1 dec0) elBits01);
| ^
error: Bits is not a function
../examples/x86.mm1:252:30:
|
252 | theorem elBits1: $ a e. Bits 1 <-> bool a $ = '(bitr elBits2 @ lteq2 pow12);
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/x86.mm1:253:23:
|
253 | theorem elBits11: $ 1 e. Bits n <-> n != 0 $ =
| ^
error: expecting (
../examples/x86.mm1:255:46:
|
255 | theorem Bits_zeqm_02: $ a e. Bits n -> (modZ(2 ^ n): b0 a = 0 <-> a = 0) $ =
| ^
error: expecting (
../examples/x86.mm1:258:30:
|
258 | theorem eq_bitAnd1: $ a C_ b <-> bitAnd a b = a $ = '(bitr eqin1 @ bitr3 (eqseq1 bitAndEq) nsinj);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:259:30:
|
259 | theorem eq_bitAnd2: $ a C_ b <-> bitAnd b a = a $ = '(bitr eq_bitAnd1 @ eqeq1 bitAnd_sym);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:261:26:
|
261 | theorem bitAndT1: $ a e. Bits n -> bitAnd a b e. Bits n $ =
| ^
error: Bits is not a function
../examples/x86.mm1:263:26:
|
263 | theorem bitAndT2: $ b e. Bits n -> bitAnd a b e. Bits n $ =
| ^
error: Bits is not a function
../examples/x86.mm1:265:31:
|
265 | theorem bitOrT: $ a e. Bits n /\ b e. Bits n <-> bitOr a b e. Bits n $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:267:25:
|
267 | theorem bitDifT: $ a e. Bits n -> bitDif a b e. Bits n $ =
| ^
error: Bits is not a function
../examples/x86.mm1:270:33:
|
270 | theorem mulBitsT: $ a e. Bits m /\ b e. Bits n -> a * b e. Bits (m + n) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:273:32:
|
273 | theorem shladdT: $ a e. Bits n /\ c e. Bits b -> shl a b + c e. Bits (n + b) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:278:53:
|
278 | theorem shlT: $ a e. Bits n -> shl a b e. Bits (n + b) $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:280:35:
|
280 | theorem shlT2: $ a e. Bits n -> n + b <= c -> shl a b e. Bits c $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:282:32:
|
282 | theorem shrT: $ a e. Bits (n + b) -> shr a b e. Bits n $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:286:31:
|
286 | theorem b1Bits: $ a e. Bits n <-> b1 a e. Bits (suc n) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:288:31:
|
288 | theorem b0Bits: $ a e. Bits n <-> b0 a e. Bits (suc n) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:291:26:
|
291 | theorem b0Bitsi (h1: $ a = b0 a2 $) (h2: $ a2 e. Bits n $): $ a e. Bits (suc n) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:293:26:
|
293 | theorem b1Bitsi (h1: $ a = b1 a2 $) (h2: $ a2 e. Bits n $): $ a e. Bits (suc n) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:296:26:
|
296 | theorem mod_el_Bits: $ a % 2 ^ k e. Bits k $ = '(mpbir elupto @ modlt pow2ne0);
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/x86.mm1:298:36:
|
298 | theorem h2nT (h: hex): $ h e. Bits 4 $ =
| ^
error: unexpected '4'
expecting '$' or infix >= 0
../examples/x86.mm1:300:34:
|
300 | theorem hexT: $ a e. Bits k -> a :x x e. Bits (k + 4) $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/x86.mm1:302:35:
|
302 | theorem hex2T: $ a e. Bits k -> a :x x :x y e. Bits (k + 8) $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/x86.mm1:305:38:
|
305 | theorem xelBits4S (h: $ n e. Bits (4 * k) $): $ n :x a e. Bits (4 * suc k) $ =
| ^
error: expecting (
../examples/x86.mm1:307:39:
|
307 | theorem xelBits41: $ h2n a e. Bits (4 * suc k) $ =
| ^
error: expecting (
../examples/x86.mm1:316:38:
|
316 | theorem xelBits8S (h: $ n e. Bits (8 * k) $): $ n :x a1 :x a0 e. Bits (8 * suc k) $ =
| ^
error: expecting (
../examples/x86.mm1:318:29:
|
318 | theorem xelBits82: $ h2n a1 :x a0 e. Bits (8 * suc k) $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/x86.mm1:320:40:
|
320 | theorem xelBits81: $ h2n a0 e. Bits (8 * suc k) $ =
| ^
error: expecting (
../examples/x86.mm1:330:38:
|
330 | theorem xelBits7S (h: $ n e. Bits (8 * k + 7) $): $ n :x a1 :x a0 e. Bits (8 * suc k + 7) $ =
| ^
error: expecting (
../examples/x86.mm1:332:30:
|
332 | theorem xelBits72S: $ h2n a1 :x a0 e. Bits (8 * suc k + 7) $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/x86.mm1:334:29:
|
334 | theorem xelBits720 (h: $ a1 < x8 $): $ h2n a1 :x a0 e. Bits (8 * 0 + 7) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:337:40:
|
337 | theorem xelBits71: $ h2n a0 e. Bits (8 * k + 7) $ =
| ^
error: expecting (
../examples/x86.mm1:349:1:
|
349 | @_ def u8: nat = $ Bits 8 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:349:25:
|
349 | @_ def u8: nat = $ Bits 8 $;
| ^
error: unexpected '8'
expecting '$' or infix >= 0
../examples/x86.mm1:350:1:
|
350 | @_ def u16: nat = $ Bits 16 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:350:26:
|
350 | @_ def u16: nat = $ Bits 16 $;
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/x86.mm1:351:1:
|
351 | @_ def u32: nat = $ Bits 32 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:351:26:
|
351 | @_ def u32: nat = $ Bits 32 $;
| ^
error: unexpected '3'
expecting '$' or infix >= 0
../examples/x86.mm1:352:1:
|
352 | @_ def u64: nat = $ Bits 64 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:352:26:
|
352 | @_ def u64: nat = $ Bits 64 $;
| ^
error: unexpected '6'
expecting '$' or infix >= 0
../examples/x86.mm1:354:21:
|
354 | theorem d0elu8: $ 0 e. u8 $ = 'elBits01;
| ^
error: expecting (
../examples/x86.mm1:355:22:
|
355 | theorem d0elu16: $ 0 e. u16 $ = 'elBits01;
| ^
error: expecting (
../examples/x86.mm1:356:22:
|
356 | theorem d0elu32: $ 0 e. u32 $ = 'elBits01;
| ^
error: expecting (
../examples/x86.mm1:357:22:
|
357 | theorem d0elu64: $ 0 e. u64 $ = 'elBits01;
| ^
error: expecting (
../examples/x86.mm1:359:20:
|
359 | theorem u32ss64: $ u32 C_ u64 $ = '(Bitsss d32le64);
| ^
error: u32 is not a function
../examples/x86.mm1:360:20:
|
360 | theorem u16ss64: $ u16 C_ u64 $ = '(Bitsss d16le64);
| ^
error: u16 is not a function
../examples/x86.mm1:361:19:
|
361 | theorem u8ss32: $ u8 C_ u32 $ = '(Bitsss d8le32);
| ^
error: u8 is not a function
../examples/x86.mm1:362:19:
|
362 | theorem u8ss64: $ u8 C_ u64 $ = '(Bitsss d8le64);
| ^
error: u8 is not a function
../examples/x86.mm1:363:19:
|
363 | theorem u8ss16: $ u8 C_ u16 $ = '(Bitsss @ ltle d8lt16);
| ^
error: u8 is not a function
../examples/x86.mm1:365:21:
|
365 | theorem u64le1: $ v <= w -> w e. u64 -> v e. u64 $ = 'Bitsle1;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:367:25:
|
367 | theorem elu8: $ n e. u8 <-> n < 16 * 16 $ = '(bitr elBits2 @ lteq2 d2pow8);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:368:27:
|
368 | theorem elu8_2: $ n e. u8 <-> n < 256 $ = '(bitr elu8 @ lteq2 d16mul16);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:369:27:
|
369 | theorem elu8_3: $ n e. u8 <-> n < 256 ^ 1 $ = '(bitr4 elu8_2 @ lteq2 pow12);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:370:27:
|
370 | theorem c2nT (c: char): $ c e. u8 $ = '(mpbir elu8 c2nlt);
| ^
error: type error, expected nat, got c: char
../examples/x86.mm1:371:26:
|
371 | theorem elu8_lem (h: $ n < ,256 $): $ n e. u8 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:373:21:
|
373 | theorem d1elu8: $ 1 e. u8 $ = '(elu8_lem ,norm_num);
| ^
error: expecting (
../examples/x86.mm1:374:21:
|
374 | theorem d2elu8: $ 2 e. u8 $ = '(elu8_lem ,norm_num);
| ^
error: expecting (
../examples/x86.mm1:375:22:
|
375 | theorem d1elu32: $ 1 e. u32 $ = '(ssel u8ss32 d1elu8);
| ^
error: expecting (
../examples/x86.mm1:377:24:
|
377 | theorem mod_el_u8: $ a % 256 e. u8 $ = 'mod_el_Bits;
| ^
error: unexpected '%'
expecting '$' or infix >= 0
../examples/x86.mm1:379:27:
|
379 | theorem elu16: $ n e. u16 <-> n < 256 ^ 2 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:381:27:
|
381 | theorem elu32: $ n e. u32 <-> n < 256 ^ 4 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:383:27:
|
383 | theorem elu64: $ n e. u64 <-> n < 256 ^ 8 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:386:44:
|
386 | theorem xu8Byte_2 (a0 a1: hex): $ ch a1 a0 = a1 :x a0 $ = 'c2nhex;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:387:41:
|
387 | theorem xu8Byte_1 (a0: hex): $ ch x0 a0 = a0 $ = 'c2nh2n;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:388:30:
|
388 | theorem xelu8_1 (a0: hex): $ a0 e. u8 $ = '(mpbi (eleq1 xu8Byte_1) c2nT);
| ^
error: type error, expected nat, got a0: hex
../examples/x86.mm1:389:36:
|
389 | theorem xelu8_2 (a0 a1: hex): $ a1 :x a0 e. u8 $ = '(mpbi (eleq1 xu8Byte_2) c2nT);
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/x86.mm1:391:26:
|
391 | theorem xeluNlem (e: $ 8 * k = n $) (h: $ a e. Bits (8 * k) $): $ a e. Bits n $ =
| ^
error: expecting (
../examples/x86.mm1:393:35:
|
393 | theorem xelu8i (h: $ a e. Bits (8 * suc 0) $): $ a e. u8 $ = '(xeluNlem mul12 h);
| ^
error: expecting (
../examples/x86.mm1:394:36:
|
394 | theorem xelu16i (h: $ a e. Bits (8 * ,(sucs 2)) $): $ a e. u16 $ = '(xeluNlem d8mul2 h);
| ^
error: expecting (
../examples/x86.mm1:395:36:
|
395 | theorem xelu32i (h: $ a e. Bits (8 * ,(sucs 4)) $): $ a e. u32 $ = '(xeluNlem d8mul4 h);
| ^
error: expecting (
../examples/x86.mm1:396:36:
|
396 | theorem xelu64i (h: $ a e. Bits (8 * ,(sucs 8)) $): $ a e. u64 $ = '(xeluNlem d8mul8 h);
| ^
error: expecting (
../examples/x86.mm1:403:39:
|
403 | theorem xelBits7b0 (h: $ a e. Bits (8 * k + 7) $): $ b0 a e. Bits (8 * suc k) $ =
| ^
error: expecting (
../examples/x86.mm1:405:39:
|
405 | theorem xelBits7b1 (h: $ a e. Bits (8 * k + 7) $): $ b1 a e. Bits (8 * suc k) $ =
| ^
error: expecting (
../examples/x86.mm1:407:37:
|
407 | theorem xelu8b0i (h: $ a e. Bits (8 * 0 + 7) $): $ b0 a e. u8 $ = '(xelu8i @ xelBits7b0 h);
| ^
error: expecting (
../examples/x86.mm1:408:37:
|
408 | theorem xelu8b1i (h: $ a e. Bits (8 * 0 + 7) $): $ b1 a e. u8 $ = '(xelu8i @ xelBits7b1 h);
| ^
error: expecting (
../examples/x86.mm1:409:38:
|
409 | theorem xelu16b0i (h: $ a e. Bits (8 * ,(sucs 1) + 7) $): $ b0 a e. u16 $ = '(xelu16i @ xelBits7b0 h);
| ^
error: expecting (
../examples/x86.mm1:410:38:
|
410 | theorem xelu16b1i (h: $ a e. Bits (8 * ,(sucs 1) + 7) $): $ b1 a e. u16 $ = '(xelu16i @ xelBits7b1 h);
| ^
error: expecting (
../examples/x86.mm1:411:38:
|
411 | theorem xelu32b0i (h: $ a e. Bits (8 * ,(sucs 3) + 7) $): $ b0 a e. u32 $ = '(xelu32i @ xelBits7b0 h);
| ^
error: expecting (
../examples/x86.mm1:412:38:
|
412 | theorem xelu32b1i (h: $ a e. Bits (8 * ,(sucs 3) + 7) $): $ b1 a e. u32 $ = '(xelu32i @ xelBits7b1 h);
| ^
error: expecting (
../examples/x86.mm1:413:38:
|
413 | theorem xelu64b0i (h: $ a e. Bits (8 * ,(sucs 7) + 7) $): $ b0 a e. u64 $ = '(xelu64i @ xelBits7b0 h);
| ^
error: expecting (
../examples/x86.mm1:414:38:
|
414 | theorem xelu64b1i (h: $ a e. Bits (8 * ,(sucs 7) + 7) $): $ b1 a e. u64 $ = '(xelu64i @ xelBits7b1 h);
| ^
error: expecting (
../examples/x86.mm1:424:3:
|
424 | @(add-eval @ fn (k n) {(eval n) band {{1 shl (eval k)} - 1}})
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:426:33:
|
426 | pub theorem chopT (k n: nat): $ chop k n e. Bits k $ = '(mpbir elupto @ modlt pow2ne0);
| ^
error: chop is not a function
../examples/x86.mm1:428:24:
|
428 | theorem chop01: $ chop 0 n = 0 $ = '(mpbi elBits0 chopT);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:429:26:
|
429 | theorem chop02: $ chop k 0 = 0 $ = 'mod01;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:430:34:
|
430 | theorem el_chop: $ a e. chop k n <-> a < k /\ a e. n $ = 'elmodpow2;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:431:23:
|
431 | theorem bit_chop: $ a < k -> bit (chop k n) a = bit n a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:433:26:
|
433 | theorem bit_chop_0: $ ~a < k -> bit (chop k n) a = 0 $ =
| ^
error: unexpected '<'
expecting '$', infix >= 0, or infix >= 41
../examples/x86.mm1:435:27:
|
435 | theorem chopT_min: $ a e. Bits m -> chop k a e. Bits (min m k) $ =
| ^
error: Bits is not a function
../examples/x86.mm1:439:42:
|
439 | theorem bitAnd_upto: $ bitAnd (upto k) a = chop k a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:442:24:
|
442 | theorem chop_upto: $ m <= k <-> chop m (upto k) = upto m $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:445:40:
|
445 | theorem shlshr_chop: $ shl (shr n k) k + chop k n = n $ = '(eqtr (addeq1 mulcom) divmod);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:447:25:
|
447 | theorem chop_shl_0: $ m <= k -> chop m (shl a k) = 0 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:451:36:
|
451 | theorem shladd_uniq: $ a e. Bits k /\ shl m k + a = n <-> shr n k = m /\ chop k n = a $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:455:57:
|
455 | theorem chop_shladd: $ b e. Bits k -> chop k (shl a k + b) = b $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:457:26:
|
457 | theorem chop4hex: $ chop 4 (a :x b) = b $ = '(eqtr (chopeq2 hexshl4) @ chop_shladd h2nT);
| ^
error: unexpected '4'
expecting '$' or infix >= 0
../examples/x86.mm1:458:43:
|
458 | theorem chop_shladd2: $ chop k (shl a k + b) = chop k b $ = '(muladdmod1 pow2ne0);
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:460:46:
|
460 | theorem Bits_chop: $ a e. Bits k -> chop k a = a $ = 'Bits_mod;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:461:25:
|
461 | theorem eqm_chop: $ mod(2 ^ k): chop k a = a $ = 'eqmmod;
| ^
error: expecting (
../examples/x86.mm1:462:27:
|
462 | theorem zeqm_chop: $ modZ(2 ^ k): b0 (chop k a) = b0 a $ = '(mpbir zeqmeqm eqm_chop);
| ^
error: expecting (
../examples/x86.mm1:463:34:
|
463 | theorem chop_eq_chop: $ chop k a = chop k b <-> mod(2 ^ k): a = b $ = 'biid;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:464:35:
|
464 | theorem chop_eq_chop2: $ chop k a = chop k b <-> modZ(2 ^ k): b0 a = b0 b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:467:24:
|
467 | theorem chop_chop: $ m <= n -> chop m (chop n a) = chop m a $ = '(syl modmod powdvd);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:469:38:
|
469 | theorem chop_shl: $ shl (chop n a) k = chop (n + k) (shl a k) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:471:36:
|
471 | theorem chop_shr: $ shr (chop (n + k) a) k = chop n (shr a k) $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:473:37:
|
473 | theorem chop_shr2: $ shr (chop (k + n) a) k = chop n (shr a k) $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:476:45:
|
476 | theorem chop_bitAnd1: $ chop m (bitAnd a b) = bitAnd (chop m a) b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:478:45:
|
478 | theorem chop_bitAnd2: $ chop m (bitAnd a b) = bitAnd a (chop m b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:480:44:
|
480 | theorem chop_bitAnd: $ chop m (bitAnd a b) = bitAnd (chop m a) (chop m b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:482:42:
|
482 | theorem chop_bitOr: $ chop m (bitOr a b) = bitOr (chop m a) (chop m b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:484:45:
|
484 | theorem chop_bitDif1: $ chop m (bitDif a b) = bitDif (chop m a) b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:486:44:
|
486 | theorem chop_bitDif: $ chop m (bitDif a b) = bitDif (chop m a) (chop m b) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:489:42:
|
489 | theorem shl_bitAnd: $ shl (bitAnd a b) m = bitAnd (shl a m) (shl b m) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:492:40:
|
492 | theorem shl_bitOr: $ shl (bitOr a b) m = bitOr (shl a m) (shl b m) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:495:42:
|
495 | theorem shl_bitDif: $ shl (bitDif a b) m = bitDif (shl a m) (shl b m) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:499:42:
|
499 | theorem shr_bitAnd: $ shr (bitAnd a b) m = bitAnd (shr a m) (shr b m) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:501:40:
|
501 | theorem shr_bitOr: $ shr (bitOr a b) m = bitOr (shr a m) (shr b m) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:503:42:
|
503 | theorem shr_bitDif: $ shr (bitDif a b) m = bitDif (shr a m) (shr b m) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:506:34:
|
506 | theorem eqm_chopd (h: $ G -> mod(2 ^ k): a = b $):
| ^
error: expecting (
../examples/x86.mm1:508:36:
|
508 | theorem zeqm_chopd (h: $ G -> modZ(2 ^ k): b0 a = b $):
| ^
error: expecting (
../examples/x86.mm1:511:44:
|
511 | theorem zeqm_chop1: $ b e. Bits n -> (modZ(2 ^ n): b0 a = b0 b <-> chop n a = b) $ =
| ^
error: expecting (
../examples/x86.mm1:513:44:
|
513 | theorem zeqm_chop2: $ a e. Bits n -> (modZ(2 ^ n): b0 a = b0 b <-> a = chop n b) $ =
| ^
error: expecting (
../examples/x86.mm1:516:3:
|
516 | @(add-eval @ fn (k n) {(evalZ n) band {{1 shl (eval k)} - 1}})
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:518:30:
|
518 | theorem chopZT (k n: nat): $ chopZ k n e. Bits k $ = 'chopT;
| ^
error: chopZ is not a function
../examples/x86.mm1:520:36:
|
520 | theorem chopZ_b0: $ chopZ k (b0 a) = chop k a $ = 'zmodb0;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:521:28:
|
521 | theorem zeqm_chopZ: $ modZ(2 ^ k): b0 (chopZ k a) = a $ = '(zeqmmod pow2ne0);
| ^
error: expecting (
../examples/x86.mm1:522:37:
|
522 | theorem zeqm_chopZd (h: $ G -> modZ(2 ^ k): a = b $):
| ^
error: expecting (
../examples/x86.mm1:525:37:
|
525 | theorem chopZ_eq_chopZ: $ chopZ k a = chopZ k b <-> modZ(2 ^ k): a = b $ = '(zmodeqmod pow2ne0);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:527:51:
|
527 | theorem chopZ_b1: $ a e. Bits k -> chopZ k (b1 a) = 2 ^ k - suc a $ = '(sylbi elBits2 zmodb1);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:528:53:
|
528 | theorem chopZ_b1_2: $ a e. Bits k -> chopZ k (b1 a) + suc a = 2 ^ k $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:532:7:
|
532 | $ a :x b :x c // 256 = a /\ a :x b :x c % 256 = b :x c $ =
| ^
error: unexpected ':'
expecting '$' or infix >= 0
../examples/x86.mm1:536:32:
|
536 | theorem xchopshr8: $ shr (a :x b :x c) 8 = a /\ chop 8 (a :x b :x c) = b :x c $ = 'hex_divmod256;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:538:29:
|
538 | theorem s2nT (s: string): $ s e. List u8 $ =
| ^
error: type error, expected nat, got s: string
../examples/x86.mm1:541:3:
|
541 | @(add-eval @ fn (k n) @ match (eval k) [0 #f] [k {{{(eval n) shr {k - 1}} band 1} = 1}])
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:544:35:
|
544 | theorem bitsMSB_b0: $ bitsMSB k n <-> k e. b0 n $ = '(bicom elb0);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:546:57:
|
546 | theorem bitsMSB_Bits: $ n e. Bits k -> (bitsMSB k n <-> ~n e. Bits (k - 1)) $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:553:55:
|
553 | theorem bitsMSB_le: $ n e. Bits k -> (bitsMSB k n <-> 2 ^ (k - 1) <= n) $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:556:64:
|
556 | theorem chopZ_MSB: $ a e. Bits k -> (bitsMSB k (chopZ k a) <-> odd a) $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:572:35:
|
572 | theorem Bits_zeqm2: $ a e. Bits n /\ b e. Bits n -> (modZ(2 ^ n): a = b <-> a = b) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:592:1:
|
592 | @_ def sExt (m n v: nat): nat = $ if (bitsMSB m v) (2 ^ n - 2 ^ m + v) v $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:592:55:
|
592 | @_ def sExt (m n v: nat): nat = $ if (bitsMSB m v) (2 ^ n - 2 ^ m + v) v $;
| ^
error: expecting (
../examples/x86.mm1:593:1:
|
593 | @_ def sExtq (n v: nat): nat = $ sExt n 64 v $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:593:41:
|
593 | @_ def sExtq (n v: nat): nat = $ sExt n 64 v $;
| ^
error: unexpected '6'
expecting '$' or infix >= 0
../examples/x86.mm1:595:37:
|
595 | pub theorem sExtT (m n v: nat): $ m <= n /\ v e. Bits m -> sExt m n v e. Bits n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:602:36:
|
602 | pub theorem sExtqT (n v: nat): $ n <= 64 /\ v e. Bits n -> sExtq n v e. u64 $ = 'sExtT;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:604:25:
|
604 | theorem sExt_chopZ: $ m <= n /\ a e. Bits m -> sExt m n (chopZ m a) = chopZ n a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:619:1:
|
619 | @_ def bitsUpdate (k m a n: nat): nat = $ bitDif n (shl (upto m) k) + shl a k $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:619:69:
|
619 | @_ def bitsUpdate (k m a n: nat): nat = $ bitDif n (shl (upto m) k) + shl a k $;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:621:7:
|
621 | $ k + m <= l /\ a e. Bits m /\ n e. Bits l -> bitsUpdate k m a n e. Bits l $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:628:22:
|
628 | bitsUpdate k m a n = bitOr (bitDif n (shl (upto m) k)) (shl a k) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:633:26:
|
633 | $ shr (bitsUpdate (k + i) m a n) i = bitsUpdate k m a (shr n i) $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:638:32:
|
638 | theorem chop_bitsUpdate_2: $ k + i = j -> a e. Bits m ->
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:646:33:
|
646 | $ chop k (bitsUpdate k m a n) = chop k n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:650:32:
|
650 | theorem chop_bitsUpdate_1: $ i <= k -> chop i (bitsUpdate k m a n) = chop i n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:653:36:
|
653 | theorem bitsUpdate01: $ bitsUpdate 0 m a n = bitDif n (upto m) + a $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:656:37:
|
656 | theorem bitsUpdate01_: $ bitsUpdate 0 m a n = shl (shr n m) m + a $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:659:30:
|
659 | theorem el_bitsUpdate_1: $ i < k -> (i e. bitsUpdate k m a n <-> i e. n) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:662:30:
|
662 | theorem el_bitsUpdate_2: $ i < m -> (k + i e. bitsUpdate k m a n <-> i e. a) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:667:40:
|
667 | theorem el_bitsUpdate_3: $ a e. Bits m /\ k + m <= i ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:675:48:
|
675 | theorem el_bitsUpdate1_eq: $ k e. bitsUpdate k 1 (nat p) n <-> p $ =
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/x86.mm1:677:32:
|
677 | theorem el_bitsUpdate1_ne: $ i != k -> (i e. bitsUpdate k 1 (nat p) n <-> i e. n) $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/x86.mm1:681:3:
|
681 | @(add-eval @ fn (n v) @ match (eval k) [0 #f] [k {{{(eval n) shr {k - 1}} band 1} = 1}])
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:683:58:
|
683 | pub theorem bitsNot_mem (k n i: nat): $ i e. bitsNot k n <-> i < k /\ ~i e. n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:686:36:
|
686 | pub theorem bitsNotT (k n: nat): $ bitsNot k n e. Bits k $ = '(bitDifT uptoT);
| ^
error: bitsNot is not a function
../examples/x86.mm1:688:46:
|
688 | theorem bitsNot_chop: $ bitsNot k (chop k n) = bitsNot k n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:691:51:
|
691 | theorem bitsNot_add: $ n e. Bits k -> bitsNot k n + n = upto k $ = '(sylbi elBits bitDifadd);
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:692:51:
|
692 | theorem bitsNot_sub: $ n e. Bits k -> bitsNot k n = upto k - n $ = '(sylbi elBits bitDifsub);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:693:31:
|
693 | theorem bitsNot0: $ bitsNot k 0 = upto k $ = '(eqtr (bitsNot_sub elBits01) sub02);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:694:30:
|
694 | theorem bitsNot01: $ bitsNot 0 n = 0 $ = '(eqtr (bitDifeq1 upto0) bitDif01);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:696:27:
|
696 | theorem chop_bitsNot: $ m <= k -> chop m (bitsNot k n) = bitsNot m n $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:698:44:
|
698 | theorem shl_bitsNot: $ shl (bitsNot k a) m + upto m = bitsNot (k + m) (shl a m) $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:702:44:
|
702 | theorem shr_bitsNot: $ shr (bitsNot k a) m = bitsNot (k - m) (shr a m) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:705:30:
|
705 | theorem zeqm_bitsNot: $ modZ(2 ^ k): b0 (bitsNot k n) = -uZ b0 (suc n) $ =
| ^
error: expecting (
../examples/x86.mm1:712:31:
|
712 | theorem zeqm_bitsNot2: $ modZ(2 ^ k): b0 (bitsNot k n) = b1 n $ =
| ^
error: expecting (
../examples/x86.mm1:715:44:
|
715 | theorem chopZ_b1_bitsNot: $ chopZ k (b1 n) = bitsNot k n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:719:20:
|
719 | (h1: $ G -> modZ(2 ^ k): b0 a = x $):
| ^
error: expecting (
../examples/x86.mm1:724:42:
|
724 | theorem bitsNot4_h2n (a: hex): $ bitsNot 4 a + a = xf $ =
| ^
error: unexpected '4'
expecting '$' or infix >= 0
../examples/x86.mm1:726:33:
|
726 | theorem bitsNot4_hex: $ bitsNot 4 (a :x b) + b = xf $ =
| ^
error: unexpected '4'
expecting '$' or infix >= 0
../examples/x86.mm1:729:26:
|
729 | theorem bitsNot_hex: $ b + c = xf -> bitsNot (k + 4) (a :x b) = bitsNot k a :x c $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:735:27:
|
735 | theorem xbitNotS (h0: $ a + b = xf $) (h1: $ c = bitsNot k n $):
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:737:27:
|
737 | theorem xbitNot1 (h0: $ a + h2n b = xf $): $ b = bitsNot 4 (n :x a) $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:739:30:
|
739 | theorem xbitNot_ch (h0: $ a0 + c0 = xf $) (h1: $ a1 + c1 = xf $):
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:743:3:
|
743 | @(add-eval @ fn (k a b) {{(eval a) + (eval b)} band {{1 shl (eval k)} - 1}})
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:745:38:
|
745 | pub theorem bitsAddT (k a b: nat): $ bitsAdd k a b e. Bits k $ = 'chopT;
| ^
error: bitsAdd is not a function
../examples/x86.mm1:747:27:
|
747 | theorem bitsAdd_eqid: $ a + b e. Bits k -> bitsAdd k a b = a + b $ = 'Bits_chop;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:748:28:
|
748 | theorem eqm_bitsAdd: $ mod(2 ^ k): bitsAdd k a b = a + b $ = 'eqm_chop;
| ^
error: expecting (
../examples/x86.mm1:749:30:
|
749 | theorem zeqm_bitsAdd: $ modZ(2 ^ k): b0 (bitsAdd k a b) = b0 a +Z b0 b $ =
| ^
error: expecting (
../examples/x86.mm1:752:19:
|
752 | (h1: $ G -> mod(2 ^ k): a = x $) (h2: $ G -> mod(2 ^ k): b = y $):
| ^
error: expecting (
../examples/x86.mm1:756:20:
|
756 | (h1: $ G -> modZ(2 ^ k): b0 a = x $) (h2: $ G -> modZ(2 ^ k): b0 b = y $):
| ^
error: expecting (
../examples/x86.mm1:760:32:
|
760 | theorem bitsAdd02: $ bitsAdd k 0 a = chop k a $ = '(chopeq2 add01);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:761:34:
|
761 | theorem bitsAdd03: $ bitsAdd k a 0 = chop k a $ = '(chopeq2 add0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:763:3:
|
763 | @(add-eval @ fn (k n) {(- (eval n)) band {{1 shl (eval k)} - 1}})
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:765:36:
|
765 | pub theorem bitsNegT (k n: nat): $ bitsNeg k n e. Bits k $ = 'bitsAddT;
| ^
error: bitsNeg is not a function
../examples/x86.mm1:768:20:
|
768 | (h1: $ G -> modZ(2 ^ k): b0 a = x $):
| ^
error: expecting (
../examples/x86.mm1:772:30:
|
772 | theorem zeqm_bitsNeg: $ modZ(2 ^ k): b0 (bitsNeg k n) = -uZ b0 n $ =
| ^
error: expecting (
../examples/x86.mm1:775:31:
|
775 | theorem bitsNeg0: $ bitsNeg k 0 = 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:779:31:
|
779 | theorem bitsNeg1: $ bitsNeg k 1 = upto k $ =
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/x86.mm1:784:3:
|
784 | @(add-eval @ fn (k a b) {{(eval a) - (eval b)} band {{1 shl (eval k)} - 1}})
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:786:38:
|
786 | pub theorem bitsSubT (k a b: nat): $ bitsSub k a b e. Bits k $ = 'bitsAddT;
| ^
error: bitsSub is not a function
../examples/x86.mm1:789:20:
|
789 | (h1: $ G -> modZ(2 ^ k): b0 a = x $) (h2: $ G -> modZ(2 ^ k): b0 b = y $):
| ^
error: expecting (
../examples/x86.mm1:792:31:
|
792 | theorem zeqm_bitsSub2: $ modZ(2 ^ k): b0 (bitsSub k a b) = b0 a -Z b0 b $ =
| ^
error: expecting (
../examples/x86.mm1:794:30:
|
794 | theorem zeqm_bitsSub: $ modZ(2 ^ k): b0 (bitsSub k a b) = a -ZN b $ =
| ^
error: expecting (
../examples/x86.mm1:797:29:
|
797 | theorem bitsSub_eq_sub: $ b <= a -> a e. Bits k -> bitsSub k a b = a - b $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:801:34:
|
801 | theorem bitsSub03: $ bitsSub k a 0 = chop k a $ = '(eqtr (bitsAddeq3 bitsNeg0) bitsAdd03);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:803:51:
|
803 | theorem bits_npcan: $ bitsAdd k (bitsSub k a b) b = chop k a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:806:51:
|
806 | theorem bits_pncan: $ bitsSub k (bitsAdd k a b) b = chop k a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:810:1:
|
810 | @_ def bitsSar (k a b: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:811:21:
|
811 | $ nat (bitsMSB k a) * (upto k - upto (k - b)) + shr a b $;
| ^
error: unexpected '*'
expecting '$' or infix >= 0
../examples/x86.mm1:813:17:
|
813 | $ a e. Bits k /\ b <= k -> bitsSar k a b e. Bits k $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:820:3:
|
820 | @(add-eval @ fn (a b) {{(eval a) + (eval b)} band {{1 shl 64} - 1}})
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:821:59:
|
821 | @_ def add64 (a b: nat): nat = $ bitsAdd 64 a b $; infixl add64: $+_64$ prec 64;
| ^
error: term 'add64' not declared
../examples/x86.mm1:822:36:
|
822 | pub theorem add64T (a b: nat): $ a +_64 b e. u64 $ = 'bitsAddT;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:824:25:
|
824 | theorem add64_eqid: $ a + b e. u64 -> a +_64 b = a + b $ = 'bitsAdd_eqid;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:825:42:
|
825 | theorem add64S_eqid: $ suc a e. u64 -> a +_64 1 = suc a $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:828:3:
|
828 | @(add-eval @ fn (a b) {{(eval a) - (eval b)} band {{1 shl 64} - 1}})
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:829:59:
|
829 | @_ def sub64 (a b: nat): nat = $ bitsSub 64 a b $; infixl sub64: $-_64$ prec 64;
| ^
error: term 'sub64' not declared
../examples/x86.mm1:830:36:
|
830 | pub theorem sub64T (a b: nat): $ a -_64 b e. u64 $ = 'bitsSubT;
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/x86.mm1:832:25:
|
832 | theorem sub64_eqid: $ b <= a -> a e. u64 -> a -_64 b = a - b $ = 'bitsSub_eq_sub;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:834:23:
|
834 | theorem sub02_64: $ a -_64 0 = chop 64 a $ = 'bitsSub03;
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/x86.mm1:835:22:
|
835 | theorem npcan64: $ a -_64 b +_64 b = chop 64 a $ = 'bits_npcan;
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/x86.mm1:836:22:
|
836 | theorem pncan64: $ a +_64 b -_64 b = chop 64 a $ = 'bits_pncan;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:838:1:
|
838 | @_ local def toBytesAux (k n .a: nat): nat = $ rec 0 (\ a,
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:838:52:
|
838 | @_ local def toBytesAux (k n .a: nat): nat = $ rec 0 (\ a,
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:841:35:
|
841 | theorem toBytesAux0: $ toBytesAux 0 n = 0 $ = (named 'rec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:842:39:
|
842 | theorem toBytesAux0_app: $ toBytesAux 0 n @ i = 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:845:45:
|
845 | theorem toBytesAuxS: $ toBytesAux (suc k) n =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:850:30:
|
850 | theorem toBytesAuxS_app: $ a <= n ->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:856:1:
|
856 | @_ abstract def toBytes (k n: nat): nat = $ toBytesAux k n @ n $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:856:60:
|
856 | @_ abstract def toBytes (k n: nat): nat = $ toBytesAux k n @ n $;
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/x86.mm1:858:42:
|
858 | pub theorem toBytes0 (n: nat): $ toBytes 0 n = 0 $ = 'toBytesAux0_app;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:860:29:
|
860 | theorem toBytesAuxS_eq: $ a <= n -> toBytesAux k n @ a = toBytes k a $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:874:23:
|
874 | $ toBytes (suc k) n = (n % 256) : toBytes k (n // 256) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:876:40:
|
876 | theorem toBytesS2: $ toBytes (suc k) n = chop 8 n : toBytes k (shr n 8) $ = 'toBytesS;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:878:32:
|
878 | theorem toBytes02: $ toBytes k 0 = repeat 0 k $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:884:36:
|
884 | pub theorem toBytesT (k n: nat): $ toBytes k n e. Array u8 k $ =
| ^
error: toBytes is not a function
../examples/x86.mm1:891:22:
|
891 | theorem toBytesT2: $ toBytes k n e. List u8 $ = '(elArrayList toBytesT);
| ^
error: toBytes is not a function
../examples/x86.mm1:892:42:
|
892 | theorem toBytes_len: $ len (toBytes k n) = k $ = '(elArraylen toBytesT);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:894:29:
|
894 | theorem toBytes1: $ toBytes 1 n = chop 8 n : 0 $ =
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/x86.mm1:897:44:
|
897 | theorem toBytes_chop: $ toBytes k (chop (8 * k) n) = toBytes k n $ =
| ^
error: expecting (
../examples/x86.mm1:905:37:
|
905 | theorem toBytes_inj2: $ toBytes k a = toBytes k b <-> chop (8 * k) a = chop (8 * k) b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:918:36:
|
918 | theorem toBytes_inj: $ toBytes k a = toBytes k b <-> mod(2 ^ (8 * k)): a = b $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:921:57:
|
921 | theorem toBytesS_bitsNot: $ toBytes (suc k) (bitsNot (8 * suc k) n) =
| ^
error: expecting (
../examples/x86.mm1:927:31:
|
927 | theorem s2n_toBytesS0 (h: $ c = a $) (h2: $ s = repeat 0 k $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:933:25:
|
933 | theorem xtoBytes0: $ s0 = toBytes 0 a $ = '(eqtr4 s2ns0 toBytes0);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:934:27:
|
934 | theorem xtoBytesS (h: $ s = toBytes k n $): $ ch a1 a0 ': s = toBytes (suc k) (n :x a1 :x a0) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:937:28:
|
937 | theorem xtoBytesS2 (h: $ s = toBytes k x0 $): $ ch a1 a0 ': s = toBytes (suc k) (a1 :x a0) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:939:28:
|
939 | theorem xtoBytesS1 (h: $ s = toBytes k x0 $): $ ch x0 a0 ': s = toBytes (suc k) a0 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:941:37:
|
941 | theorem xtoBytes1S: $ s1 (ch a1 a0) = toBytes (suc 0) (n :x a1 :x a0) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:943:37:
|
943 | theorem xtoBytes12: $ s1 (ch a1 a0) = toBytes (suc 0) (a1 :x a0) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:945:37:
|
945 | theorem xtoBytes11: $ s1 (ch x0 a0) = toBytes (suc 0) a0 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:965:1:
|
965 | @_ def u16Bytes (n: nat): nat = $ toBytes 2 n $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:965:43:
|
965 | @_ def u16Bytes (n: nat): nat = $ toBytes 2 n $;
| ^
error: unexpected '2'
expecting '$' or infix >= 0
../examples/x86.mm1:966:1:
|
966 | @_ def u32Bytes (n: nat): nat = $ toBytes 4 n $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:966:43:
|
966 | @_ def u32Bytes (n: nat): nat = $ toBytes 4 n $;
| ^
error: unexpected '4'
expecting '$' or infix >= 0
../examples/x86.mm1:967:1:
|
967 | @_ def u64Bytes (n: nat): nat = $ toBytes 8 n $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:967:43:
|
967 | @_ def u64Bytes (n: nat): nat = $ toBytes 8 n $;
| ^
error: unexpected '8'
expecting '$' or infix >= 0
../examples/x86.mm1:968:45:
|
968 | theorem u16BytesT: $ u16Bytes n e. Array u8 2 $ = 'toBytesT;
| ^
error: unexpected '2'
expecting '$' or infix >= 0
../examples/x86.mm1:969:45:
|
969 | theorem u32BytesT: $ u32Bytes n e. Array u8 4 $ = 'toBytesT;
| ^
error: unexpected '4'
expecting '$' or infix >= 0
../examples/x86.mm1:970:45:
|
970 | theorem u64BytesT: $ u64Bytes n e. Array u8 8 $ = 'toBytesT;
| ^
error: unexpected '8'
expecting '$' or infix >= 0
../examples/x86.mm1:971:25:
|
971 | theorem u16BytesList: $ u16Bytes n e. List u8 $ = '(elArrayList u16BytesT);
| ^
error: u16Bytes is not a function
../examples/x86.mm1:972:25:
|
972 | theorem u32BytesList: $ u32Bytes n e. List u8 $ = '(elArrayList u32BytesT);
| ^
error: u32Bytes is not a function
../examples/x86.mm1:973:25:
|
973 | theorem u64BytesList: $ u64Bytes n e. List u8 $ = '(elArrayList u64BytesT);
| ^
error: u64Bytes is not a function
../examples/x86.mm1:974:42:
|
974 | theorem u16Bytes_len: $ len (u16Bytes n) = 2 $ = 'toBytes_len;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:975:42:
|
975 | theorem u32Bytes_len: $ len (u32Bytes n) = 4 $ = 'toBytes_len;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:976:42:
|
976 | theorem u64Bytes_len: $ len (u64Bytes n) = 8 $ = 'toBytes_len;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:978:31:
|
978 | theorem xu16Bytes (h: $ s2n s = toBytes ,(sucs 2) n $): $ s = u16Bytes n $ = 'h;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:979:31:
|
979 | theorem xu32Bytes (h: $ s2n s = toBytes ,(sucs 4) n $): $ s = u32Bytes n $ = 'h;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:980:31:
|
980 | theorem xu64Bytes (h: $ s2n s = toBytes ,(sucs 8) n $): $ s = u64Bytes n $ = 'h;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:989:1:
|
989 | @_ local def toIBytes (k n: nat): nat = $ toBytes k (chopZ (8 * k) n) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:989:63:
|
989 | @_ local def toIBytes (k n: nat): nat = $ toBytes k (chopZ (8 * k) n) $;
| ^
error: expecting (
../examples/x86.mm1:990:1:
|
990 | @_ local def i8Bytes (n: nat): nat = $ toIBytes 1 n $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:990:49:
|
990 | @_ local def i8Bytes (n: nat): nat = $ toIBytes 1 n $;
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/x86.mm1:991:1:
|
991 | @_ local def i16Bytes (n: nat): nat = $ toIBytes 2 n $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:991:50:
|
991 | @_ local def i16Bytes (n: nat): nat = $ toIBytes 2 n $;
| ^
error: unexpected '2'
expecting '$' or infix >= 0
../examples/x86.mm1:992:1:
|
992 | @_ local def i32Bytes (n: nat): nat = $ toIBytes 4 n $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:992:50:
|
992 | @_ local def i32Bytes (n: nat): nat = $ toIBytes 4 n $;
| ^
error: unexpected '4'
expecting '$' or infix >= 0
../examples/x86.mm1:993:1:
|
993 | @_ local def i64Bytes (n: nat): nat = $ toIBytes 8 n $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:993:50:
|
993 | @_ local def i64Bytes (n: nat): nat = $ toIBytes 8 n $;
| ^
error: unexpected '8'
expecting '$' or infix >= 0
../examples/x86.mm1:995:35:
|
995 | theorem i8Bytes_val2: $ i8Bytes n = toBytes 1 (chopZ 8 n) $ = '(toByteseq2 @ chopZeq1 mul12);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:996:36:
|
996 | theorem i16Bytes_val: $ i16Bytes n = toBytes 2 (chopZ 16 n) $ = '(toByteseq2 @ chopZeq1 d8mul2);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:997:36:
|
997 | theorem i32Bytes_val: $ i32Bytes n = toBytes 4 (chopZ 32 n) $ = '(toByteseq2 @ chopZeq1 d8mul4);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:998:36:
|
998 | theorem i64Bytes_val: $ i64Bytes n = toBytes 8 (chopZ 64 n) $ = '(toByteseq2 @ chopZeq1 d8mul8);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1000:43:
|
1000 | theorem i8Bytes_val (n: nat): $ i8Bytes n = chopZ 8 n : 0 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1003:22:
|
1003 | theorem toIBytesT: $ toIBytes k n e. Array u8 k $ = 'toBytesT;
| ^
error: toIBytes is not a function
../examples/x86.mm1:1004:23:
|
1004 | theorem toIBytesT2: $ toIBytes k n e. List u8 $ = 'toBytesT2;
| ^
error: toIBytes is not a function
../examples/x86.mm1:1005:44:
|
1005 | theorem toIBytes_len: $ len (toIBytes k n) = k $ = 'toBytes_len;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1006:43:
|
1006 | theorem i8BytesT: $ i8Bytes n e. Array u8 1 $ = 'toIBytesT;
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/x86.mm1:1007:45:
|
1007 | theorem i16BytesT: $ i16Bytes n e. Array u8 2 $ = 'toIBytesT;
| ^
error: unexpected '2'
expecting '$' or infix >= 0
../examples/x86.mm1:1008:45:
|
1008 | theorem i32BytesT: $ i32Bytes n e. Array u8 4 $ = 'toIBytesT;
| ^
error: unexpected '4'
expecting '$' or infix >= 0
../examples/x86.mm1:1009:45:
|
1009 | theorem i64BytesT: $ i64Bytes n e. Array u8 8 $ = 'toIBytesT;
| ^
error: unexpected '8'
expecting '$' or infix >= 0
../examples/x86.mm1:1011:31:
|
1011 | theorem toIBytes0: $ toIBytes 0 n = 0 $ = 'toBytes0;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1012:42:
|
1012 | theorem toIBytes_b0: $ toIBytes k (b0 n) = toBytes k n $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1014:49:
|
1014 | theorem toIBytesS_b1: $ toIBytes (suc k) (b1 n) =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1019:26:
|
1019 | theorem xtoIBytes0: $ s0 = toIBytes 0 a $ = 'xtoBytes0;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1020:31:
|
1020 | theorem xtoIBytesSb0_ (h: $ s = toBytes k n $): $ s = toIBytes k (b0 n) $ = '(eqtr4 h toIBytes_b0);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1021:30:
|
1021 | theorem xtoIBytesSb0 (h: $ s = toIBytes k (b0 n) $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1024:29:
|
1024 | theorem xtoIBytes02 (h: $ s = toBytes k x0 $): $ s2n s = toIBytes k 0 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1026:33:
|
1026 | theorem xtoIBytesSb1S (h0: $ a0 + c0 = xf $) (h1: $ a1 + c1 = xf $) (h: $ s = toIBytes k (b1 n) $):
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:1030:33:
|
1030 | theorem xtoIBytesSb12 (h0: $ a0 + c0 = xf $) (h1: $ a1 + c1 = xf $) (h: $ s = toIBytes k (b1 x0) $):
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:1033:33:
|
1033 | theorem xtoIBytesSb11 (h0: $ a0 + c0 = xf $) (h: $ s = toIBytes k (b1 x0) $):
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:1036:31:
|
1036 | theorem xtoIBytesSb10 (h: $ s = toIBytes k (b1 x0) $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1055:30:
|
1055 | theorem xi8Bytes (h: $ s2n s = toIBytes ,(sucs 1) n $): $ s = i8Bytes n $ = 'h;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1056:31:
|
1056 | theorem xi16Bytes (h: $ s2n s = toIBytes ,(sucs 2) n $): $ s = i16Bytes n $ = 'h;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1057:31:
|
1057 | theorem xi32Bytes (h: $ s2n s = toIBytes ,(sucs 4) n $): $ s = i32Bytes n $ = 'h;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1058:31:
|
1058 | theorem xi64Bytes (h: $ s2n s = toIBytes ,(sucs 8) n $): $ s = i64Bytes n $ = 'h;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1070:1:
|
1070 | @_ def Bitvec {.n: nat}: set = $ {n | snd n < 2 ^ fst n} $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1070:47:
|
1070 | @_ def Bitvec {.n: nat}: set = $ {n | snd n < 2 ^ fst n} $;
| ^
error: expecting infix >= 1 or }
../examples/x86.mm1:1071:22:
|
1071 | theorem elBitvec: $ n, bs e. Bitvec <-> bs < 2 ^ n $ =
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/x86.mm1:1073:23:
|
1073 | theorem elBitvec2: $ n, bs e. Bitvec <-> bs e. Bits n $ = '(bitr4 elBitvec elBits2);
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/x86.mm1:1075:1:
|
1075 | @_ abstract def bvSize (bs: nat): nat = $ lrec 0 (\\ p, \\ z, \ ih, fst p + ih) bs $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1075:48:
|
1075 | @_ abstract def bvSize (bs: nat): nat = $ lrec 0 (\\ p, \\ z, \ ih, fst p + ih) bs $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1076:31:
|
1076 | pub theorem bvSize0: $ bvSize 0 = 0 $ = (named 'lrec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1077:50:
|
1077 | pub theorem bvSizeS (k bs n: nat): $ bvSize ((k, bs) : n) = k + bvSize n $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1081:32:
|
1081 | theorem bvSize1: $ bvSize ((k, bs) : 0) = k $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1084:35:
|
1084 | theorem bvSizeA: $ bvSize (bs1 ++ bs2) = bvSize bs1 + bvSize bs2 $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1097:1:
|
1097 | @_ def isBitvecs (bs k: nat): wff = $ bs e. List Bitvec /\ bvSize bs = k $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1097:57:
|
1097 | @_ def isBitvecs (bs k: nat): wff = $ bs e. List Bitvec /\ bvSize bs = k $;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:1099:1:
|
1099 | @_ abstract def ofBits (n: nat): nat = $ lrec 0 (\\ p, \\ z, \ ih, snd p + shl ih (fst p)) n $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1099:47:
|
1099 | @_ abstract def ofBits (n: nat): nat = $ lrec 0 (\\ p, \\ z, \ ih, snd p + shl ih (fst p)) n $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1100:31:
|
1100 | pub theorem ofBits0: $ ofBits 0 = 0 $ = (named 'lrec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1101:50:
|
1101 | pub theorem ofBitsS (k n bs: nat): $ ofBits ((k, n) : bs) = n + shl (ofBits bs) k $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1105:33:
|
1105 | theorem ofBitsS2: $ ofBits ((k, n) : bs) = shl (ofBits bs) k + n $ = '(eqtr ofBitsS addcom);
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1106:32:
|
1106 | theorem ofBits1: $ ofBits ((k, n) : 0) = n $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1108:32:
|
1108 | pub theorem ofBits0T: $ ofBits 0 e. Bits 0 $ = '(mpbir elBits0 ofBits0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1110:17:
|
1110 | $ n e. Bits k /\ ofBits bs e. Bits m ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:1115:11:
|
1115 | $ bs e. List Bitvec -> ofBits bs e. Bits (bvSize bs) $ =
| ^
error: List is not a function
../examples/x86.mm1:1123:35:
|
1123 | theorem ofBitsA: $ ofBits (bs1 ++ bs2) = shl (ofBits bs2) (bvSize bs1) + ofBits bs1 $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1134:59:
|
1134 | theorem chop_ofBits: $ n e. Bits k -> chop k (ofBits ((k, n) : bs)) = n $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1136:55:
|
1136 | theorem shr_ofBits: $ n e. Bits k -> shr (ofBits ((k, n) : bs)) k = ofBits bs $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1139:1:
|
1139 | @_ def splitBits (bs n: nat): wff = $ bs e. List Bitvec /\ ofBits bs = n $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1139:57:
|
1139 | @_ def splitBits (bs n: nat): wff = $ bs e. List Bitvec /\ ofBits bs = n $;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:1141:20:
|
1141 | $ isBitvecs bs k /\ splitBits bs n -> n e. Bits k $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:1144:37:
|
1144 | theorem splitBitsTi (h: $ bvSize bs = k $): $ splitBits bs n -> n e. Bits k $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1147:33:
|
1147 | theorem splitBits0: $ splitBits 0 n <-> n = 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1150:39:
|
1150 | theorem splitBitsS2: $ splitBits ((k, a) : bs) n <->
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1155:38:
|
1155 | theorem splitBitsS: $ splitBits ((k, a) : bs) n <->
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1161:15:
|
1161 | (h1: $ a e. Bits k $) (h2: $ shl m k + a = n $) (h3: $ splitBits bs m $):
| ^
error: Bits is not a function
../examples/x86.mm1:1165:38:
|
1165 | theorem splitBits1: $ splitBits ((k, a) : 0) n <-> a e. Bits k /\ a = n $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1170:54:
|
1170 | theorem splitBits1i: $ a e. Bits k -> splitBits ((k, a) : 0) a $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1174:20:
|
1174 | $ splitBits ((k, a) : bs) n <-> chop k n = a /\ splitBits bs (shr n k) $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1180:37:
|
1180 | theorem splitBitsS4: $ splitBits ((4, a) : bs) n <->
| ^
error: expecting (
../examples/x86.mm1:1184:34:
|
1184 | theorem splitBitsA: $ bvSize bs1 = k ->
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1194:44:
|
1194 | theorem splitBits_split: $ splitBits ((k + l, b) : bs) n <->
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1210:44:
|
1210 | theorem splitBits_mid: $ splitBits (bs1 ++ (k + l, b) : bs2) n <->
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1218:35:
|
1218 | theorem splitBitsx0i: $ splitBits 0 x0 $ = '(mpbir splitBits0 @ eqcom dec0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1219:47:
|
1219 | theorem splitBits14i (a: hex): $ splitBits ((4, a) : 0) a $ = '(splitBits1i h2nT);
| ^
error: expecting (
../examples/x86.mm1:1220:40:
|
1220 | theorem splitBits14ie (x: hex) (h: $ a = x $): $ splitBits ((4, a) : 0) x $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1222:28:
|
1222 | theorem splitBitsS4i (h: $ splitBits bs n $): $ splitBits ((4, a) : bs) (n :x a) $ =
| ^
error: splitBits is not a function
../examples/x86.mm1:1226:14:
|
1226 | (he: $ bs1 ++ bs2 = bs $) (hs: $ bvSize bs1 = 4 $)
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:1233:14:
|
1233 | (he: $ bs1 ++ bs2 = bs $) (hs: $ bvSize bs1 = 4 $)
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:1238:29:
|
1238 | theorem splitBitsS1i (h0: $ bool x $)
| ^
error: bool is not a function
../examples/x86.mm1:1243:32:
|
1243 | theorem splitBitsS1i0 (h1: $ n = b0 n2 $) (h2: $ splitBits bs n2 $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1245:32:
|
1245 | theorem splitBitsS1i1 (h1: $ n = b1 n2 $) (h2: $ splitBits bs n2 $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1248:29:
|
1248 | theorem splitBitsSSi (h0: $ bool x $)
| ^
error: bool is not a function
../examples/x86.mm1:1257:32:
|
1257 | theorem splitBitsSSi0 (ha: $ a = b0 a2 $) (hn: $ n = b0 n2 $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1260:32:
|
1260 | theorem splitBitsSSi1 (ha: $ a = b1 a2 $) (hn: $ n = b1 n2 $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1265:14:
|
1265 | (hy: $ bs1 ++ (1, bl) : 0 = by $)
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:1279:23:
|
1279 | (h1: $ splitBits ((3, a) : (1, bl) : 0) y $)
| ^
error: expecting (
../examples/x86.mm1:1293:4:
|
1293 | (scan '((1 3) (2 2) (3 1) (1 2 1) (1 1 1 1)) @ fn (l)
| ^
error: Reference to unbound variable 'scan'
../examples/x86.mm1:1337:1:
|
1337 | @_ local def splatBitsHelper (n a i j k p q) =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1338:5:
|
1338 | $ i + k = j /\ (chop k (shr n i) = a -> p -> q) $;
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:1339:34:
|
1339 | theorem splatBitsS_skip (h1: $ i + k = j $) (h2: $ splitBits bs (shr n j) -> p $):
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:1343:10:
|
1343 | (h1: $ splatBitsHelper n a i j k p q $)
| ^
error: splatBitsHelper is not a function
../examples/x86.mm1:1347:52:
|
1347 | theorem splatBits1 (h: $ splatBitsHelper n a i j k T. q $):
| ^
error: unexpected 'T'
expecting '$' or infix >= 0
../examples/x86.mm1:1349:26:
|
1349 | theorem splatBits0 (h: $ splitBits bs (shr n x0) -> p $):
| ^
error: splitBits is not a function
../examples/x86.mm1:1352:53:
|
1352 | theorem splatBitsHelper0: $ splatBitsHelper n a i i 0 p p $ = '(iani add0 idd);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1353:39:
|
1353 | theorem splatBitsHelperS (h1: $ suc i = i2 $) (h2: $ suc k2 = k $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1366:41:
|
1366 | theorem splatBitsHelperSb0 (h1: $ suc i = i2 $) (h2: $ suc k2 = k $) (h3: $ a = b0 a2 $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1371:41:
|
1371 | theorem splatBitsHelperSb1 (h1: $ suc i = i2 $) (h2: $ suc k2 = k $) (h3: $ a = b1 a2 $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1401:16:
|
1401 | [#undef
| ^
error: expecting identifier char
../examples/x86.mm1:1420:31:
|
1420 | theorem splatBits_ch (h1: $ m = y $) (h2: $ n = x $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1438:1:
|
1438 | @_ def Regs: nat = $ Bits 4 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1438:27:
|
1438 | @_ def Regs: nat = $ Bits 4 $;
| ^
error: unexpected '4'
expecting '$' or infix >= 0
../examples/x86.mm1:1439:26:
|
1439 | theorem Regs_lem (h: $ a < 16 $): $ a e. Regs $ = '(mpbir elBits2 @ mpbir (lteq2 d2pow4) h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1440:3:
|
1440 | @(add-eval) def RAX: nat = $ 0 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:1441:56:
|
1441 | pub theorem RAX_T: $ RAX e. Regs $ = '(! Regs_lem $0$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:1442:3:
|
1442 | @(add-eval) def RCX: nat = $ 1 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:1443:56:
|
1443 | pub theorem RCX_T: $ RCX e. Regs $ = '(! Regs_lem $1$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:1444:3:
|
1444 | @(add-eval) def RDX: nat = $ 2 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:1445:56:
|
1445 | pub theorem RDX_T: $ RDX e. Regs $ = '(! Regs_lem $2$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:1446:3:
|
1446 | @(add-eval) def RBX: nat = $ 3 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:1447:56:
|
1447 | pub theorem RBX_T: $ RBX e. Regs $ = '(! Regs_lem $3$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:1448:3:
|
1448 | @(add-eval) def RSP: nat = $ 4 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:1449:56:
|
1449 | pub theorem RSP_T: $ RSP e. Regs $ = '(! Regs_lem $4$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:1450:3:
|
1450 | @(add-eval) def RBP: nat = $ 5 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:1451:56:
|
1451 | pub theorem RBP_T: $ RBP e. Regs $ = '(! Regs_lem $5$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:1452:3:
|
1452 | @(add-eval) def RSI: nat = $ 6 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:1453:56:
|
1453 | pub theorem RSI_T: $ RSI e. Regs $ = '(! Regs_lem $6$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:1454:3:
|
1454 | @(add-eval) def RDI: nat = $ 7 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:1455:56:
|
1455 | pub theorem RDI_T: $ RDI e. Regs $ = '(! Regs_lem $7$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:1456:21:
|
1456 | theorem R11_T: $ 11 e. Regs $ = '(Regs_lem ,norm_num);
| ^
error: expecting (
../examples/x86.mm1:1458:1:
|
1458 | @_ def REX: set = $ Option (Bits 4) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1458:35:
|
1458 | @_ def REX: set = $ Option (Bits 4) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1459:1:
|
1459 | @_ def REX_val (r: nat): nat = $ r - 1 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1459:36:
|
1459 | @_ def REX_val (r: nat): nat = $ r - 1 $;
| ^
error: unexpected '-'
expecting '$' or infix >= 0
../examples/x86.mm1:1460:1:
|
1460 | @_ def REX_W (r: nat): nat = $ bit (REX_val r) 3 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1460:48:
|
1460 | @_ def REX_W (r: nat): nat = $ bit (REX_val r) 3 $;
| ^
error: unexpected '3'
expecting '$' or infix >= 0
../examples/x86.mm1:1461:1:
|
1461 | @_ def REX_R (r: nat): nat = $ bit (REX_val r) 2 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1461:48:
|
1461 | @_ def REX_R (r: nat): nat = $ bit (REX_val r) 2 $;
| ^
error: unexpected '2'
expecting '$' or infix >= 0
../examples/x86.mm1:1462:1:
|
1462 | @_ def REX_X (r: nat): nat = $ bit (REX_val r) 1 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1462:48:
|
1462 | @_ def REX_X (r: nat): nat = $ bit (REX_val r) 1 $;
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/x86.mm1:1463:1:
|
1463 | @_ def REX_B (r: nat): nat = $ bit (REX_val r) 0 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1463:48:
|
1463 | @_ def REX_B (r: nat): nat = $ bit (REX_val r) 0 $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1464:29:
|
1464 | theorem REX_val0: $ REX_val 0 = 0 $ = 'sub01;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1465:64:
|
1465 | pub theorem REX_valT (r: nat): $ r e. REX -> REX_val r e. Bits 4 $ =
| ^
error: unexpected '4'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:1467:33:
|
1467 | pub theorem REX_W_T (r: nat): $ bool (REX_W r) $ = 'bitT;
| ^
error: bool is not a function
../examples/x86.mm1:1468:33:
|
1468 | pub theorem REX_R_T (r: nat): $ bool (REX_R r) $ = 'bitT;
| ^
error: bool is not a function
../examples/x86.mm1:1469:33:
|
1469 | pub theorem REX_X_T (r: nat): $ bool (REX_X r) $ = 'bitT;
| ^
error: bool is not a function
../examples/x86.mm1:1470:33:
|
1470 | pub theorem REX_B_T (r: nat): $ bool (REX_B r) $ = 'bitT;
| ^
error: bool is not a function
../examples/x86.mm1:1472:36:
|
1472 | theorem REX_bit_0: $ bit (REX_val 0) i = 0 $ = '(eqtr (biteq1 REX_val0) bit01);
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1473:26:
|
1473 | theorem REX_W_0: $ REX_W 0 = 0 $ = 'REX_bit_0;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1474:26:
|
1474 | theorem REX_R_0: $ REX_R 0 = 0 $ = 'REX_bit_0;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1475:26:
|
1475 | theorem REX_X_0: $ REX_X 0 = 0 $ = 'REX_bit_0;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1476:26:
|
1476 | theorem REX_B_0: $ REX_B 0 = 0 $ = 'REX_bit_0;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1478:32:
|
1478 | theorem REX_W_Si (h: $ bit rex 3 = a $): $ REX_W (suc rex) = a $ = '(eqtr (biteq1 sucsub1) h);
| ^
error: unexpected '3'
expecting '$' or infix >= 0
../examples/x86.mm1:1479:32:
|
1479 | theorem REX_R_Si (h: $ bit rex 2 = a $): $ REX_R (suc rex) = a $ = '(eqtr (biteq1 sucsub1) h);
| ^
error: unexpected '2'
expecting '$' or infix >= 0
../examples/x86.mm1:1480:32:
|
1480 | theorem REX_X_Si (h: $ bit rex 1 = a $): $ REX_X (suc rex) = a $ = '(eqtr (biteq1 sucsub1) h);
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/x86.mm1:1481:32:
|
1481 | theorem REX_B_Si (h: $ bit rex 0 = a $): $ REX_B (suc rex) = a $ = '(eqtr (biteq1 sucsub1) h);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1483:3:
|
1483 | @(add-eval @ fn (b r) {{(eval b) shl 3} + (eval r)})
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:1485:43:
|
1485 | pub theorem rex_regT (b r: nat): $ bool b /\ r e. Bits 3 -> rex_reg b r e. Regs $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:1488:38:
|
1488 | theorem rex_reg_i (h: $ splitBits ((3, r) : (1, b) : 0) n $): $ rex_reg b r = n $ =
| ^
error: expecting (
../examples/x86.mm1:1492:23:
|
1492 | (h1: $ splitBits ((1, bl) : (2, bh) : (1, r) : 0) rn $)
| ^
error: expecting (
../examples/x86.mm1:1498:1:
|
1498 | @_ def Base: set = $ Option (Option Regs) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1498:22:
|
1498 | @_ def Base: set = $ Option (Option Regs) $;
| ^
error: Option is not a function
../examples/x86.mm1:1499:1:
|
1499 | @_ def base_RIP: nat = $ suc 0 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1499:30:
|
1499 | @_ def base_RIP: nat = $ suc 0 $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1500:1:
|
1500 | @_ def base_reg (r: nat): nat = $ suc (suc r) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1500:35:
|
1500 | @_ def base_reg (r: nat): nat = $ suc (suc r) $;
| ^
error: suc is not a function
../examples/x86.mm1:1501:25:
|
1501 | pub theorem base0T: $ 0 e. Base $ = 'opt0;
| ^
error: expecting (
../examples/x86.mm1:1502:50:
|
1502 | pub theorem base_RIP_T: $ base_RIP e. Base $ = '(mpbir optS opt0);
| ^
error: unknown theorem/hypothesis 'mpbir'
../examples/x86.mm1:1503:54:
|
1503 | pub theorem base_regT (r: nat): $ base_reg r e. Base <-> r e. Regs $ = '(bitr optS optS);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1505:1:
|
1505 | @_ def ScaleIndex: set = $ Xp (Bits 2) Regs $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1505:38:
|
1505 | @_ def ScaleIndex: set = $ Xp (Bits 2) Regs $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1507:1:
|
1507 | @_ def RM: set = $ Sum Regs (Xp (Option ScaleIndex) (Xp Base u64)) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1507:20:
|
1507 | @_ def RM: set = $ Sum Regs (Xp (Option ScaleIndex) (Xp Base u64)) $;
| ^
error: Sum is not a function
../examples/x86.mm1:1508:1:
|
1508 | @_ def RM_reg (r: nat): nat = $ b0 r $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1508:33:
|
1508 | @_ def RM_reg (r: nat): nat = $ b0 r $;
| ^
error: b0 is not a function
../examples/x86.mm1:1509:1:
|
1509 | @_ def RM_mem (si base q: nat): nat = $ b1 (si, base, q) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1509:49:
|
1509 | @_ def RM_mem (si base q: nat): nat = $ b1 (si, base, q) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1510:48:
|
1510 | pub theorem RM_regT (r: nat): $ RM_reg r e. RM <-> r e. Regs $ = 'Suml;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1512:28:
|
1512 | $ RM_mem si base q e. RM <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1516:1:
|
1516 | @_ def RM_isMem (rm: nat): wff = $ odd rm $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1516:36:
|
1516 | @_ def RM_isMem (rm: nat): wff = $ odd rm $;
| ^
error: odd is not a function
../examples/x86.mm1:1518:35:
|
1518 | theorem readDisplacement_lem: $ x < 3 <-> x e. Bits 2 /\ x != 3 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1521:1:
|
1521 | @_ def readDisplacement (mod q l .b .w: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1522:7:
|
1522 | $ mod = 0 /\ q = 0 /\ l = 0 \/
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1527:17:
|
1527 | mod e. Bits 2 /\ mod != 3 /\ q e. u64 /\ l e. List u8 $ =
| ^
error: unexpected '2'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:1539:69:
|
1539 | theorem readDisplacement_len_le: $ readDisplacement md q l -> len l <= 4 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1544:48:
|
1544 | theorem readDisplacement_0: $ readDisplacement 0 0 s0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1547:30:
|
1547 | (h1: $ a e. u8 $) (h2: $ l = i8Bytes a $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1553:31:
|
1553 | (h1: $ a e. u32 $) (h2: $ l = i32Bytes a $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1559:1:
|
1559 | @_ def readSIBDisplacement (mod bbase q base l .w: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1560:16:
|
1560 | $ ifp (bbase = RBP /\ mod = 0)
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1564:19:
|
1564 | $ bbase e. Regs /\ readSIBDisplacement mod bbase q base l ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:1576:86:
|
1576 | theorem readSIBDisplacement_len_le: $ readSIBDisplacement md bbase q base l -> len l <= 4 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1581:31:
|
1581 | (h1: $ a e. u32 $) (h2: $ l = i32Bytes a $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1588:1:
|
1588 | @_ def readSIB (rex mod rm l .b .l2 .bs .ix .sc .disp .bbase .index: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1590:18:
|
1590 | splitBits ((3, bs) : (3, ix) : (2, sc) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:1597:17:
|
1597 | mod e. Bits 2 /\ mod != 3 /\ rm e. RM /\ l e. List u8 $ =
| ^
error: unexpected '2'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:1617:56:
|
1617 | theorem readSIB_len_le: $ readSIB rex md rm l -> len l <= 5 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1623:16:
|
1623 | (h1: $ bbase != x5 \/ 0 < md $)
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/x86.mm1:1628:1:
|
1628 | @_ local def readModRM2 (rex rm rm2 mod l: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1629:14:
|
1629 | $ ifp (mod = 3) (rm = RM_reg (rex_reg (REX_B rex) rm2) /\ l = 0)
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1638:17:
|
1638 | $ rm2 e. Bits 3 /\ readModRM2 rex rm rm2 mod l -> rm e. RM /\ l e. List u8 $ =
| ^
error: unexpected '3'
expecting '$' or infix >= 0
../examples/x86.mm1:1657:41:
|
1657 | theorem readModRM2_reg (h1: $ REX_B rex = b $) (h2: $ rex_reg b rm2 = r $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1661:31:
|
1661 | (h1: $ a e. u32 $) (h2: $ l = i32Bytes a $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1666:30:
|
1666 | theorem readModRM2_sib (h: $ readSIB rex md rm l $):
| ^
error: readSIB is not a function
../examples/x86.mm1:1671:20:
|
1671 | (h1: $ REX_B rex = b $) (h2: $ rex_reg b rm2 = r $)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1682:23:
|
1682 | (h1: $ splitBits ((3, bs) : (1, ixl) : 0) y $)
| ^
error: expecting (
../examples/x86.mm1:1699:23:
|
1699 | (h1: $ splitBits ((3, bs) : (1, 0) : 0) y $)
| ^
error: expecting (
../examples/x86.mm1:1709:23:
|
1709 | (h1: $ splitBits ((3, bs) : (1, ixl) : 0) y $)
| ^
error: expecting (
../examples/x86.mm1:1720:1:
|
1720 | @_ def readModRM (rex rn rm l .b .rm2 .opc .mod .i .l2 .disp: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1722:18:
|
1722 | splitBits ((3, rm2) : (3, opc) : (2, mod) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:1735:67:
|
1735 | theorem readModRM_val (rex rn rm l: nat): $ readModRM rex rn rm l <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1746:68:
|
1746 | theorem readModRM_val2 (rex rn rm l: nat): $ readModRM rex rn rm l <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1754:41:
|
1754 | $ readModRM rex rn rm l -> rn e. Regs /\ rm e. RM /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:1767:60:
|
1767 | theorem readModRM_len_le: $ readModRM rex rn rm l -> len l <= 6 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1778:23:
|
1778 | (h1: $ splitBits ((3, rm2) : (1, o) : 0) y $)
| ^
error: expecting (
../examples/x86.mm1:1789:1:
|
1789 | @_ def readOpcodeModRM (rex v rm l .rn: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1790:35:
|
1790 | $ E. rn (readModRM rex rn rm l /\ v = chop 3 rn) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1792:45:
|
1792 | $ readOpcodeModRM rex v rm l -> v e. Bits 3 /\ rm e. RM /\ l e. List u8 $ =
| ^
error: unexpected '3'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:1797:72:
|
1797 | theorem readOpcodeModRM_len_le: $ readOpcodeModRM rex ast b l -> len l <= 6 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1801:23:
|
1801 | (h1: $ splitBits ((3, rm2) : (1, o) : 0) y $)
| ^
error: expecting (
../examples/x86.mm1:1827:1:
|
1827 | @_ def readPrefixes (rex l .b .rex2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1828:7:
|
1828 | $ rex = 0 /\ l = 0 \/ E. b E. rex2 (
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1832:38:
|
1832 | $ readPrefixes rex l -> rex e. REX /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:1840:60:
|
1840 | theorem readPrefixes_len_le: $ readPrefixes rex l -> len l <= 1 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1844:1:
|
1844 | @_ def readImmN (k q l .w: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1845:5:
|
1845 | $ 8 || k /\ E. w (w e. Bits k /\ q = sExtq k w /\ l = toBytes (k // 8) w) $;
| ^
error: expecting (
../examples/x86.mm1:1847:7:
|
1847 | $ k <= 64 /\ readImmN k q l -> q e. u64 /\ l e. List u8 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1852:49:
|
1852 | theorem readImmN_len: $ readImmN k q l -> len l = k // 8 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1854:31:
|
1854 | theorem readImmN_len2 (h: $ 8 * n = k $): $ readImmN k q l -> len l = n $ =
| ^
error: expecting (
../examples/x86.mm1:1857:40:
|
1857 | theorem readImmN_val: $ readImmN k q l <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1861:31:
|
1861 | theorem readImm8T: $ readImmN 8 q l -> q e. u64 /\ l e. List u8 $ =
| ^
error: unexpected '8'
expecting '$' or infix >= 0
../examples/x86.mm1:1863:32:
|
1863 | theorem readImm16T: $ readImmN 16 q l -> q e. u64 /\ l e. List u8 $ =
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/x86.mm1:1865:32:
|
1865 | theorem readImm32T: $ readImmN 32 q l -> q e. u64 /\ l e. List u8 $ =
| ^
error: unexpected '3'
expecting '$' or infix >= 0
../examples/x86.mm1:1867:32:
|
1867 | theorem readImm64T: $ readImmN 64 q l -> q e. u64 /\ l e. List u8 $ =
| ^
error: unexpected '6'
expecting '$' or infix >= 0
../examples/x86.mm1:1869:42:
|
1869 | theorem readImm8_32T: $ readImmN (if p 8 32) q l -> q e. u64 /\ l e. List u8 $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1874:34:
|
1874 | theorem readImm8_len: $ readImmN 8 q l -> len l = 1 $ = '(readImmN_len2 mul12);
| ^
error: unexpected '8'
expecting '$' or infix >= 0
../examples/x86.mm1:1875:35:
|
1875 | theorem readImm16_len: $ readImmN 16 q l -> len l = 2 $ = '(readImmN_len2 d8mul2);
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/x86.mm1:1876:35:
|
1876 | theorem readImm32_len: $ readImmN 32 q l -> len l = 4 $ = '(readImmN_len2 d8mul4);
| ^
error: unexpected '3'
expecting '$' or infix >= 0
../examples/x86.mm1:1877:35:
|
1877 | theorem readImm64_len: $ readImmN 64 q l -> len l = 8 $ = '(readImmN_len2 d8mul8);
| ^
error: unexpected '6'
expecting '$' or infix >= 0
../examples/x86.mm1:1878:48:
|
1878 | theorem readImm8_32_len_le: $ readImmN (if p 8 32) q l -> len l <= 4 $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1884:29:
|
1884 | theorem readImmN_I (h1: $ 8 * i = k $) (h2: $ k <= 64 $)
| ^
error: expecting (
../examples/x86.mm1:1892:1:
|
1892 | @_ def WSize (.n: nat): set = $ Xp (8 ; 16 ; 32 ; sn 64) Bool i^i {n | fst n = 8 \/ snd n = 0} $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1892:39:
|
1892 | @_ def WSize (.n: nat): set = $ Xp (8 ; 16 ; 32 ; sn 64) Bool i^i {n | fst n = 8 \/ snd n = 0} $;
| ^
error: expecting (
../examples/x86.mm1:1893:1:
|
1893 | @_ def wsizeBits (sz: nat): nat = $ fst sz $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1893:37:
|
1893 | @_ def wsizeBits (sz: nat): nat = $ fst sz $;
| ^
error: fst is not a function
../examples/x86.mm1:1894:1:
|
1894 | @_ def wsizeBytes (sz: nat): nat = $ wsizeBits sz // 8 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1894:51:
|
1894 | @_ def wsizeBytes (sz: nat): nat = $ wsizeBits sz // 8 $;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:1895:1:
|
1895 | @_ def wSz8 (have_rex: wff): nat = $ 8, nat have_rex $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1895:39:
|
1895 | @_ def wSz8 (have_rex: wff): nat = $ 8, nat have_rex $;
| ^
error: expecting (
../examples/x86.mm1:1896:1:
|
1896 | @_ def wSz16: nat = $ 16, 0 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1896:25:
|
1896 | @_ def wSz16: nat = $ 16, 0 $;
| ^
error: expecting (
../examples/x86.mm1:1897:1:
|
1897 | @_ def wSz32: nat = $ 32, 0 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1897:25:
|
1897 | @_ def wSz32: nat = $ 32, 0 $;
| ^
error: expecting (
../examples/x86.mm1:1898:1:
|
1898 | @_ def wSz64: nat = $ 64, 0 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1898:25:
|
1898 | @_ def wSz64: nat = $ 64, 0 $;
| ^
error: expecting (
../examples/x86.mm1:1900:22:
|
1900 | theorem WSize_fin: $ finite WSize $ = (named '(infin1 @ xpfin finns finns));
| ^
error: finite is not a function
../examples/x86.mm1:1902:32:
|
1902 | theorem elWSize: $ sz e. WSize <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1907:43:
|
1907 | theorem wSizeBytes_lem (h: $ wsizeBits sz = k $) (h2: $ n * 8 = k $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1910:40:
|
1910 | theorem wSz8Bits: $ wsizeBits (wSz8 r) = 8 $ = 'fstpr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1911:42:
|
1911 | theorem wSz8Bytes: $ wsizeBytes (wSz8 r) = 1 $ = '(wSizeBytes_lem wSz8Bits ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1912:18:
|
1912 | theorem wSz8T: $ wSz8 r e. WSize $ =
| ^
error: wSz8 is not a function
../examples/x86.mm1:1917:38:
|
1917 | theorem wSz16Bits: $ wsizeBits wSz16 = 16 $ = 'fstpr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1918:40:
|
1918 | theorem wSz16Bytes: $ wsizeBytes wSz16 = 2 $ = '(wSizeBytes_lem wSz16Bits ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1920:3:
|
1920 | '(mpbir elWSize @ ian (ian
| ^
error: unknown theorem/hypothesis 'mpbir'
../examples/x86.mm1:1923:38:
|
1923 | theorem wSz32Bits: $ wsizeBits wSz32 = 32 $ = 'fstpr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1924:40:
|
1924 | theorem wSz32Bytes: $ wsizeBytes wSz32 = 4 $ = '(wSizeBytes_lem wSz32Bits ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1926:3:
|
1926 | '(mpbir elWSize @ ian (ian
| ^
error: unknown theorem/hypothesis 'mpbir'
../examples/x86.mm1:1929:38:
|
1929 | theorem wSz64Bits: $ wsizeBits wSz64 = 64 $ = 'fstpr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1930:40:
|
1930 | theorem wSz64Bytes: $ wsizeBytes wSz64 = 8 $ = '(wSizeBytes_lem wSz64Bits ,norm_num);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1932:3:
|
1932 | '(mpbir elWSize @ ian (ian
| ^
error: unknown theorem/hypothesis 'mpbir'
../examples/x86.mm1:1936:55:
|
1936 | theorem wsizeBits_le64: $ sz e. WSize -> wsizeBits sz <= 64 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1942:45:
|
1942 | theorem wsizeBits_bytes: $ sz e. WSize -> 8 * wsizeBytes sz = wsizeBits sz $ =
| ^
error: expecting (
../examples/x86.mm1:1949:1:
|
1949 | @_ def readFullImm (sz q l: nat): wff = $ readImmN (wsizeBits sz) q l $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1949:43:
|
1949 | @_ def readFullImm (sz q l: nat): wff = $ readImmN (wsizeBits sz) q l $;
| ^
error: readImmN is not a function
../examples/x86.mm1:1951:17:
|
1951 | $ sz e. WSize /\ readFullImm sz q l -> q e. u64 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:1954:43:
|
1954 | theorem readFullImm_len_le: $ sz e. WSize /\ readFullImm sz q l -> len l <= 8 $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:1958:31:
|
1958 | theorem readFullImmI (h1: $ 8 * i = k $)
| ^
error: expecting (
../examples/x86.mm1:1965:56:
|
1965 | theorem readFullImm32I (h1: $ a e. u32 $) (h2: $ s2n l = i32Bytes a $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1969:56:
|
1969 | theorem readFullImm64I (h1: $ a e. u64 $) (h2: $ s2n l = i64Bytes a $):
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:1973:1:
|
1973 | @_ def readImm (sz q l: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1974:34:
|
1974 | $ readImmN (min (wsizeBits sz) 32) q l $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1976:17:
|
1976 | $ sz e. WSize /\ readImm sz q l -> q e. u64 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:1979:51:
|
1979 | theorem readImm_len_le: $ readImm sz q l -> len l <= 4 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:1982:1:
|
1982 | @_ def opSize (have_rex: wff) (w v: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1983:3:
|
1983 | $ if (true v) (if (true w) wSz64 wSz32) (wSz8 have_rex) $;
| ^
error: if is not a function
../examples/x86.mm1:1984:48:
|
1984 | theorem opSizeT2 (have_rex: wff) (w v: nat): $ opSize have_rex w v e. WSize $ =
| ^
error: opSize is not a function
../examples/x86.mm1:1986:51:
|
1986 | pub theorem opSizeT (have_rex: wff) (w v: nat): $ opSize have_rex w v e. WSize $ = 'opSizeT2;
| ^
error: opSize is not a function
../examples/x86.mm1:1988:31:
|
1988 | theorem opSize_64: $ opSize r 1 1 = wSz64 $ = '(eqtr (ifpos true1) (ifpos true1));
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/x86.mm1:1989:31:
|
1989 | theorem opSize_32: $ opSize r 0 1 = wSz32 $ = '(eqtr (ifpos true1) (ifneg true0));
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1990:32:
|
1990 | theorem opSize_8: $ opSize r w 0 = wSz8 r $ = '(ifneg true0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:1992:1:
|
1992 | @_ def opSizeW (rex v: nat): nat = $ opSize (rex != 0) (REX_W rex) v $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:1992:53:
|
1992 | @_ def opSizeW (rex v: nat): nat = $ opSize (rex != 0) (REX_W rex) v $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:1993:39:
|
1993 | pub theorem opSizeW_T (rex v: nat): $ opSizeW rex v e. WSize $ = 'opSizeT;
| ^
error: opSizeW is not a function
../examples/x86.mm1:1995:32:
|
1995 | theorem opSizeW_0 (h: $ opSize F. 0 v = a $): $ opSizeW 0 v = a $ =
| ^
error: unexpected 'F'
expecting '$' or infix >= 0
../examples/x86.mm1:1997:34:
|
1997 | theorem opSizeW_S (h1: $ bit rex 3 = w $)
| ^
error: unexpected '3'
expecting '$' or infix >= 0
../examples/x86.mm1:2001:1:
|
2001 | @_ def DestSrc: set = $ Sum (Xp RM (Sum u64 Regs)) (Xp Regs RM) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2001:25:
|
2001 | @_ def DestSrc: set = $ Sum (Xp RM (Sum u64 Regs)) (Xp Regs RM) $;
| ^
error: Sum is not a function
../examples/x86.mm1:2002:1:
|
2002 | @_ def Rm_i (rm i: nat): nat = $ b0 (rm, b0 i) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2002:42:
|
2002 | @_ def Rm_i (rm i: nat): nat = $ b0 (rm, b0 i) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2003:1:
|
2003 | @_ def Rm_r (rm r: nat): nat = $ b0 (rm, b1 r) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2003:42:
|
2003 | @_ def Rm_r (rm r: nat): nat = $ b0 (rm, b1 r) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2004:1:
|
2004 | @_ def R_rm (r rm: nat): nat = $ b1 (r, rm) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2004:41:
|
2004 | @_ def R_rm (r rm: nat): nat = $ b1 (r, rm) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2005:55:
|
2005 | pub theorem Rm_iT (rm i: nat): $ Rm_i rm i e. DestSrc <-> rm e. RM /\ i e. u64 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2007:55:
|
2007 | pub theorem Rm_rT (rm r: nat): $ Rm_r rm r e. DestSrc <-> rm e. RM /\ r e. Regs $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2009:55:
|
2009 | pub theorem R_rmT (r rm: nat): $ R_rm r rm e. DestSrc <-> r e. Regs /\ rm e. RM $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2012:1:
|
2012 | @_ def ImmRM: set = $ Sum RM u64 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2012:23:
|
2012 | @_ def ImmRM: set = $ Sum RM u64 $;
| ^
error: Sum is not a function
../examples/x86.mm1:2013:1:
|
2013 | @_ def immRM_rm (rm: nat): nat = $ b0 rm $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2013:36:
|
2013 | @_ def immRM_rm (rm: nat): nat = $ b0 rm $;
| ^
error: b0 is not a function
../examples/x86.mm1:2014:1:
|
2014 | @_ def immRM_imm (i: nat): nat = $ b1 i $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2014:36:
|
2014 | @_ def immRM_imm (i: nat): nat = $ b1 i $;
| ^
error: b1 is not a function
../examples/x86.mm1:2015:57:
|
2015 | pub theorem immRM_rmT (rm: nat): $ immRM_rm rm e. ImmRM <-> rm e. RM $ = 'Suml;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2016:57:
|
2016 | pub theorem immRM_immT (i: nat): $ immRM_imm i e. ImmRM <-> i e. u64 $ = 'Sumr;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2018:1:
|
2018 | @_ def Unop: nat = $ upto 4 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2018:27:
|
2018 | @_ def Unop: nat = $ upto 4 $;
| ^
error: unexpected '4'
expecting '$' or infix >= 0
../examples/x86.mm1:2019:3:
|
2019 | @(add-eval) def unopInc: nat = $ 0 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2020:3:
|
2020 | @(add-eval) def unopDec: nat = $ 1 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2021:3:
|
2021 | @(add-eval) def unopNot: nat = $ 2 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2022:3:
|
2022 | @(add-eval) def unopNeg: nat = $ 3 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2023:43:
|
2023 | theorem unopIncT: $ unopInc e. Unop $ = '(mpbir elupto d0lt4);
| ^
error: unknown theorem/hypothesis 'mpbir'
../examples/x86.mm1:2024:43:
|
2024 | theorem unopDecT: $ unopDec e. Unop $ = '(mpbir elupto d1lt4);
| ^
error: unknown theorem/hypothesis 'mpbir'
../examples/x86.mm1:2025:43:
|
2025 | theorem unopNotT: $ unopNot e. Unop $ = '(mpbir elupto d2lt4);
| ^
error: unknown theorem/hypothesis 'mpbir'
../examples/x86.mm1:2026:43:
|
2026 | theorem unopNegT: $ unopNeg e. Unop $ = '(mpbir elupto d3lt4);
| ^
error: unknown theorem/hypothesis 'mpbir'
../examples/x86.mm1:2028:1:
|
2028 | @_ def Binop: nat = $ Bits 4 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2028:28:
|
2028 | @_ def Binop: nat = $ Bits 4 $;
| ^
error: unexpected '4'
expecting '$' or infix >= 0
../examples/x86.mm1:2029:3:
|
2029 | @(add-eval) def binopAdd: nat = $ 0 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2030:3:
|
2030 | @(add-eval) def binopOr: nat = $ 1 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2031:3:
|
2031 | @(add-eval) def binopAdc: nat = $ 2 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2032:3:
|
2032 | @(add-eval) def binopSbb: nat = $ 3 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2033:3:
|
2033 | @(add-eval) def binopAnd: nat = $ 4 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2034:3:
|
2034 | @(add-eval) def binopSub: nat = $ 5 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2035:3:
|
2035 | @(add-eval) def binopXor: nat = $ 6 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2036:3:
|
2036 | @(add-eval) def binopCmp: nat = $ 7 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2037:3:
|
2037 | @(add-eval) def binopRol: nat = $ 8 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2038:3:
|
2038 | @(add-eval) def binopRor: nat = $ 9 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2039:3:
|
2039 | @(add-eval) def binopRcl: nat = $ 10 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2040:3:
|
2040 | @(add-eval) def binopRcr: nat = $ 11 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2041:3:
|
2041 | @(add-eval) def binopShl: nat = $ 12 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2042:3:
|
2042 | @(add-eval) def binopShr: nat = $ 13 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2043:3:
|
2043 | @(add-eval) def binopTst: nat = $ 14 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2044:3:
|
2044 | @(add-eval) def binopSar: nat = $ 15 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2045:27:
|
2045 | theorem Binop_lem (h: $ a < 16 $): $ a e. Binop $ = '(Regs_lem h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2046:32:
|
2046 | theorem Binop_low: $ a e. Bits 3 -> a e. Binop $ = '(ssel @ Bitsss ,norm_num);
| ^
error: unexpected '3'
expecting '$' or infix >= 0
../examples/x86.mm1:2047:45:
|
2047 | theorem binopAddT: $ binopAdd e. Binop $ = 'elBits01;
| ^
error: unknown theorem/hypothesis 'elBits01'
../examples/x86.mm1:2048:61:
|
2048 | theorem binopOrT: $ binopOr e. Binop $ = '(! Binop_lem $1$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2049:63:
|
2049 | theorem binopAdcT: $ binopAdc e. Binop $ = '(! Binop_lem $2$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2050:63:
|
2050 | theorem binopSbbT: $ binopSbb e. Binop $ = '(! Binop_lem $3$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2051:63:
|
2051 | theorem binopAndT: $ binopAnd e. Binop $ = '(! Binop_lem $4$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2052:63:
|
2052 | theorem binopSubT: $ binopSub e. Binop $ = '(! Binop_lem $5$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2053:63:
|
2053 | theorem binopXorT: $ binopXor e. Binop $ = '(! Binop_lem $6$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2054:63:
|
2054 | theorem binopCmpT: $ binopCmp e. Binop $ = '(! Binop_lem $7$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2055:63:
|
2055 | theorem binopRolT: $ binopRol e. Binop $ = '(! Binop_lem $8$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2056:63:
|
2056 | theorem binopRorT: $ binopRor e. Binop $ = '(! Binop_lem $9$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2057:64:
|
2057 | theorem binopRclT: $ binopRcl e. Binop $ = '(! Binop_lem $10$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2058:64:
|
2058 | theorem binopRcrT: $ binopRcr e. Binop $ = '(! Binop_lem $11$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2059:64:
|
2059 | theorem binopShlT: $ binopShl e. Binop $ = '(! Binop_lem $12$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2060:64:
|
2060 | theorem binopShrT: $ binopShr e. Binop $ = '(! Binop_lem $13$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2061:64:
|
2061 | theorem binopTstT: $ binopTst e. Binop $ = '(! Binop_lem $14$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2062:64:
|
2062 | theorem binopSarT: $ binopSar e. Binop $ = '(! Binop_lem $15$ ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2064:1:
|
2064 | @_ def BCond: nat = $ Bits 3 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2064:28:
|
2064 | @_ def BCond: nat = $ Bits 3 $;
| ^
error: unexpected '3'
expecting '$' or infix >= 0
../examples/x86.mm1:2065:3:
|
2065 | @(add-eval) def bcondO: nat = $ 0 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2066:3:
|
2066 | @(add-eval) def bcondB: nat = $ 1 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2067:3:
|
2067 | @(add-eval) def bcondE: nat = $ 2 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2068:3:
|
2068 | @(add-eval) def bcondNA: nat = $ 3 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2069:3:
|
2069 | @(add-eval) def bcondS: nat = $ 4 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2070:3:
|
2070 | @(add-eval) def bcondL: nat = $ 6 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2071:3:
|
2071 | @(add-eval) def bcondNG: nat = $ 7 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2073:1:
|
2073 | @_ def Cond: set = $ Option (Bits 4) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2073:36:
|
2073 | @_ def Cond: set = $ Option (Bits 4) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2074:3:
|
2074 | @(add-eval) def condAlways: nat = $ 0 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:2075:1:
|
2075 | @_ def condPos (c: nat): nat = $ suc (b0 c) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2075:34:
|
2075 | @_ def condPos (c: nat): nat = $ suc (b0 c) $;
| ^
error: suc is not a function
../examples/x86.mm1:2076:1:
|
2076 | @_ def condNeg (c: nat): nat = $ suc (b1 c) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2076:34:
|
2076 | @_ def condNeg (c: nat): nat = $ suc (b1 c) $;
| ^
error: suc is not a function
../examples/x86.mm1:2077:52:
|
2077 | pub theorem condAlwaysT: $ condAlways e. Cond $ = 'opt0;
| ^
error: unknown theorem/hypothesis 'opt0'
../examples/x86.mm1:2078:45:
|
2078 | pub theorem condPosT (c: nat): $ c e. BCond <-> condPos c e. Cond $ = '(bitr4 b0Bits optS);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2079:45:
|
2079 | pub theorem condNegT (c: nat): $ c e. BCond <-> condNeg c e. Cond $ = '(bitr4 b1Bits optS);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2081:1:
|
2081 | @_ def XASTArith: set =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2082:3:
|
2082 | $ Sum (Sum (Xp Unop (Xp WSize RM)) (Xp Binop (Xp WSize DestSrc)))
| ^
error: Sum is not a function
../examples/x86.mm1:2084:1:
|
2084 | @_ def xastUnop (unop sz rm: nat): nat = $ b0 (b0 (b0 (b0 (unop, sz, rm)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2084:66:
|
2084 | @_ def xastUnop (unop sz rm: nat): nat = $ b0 (b0 (b0 (b0 (unop, sz, rm)))) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2085:1:
|
2085 | @_ def xastBinop (binop sz ds: nat): nat = $ b0 (b0 (b0 (b1 (binop, sz, ds)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2085:69:
|
2085 | @_ def xastBinop (binop sz ds: nat): nat = $ b0 (b0 (b0 (b1 (binop, sz, ds)))) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2086:1:
|
2086 | @_ def xastMul (sz rm: nat): nat = $ b0 (b0 (b1 (b0 (0, sz, rm)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2086:55:
|
2086 | @_ def xastMul (sz rm: nat): nat = $ b0 (b0 (b1 (b0 (0, sz, rm)))) $;
| ^
error: expecting (
../examples/x86.mm1:2087:1:
|
2087 | @_ def xastDiv (sz rm: nat): nat = $ b0 (b0 (b1 (b0 (1, sz, rm)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2087:55:
|
2087 | @_ def xastDiv (sz rm: nat): nat = $ b0 (b0 (b1 (b0 (1, sz, rm)))) $;
| ^
error: expecting (
../examples/x86.mm1:2088:1:
|
2088 | @_ def xastCDX (sz: nat): nat = $ b0 (b0 (b1 (b1 (sz, 0)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2088:55:
|
2088 | @_ def xastCDX (sz: nat): nat = $ b0 (b0 (b1 (b1 (sz, 0)))) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2089:1:
|
2089 | @_ def xastLea (sz ds: nat): nat = $ b0 (b0 (b1 (b1 (sz, suc ds)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2089:58:
|
2089 | @_ def xastLea (sz ds: nat): nat = $ b0 (b0 (b1 (b1 (sz, suc ds)))) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2091:1:
|
2091 | @_ def XASTData: set =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2092:62:
|
2092 | $ Sum (Xp WSize (Sum (Xp Bool (Xp DestSrc WSize)) (Xp (upto 3) (Xp RM Regs))))
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2094:1:
|
2094 | @_ def xastMovX (b sz ds sz2: nat): nat = $ b0 (b1 (b0 (sz, b0 (b, ds, sz2)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2094:61:
|
2094 | @_ def xastMovX (b sz ds sz2: nat): nat = $ b0 (b1 (b0 (sz, b0 (b, ds, sz2)))) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2095:1:
|
2095 | @_ def xastXchg (sz rm rn: nat): nat = $ b0 (b1 (b0 (sz, b1 (0, rm, rn)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2095:58:
|
2095 | @_ def xastXchg (sz rm rn: nat): nat = $ b0 (b1 (b0 (sz, b1 (0, rm, rn)))) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2096:1:
|
2096 | @_ def xastCmpXchg (sz rm rn: nat): nat = $ b0 (b1 (b0 (sz, b1 (1, rm, rn)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2096:61:
|
2096 | @_ def xastCmpXchg (sz rm rn: nat): nat = $ b0 (b1 (b0 (sz, b1 (1, rm, rn)))) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2097:1:
|
2097 | @_ def xastXadd (sz rm rn: nat): nat = $ b0 (b1 (b0 (sz, b1 (2, rm, rn)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2097:58:
|
2097 | @_ def xastXadd (sz rm rn: nat): nat = $ b0 (b1 (b0 (sz, b1 (2, rm, rn)))) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2098:1:
|
2098 | @_ def xastCMov (c sz ds: nat): nat = $ b0 (b1 (b1 (c, b0 (sz, ds)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2098:56:
|
2098 | @_ def xastCMov (c sz ds: nat): nat = $ b0 (b1 (b1 (c, b0 (sz, ds)))) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2099:1:
|
2099 | @_ def xastSetCC (c b ds: nat): nat = $ b0 (b1 (b1 (c, b1 (b, ds)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2099:56:
|
2099 | @_ def xastSetCC (c b ds: nat): nat = $ b0 (b1 (b1 (c, b1 (b, ds)))) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2101:1:
|
2101 | @_ def xastMov (sz ds: nat): nat = $ xastCMov condAlways sz ds $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2101:38:
|
2101 | @_ def xastMov (sz ds: nat): nat = $ xastCMov condAlways sz ds $;
| ^
error: xastCMov is not a function
../examples/x86.mm1:2102:1:
|
2102 | @_ def xastMovZX (sz ds sz2: nat): nat = $ xastMovX 0 sz ds sz2 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2102:53:
|
2102 | @_ def xastMovZX (sz ds sz2: nat): nat = $ xastMovX 0 sz ds sz2 $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:2103:1:
|
2103 | @_ def xastMovSX (sz ds sz2: nat): nat = $ xastMovX 1 sz ds sz2 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2103:53:
|
2103 | @_ def xastMovSX (sz ds sz2: nat): nat = $ xastMovX 1 sz ds sz2 $;
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/x86.mm1:2105:1:
|
2105 | @_ def XASTFlow: set =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2106:3:
|
2106 | $ Sum (Sum (Sum RM (Xp Cond u64)) (Sum ImmRM u64)) (Option (Sum ImmRM RM)) $;
| ^
error: Sum is not a function
../examples/x86.mm1:2107:1:
|
2107 | @_ def xastJump (rm: nat): nat = $ b1 (b0 (b0 (b0 (b0 rm)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2107:36:
|
2107 | @_ def xastJump (rm: nat): nat = $ b1 (b0 (b0 (b0 (b0 rm)))) $;
| ^
error: b1 is not a function
../examples/x86.mm1:2108:1:
|
2108 | @_ def xastJCC (c q: nat): nat = $ b1 (b0 (b0 (b0 (b1 (c, q))))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2108:59:
|
2108 | @_ def xastJCC (c q: nat): nat = $ b1 (b0 (b0 (b0 (b1 (c, q))))) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2109:1:
|
2109 | @_ def xastCall (irm: nat): nat = $ b1 (b0 (b0 (b1 (b0 irm)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2109:37:
|
2109 | @_ def xastCall (irm: nat): nat = $ b1 (b0 (b0 (b1 (b0 irm)))) $;
| ^
error: b1 is not a function
../examples/x86.mm1:2110:1:
|
2110 | @_ def xastRet (q: nat): nat = $ b1 (b0 (b0 (b1 (b1 q)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2110:34:
|
2110 | @_ def xastRet (q: nat): nat = $ b1 (b0 (b0 (b1 (b1 q)))) $;
| ^
error: b1 is not a function
../examples/x86.mm1:2111:1:
|
2111 | @_ def xastLeave: nat = $ b1 (b0 (b1 0)) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2111:39:
|
2111 | @_ def xastLeave: nat = $ b1 (b0 (b1 0)) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2112:1:
|
2112 | @_ def xastPush (irm: nat): nat = $ b1 (b0 (b1 (suc (b0 irm)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2112:37:
|
2112 | @_ def xastPush (irm: nat): nat = $ b1 (b0 (b1 (suc (b0 irm)))) $;
| ^
error: b1 is not a function
../examples/x86.mm1:2113:1:
|
2113 | @_ def xastPop (rm: nat): nat = $ b1 (b0 (b1 (suc (b1 rm)))) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2113:35:
|
2113 | @_ def xastPop (rm: nat): nat = $ b1 (b0 (b1 (suc (b1 rm)))) $;
| ^
error: b1 is not a function
../examples/x86.mm1:2115:1:
|
2115 | @_ def XASTMisc: set = $ upto 5 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2115:31:
|
2115 | @_ def XASTMisc: set = $ upto 5 $;
| ^
error: unexpected '5'
expecting '$' or infix >= 0
../examples/x86.mm1:2116:1:
|
2116 | @_ def xastCMC: nat = $ b1 (b1 0) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2116:33:
|
2116 | @_ def xastCMC: nat = $ b1 (b1 0) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2117:1:
|
2117 | @_ def xastCLC: nat = $ b1 (b1 1) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2117:33:
|
2117 | @_ def xastCLC: nat = $ b1 (b1 1) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2118:1:
|
2118 | @_ def xastSTC: nat = $ b1 (b1 2) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2118:33:
|
2118 | @_ def xastSTC: nat = $ b1 (b1 2) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2119:1:
|
2119 | @_ def xastUD2: nat = $ b1 (b1 3) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2119:33:
|
2119 | @_ def xastUD2: nat = $ b1 (b1 3) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2120:1:
|
2120 | @_ def xastSysCall: nat = $ b1 (b1 4) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2120:37:
|
2120 | @_ def xastSysCall: nat = $ b1 (b1 4) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2122:1:
|
2122 | @_ def XAST: set = $ Sum (Sum XASTArith XASTData) (Sum XASTFlow XASTMisc) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2122:22:
|
2122 | @_ def XAST: set = $ Sum (Sum XASTArith XASTData) (Sum XASTFlow XASTMisc) $;
| ^
error: Sum is not a function
../examples/x86.mm1:2126:33:
|
2126 | $ xastUnop unop sz rm e. XAST <-> unop e. Unop /\ sz e. WSize /\ rm e. RM $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2129:33:
|
2129 | $ xastBinop bop sz ds e. XAST <-> bop e. Binop /\ sz e. WSize /\ ds e. DestSrc $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2132:27:
|
2132 | $ xastMul sz rm e. XAST <-> sz e. WSize /\ rm e. RM $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2135:27:
|
2135 | $ xastDiv sz rm e. XAST <-> sz e. WSize /\ rm e. RM $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2137:55:
|
2137 | pub theorem xastCDX_T (sz: nat): $ xastCDX sz e. XAST <-> sz e. WSize $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2140:27:
|
2140 | $ xastLea sz ds e. XAST <-> sz e. WSize /\ ds e. DestSrc $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2144:34:
|
2144 | $ xastMovX b sz ds sz2 e. XAST <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2150:31:
|
2150 | $ xastXchg sz rm rn e. XAST <-> sz e. WSize /\ rm e. RM /\ rn e. Regs $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2155:34:
|
2155 | $ xastCmpXchg sz rm rn e. XAST <-> sz e. WSize /\ rm e. RM /\ rn e. Regs $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2160:31:
|
2160 | $ xastXadd sz rm rn e. XAST <-> sz e. WSize /\ rm e. RM /\ rn e. Regs $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2165:30:
|
2165 | $ xastCMov c sz ds e. XAST <-> c e. Cond /\ sz e. WSize /\ ds e. DestSrc $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2169:30:
|
2169 | $ xastSetCC c b rm e. XAST <-> c e. Cond /\ bool b /\ rm e. RM $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2173:33:
|
2173 | $ xastMovZX sz ds sz2 e. XAST <-> sz e. WSize /\ ds e. DestSrc /\ sz2 e. WSize $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2177:33:
|
2177 | $ xastMovSX sz ds sz2 e. XAST <-> sz e. WSize /\ ds e. DestSrc /\ sz2 e. WSize $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2181:27:
|
2181 | $ xastMov sz ds e. XAST <-> sz e. WSize /\ ds e. DestSrc $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2185:56:
|
2185 | pub theorem xastJumpT (rm: nat): $ xastJump rm e. XAST <-> rm e. RM $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2187:57:
|
2187 | pub theorem xastJCC_T (c q: nat): $ xastJCC c q e. XAST <-> c e. Cond /\ q e. u64 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2189:58:
|
2189 | pub theorem xastCallT (irm: nat): $ xastCall irm e. XAST <-> irm e. ImmRM $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2191:52:
|
2191 | pub theorem xastRetT (q: nat): $ xastRet q e. XAST <-> q e. u64 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2194:3:
|
2194 | '(trud @ Sumrd @ Sumld @ Sumrd opt0d);
| ^
error: unknown theorem/hypothesis 'trud'
../examples/x86.mm1:2195:58:
|
2195 | pub theorem xastPushT (irm: nat): $ xastPush irm e. XAST <-> irm e. ImmRM $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2197:54:
|
2197 | pub theorem xastPopT (rm: nat): $ xastPop rm e. XAST <-> rm e. RM $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2201:46:
|
2201 | '(trud @ Sumrd @ Sumrd @ a1i @ mpbir elupto ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2203:46:
|
2203 | '(trud @ Sumrd @ Sumrd @ a1i @ mpbir elupto ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2205:46:
|
2205 | '(trud @ Sumrd @ Sumrd @ a1i @ mpbir elupto ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2207:46:
|
2207 | '(trud @ Sumrd @ Sumrd @ a1i @ mpbir elupto ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2209:46:
|
2209 | '(trud @ Sumrd @ Sumrd @ a1i @ mpbir elupto ,norm_num);
| ^
error: Reference to unbound variable 'norm_num'
../examples/x86.mm1:2211:1:
|
2211 | @_ def decodeTwoCMov (rex ast b l .c .reg .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2212:34:
|
2212 | $ E. c E. reg E. r (splitBits ((4, c) : (4, 4) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2216:46:
|
2216 | $ decodeTwoCMov rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2225:68:
|
2225 | theorem decodeTwoCMov_len_le: $ decodeTwoCMov rex ast b l -> len l <= 6 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2228:1:
|
2228 | @_ def decodeTwoJCC (_rex ast b l .c .imm: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2229:29:
|
2229 | $ E. c E. imm (splitBits ((4, c) : (4, 8) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2233:45:
|
2233 | $ decodeTwoJCC rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2241:66:
|
2241 | theorem decodeTwoJCC_len_le: $ decodeTwoJCC rex ast b l -> len l <= 6 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2244:1:
|
2244 | @_ def decodeTwoSetCC (rex ast b l .c .reg .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2245:34:
|
2245 | $ E. c E. reg E. r (splitBits ((4, c) : (4, 9) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2249:47:
|
2249 | $ decodeTwoSetCC rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2257:70:
|
2257 | theorem decodeTwoSetCC_len_le: $ decodeTwoSetCC rex ast b l -> len l <= 6 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2260:1:
|
2260 | @_ def decodeTwoCmpXchg (rex ast b l .v .reg .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2261:34:
|
2261 | $ E. v E. reg E. r (splitBits ((1, v) : (3, 0) : (4, 11) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2265:49:
|
2265 | $ decodeTwoCmpXchg rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2272:74:
|
2272 | theorem decodeTwoCmpXchg_len_le: $ decodeTwoCmpXchg rex ast b l -> len l <= 6 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2275:1:
|
2275 | @_ def decodeTwoMovX (rex ast b l .v .s .reg .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2277:18:
|
2277 | splitBits ((1, v) : (2, 3) : (1, s) : (4, 11) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2282:46:
|
2282 | $ decodeTwoMovX rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2291:68:
|
2291 | theorem decodeTwoMovX_len_le: $ decodeTwoMovX rex ast b l -> len l <= 6 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2294:1:
|
2294 | @_ def decodeTwoXadd (rex ast b l .v .reg .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2296:18:
|
2296 | splitBits ((1, v) : (3, 0) : (4, 12) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2300:46:
|
2300 | $ decodeTwoXadd rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2307:68:
|
2307 | theorem decodeTwoXadd_len_le: $ decodeTwoXadd rex ast b l -> len l <= 6 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2311:7:
|
2311 | $ b = c /\ l = 0 /\ ast = a -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2314:1:
|
2314 | @_ def decodeTwoUD2 (_rex ast b l: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2315:5:
|
2315 | $ b = ch x0 xb /\ l = 0 /\ ast = xastUD2 $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2317:45:
|
2317 | $ decodeTwoUD2 rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2320:66:
|
2320 | theorem decodeTwoUD2_len_le: $ decodeTwoUD2 rex ast b l -> len l <= 6 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2323:1:
|
2323 | @_ def decodeTwoSysCall (_rex ast b l: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2324:5:
|
2324 | $ b = ch x0 x5 /\ l = 0 /\ ast = xastSysCall $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2326:49:
|
2326 | $ decodeTwoSysCall rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2329:74:
|
2329 | theorem decodeTwoSysCall_len_le: $ decodeTwoSysCall rex ast b l -> len l <= 6 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2332:1:
|
2332 | @_ def decodeTwoAux (rex ast b l: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2333:29:
|
2333 | $ decodeTwoCMov rex ast b l \/ decodeTwoJCC rex ast b l \/
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/x86.mm1:2338:45:
|
2338 | $ decodeTwoAux rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2344:66:
|
2344 | theorem decodeTwoAux_len_le: $ decodeTwoAux rex ast b l -> len l <= 6 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2350:1:
|
2350 | @_ def decodeTwo (rex ast b l .b2 .l2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2351:5:
|
2351 | $ b = ch x0 xf /\ E. b2 E. l2 (l = b2 : l2 /\ decodeTwoAux rex ast b2 l2) $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2353:42:
|
2353 | $ decodeTwo rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2358:60:
|
2358 | theorem decodeTwo_len_le: $ decodeTwo rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2363:1:
|
2363 | @_ def decodeBinopReg (rex ast b l .v .d .opc .reg .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2365:18:
|
2365 | splitBits ((1, v) : (1, d) : (1, 0) : (3, opc) : (2, 0) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2370:47:
|
2370 | $ decodeBinopReg rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2381:70:
|
2381 | theorem decodeBinopReg_len_le: $ decodeBinopReg rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2384:1:
|
2384 | @_ def decodeBinopRAX (rex ast b l .v .opc .imm: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2386:18:
|
2386 | splitBits ((1, v) : (2, 2) : (3, opc) : (2, 0) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2390:47:
|
2390 | $ decodeBinopRAX rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2400:70:
|
2400 | theorem decodeBinopRAX_len_le: $ decodeBinopRAX rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2403:1:
|
2403 | @_ def decodeBinopImm (rex ast b l .v .opc .r .l1 .imm .l2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2404:44:
|
2404 | $ E. v E. opc E. r E. l1 E. imm E. l2 (l = l1 ++ l2 /\
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/x86.mm1:2410:47:
|
2410 | $ decodeBinopImm rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2421:70:
|
2421 | theorem decodeBinopImm_len_le: $ decodeBinopImm rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2427:1:
|
2427 | @_ def decodeBinopImm8 (rex ast b l .opc .r .l1 .imm .l2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2428:39:
|
2428 | $ E. opc E. r E. imm E. l1 E. l2 (l = l1 ++ l2 /\ b = ch x8 x3 /\
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/x86.mm1:2433:48:
|
2433 | $ decodeBinopImm8 rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2444:72:
|
2444 | theorem decodeBinopImm8_len_le: $ decodeBinopImm8 rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2450:1:
|
2450 | @_ def decodeBinopHi (rex ast b l .v .opc .r .imm .l1 .l2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2451:44:
|
2451 | $ E. v E. opc E. r E. imm E. l1 E. l2 (l = l1 ++ l2 /\
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/x86.mm1:2457:46:
|
2457 | $ decodeBinopHi rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2468:68:
|
2468 | theorem decodeBinopHi_len_le: $ decodeBinopHi rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2474:1:
|
2474 | @_ def decodeBinopHiReg (rex ast b l .v .x .opc .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2476:18:
|
2476 | splitBits ((1, v) : (1, x) : (2, 0) : (4, 13) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2481:49:
|
2481 | $ decodeBinopHiReg rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2492:74:
|
2492 | theorem decodeBinopHiReg_len_le: $ decodeBinopHiReg rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2495:1:
|
2495 | @_ def decodeBinop (rex ast b l: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2496:30:
|
2496 | $ decodeBinopReg rex ast b l \/ decodeBinopRAX rex ast b l \/
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/x86.mm1:2500:44:
|
2500 | $ decodeBinop rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2506:64:
|
2506 | theorem decodeBinop_len_le: $ decodeBinop rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2512:1:
|
2512 | @_ def decodeMovSX (rex ast b l .reg .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2513:20:
|
2513 | $ E. reg E. r (b = ch x6 x3 /\
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/x86.mm1:2516:44:
|
2516 | $ decodeMovSX rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2523:64:
|
2523 | theorem decodeMovSX_len_le: $ decodeMovSX rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2526:1:
|
2526 | @_ def decodeMovReg (rex ast b l .v .d .reg .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2528:18:
|
2528 | splitBits ((1, v) : (1, d) : (2, 2) : (4, 8) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2532:45:
|
2532 | $ decodeMovReg rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2540:66:
|
2540 | theorem decodeMovReg_len_le: $ decodeMovReg rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2543:1:
|
2543 | @_ def decodeMov64 (rex ast b l .r .v .imm: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2545:18:
|
2545 | splitBits ((3, r) : (1, v) : (4, 11) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2549:44:
|
2549 | $ decodeMov64 rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2559:64:
|
2559 | theorem decodeMov64_len_le: $ decodeMov64 rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2563:1:
|
2563 | @_ def decodeMovImm (rex ast b l .v .opc .r .imm .l1 .l2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2564:37:
|
2564 | $ E. v E. r E. imm E. l1 E. l2 (l = l1 ++ l2 /\
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/x86.mm1:2570:45:
|
2570 | $ decodeMovImm rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2580:66:
|
2580 | theorem decodeMovImm_len_le: $ decodeMovImm rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2586:1:
|
2586 | @_ def decodeMov (rex ast b l: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2587:27:
|
2587 | $ decodeMovSX rex ast b l \/ decodeMovReg rex ast b l \/
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/x86.mm1:2590:42:
|
2590 | $ decodeMov rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2596:60:
|
2596 | theorem decodeMov_len_le: $ decodeMov rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2602:1:
|
2602 | @_ def decodePushImm (_rex ast b l .x .imm .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2604:18:
|
2604 | splitBits ((1, 0) : (1, x) : (2, 2) : (4, 6) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2608:46:
|
2608 | $ decodePushImm rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2615:68:
|
2615 | theorem decodePushImm_len_le: $ decodePushImm rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2618:1:
|
2618 | @_ def decodePushReg (rex ast b l .x .imm .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2619:5:
|
2619 | $ l = 0 /\ E. r (
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2623:46:
|
2623 | $ decodePushReg rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2631:68:
|
2631 | theorem decodePushReg_len_le: $ decodePushReg rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2634:1:
|
2634 | @_ def decodePopReg (rex ast b l .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2635:5:
|
2635 | $ l = 0 /\ E. r (
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2639:45:
|
2639 | $ decodePopReg rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2647:66:
|
2647 | theorem decodePopReg_len_le: $ decodePopReg rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2650:1:
|
2650 | @_ def decodePop0 (rex ast b l .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2651:13:
|
2651 | $ E. r (b = ch x8 xf /\ readOpcodeModRM rex 0 r l /\ ast = xastPop r) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2653:43:
|
2653 | $ decodePop0 rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2659:62:
|
2659 | theorem decodePop0_len_le: $ decodePop0 rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2662:1:
|
2662 | @_ def decodeStack (rex ast b l .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2663:29:
|
2663 | $ decodePushImm rex ast b l \/ decodePushReg rex ast b l \/
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/x86.mm1:2666:44:
|
2666 | $ decodeStack rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2672:64:
|
2672 | theorem decodeStack_len_le: $ decodeStack rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2678:1:
|
2678 | @_ def decodeJump (_rex ast b l .x .imm: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2680:18:
|
2680 | splitBits ((1, 1) : (1, x) : (2, 2) : (4, 14) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2684:43:
|
2684 | $ decodeJump rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2691:62:
|
2691 | theorem decodeJump_len_le: $ decodeJump rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2694:1:
|
2694 | @_ def decodeJCC8 (_rex ast b l .c .imm: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2695:29:
|
2695 | $ E. c E. imm (splitBits ((4, c) : (4, 7) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2698:43:
|
2698 | $ decodeJCC8 rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2706:59:
|
2706 | theorem decodeJCC8_len: $ decodeJCC8 rex ast b l -> len l = 1 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2708:62:
|
2708 | theorem decodeJCC8_len_le: $ decodeJCC8 rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2711:1:
|
2711 | @_ def decodeCall (_rex ast b l .imm: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2712:15:
|
2712 | $ E. imm (b = ch xe x8 /\
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2715:43:
|
2715 | $ decodeCall rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2722:59:
|
2722 | theorem decodeCall_len: $ decodeCall rex ast b l -> len l = 4 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2724:62:
|
2724 | theorem decodeCall_len_le: $ decodeCall rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2727:1:
|
2727 | @_ def decodeRet (_rex ast b l .v .imm: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2729:18:
|
2729 | splitBits ((1, v) : (3, 1) : (4, 12) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2733:42:
|
2733 | $ decodeRet rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2741:60:
|
2741 | theorem decodeRet_len_le: $ decodeRet rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2746:1:
|
2746 | @_ def decodeLeave (_rex ast b l: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2747:5:
|
2747 | $ b = ch xc x9 /\ l = 0 /\ ast = xastLeave $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2749:44:
|
2749 | $ decodeLeave rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2751:56:
|
2751 | theorem decodeLeave_l0: $ decodeLeave rex ast b l -> l = 0 $ = 'anlr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2753:64:
|
2753 | theorem decodeLeave_len_le: $ decodeLeave rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2756:1:
|
2756 | @_ def decodeFlow (rex ast b l: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2757:26:
|
2757 | $ decodeJump rex ast b l \/ decodeJCC8 rex ast b l \/
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/x86.mm1:2760:43:
|
2760 | $ decodeFlow rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2766:62:
|
2766 | theorem decodeFlow_len_le: $ decodeFlow rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2772:1:
|
2772 | @_ def decodeXchg (rex ast b l .v .reg .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2774:18:
|
2774 | splitBits ((1, v) : (3, 3) : (4, 8) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2778:43:
|
2778 | $ decodeXchg rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2785:62:
|
2785 | theorem decodeXchg_len_le: $ decodeXchg rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2788:1:
|
2788 | @_ def decodeXchgRAX (rex ast b l .v .reg .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2789:5:
|
2789 | $ l = 0 /\ E. r (
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2793:46:
|
2793 | $ decodeXchgRAX rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2802:68:
|
2802 | theorem decodeXchgRAX_len_le: $ decodeXchgRAX rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2805:1:
|
2805 | @_ def decodeCDX (rex ast b l .reg .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2806:20:
|
2806 | $ E. reg E. r (b = ch x9 x9 /\ l = 0 /\ ast = xastCDX (opSize T. (REX_W rex) 1)) $;
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/x86.mm1:2808:42:
|
2808 | $ decodeCDX rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2814:60:
|
2814 | theorem decodeCDX_len_le: $ decodeCDX rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2817:1:
|
2817 | @_ def decodeLea (rex ast b l .reg .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2818:20:
|
2818 | $ E. reg E. r (b = ch x8 xd /\
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/x86.mm1:2822:42:
|
2822 | $ decodeLea rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2830:60:
|
2830 | theorem decodeLea_len_le: $ decodeLea rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2833:1:
|
2833 | @_ def decodeTest (rex ast b l .v .reg .r: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2835:18:
|
2835 | splitBits ((1, v) : (3, 2) : (4, 8) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2839:43:
|
2839 | $ decodeTest rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2847:62:
|
2847 | theorem decodeTest_len_le: $ decodeTest rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2850:1:
|
2850 | @_ def decodeTestRAX (rex ast b l .v .imm .sz: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2852:18:
|
2852 | splitBits ((1, v) : (3, 4) : (4, 10) : 0) b /\
| ^
error: expecting ( or infix >= max
../examples/x86.mm1:2857:46:
|
2857 | $ decodeTestRAX rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2867:68:
|
2867 | theorem decodeTestRAX_len_le: $ decodeTestRAX rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2870:1:
|
2870 | @_ def decodeCMC (_rex ast b l: nat): wff = $ b = ch xf x5 /\ l = 0 /\ ast = xastCMC $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2870:49:
|
2870 | @_ def decodeCMC (_rex ast b l: nat): wff = $ b = ch xf x5 /\ l = 0 /\ ast = xastCMC $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2872:42:
|
2872 | $ decodeCMC rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ = '(decodeCMC_T_lem xastCMC_T);
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2873:52:
|
2873 | theorem decodeCMC_l0: $ decodeCMC rex ast b l -> l = 0 $ = 'anlr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2874:1:
|
2874 | @_ def decodeCLC (_rex ast b l: nat): wff = $ b = ch xf x8 /\ l = 0 /\ ast = xastCLC $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2874:49:
|
2874 | @_ def decodeCLC (_rex ast b l: nat): wff = $ b = ch xf x8 /\ l = 0 /\ ast = xastCLC $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2876:42:
|
2876 | $ decodeCLC rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ = '(decodeCMC_T_lem xastCLC_T);
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2877:52:
|
2877 | theorem decodeCLC_l0: $ decodeCLC rex ast b l -> l = 0 $ = 'anlr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2878:1:
|
2878 | @_ def decodeSTC (_rex ast b l: nat): wff = $ b = ch xf x9 /\ l = 0 /\ ast = xastSTC $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2878:49:
|
2878 | @_ def decodeSTC (_rex ast b l: nat): wff = $ b = ch xf x9 /\ l = 0 /\ ast = xastSTC $;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2880:42:
|
2880 | $ decodeSTC rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ = '(decodeCMC_T_lem xastSTC_T);
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2881:52:
|
2881 | theorem decodeSTC_l0: $ decodeSTC rex ast b l -> l = 0 $ = 'anlr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2883:1:
|
2883 | @_ def decodeFlag (rex ast b l: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2884:25:
|
2884 | $ decodeCMC rex ast b l \/ decodeCLC rex ast b l \/ decodeSTC rex ast b l $;
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/x86.mm1:2886:43:
|
2886 | $ decodeFlag rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ = '(eor (eor decodeCMC_T decodeCLC_T)
decodeSTC_T);
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2887:54:
|
2887 | theorem decodeFlag_l0: $ decodeFlag rex ast b l -> l = 0 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:2890:62:
|
2890 | theorem decodeFlag_len_le: $ decodeFlag rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2893:1:
|
2893 | @_ def decodeMisc (rex ast b l: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2894:26:
|
2894 | $ decodeXchg rex ast b l \/ decodeXchgRAX rex ast b l \/
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/x86.mm1:2898:43:
|
2898 | $ decodeMisc rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2904:62:
|
2904 | theorem decodeMisc_len_le: $ decodeMisc rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2910:1:
|
2910 | @_ def decodeHiAux (v sz r hi n ast l .imm: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2912:10:
|
2912 | (l = 0 /\ (
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2927:17:
|
2927 | $ sz e. WSize /\ r e. RM /\
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:2949:70:
|
2949 | theorem decodeHiAux_len_le: $ decodeHiAux v sz r hi n ast l -> len l <= 4 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2954:1:
|
2954 | @_ def decodeHi (rex ast b l .v .x .opc .r .l1 .l2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2955:42:
|
2955 | $ E. v E. x E. opc E. r E. l1 E. l2 (l = l1 ++ l2 /\
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/x86.mm1:2960:41:
|
2960 | $ decodeHi rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2967:57:
|
2967 | theorem decodeHi_len_le: $ decodeHi rex v rm l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2973:1:
|
2973 | @_ def decodeAux (rex ast b l: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:2974:27:
|
2974 | $ decodeBinop rex ast b l \/ decodeMov rex ast b l \/
| ^
error: unexpected '\'
expecting '$' or infix >= 0
../examples/x86.mm1:2978:42:
|
2978 | $ decodeAux rex ast b l -> ast e. XAST /\ b e. u8 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:2984:56:
|
2984 | theorem decodeAux_s1 (h: $ decodeAux rex ast opc (c ': s0) $):
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:2987:60:
|
2987 | theorem decodeAux_len_le: $ decodeAux rex ast b l -> len l <= 10 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:2993:28:
|
2993 | theorem decodeBinopI (h: $ decodeBinop rex ast b l $): $ decodeAux rex ast b l $ = '(orl @ orl @ orl @ orl @
orl @ orl h);
| ^
error: decodeBinop is not a function
../examples/x86.mm1:2994:28:
|
2994 | theorem decodeMovI (h: $ decodeMov rex ast b l $): $ decodeAux rex ast b l $ = '(orl @ orl @ orl @ orl @
orl @ orr h);
| ^
error: decodeMov is not a function
../examples/x86.mm1:2995:28:
|
2995 | theorem decodeStackI (h: $ decodeStack rex ast b l $): $ decodeAux rex ast b l $ = '(orl @ orl @ orl @ orl @
orr h);
| ^
error: decodeStack is not a function
../examples/x86.mm1:2996:28:
|
2996 | theorem decodeFlowI (h: $ decodeFlow rex ast b l $): $ decodeAux rex ast b l $ = '(orl @ orl @ orl @ orr h
);
| ^
error: decodeFlow is not a function
../examples/x86.mm1:2997:28:
|
2997 | theorem decodeMiscI (h: $ decodeMisc rex ast b l $): $ decodeAux rex ast b l $ = '(orl @ orl @ orr h);
| ^
error: decodeMisc is not a function
../examples/x86.mm1:2998:28:
|
2998 | theorem decodeHiI (h: $ decodeHi rex ast b l $): $ decodeAux rex ast b l $ = '(orl @ orr h);
| ^
error: decodeHi is not a function
../examples/x86.mm1:3001:14:
|
3001 | (hy: $ bs1 ++ (1, o) : 0 = by $)
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:3015:23:
|
3015 | (h1: $ splitBits ((1, v) : (1, d) : (1, 0) : (1, o) : 0) y $)
| ^
error: expecting (
../examples/x86.mm1:3028:23:
|
3028 | (h1: $ splitBits ((1, v) : (2, 2) : (1, o) : 0) y $)
| ^
error: expecting (
../examples/x86.mm1:3040:23:
|
3040 | (h1: $ splitBits ((1, v) : (3, 0) : 0) y $)
| ^
error: expecting (
../examples/x86.mm1:3052:10:
|
3052 | (h1: $ readOpcodeModRM rex opc r l1 $)
| ^
error: readOpcodeModRM is not a function
../examples/x86.mm1:3062:23:
|
3062 | (h1: $ splitBits ((1, v) : (1, d) : (2, 2) : 0) a $)
| ^
error: expecting (
../examples/x86.mm1:3073:23:
|
3073 | (h1: $ splitBits ((1, v) : (1, 1) : (2, 2) : 0) a $)
| ^
error: expecting (
../examples/x86.mm1:3080:23:
|
3080 | (h1: $ splitBits ((1, v) : (1, 0) : (2, 2) : 0) a $)
| ^
error: expecting (
../examples/x86.mm1:3087:23:
|
3087 | (h1: $ splitBits ((3, r) : (1, v) : 0) a $)
| ^
error: expecting (
../examples/x86.mm1:3102:23:
|
3102 | (h1: $ splitBits ((1, v) : (3, 3) : 0) a $)
| ^
error: expecting (
../examples/x86.mm1:3114:28:
|
3114 | theorem decodeTwoI (h: $ ,(foldr '(2 2 2 2 6) (get-decl 'decodeTwo) nth) $):
| ^
error: Reference to unbound variable 'foldr'
../examples/x86.mm1:3118:1:
|
3118 | @_ def decode (ast l .rex .l1 .opc .l2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3119:34:
|
3119 | $ E. rex E. l1 E. opc E. l2 (l = l1 ++ opc : l2 /\
| ^
error: expecting ), infix >= 0, or infix >= max
../examples/x86.mm1:3122:65:
|
3122 | pub theorem decodeT (ast l: nat): $ decode ast l -> ast e. XAST /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3129:7:
|
3129 | $ l = l1 ++ opc : l2 /\ readPrefixes rex l1 /\ decodeAux rex ast opc l2 -> len l <= 12 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3134:48:
|
3134 | theorem decode_len_le: $ decode ast l -> len l <= 12 $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3137:24:
|
3137 | theorem decodeI (h1: $ readPrefixes rex l1 $) (h2: $ decodeAux rex ast opc l2 $)
| ^
error: readPrefixes is not a function
../examples/x86.mm1:3143:34:
|
3143 | theorem decode0I (h: $ decodeAux 0 ast opc s $): $ decode ast (opc ': s) $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:3146:24:
|
3146 | theorem decode1I (h: $ decodeAux (suc rex) ast opc s $):
| ^
error: decodeAux is not a function
../examples/x86.mm1:3152:42:
|
3152 | theorem decode_s1 (h: $ decode ast (c ': s0) $):
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:3156:23:
|
3156 | (h1: $ splitBits ((1, v) : (3, 1) : 0) a $)
| ^
error: expecting (
../examples/x86.mm1:3164:41:
|
3164 | theorem decodeRet0I: $ decode (xastRet 0) (s1 (ch xc x3)) $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:3168:18:
|
3168 | (h: $ readImmN 16 imm l $):
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/x86.mm1:3172:59:
|
3172 | theorem decodeSysCallI: $ decode xastSysCall (ch x0 xf ': s1 (ch x0 x5)) $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:3179:1:
|
3179 | @_ def Flags: nat = $ u64 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3180:1:
|
3180 | @_ def CF (flags: nat): wff = $ 0 e. flags $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3180:35:
|
3180 | @_ def CF (flags: nat): wff = $ 0 e. flags $;
| ^
error: expecting (
../examples/x86.mm1:3181:1:
|
3181 | @_ def ZF (flags: nat): wff = $ 6 e. flags $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3181:35:
|
3181 | @_ def ZF (flags: nat): wff = $ 6 e. flags $;
| ^
error: expecting (
../examples/x86.mm1:3182:1:
|
3182 | @_ def SF (flags: nat): wff = $ 7 e. flags $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3182:35:
|
3182 | @_ def SF (flags: nat): wff = $ 7 e. flags $;
| ^
error: expecting (
../examples/x86.mm1:3183:1:
|
3183 | @_ def OF (flags: nat): wff = $ 11 e. flags $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3183:36:
|
3183 | @_ def OF (flags: nat): wff = $ 11 e. flags $;
| ^
error: expecting (
../examples/x86.mm1:3185:1:
|
3185 | @_ def setCF (f: nat) (p: wff): nat = $ bitsUpdate 0 1 (nat p) f $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3185:52:
|
3185 | @_ def setCF (f: nat) (p: wff): nat = $ bitsUpdate 0 1 (nat p) f $;
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:3186:1:
|
3186 | @_ def setZF (f: nat) (p: wff): nat = $ bitsUpdate 6 1 (nat p) f $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3186:52:
|
3186 | @_ def setZF (f: nat) (p: wff): nat = $ bitsUpdate 6 1 (nat p) f $;
| ^
error: unexpected '6'
expecting '$' or infix >= 0
../examples/x86.mm1:3187:1:
|
3187 | @_ def setSF (f: nat) (p: wff): nat = $ bitsUpdate 7 1 (nat p) f $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3187:52:
|
3187 | @_ def setSF (f: nat) (p: wff): nat = $ bitsUpdate 7 1 (nat p) f $;
| ^
error: unexpected '7'
expecting '$' or infix >= 0
../examples/x86.mm1:3188:1:
|
3188 | @_ def setOF (f: nat) (p: wff): nat = $ bitsUpdate 11 1 (nat p) f $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3188:52:
|
3188 | @_ def setOF (f: nat) (p: wff): nat = $ bitsUpdate 11 1 (nat p) f $;
| ^
error: unexpected '1'
expecting '$' or infix >= 0
../examples/x86.mm1:3189:47:
|
3189 | pub theorem setCF_T (f: nat) (p: wff): $ f e. Flags -> setCF f p e. Flags $ =
| ^
error: term 'Flags' applied to 0 arguments, expected 1
../examples/x86.mm1:3191:47:
|
3191 | pub theorem setZF_T (f: nat) (p: wff): $ f e. Flags -> setZF f p e. Flags $ =
| ^
error: term 'Flags' applied to 0 arguments, expected 1
../examples/x86.mm1:3193:47:
|
3193 | pub theorem setSF_T (f: nat) (p: wff): $ f e. Flags -> setSF f p e. Flags $ =
| ^
error: term 'Flags' applied to 0 arguments, expected 1
../examples/x86.mm1:3195:47:
|
3195 | pub theorem setOF_T (f: nat) (p: wff): $ f e. Flags -> setOF f p e. Flags $ =
| ^
error: term 'Flags' applied to 0 arguments, expected 1
../examples/x86.mm1:3198:36:
|
3198 | theorem CF_setCF: $ CF (setCF f p) <-> p $ = 'el_bitsUpdate1_eq;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3199:36:
|
3199 | theorem ZF_setZF: $ ZF (setZF f p) <-> p $ = 'el_bitsUpdate1_eq;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3200:36:
|
3200 | theorem SF_setSF: $ SF (setSF f p) <-> p $ = 'el_bitsUpdate1_eq;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3201:36:
|
3201 | theorem OF_setOF: $ OF (setOF f p) <-> p $ = 'el_bitsUpdate1_eq;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3203:26:
|
3203 | theorem setF_ne (h1: $ i != j $) (h2: $ i e. f <-> q $):
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/x86.mm1:3205:29:
|
3205 | theorem ZF_setCF (h: $ ZF f <-> q $): $ ZF (setCF f p) <-> q $ = '(setF_ne ,norm_num h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3206:29:
|
3206 | theorem SF_setCF (h: $ SF f <-> q $): $ SF (setCF f p) <-> q $ = '(setF_ne ,norm_num h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3207:29:
|
3207 | theorem OF_setCF (h: $ OF f <-> q $): $ OF (setCF f p) <-> q $ = '(setF_ne ,norm_num h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3208:29:
|
3208 | theorem CF_setZF (h: $ CF f <-> q $): $ CF (setZF f p) <-> q $ = '(setF_ne ,norm_num h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3209:29:
|
3209 | theorem SF_setZF (h: $ SF f <-> q $): $ SF (setZF f p) <-> q $ = '(setF_ne ,norm_num h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3210:29:
|
3210 | theorem OF_setZF (h: $ OF f <-> q $): $ OF (setZF f p) <-> q $ = '(setF_ne ,norm_num h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3211:29:
|
3211 | theorem CF_setSF (h: $ CF f <-> q $): $ CF (setSF f p) <-> q $ = '(setF_ne ,norm_num h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3212:29:
|
3212 | theorem ZF_setSF (h: $ ZF f <-> q $): $ ZF (setSF f p) <-> q $ = '(setF_ne ,norm_num h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3213:29:
|
3213 | theorem OF_setSF (h: $ OF f <-> q $): $ OF (setSF f p) <-> q $ = '(setF_ne ,norm_num h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3214:29:
|
3214 | theorem CF_setOF (h: $ CF f <-> q $): $ CF (setOF f p) <-> q $ = '(setF_ne ,norm_num h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3215:29:
|
3215 | theorem ZF_setOF (h: $ ZF f <-> q $): $ ZF (setOF f p) <-> q $ = '(setF_ne ,norm_num h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3216:29:
|
3216 | theorem SF_setOF (h: $ SF f <-> q $): $ SF (setOF f p) <-> q $ = '(setF_ne ,norm_num h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3218:68:
|
3218 | theorem CF_setCZSO: $ CF (setOF (setSF (setZF (setCF f c) z) s) o) <-> c $ = '(CF_setOF @ CF_setSF @ CF_setZ
F CF_setCF);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3219:68:
|
3219 | theorem ZF_setCZSO: $ ZF (setOF (setSF (setZF (setCF f c) z) s) o) <-> z $ = '(ZF_setOF @ ZF_setSF ZF_setZF)
;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3220:68:
|
3220 | theorem SF_setCZSO: $ SF (setOF (setSF (setZF (setCF f c) z) s) o) <-> s $ = '(SF_setOF SF_setSF);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3221:68:
|
3221 | theorem OF_setCZSO: $ OF (setOF (setSF (setZF (setCF f c) z) s) o) <-> o $ = 'OF_setOF;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3223:1:
|
3223 | @_ abstract def readBCond (f c: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3224:12:
|
3224 | $ ifp (c < 4)
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:3227:55:
|
3227 | pub theorem readBCondO (f: nat): $ readBCond f bcondO <-> OF f $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3229:55:
|
3229 | pub theorem readBCondB (f: nat): $ readBCond f bcondB <-> CF f $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3231:55:
|
3231 | pub theorem readBCondE (f: nat): $ readBCond f bcondE <-> ZF f $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3233:57:
|
3233 | pub theorem readBCondNA (f: nat): $ readBCond f bcondNA <-> CF f \/ ZF f $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3235:55:
|
3235 | pub theorem readBCondS (f: nat): $ readBCond f bcondS <-> SF f $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3237:55:
|
3237 | pub theorem readBCondL (f: nat): $ readBCond f bcondL <-> ~(SF f <-> OF f) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3239:57:
|
3239 | pub theorem readBCondNG (f: nat): $ readBCond f bcondNG <-> ZF f \/ ~(SF f <-> OF f) $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3242:1:
|
3242 | @_ abstract def readCondF (f c: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3243:8:
|
3243 | $ c e. Option (Sum {x | readBCond f x} {x | ~readBCond f x}) $;
| ^
error: Option is not a function
../examples/x86.mm1:3244:41:
|
3244 | pub theorem readCondFAlways (f: nat): $ readCondF f condAlways $ = (named 'opt0);
| ^
error: readCondF is not a function
../examples/x86.mm1:3245:64:
|
3245 | pub theorem readCondFPos (f c: nat): $ readCondF f (condPos c) <-> readBCond f c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3247:64:
|
3247 | pub theorem readCondFNeg (f c: nat): $ readCondF f (condNeg c) <-> ~readBCond f c $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3250:1:
|
3250 | @_ def Prot: set = $ Bits 3 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3250:27:
|
3250 | @_ def Prot: set = $ Bits 3 $;
| ^
error: unexpected '3'
expecting '$' or infix >= 0
../examples/x86.mm1:3251:27:
|
3251 | pub theorem finiteProt: $ finite Prot $ = 'finns;
| ^
error: finite is not a function
../examples/x86.mm1:3252:3:
|
3252 | @(add-eval) def PROT_READ: nat = $ 1 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:3253:3:
|
3253 | @(add-eval) def PROT_WRITE: nat = $ 2 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:3254:3:
|
3254 | @(add-eval) def PROT_EXEC: nat = $ 4 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:3255:28:
|
3255 | theorem PROT_T_lem (h: $ a < 8 $): $ a e. Prot $ = '(mpbir elBits2 @ mpbir (lteq2 d2pow3) h);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3256:52:
|
3256 | pub theorem PROT_READ_T: $ PROT_READ e. Prot $ = '(PROT_T_lem d1lt8);
| ^
error: unknown theorem/hypothesis 'PROT_T_lem'
../examples/x86.mm1:3257:54:
|
3257 | pub theorem PROT_WRITE_T: $ PROT_WRITE e. Prot $ = '(PROT_T_lem d2lt8);
| ^
error: unknown theorem/hypothesis 'PROT_T_lem'
../examples/x86.mm1:3258:52:
|
3258 | pub theorem PROT_EXEC_T: $ PROT_EXEC e. Prot $ = '(PROT_T_lem d4lt8);
| ^
error: unknown theorem/hypothesis 'PROT_T_lem'
../examples/x86.mm1:3259:20:
|
3259 | theorem Prot_ss: $ a C_ b -> b e. Prot -> a e. Prot $ = '(sylibr (imeqi elBits elBits) sstr);
| ^
error: a is not a function
../examples/x86.mm1:3260:32:
|
3260 | theorem PROT_RX_T: $ PROT_READ + PROT_EXEC e. Prot $ =
| ^
error: unexpected '+'
expecting '$' or infix >= 0
../examples/x86.mm1:3263:1:
|
3263 | @_ def Memory: set = $ Arrow u64 (Xp Prot u8) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3263:24:
|
3263 | @_ def Memory: set = $ Arrow u64 (Xp Prot u8) $;
| ^
error: Arrow is not a function
../examples/x86.mm1:3264:29:
|
3264 | pub theorem finiteMemory: $ finite Memory $ = '(Arrowfin finns @ xpfin finiteProt finns);
| ^
error: finite is not a function
../examples/x86.mm1:3265:34:
|
3265 | theorem elMemoryT: $ m e. Memory /\ x e. u64 -> m @ x e. Xp Prot u8 $ = 'appT;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3267:1:
|
3267 | @_ def Exception: set = $ upto 3 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3267:32:
|
3267 | @_ def Exception: set = $ upto 3 $;
| ^
error: unexpected '3'
expecting '$' or infix >= 0
../examples/x86.mm1:3268:32:
|
3268 | pub theorem finiteException: $ finite Exception $ = 'finns;
| ^
error: finite is not a function
../examples/x86.mm1:3270:3:
|
3270 | @(add-eval) def exSysCall: nat = $ 0 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:3272:3:
|
3272 | @(add-eval) def exGPF: nat = $ 1 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:3274:3:
|
3274 | @(add-eval) def exUD: nat = $ 2 $;
| ^
error: Reference to unbound variable 'add-eval'
../examples/x86.mm1:3275:56:
|
3275 | pub theorem exSysCallT: $ exSysCall e. Exception $ = '(mpbir elupto d0lt3);
| ^
error: unknown theorem/hypothesis 'mpbir'
../examples/x86.mm1:3276:49:
|
3276 | pub theorem exGPF_T: $ exGPF e. Exception $ = '(mpbir elupto d1lt3);
| ^
error: unknown theorem/hypothesis 'mpbir'
../examples/x86.mm1:3277:47:
|
3277 | pub theorem exUD_T: $ exUD e. Exception $ = '(mpbir elupto d2lt3);
| ^
error: unknown theorem/hypothesis 'mpbir'
../examples/x86.mm1:3287:1:
|
3287 | @_ def Config: set = $ Xp (Xp (Option Exception) u64) (Xp (Arrow Regs u64) (Xp Flags Memory)) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3287:24:
|
3287 | @_ def Config: set = $ Xp (Xp (Option Exception) u64) (Xp (Arrow Regs u64) (Xp Flags Memory)) $;
| ^
error: Xp is not a function
../examples/x86.mm1:3288:29:
|
3288 | pub theorem finiteConfig: $ finite Config $ =
| ^
error: finite is not a function
../examples/x86.mm1:3291:1:
|
3291 | @_ def mkCfg (ex rip regs flags mem: nat): nat = $ (ex, rip), regs, flags, mem $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3291:57:
|
3291 | @_ def mkCfg (ex rip regs flags mem: nat): nat = $ (ex, rip), regs, flags, mem $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:3293:43:
|
3293 | $ mkCfg ex rip regs flags mem e. Config <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3298:49:
|
3298 | theorem mkCfg_ex: $ E. e E. i E. rs E. f E. m k = mkCfg e i rs f m $ =
| ^
error: unexpected '='
expecting '$', infix >= 0, or infix >= 41
../examples/x86.mm1:3303:1:
|
3303 | @_ def readException (k: nat): nat = $ pi11 k $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3303:40:
|
3303 | @_ def readException (k: nat): nat = $ pi11 k $;
| ^
error: pi11 is not a function
../examples/x86.mm1:3304:1:
|
3304 | @_ def readRIP (k: nat): nat = $ pi12 k $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3304:34:
|
3304 | @_ def readRIP (k: nat): nat = $ pi12 k $;
| ^
error: pi12 is not a function
../examples/x86.mm1:3305:1:
|
3305 | @_ def readReg (k r: nat): nat = $ pi21 k @ r $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3305:43:
|
3305 | @_ def readReg (k r: nat): nat = $ pi21 k @ r $;
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/x86.mm1:3306:1:
|
3306 | @_ def readFlags (k: nat): nat = $ pi221 k $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3306:36:
|
3306 | @_ def readFlags (k: nat): nat = $ pi221 k $;
| ^
error: pi221 is not a function
../examples/x86.mm1:3307:1:
|
3307 | @_ def getMemory (k: nat): nat = $ pi222 k $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3307:36:
|
3307 | @_ def getMemory (k: nat): nat = $ pi222 k $;
| ^
error: pi222 is not a function
../examples/x86.mm1:3308:1:
|
3308 | @_ def readCond (k c: nat): wff = $ readCondF (readFlags k) c $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3308:37:
|
3308 | @_ def readCond (k c: nat): wff = $ readCondF (readFlags k) c $;
| ^
error: readCondF is not a function
../examples/x86.mm1:3309:61:
|
3309 | theorem readException_mk: $ readException (mkCfg e i r f m) = e $ = 'pi11pr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3310:49:
|
3310 | theorem readRIP_mk: $ readRIP (mkCfg e i r f m) = i $ = 'pi12pr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3311:51:
|
3311 | theorem readReg_mk: $ readReg (mkCfg e i r f m) a = r @ a $ = '(appneq1 pi21pr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3312:53:
|
3312 | theorem readFlags_mk: $ readFlags (mkCfg e i r f m) = f $ = 'pi221pr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3313:53:
|
3313 | theorem getMemory_mk: $ getMemory (mkCfg e i r f m) = m $ = 'pi222pr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3315:55:
|
3315 | pub theorem readExceptionT (k: nat): $ k e. Config -> readException k e. Option Exception $ =
| ^
error: readException is not a function
../examples/x86.mm1:3317:50:
|
3317 | pub theorem readRIP_T (k: nat): $ k e. Config -> readRIP k e. u64 $ =
| ^
error: readRIP is not a function
../examples/x86.mm1:3319:48:
|
3319 | pub theorem readRegT (k r: nat): $ k e. Config /\ r e. Regs -> readReg k r e. u64 $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3321:51:
|
3321 | pub theorem readFlagsT (k: nat): $ k e. Config -> readFlags k e. Flags $ =
| ^
error: readFlags is not a function
../examples/x86.mm1:3323:51:
|
3323 | pub theorem getMemoryT (k: nat): $ k e. Config -> getMemory k e. Memory $ =
| ^
error: getMemory is not a function
../examples/x86.mm1:3326:1:
|
3326 | @_ def readMemory1 (ps m a b .prot: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3327:15:
|
3327 | $ m e. Memory /\ a e. u64 /\ E. prot (m @ a = prot, b /\ ps C_ prot) $;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3329:40:
|
3329 | $ readMemory1 ps m a b -> ps e. Prot /\ m e. Memory /\ a e. u64 /\ b e. u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3334:1:
|
3334 | @_ local def readMemory_aux (ps m l: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3335:16:
|
3335 | $ lrec u64 (\\ b, \\ z, \ ih, sep u64 {a | readMemory1 ps m a b /\ a +_64 1 e. ih}) l $;
| ^
error: expecting (
../examples/x86.mm1:3337:1:
|
3337 | @_ abstract def readMemory (ps m a l: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3338:14:
|
3338 | $ ps e. Prot /\ m e. Memory /\ a e. readMemory_aux ps m l $;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3340:23:
|
3340 | $ readMemory ps m a 0 <-> ps e. Prot /\ m e. Memory /\ a e. u64 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:3343:28:
|
3343 | $ readMemory ps m a (b : l) <->
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:3353:39:
|
3353 | $ readMemory ps m a l -> ps e. Prot /\ m e. Memory /\ a e. u64 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3361:1:
|
3361 | @_ def readMem (k a l: nat): wff = $ k e. Config /\ readMemory PROT_READ (getMemory k) a l $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3361:50:
|
3361 | @_ def readMem (k a l: nat): wff = $ k e. Config /\ readMemory PROT_READ (getMemory k) a l $;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3363:34:
|
3363 | $ readMem k a l -> k e. Config /\ a e. u64 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3366:1:
|
3366 | @_ def readMemX (k a l: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3367:15:
|
3367 | $ k e. Config /\ readMemory (PROT_READ + PROT_EXEC) (getMemory k) a l $;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3369:35:
|
3369 | $ readMemX k a l -> k e. Config /\ a e. u64 /\ l e. List u8 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3372:1:
|
3372 | @_ def writeMemory1 (m a b m2 e .prot .b2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3373:15:
|
3373 | $ m e. Memory /\ a e. u64 /\ b e. u8 /\
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3381:18:
|
3381 | (h5: $ G -> m2 == write m a (prot, b) $): $ G -> m2 e. Memory $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3385:17:
|
3385 | m e. Memory /\ a e. u64 /\ b e. u8 /\
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3399:17:
|
3399 | m e. Memory /\ a e. u64 /\ b e. u8 /\
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3403:1:
|
3403 | @_ local def setMem1 (m a b: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3404:19:
|
3404 | $ if (PROT_READ + PROT_WRITE C_ fst (m @ a))
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:3408:57:
|
3408 | theorem writeMemory1_setMem1: $ writeMemory1 m a b m2 e <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3419:35:
|
3419 | theorem setMem1_T2: $ m e. Memory /\ a e. u64 /\ b e. u8 ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3424:34:
|
3424 | theorem setMem1_T: $ m e. Memory /\ a e. u64 /\ b e. u8 ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3428:1:
|
3428 | @_ local def setMemAux (l: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3430:7:
|
3430 | (\. m e. lower Memory, \. a e. u64, m, 0)
| ^
error: expecting (
../examples/x86.mm1:3436:1:
|
3436 | @_ local def setMem (m a l: nat): nat = $ setMemAux l @ m @ a $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3436:55:
|
3436 | @_ local def setMem (m a l: nat): nat = $ setMemAux l @ m @ a $;
| ^
error: unexpected '@'
expecting '$' or infix >= 0
../examples/x86.mm1:3438:32:
|
3438 | theorem setMem0: $ m e. Memory /\ a e. u64 -> setMem m a 0 = m, 0 $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3443:32:
|
3443 | theorem setMemS: $ m e. Memory /\ a e. u64 ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3453:32:
|
3453 | theorem setMemT: $ m e. Memory /\ a e. u64 /\ l e. List u8 ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3468:33:
|
3468 | theorem setMemT2: $ m e. Memory /\ a e. u64 /\ l e. List u8 ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3473:1:
|
3473 | @_ abstract def writeMemory (m a l m2 e: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3474:15:
|
3474 | $ m e. Memory /\ a e. u64 /\ l e. List u8 /\ setMem m a l = m2, e $;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3477:17:
|
3477 | $ m e. Memory /\ a e. u64 ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3483:17:
|
3483 | $ m e. Memory /\ a e. u64 /\ b e. u8 /\ l e. List u8 ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3501:17:
|
3501 | m e. Memory /\ a e. u64 /\ l e. List u8 /\ m2 e. Memory /\ e e. Option (sn exGPF) $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3506:17:
|
3506 | m e. Memory /\ a e. u64 /\ l e. List u8 /\ m2 e. Memory /\ e e. Option Exception $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3510:21:
|
3510 | $ writeMemory m a 0 m2 e <-> m e. Memory /\ a e. u64 /\ m2 = m /\ e = 0 $ =
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:3514:26:
|
3514 | $ writeMemory m a (b : l) m3 e <->
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:3523:1:
|
3523 | @_ def writeMem (k a l k2 .ip .r .f .m .m2 .e: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3524:15:
|
3524 | $ k e. Config /\ a e. u64 /\ l e. List u8 /\
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3528:38:
|
3528 | $ writeMem k a l k2 -> k e. Config /\ a e. u64 /\ l e. List u8 /\ k2 e. Config $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3535:1:
|
3535 | @_ local def setMemory (k m: nat): nat = $ fst k, pi21 k, pi221 k, m $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3535:49:
|
3535 | @_ local def setMemory (k m: nat): nat = $ fst k, pi21 k, pi221 k, m $;
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/x86.mm1:3537:17:
|
3537 | $ k e. Config /\ m e. Memory -> setMemory k m e. Config $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3539:57:
|
3539 | theorem setMemory_mk: $ setMemory (mkCfg e ip r f m) m2 = mkCfg e ip r f m2 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3541:66:
|
3541 | theorem readException_setMemory: $ readException (setMemory k m) = readException k $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3543:54:
|
3543 | theorem readRIP_setMemory: $ readRIP (setMemory k m) = readRIP k $ = '(sndeq fstpr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3544:56:
|
3544 | theorem readReg_setMemory: $ readReg (setMemory k m) r = readReg k r $ = '(appneq1 pi21pr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3545:58:
|
3545 | theorem readFlags_setMemory: $ readFlags (setMemory k m) = readFlags k $ = 'pi221pr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3546:53:
|
3546 | theorem get_setMemory: $ getMemory (setMemory k m2) = m2 $ = 'pi222pr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3547:56:
|
3547 | theorem set_setMemory: $ setMemory (setMemory k m2) m3 = setMemory k m3 $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3549:52:
|
3549 | theorem set_getMemory: $ setMemory k (getMemory k) = k $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3552:1:
|
3552 | @_ def EA: set = $ Sum u64 (Sum Regs u64) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3552:20:
|
3552 | @_ def EA: set = $ Sum u64 (Sum Regs u64) $;
| ^
error: Sum is not a function
../examples/x86.mm1:3553:1:
|
3553 | @_ def EA_i (q: nat): nat = $ b0 q $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3553:31:
|
3553 | @_ def EA_i (q: nat): nat = $ b0 q $;
| ^
error: b0 is not a function
../examples/x86.mm1:3554:1:
|
3554 | @_ def EA_r (r: nat): nat = $ b1 (b0 r) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3554:31:
|
3554 | @_ def EA_r (r: nat): nat = $ b1 (b0 r) $;
| ^
error: b1 is not a function
../examples/x86.mm1:3555:1:
|
3555 | @_ def EA_m (q: nat): nat = $ b1 (b1 q) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3555:31:
|
3555 | @_ def EA_m (q: nat): nat = $ b1 (b1 q) $;
| ^
error: b1 is not a function
../examples/x86.mm1:3556:44:
|
3556 | pub theorem EA_iT (q: nat): $ EA_i q e. EA <-> q e. u64 $ = 'Suml;
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3557:44:
|
3557 | pub theorem EA_rT (r: nat): $ EA_r r e. EA <-> r e. Regs $ = '(bitr Sumr Suml);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3558:44:
|
3558 | pub theorem EA_mT (q: nat): $ EA_m q e. EA <-> q e. u64 $ = '(bitr Sumr Sumr);
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3560:1:
|
3560 | @_ abstract def EA_addr (ea: nat): nat = $ if (E. a ea = EA_m a) (ea // 2 // 2) 0 $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3560:58:
|
3560 | @_ abstract def EA_addr (ea: nat): nat = $ if (E. a ea = EA_m a) (ea // 2 // 2) 0 $;
| ^
error: expecting ), infix >= 0, or infix >= 41
../examples/x86.mm1:3561:51:
|
3561 | pub theorem EA_addrm (a: nat): $ EA_addr (EA_m a) = a $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3563:56:
|
3563 | pub theorem EA_addr0 {a: nat} (ea: nat): $ ~(E. a ea = EA_m a) -> EA_addr ea = 0 $ = 'ifneg;
| ^
error: expecting ), infix >= 0, or infix >= 41
../examples/x86.mm1:3564:47:
|
3564 | pub theorem EA_addrT (ea: nat): $ ea e. EA -> EA_addr ea e. u64 $ =
| ^
error: EA_addr is not a function
../examples/x86.mm1:3570:1:
|
3570 | @_ abstract def readIndex (k si: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3571:16:
|
3571 | $ obind si (\\ sc, \ r, chop 64 (shl (readReg k r) sc)) $;
| ^
error: expecting (
../examples/x86.mm1:3572:48:
|
3572 | pub theorem readIndex0 (k: nat): $ readIndex k 0 = 0 $ = (named 'obind0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:3574:27:
|
3574 | $ readIndex k (suc (sc, r)) = chop 64 (shl (readReg k r) sc) $ =
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:3577:17:
|
3577 | $ k e. Config /\ si e. Option ScaleIndex -> readIndex k si e. u64 $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3583:1:
|
3583 | @_ abstract def readBase (k b: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3584:33:
|
3584 | $ obind b (ocase (readRIP k) (\ r, readReg k r)) $;
| ^
error: expecting (
../examples/x86.mm1:3585:46:
|
3585 | pub theorem readBase0 (k: nat): $ readBase k 0 = 0 $ = (named 'obind0);
| ^
error: unexpected '0'
expecting '$' or infix >= 0
../examples/x86.mm1:3586:57:
|
3586 | pub theorem readBaseRIP (k: nat): $ readBase k base_RIP = readRIP k $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3588:63:
|
3588 | pub theorem readBaseReg (k r: nat): $ readBase k (base_reg r) = readReg k r $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3591:17:
|
3591 | $ k e. Config /\ b e. Base -> readBase k b e. u64 $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3599:1:
|
3599 | @_ abstract def RM_EA (k rm: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3601:8:
|
3601 | (\ r, EA_r r)
| ^
error: expecting (
../examples/x86.mm1:3604:55:
|
3604 | pub theorem RM_EAreg (k r: nat): $ RM_EA k (RM_reg r) = EA_r r $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3606:71:
|
3606 | pub theorem RM_EAmem (k si base q: nat): $ RM_EA k (RM_mem si base q) =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3611:17:
|
3611 | $ k e. Config /\ rm e. RM -> RM_EA k rm e. EA $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3618:1:
|
3618 | @_ abstract def immRM_EA (k irm: nat): nat = $ case (\ rm, RM_EA k rm) (\ q, EA_i q) @ irm $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3618:56:
|
3618 | @_ abstract def immRM_EA (k irm: nat): nat = $ case (\ rm, RM_EA k rm) (\ q, EA_i q) @ irm $;
| ^
error: expecting (
../examples/x86.mm1:3619:64:
|
3619 | pub theorem immRM_EArm (k rm: nat): $ immRM_EA k (immRM_rm rm) = RM_EA k rm $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3621:57:
|
3621 | theorem immRM_EAreg: $ immRM_EA k (immRM_rm (RM_reg r)) = EA_r r $ = '(eqtr immRM_EArm RM_EAreg);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3622:64:
|
3622 | pub theorem immRM_EAimm (k q: nat): $ immRM_EA k (immRM_imm q) = EA_i q $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3624:52:
|
3624 | pub theorem immRM_EA_T (k irm: nat): $ k e. Config /\ irm e. ImmRM -> immRM_EA k irm e. EA $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3631:1:
|
3631 | @_ local def destsrcIRM (ds: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3632:12:
|
3632 | $ case (\\ v, case
| ^
error: expecting (
../examples/x86.mm1:3636:59:
|
3636 | theorem destsrcIRMm_i (v q: nat): $ destsrcIRM (Rm_i v q) = v, immRM_imm q $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3638:59:
|
3638 | theorem destsrcIRMm_r (v r: nat): $ destsrcIRM (Rm_r v r) = v, immRM_rm (RM_reg r) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3640:61:
|
3640 | theorem destsrcIRM_rm (r rm: nat): $ destsrcIRM (R_rm r rm) = RM_reg r, immRM_rm rm $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3643:22:
|
3643 | $ ds e. DestSrc -> destsrcIRM ds e. Xp RM ImmRM $ =
| ^
error: destsrcIRM is not a function
../examples/x86.mm1:3657:1:
|
3657 | @_ local def destRM (ds: nat): nat = $ fst (destsrcIRM ds) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3657:40:
|
3657 | @_ local def destRM (ds: nat): nat = $ fst (destsrcIRM ds) $;
| ^
error: fst is not a function
../examples/x86.mm1:3658:51:
|
3658 | theorem destRMm_i (v q: nat): $ destRM (Rm_i v q) = v $ = '(eqtr (fsteq destsrcIRMm_i) fstpr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3659:51:
|
3659 | theorem destRMm_r (v r: nat): $ destRM (Rm_r v r) = v $ = '(eqtr (fsteq destsrcIRMm_r) fstpr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3660:53:
|
3660 | theorem destRM_rm (r rm: nat): $ destRM (R_rm r rm) = RM_reg r $ = '(eqtr (fsteq destsrcIRM_rm) fstpr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3661:48:
|
3661 | theorem destRM_T (ds: nat): $ ds e. DestSrc -> destRM ds e. RM $ = '(syl xpfst destsrcIRM_T);
| ^
error: destRM is not a function
../examples/x86.mm1:3663:1:
|
3663 | @_ local def srcIRM (ds: nat): nat = $ snd (destsrcIRM ds) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3663:40:
|
3663 | @_ local def srcIRM (ds: nat): nat = $ snd (destsrcIRM ds) $;
| ^
error: snd is not a function
../examples/x86.mm1:3664:51:
|
3664 | theorem srcIRMm_i (v q: nat): $ srcIRM (Rm_i v q) = immRM_imm q $ = '(eqtr (sndeq destsrcIRMm_i) sndpr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3665:51:
|
3665 | theorem srcIRMm_r (v r: nat): $ srcIRM (Rm_r v r) = immRM_rm (RM_reg r) $ = '(eqtr (sndeq destsrcIRMm_r) snd
pr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3666:53:
|
3666 | theorem srcIRM_rm (r rm: nat): $ srcIRM (R_rm r rm) = immRM_rm rm $ = '(eqtr (sndeq destsrcIRM_rm) sndpr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3667:48:
|
3667 | theorem srcIRM_T (ds: nat): $ ds e. DestSrc -> srcIRM ds e. ImmRM $ = '(syl xpsnd destsrcIRM_T);
| ^
error: srcIRM is not a function
../examples/x86.mm1:3669:1:
|
3669 | @_ abstract def destEA (k ds: nat): nat = $ RM_EA k (destRM ds) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3669:45:
|
3669 | @_ abstract def destEA (k ds: nat): nat = $ RM_EA k (destRM ds) $;
| ^
error: RM_EA is not a function
../examples/x86.mm1:3670:59:
|
3670 | pub theorem destEAm_i (k v q: nat): $ destEA k (Rm_i v q) = RM_EA k v $ = '(RM_EAeq2 destRMm_i);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3671:59:
|
3671 | pub theorem destEAm_r (k v r: nat): $ destEA k (Rm_r v r) = RM_EA k v $ = '(RM_EAeq2 destRMm_r);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3672:61:
|
3672 | pub theorem destEA_rm (k r rm: nat): $ destEA k (R_rm r rm) = EA_r r $ = '(eqtr (RM_EAeq2 destRM_rm) RM_EAre
g);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3673:49:
|
3673 | pub theorem destEA_T (k ds: nat): $ k e. Config /\ ds e. DestSrc -> destEA k ds e. EA $ = '(syl RM_EA_T @ an
im2 destRM_T);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3675:1:
|
3675 | @_ abstract def srcEA (k ds: nat): nat = $ immRM_EA k (srcIRM ds) $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3675:44:
|
3675 | @_ abstract def srcEA (k ds: nat): nat = $ immRM_EA k (srcIRM ds) $;
| ^
error: immRM_EA is not a function
../examples/x86.mm1:3676:57:
|
3676 | pub theorem srcEAm_i (k v q: nat): $ srcEA k (Rm_i v q) = EA_i q $ = '(eqtr (immRM_EAeq2 srcIRMm_i) immRM_EA
imm);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3677:57:
|
3677 | pub theorem srcEAm_r (k v r: nat): $ srcEA k (Rm_r v r) = EA_r r $ = '(eqtr (immRM_EAeq2 srcIRMm_r) immRM_EA
reg);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3678:59:
|
3678 | pub theorem srcEA_rm (k r rm: nat): $ srcEA k (R_rm r rm) = RM_EA k rm $ = '(eqtr (immRM_EAeq2 srcIRM_rm) im
mRM_EArm);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3679:48:
|
3679 | pub theorem srcEA_T (k ds: nat): $ k e. Config /\ ds e. DestSrc -> srcEA k ds e. EA $ = '(syl immRM_EA_T @ a
nim2 srcIRM_T);
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3681:1:
|
3681 | @_ def readRegSz (k sz r: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3683:15:
|
3683 | (if (sz = wSz8 F. /\ 2 e. r) (shr (readReg k (r - 4)) 8) (readReg k r)) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:3684:24:
|
3684 | theorem readRegSzT2: $ readRegSz k sz r e. Bits (wsizeBits sz) $ = 'chopT;
| ^
error: readRegSz is not a function
../examples/x86.mm1:3686:17:
|
3686 | $ k e. Config /\ sz e. WSize /\ r e. Regs ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3689:1:
|
3689 | @_ abstract def readEA (k sz ea v: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3690:15:
|
3690 | $ k e. Config /\ ea e. EA /\ sz e. WSize /\
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3696:28:
|
3696 | $ readEA k sz (EA_i q) v <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3700:28:
|
3700 | $ readEA k sz (EA_r r) v <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3704:28:
|
3704 | $ readEA k sz (EA_m a) v <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3709:17:
|
3709 | $ k e. Config /\ q e. u64 /\ sz e. WSize ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3712:17:
|
3712 | $ k e. Config /\ r e. Regs /\ sz e. WSize ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3715:17:
|
3715 | $ k e. Config /\ a e. u64 /\ sz e. WSize ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3720:15:
|
3720 | k e. Config /\ ea e. EA /\ sz e. WSize /\ v e. Bits (wsizeBits sz) $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3730:15:
|
3730 | k e. Config /\ ea e. EA /\ sz e. WSize /\ v e. u64 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3733:1:
|
3733 | @_ def readEA64 (k ea v: nat): wff = $ readEA k wSz64 ea v $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3733:40:
|
3733 | @_ def readEA64 (k ea v: nat): wff = $ readEA k wSz64 ea v $;
| ^
error: readEA is not a function
../examples/x86.mm1:3735:15:
|
3735 | k e. Config /\ ea e. EA /\ v e. u64 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3738:1:
|
3738 | @_ def setException (k e: nat): nat = $ (e, readRIP k), snd k $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3738:45:
|
3738 | @_ def setException (k e: nat): nat = $ (e, readRIP k), snd k $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:3740:41:
|
3740 | $ setException (mkCfg ex ip rs f m) e = mkCfg e ip rs f m $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3743:17:
|
3743 | $ k e. Config /\ e e. Option Exception -> setException k e e. Config $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3748:63:
|
3748 | theorem setException_mk: $ setException (mkCfg e ip r f m) e2 = mkCfg e2 ip r f m $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3750:61:
|
3750 | theorem getMem_setException: $ getMemory (setException k e) = getMemory k $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3752:63:
|
3752 | theorem read_setException: $ readException (setException k e) = e $ = 'pi11pr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3753:60:
|
3753 | theorem readRIP_setException: $ readRIP (setException k e) = readRIP k $ = 'pi12pr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3754:62:
|
3754 | theorem readReg_setException: $ readReg (setException k e) r = readReg k r $ = '(appneq1 @ fsteq sndpr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3755:64:
|
3755 | theorem readFlags_setException: $ readFlags (setException k e) = readFlags k $ = '(pi21eq sndpr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3756:64:
|
3756 | theorem getMemory_setException: $ getMemory (setException k e) = getMemory k $ = '(pi22eq sndpr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3759:30:
|
3759 | $ setMem (getMemory k) a l = m2, e ->
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3781:1:
|
3781 | @_ abstract def setReg (k r q: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3782:8:
|
3782 | $ fst k, lower (write (pi21 k) r q), pi22 k $;
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/x86.mm1:3784:37:
|
3784 | $ setReg (mkCfg ex ip rs f m) r q = mkCfg ex ip (lower (write rs r q)) f m $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3787:17:
|
3787 | $ k e. Config /\ r e. Regs /\ q e. u64 -> setReg k r q e. Config $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3794:47:
|
3794 | theorem setRegMem: $ getMemory (setReg k r q) = getMemory k $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3797:50:
|
3797 | theorem readRIP_setReg: $ readRIP (setReg k r q) = readRIP k $ = '(sndeq fstpr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3798:54:
|
3798 | theorem readFlags_setReg: $ readFlags (setReg k r q) = readFlags k $ = '(fsteq pi22pr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3799:54:
|
3799 | theorem getMemory_setReg: $ getMemory (setReg k r q) = getMemory k $ = '(sndeq pi22pr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3800:62:
|
3800 | theorem readException_setReg: $ readException (setReg k r q) = readException k $ = '(fsteq fstpr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3801:30:
|
3801 | theorem read_setReg_ne: $ r2 != r -> readReg (setReg k r q) r2 = readReg k r2 $ =
| ^
error: unexpected '!'
expecting '$' or infix >= 0
../examples/x86.mm1:3803:49:
|
3803 | theorem read_setReg: $ readReg (setReg k r q) r = q $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3806:1:
|
3806 | @_ abstract def writeReg (k sz r v: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3807:22:
|
3807 | $ if (wsizeBits sz = 8)
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:3813:36:
|
3813 | $ writeReg k (wSz8 have_rex) r v = if (~have_rex /\ 2 e. r)
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3818:26:
|
3818 | $ writeReg k wSz16 r v = setReg k r (bitsUpdate 0 16 v (readReg k r)) $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3820:27:
|
3820 | theorem writeReg_gt: $ 16 < wsizeBits sz -> writeReg k sz r v = setReg k r v $ =
| ^
error: expecting (
../examples/x86.mm1:3822:61:
|
3822 | pub theorem writeReg32 (k r v: nat): $ writeReg k wSz32 r v = setReg k r v $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3824:61:
|
3824 | pub theorem writeReg64 (k r v: nat): $ writeReg k wSz64 r v = setReg k r v $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3826:54:
|
3826 | pub theorem writeRegT (k sz r v: nat): $ k e. Config /\ sz e. WSize /\
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3844:1:
|
3844 | @_ abstract def writeEASz (k sz ea v k2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3845:15:
|
3845 | $ k e. Config /\ sz e. WSize /\ ea e. EA /\ v e. Bits (wsizeBits sz) /\
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3848:49:
|
3848 | pub theorem writeEASz_i (k sz i v k2: nat): $ ~ writeEASz k sz (EA_i i) v k2 $ =
| ^
error: writeEASz is not a function
../examples/x86.mm1:3852:34:
|
3852 | $ writeEASz k sz (EA_r r) v k2 <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3857:34:
|
3857 | $ writeEASz k sz (EA_m a) v k2 <->
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3862:17:
|
3862 | $ k e. Config /\ sz e. WSize /\ r e. Regs /\ v e. Bits (wsizeBits sz) ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3866:17:
|
3866 | $ k e. Config /\ sz e. WSize /\ a e. u64 /\ v e. Bits (wsizeBits sz) ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3872:17:
|
3872 | k e. Config /\ sz e. WSize /\ ea e. EA /\ v e. Bits (wsizeBits sz) /\
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3882:1:
|
3882 | @_ def writeEA (k sz ea v k2: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3883:12:
|
3883 | $ v e. u64 /\ writeEASz k sz ea (chop (wsizeBits sz) v) k2 $;
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3886:17:
|
3886 | k e. Config /\ sz e. WSize /\ ea e. EA /\ v e. u64 /\
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3889:1:
|
3889 | @_ abstract def writeRIP (k q: nat): nat = $ (pi11 k, q), snd k $;
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3889:55:
|
3889 | @_ abstract def writeRIP (k q: nat): nat = $ (pi11 k, q), snd k $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:3891:37:
|
3891 | $ writeRIP (mkCfg ex ip rs f m) q = mkCfg ex q rs f m $ = '(preq (preq1 pi11pr) sndpr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3893:17:
|
3893 | $ k e. Config /\ q e. u64 -> writeRIP k q e. Config $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3899:49:
|
3899 | theorem read_writeRIP: $ readRIP (writeRIP k v) = v $ = 'pi12pr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3900:54:
|
3900 | theorem readReg_writeRIP: $ readReg (writeRIP k v) r = readReg k r $ = '(appneq1 @ fsteq sndpr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3901:56:
|
3901 | theorem readFlags_writeRIP: $ readFlags (writeRIP k v) = readFlags k $ = '(pi21eq sndpr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3902:56:
|
3902 | theorem getMemory_writeRIP: $ getMemory (writeRIP k v) = getMemory k $ = '(pi22eq sndpr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3903:64:
|
3903 | theorem readException_writeRIP: $ readException (writeRIP k v) = readException k $ = 'pi11pr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3905:1:
|
3905 | @_ abstract def EA_callDest (k ea v: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3906:15:
|
3906 | $ k e. Config /\ ea e. EA /\
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3910:30:
|
3910 | $ EA_callDest k (EA_i i) v <-> k e. Config /\ i e. u64 /\ v = readRIP k +_64 i $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3913:30:
|
3913 | $ EA_callDest k (EA_r r) v <-> k e. Config /\ r e. Regs /\ v = readReg k r $ =
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3916:30:
|
3916 | $ EA_callDest k (EA_m a) v <-> k e. Config /\ a e. u64 /\
| ^
error: unexpected '<'
expecting '$' or infix >= 0
../examples/x86.mm1:3920:17:
|
3920 | $ k e. Config /\ i e. u64 -> (EA_callDest k (EA_i i) v <-> v = readRIP k +_64 i) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3923:17:
|
3923 | $ k e. Config /\ r e. Regs -> (EA_callDest k (EA_r r) v <-> v = readReg k r) $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3926:17:
|
3926 | $ k e. Config /\ a e. u64 ->
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3930:39:
|
3930 | $ EA_callDest k ea v -> k e. Config /\ ea e. EA /\ v e. u64 $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3939:1:
|
3939 | @_ def EA_jump (k ea k2 .v: nat): wff =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3940:31:
|
3940 | $ E. v (EA_callDest k ea v /\ k2 = writeRIP k v) $;
| ^
error: expecting ) or infix >= 0
../examples/x86.mm1:3942:36:
|
3942 | $ EA_jump k ea k2 -> k e. Config /\ ea e. EA /\ k2 e. Config $ =
| ^
error: unexpected '/'
expecting '$', infix >= 0, or infix >= 50
../examples/x86.mm1:3946:1:
|
3946 | @_ abstract def writeFlags (k f: nat): nat =
| ^
error: Unknown function 'annotate'
../examples/x86.mm1:3947:8:
|
3947 | $ fst k, pi21 k, f, pi222 k $;
| ^
error: unexpected ','
expecting '$' or infix >= 0
../examples/x86.mm1:3949:40:
|
3949 | $ writeFlags (mkCfg ex ip rs f m) f2 = mkCfg ex ip rs f2 m $ =
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3952:17:
|
3952 | $ k e. Config /\ f e. Flags -> writeFlags k f e. Config $ =
| ^
error: unexpected '/'
expecting '$' or infix >= 0
../examples/x86.mm1:3958:56:
|
3958 | theorem readRIP_writeFlags: $ readRIP (writeFlags k f) = readRIP k $ = '(sndeq fstpr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3959:58:
|
3959 | theorem readReg_writeFlags: $ readReg (writeFlags k f) r = readReg k r $ = '(appneq1 pi21pr);
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3960:55:
|
3960 | theorem read_writeFlags: $ readFlags (writeFlags k f) = f $ = 'pi221pr;
| ^
error: unexpected '='
expecting '$' or infix >= 0
../examples/x86.mm1:3961:60:
|
3961 | theorem getMemory_writeFlags: $ getMemory (writeFlags k f) = getMemory k $ = 'pi222pr;
|
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment