tla-ts 0.0.4-dev.0be9567 → 0.0.4-dev.2a873ee
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +37 -126
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +33 -1
- package/dist/index.d.ts +33 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +996 -0
- package/dist/prove.js +996 -0
- package/dist/run-cli.cjs +37 -47
- package/dist/run-cli.js +37 -47
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +38 -44
- package/dist/transfer.js +38 -44
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/ast.ts +2 -2
- package/src/check.ts +1 -0
- package/src/cli-options.ts +1 -1
- package/src/errors.ts +88 -29
- package/src/evaluate.ts +56 -21
- package/src/index.ts +10 -0
- package/src/live-check.ts +1 -1
- package/src/{obligation-action.ts → obligations/action.ts} +247 -69
- package/src/{obligation-anon.ts → obligations/anon.ts} +49 -47
- package/src/obligations/ctx.ts +64 -0
- package/src/{obligation-deref.ts → obligations/deref.ts} +51 -92
- package/src/{obligation-expression.ts → obligations/expression.ts} +117 -57
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/{obligation-generate.ts → obligations/generate.ts} +170 -192
- package/src/{obligations.ts → obligations/index.ts} +32 -16
- package/src/{obligation-levels.ts → obligations/levels.ts} +26 -28
- package/src/{obligation-module.ts → obligations/module.ts} +113 -121
- package/src/obligations/pickle.ts +98 -0
- package/src/obligations/pragma.ts +189 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
- package/src/{obligation-source.ts → obligations/source.ts} +154 -99
- package/src/obligations/temporal.ts +321 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
- package/src/ocaml-marshal.ts +166 -0
- package/src/parallel-worker.ts +2 -18
- package/src/parallel.ts +10 -43
- package/src/prove/decide-pool.ts +95 -0
- package/src/prove/deciders.ts +33 -0
- package/src/prove/first-order.ts +78 -0
- package/src/prove/isabelle/LICENSE +36 -0
- package/src/prove/isabelle/LICENSE-tlapm +26 -0
- package/src/prove/isabelle/decide.ts +47 -0
- package/src/prove/isabelle/encode.ts +446 -0
- package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prove/isabelle/isar/method.ts +367 -0
- package/src/prove/isabelle/isar/proof.ts +28 -0
- package/src/prove/isabelle/isar/statement.ts +57 -0
- package/src/prove/isabelle/isar/theory.ts +192 -0
- package/src/prove/isabelle/isar/type-check.ts +278 -0
- package/src/prove/isabelle/provers/blast/blast.ts +258 -0
- package/src/prove/isabelle/provers/blast/branch.ts +322 -0
- package/src/prove/isabelle/provers/blast/prove.ts +347 -0
- package/src/prove/isabelle/provers/blast/rules.ts +330 -0
- package/src/prove/isabelle/provers/blast/state.ts +180 -0
- package/src/prove/isabelle/provers/blast/term.ts +546 -0
- package/src/prove/isabelle/provers/clasimp.ts +150 -0
- package/src/prove/isabelle/provers/classical.ts +389 -0
- package/src/prove/isabelle/provers/hypsubst.ts +433 -0
- package/src/prove/isabelle/pure/bicompose.ts +174 -0
- package/src/prove/isabelle/pure/consts.ts +32 -0
- package/src/prove/isabelle/pure/conv.ts +79 -0
- package/src/prove/isabelle/pure/drule.ts +264 -0
- package/src/prove/isabelle/pure/envir.ts +331 -0
- package/src/prove/isabelle/pure/goal.ts +53 -0
- package/src/prove/isabelle/pure/interrupt.ts +16 -0
- package/src/prove/isabelle/pure/list.ts +12 -0
- package/src/prove/isabelle/pure/logic.ts +330 -0
- package/src/prove/isabelle/pure/name.ts +98 -0
- package/src/prove/isabelle/pure/net.ts +215 -0
- package/src/prove/isabelle/pure/object-logic.ts +41 -0
- package/src/prove/isabelle/pure/pattern.ts +631 -0
- package/src/prove/isabelle/pure/raw-simplifier.ts +338 -0
- package/src/prove/isabelle/pure/rewriter.ts +602 -0
- package/src/prove/isabelle/pure/search.ts +68 -0
- package/src/prove/isabelle/pure/seq.ts +133 -0
- package/src/prove/isabelle/pure/simplifier.ts +106 -0
- package/src/prove/isabelle/pure/table.ts +201 -0
- package/src/prove/isabelle/pure/tactic.ts +168 -0
- package/src/prove/isabelle/pure/tactical.ts +264 -0
- package/src/prove/isabelle/pure/term-ord.ts +105 -0
- package/src/prove/isabelle/pure/term.ts +688 -0
- package/src/prove/isabelle/pure/thm.ts +783 -0
- package/src/prove/isabelle/pure/type.ts +121 -0
- package/src/prove/isabelle/pure/unify.ts +753 -0
- package/src/prove/isabelle/pure/variable.ts +25 -0
- package/src/prove/isabelle/tla/classical-setup.ts +101 -0
- package/src/prove/isabelle/tla/context.ts +74 -0
- package/src/prove/isabelle/tla/logic-data.ts +5 -0
- package/src/prove/isabelle/tla/logic.ts +215 -0
- package/src/prove/isabelle/tla/simpdata.ts +241 -0
- package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prove/ocaml.ts +22 -0
- package/src/prove/prep/action.ts +508 -0
- package/src/prove/prep/defs.ts +33 -0
- package/src/prove/prep/elab.ts +156 -0
- package/src/prove/prep/enabled-axioms.ts +189 -0
- package/src/prove/prep/enabled.ts +43 -0
- package/src/prove/prep/fingerprint.ts +388 -0
- package/src/prove/prep/flatten.ts +70 -0
- package/src/prove/prep/level-comparison.ts +529 -0
- package/src/prove/prep/md5.ts +67 -0
- package/src/prove/prep/pragma.ts +221 -0
- package/src/prove/prep/trivial.ts +22 -0
- package/src/prove/prove-worker.ts +22 -0
- package/src/prove/prove.ts +498 -0
- package/src/prove/ptl/decide.ts +68 -0
- package/src/prove/ptl/encode.ts +255 -0
- package/src/prove/ptl/sat.ts +151 -0
- package/src/prove/ptl/tableau.ts +276 -0
- package/src/prove/smt/axiomatize.ts +69 -0
- package/src/prove/smt/axioms.ts +209 -0
- package/src/prove/smt/context.ts +108 -0
- package/src/prove/smt/data.ts +636 -0
- package/src/prove/smt/encode.ts +164 -0
- package/src/prove/smt/extensionality.ts +65 -0
- package/src/prove/smt/flatten.ts +112 -0
- package/src/prove/smt/format.ts +154 -0
- package/src/prove/smt/instances.ts +181 -0
- package/src/prove/smt/rewrite.ts +772 -0
- package/src/prove/smt/simplify.ts +57 -0
- package/src/prove/smt/solver/act-cache.ts +265 -0
- package/src/prove/smt/solver/arith-rewriter.ts +962 -0
- package/src/prove/smt/solver/array.ts +22 -0
- package/src/prove/smt/solver/asserted-formulas.ts +469 -0
- package/src/prove/smt/solver/ast-lt.ts +157 -0
- package/src/prove/smt/solver/ast-util.ts +91 -0
- package/src/prove/smt/solver/ast.ts +1315 -0
- package/src/prove/smt/solver/auf-solver.ts +572 -0
- package/src/prove/smt/solver/case-split-queue.ts +178 -0
- package/src/prove/smt/solver/cg-table.ts +175 -0
- package/src/prove/smt/solver/clause.ts +276 -0
- package/src/prove/smt/solver/conflict-resolution.ts +343 -0
- package/src/prove/smt/solver/context.ts +1292 -0
- package/src/prove/smt/solver/ctx-simplify.ts +334 -0
- package/src/prove/smt/solver/der.ts +224 -0
- package/src/prove/smt/solver/dyn-ack.ts +141 -0
- package/src/prove/smt/solver/e-matching.ts +659 -0
- package/src/prove/smt/solver/enode.ts +259 -0
- package/src/prove/smt/solver/expr-ref.ts +21 -0
- package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prove/smt/solver/fingerprints.ts +92 -0
- package/src/prove/smt/solver/flat-literals.ts +51 -0
- package/src/prove/smt/solver/goal.ts +138 -0
- package/src/prove/smt/solver/hash.ts +173 -0
- package/src/prove/smt/solver/hashtable.ts +166 -0
- package/src/prove/smt/solver/internalizer.ts +1381 -0
- package/src/prove/smt/solver/lbool.ts +5 -0
- package/src/prove/smt/solver/literal.ts +24 -0
- package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prove/smt/solver/lp/constraints.ts +78 -0
- package/src/prove/smt/solver/lp/containers.ts +296 -0
- package/src/prove/smt/solver/lp/core-solver.ts +504 -0
- package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prove/smt/solver/lp/dep-intervals.ts +642 -0
- package/src/prove/smt/solver/lp/dependency.ts +51 -0
- package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prove/smt/solver/lp/explanation.ts +46 -0
- package/src/prove/smt/solver/lp/gomory.ts +255 -0
- package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prove/smt/solver/lp/hnf.ts +281 -0
- package/src/prove/smt/solver/lp/int-cube.ts +295 -0
- package/src/prove/smt/solver/lp/int-solver.ts +514 -0
- package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prove/smt/solver/lp/lar-term.ts +62 -0
- package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prove/smt/solver/lp/nex.ts +120 -0
- package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prove/smt/solver/lp/nla-core.ts +968 -0
- package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prove/smt/solver/lp/nla-order.ts +307 -0
- package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prove/smt/solver/lp/nla-types.ts +124 -0
- package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prove/smt/solver/lp/pdd.ts +971 -0
- package/src/prove/smt/solver/lp/random-updater.ts +138 -0
- package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prove/smt/solver/lp/union-find.ts +96 -0
- package/src/prove/smt/solver/mam-compiler.ts +847 -0
- package/src/prove/smt/solver/mam-interpreter.ts +400 -0
- package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prove/smt/solver/model-checker.ts +347 -0
- package/src/prove/smt/solver/model-evaluator.ts +262 -0
- package/src/prove/smt/solver/model-finder.ts +155 -0
- package/src/prove/smt/solver/model-generator.ts +97 -0
- package/src/prove/smt/solver/model-macro-solver.ts +728 -0
- package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prove/smt/solver/nlsat/explain.ts +607 -0
- package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prove/smt/solver/nlsat/levelwise.ts +737 -0
- package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prove/smt/solver/nlsat/solver.ts +911 -0
- package/src/prove/smt/solver/nlsat/types.ts +43 -0
- package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prove/smt/solver/nnf.ts +469 -0
- package/src/prove/smt/solver/pattern-inference.ts +351 -0
- package/src/prove/smt/solver/poly-rewriter.ts +477 -0
- package/src/prove/smt/solver/propagate-values.ts +83 -0
- package/src/prove/smt/solver/proto-model.ts +551 -0
- package/src/prove/smt/solver/pull-quant.ts +139 -0
- package/src/prove/smt/solver/qe-lite-der.ts +526 -0
- package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prove/smt/solver/qe-lite.ts +381 -0
- package/src/prove/smt/solver/qi-queue.ts +362 -0
- package/src/prove/smt/solver/quant-tactics.ts +117 -0
- package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prove/smt/solver/quantifier-manager.ts +186 -0
- package/src/prove/smt/solver/random-gen.ts +10 -0
- package/src/prove/smt/solver/rational.ts +165 -0
- package/src/prove/smt/solver/ref-vector.ts +62 -0
- package/src/prove/smt/solver/relevancy.ts +247 -0
- package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prove/smt/solver/rewriter.ts +843 -0
- package/src/prove/smt/solver/rlimit.ts +79 -0
- package/src/prove/smt/solver/smtlib-parser.ts +526 -0
- package/src/prove/smt/solver/solver.ts +71 -0
- package/src/prove/smt/solver/sort.ts +35 -0
- package/src/prove/smt/solver/sticky-generations.ts +69 -0
- package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prove/smt/solver/theory-lra-model.ts +243 -0
- package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prove/smt/solver/theory-lra-state.ts +43 -0
- package/src/prove/smt/solver/theory-lra.ts +56 -0
- package/src/prove/smt/solver/var-subst.ts +258 -0
- package/src/prove/smt/solver/z3-license.txt +10 -0
- package/src/prove/smt/table.ts +170 -0
- package/src/prove/tlapm/tlapm.ts +96 -0
- package/src/prove/tlaps-module.ts +510 -0
- package/src/prove/verdict.ts +18 -0
- package/src/prove/zenon/LICENSE +32 -0
- package/src/prove/zenon/check/check.ts +105 -0
- package/src/prove/zenon/check/definitions.ts +144 -0
- package/src/prove/zenon/check/equality.ts +182 -0
- package/src/prove/zenon/check/functions.ts +62 -0
- package/src/prove/zenon/check/keys.ts +125 -0
- package/src/prove/zenon/check/propositional.ts +104 -0
- package/src/prove/zenon/check/records.ts +188 -0
- package/src/prove/zenon/check/relations.ts +121 -0
- package/src/prove/zenon/check/rewrites.ts +224 -0
- package/src/prove/zenon/check/sets.ts +302 -0
- package/src/prove/zenon/check/terms.ts +127 -0
- package/src/prove/zenon/check/tla.ts +126 -0
- package/src/prove/zenon/decide.ts +113 -0
- package/src/prove/zenon/encode.ts +379 -0
- package/src/prove/zenon/eqrel.ts +300 -0
- package/src/prove/zenon/equality-rules.ts +435 -0
- package/src/prove/zenon/expr.ts +551 -0
- package/src/prove/zenon/index-table.ts +350 -0
- package/src/prove/zenon/isar-case.ts +513 -0
- package/src/prove/zenon/isar.ts +1249 -0
- package/src/prove/zenon/limits.ts +15 -0
- package/src/prove/zenon/llproof.ts +173 -0
- package/src/prove/zenon/mltoll.ts +1566 -0
- package/src/prove/zenon/node.ts +297 -0
- package/src/prove/zenon/ocaml.ts +169 -0
- package/src/prove/zenon/parse.ts +247 -0
- package/src/prove/zenon/phrase.ts +191 -0
- package/src/prove/zenon/proof.ts +198 -0
- package/src/prove/zenon/propositional-rules.ts +387 -0
- package/src/prove/zenon/rules.ts +94 -0
- package/src/prove/zenon/search.ts +288 -0
- package/src/prove/zenon/tla/functions.ts +151 -0
- package/src/prove/zenon/tla/llproof.ts +480 -0
- package/src/prove/zenon/tla/records.ts +225 -0
- package/src/prove/zenon/tla/rewrites.ts +447 -0
- package/src/prove/zenon/tla/sets.ts +304 -0
- package/src/prove/zenon/tla/terms.ts +162 -0
- package/src/prove/zenon/tla/tla.ts +506 -0
- package/src/resolve.ts +1 -1
- package/src/run-cli.ts +283 -81
- package/src/sany-generator.ts +1 -1
- package/src/sany-report.ts +1 -1
- package/src/successors.ts +24 -5
- package/src/tlapm-cache.ts +236 -0
- package/src/tlc-random.ts +55 -32
- package/src/tlc-replay.ts +1 -1
- package/src/tlc-version.ts +8 -7
- package/src/values.ts +47 -4
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- package/src/value-sources.ts +0 -29
|
@@ -0,0 +1,513 @@
|
|
|
1
|
+
// Ported from Zenon's isar_case.ml and enum.ml, as shipped in tlapm. Copyright 2009 INRIA, see
|
|
2
|
+
// LICENSE.
|
|
3
|
+
//
|
|
4
|
+
// The lemmas for CASE expressions and record sets with more arms or fields than Zenon.thy covers.
|
|
5
|
+
// Each one is a template that Zenon's Enum expands for the arity: the text between @@@ and ...
|
|
6
|
+
// repeats counting up, the text between ... and @@@ repeats counting down.
|
|
7
|
+
|
|
8
|
+
import { TlaZenonError } from "../../errors";
|
|
9
|
+
|
|
10
|
+
// A run of digits or of other characters.
|
|
11
|
+
interface Lexeme {
|
|
12
|
+
isNumber: boolean;
|
|
13
|
+
text: string;
|
|
14
|
+
}
|
|
15
|
+
|
|
16
|
+
// A piece of a pattern: text, or a number that grows by its step at each repetition.
|
|
17
|
+
type Piece = string | { base: number; step: number };
|
|
18
|
+
|
|
19
|
+
interface Pattern {
|
|
20
|
+
pieces: Piece[];
|
|
21
|
+
separator: string;
|
|
22
|
+
}
|
|
23
|
+
|
|
24
|
+
const isDigit = (char: string | undefined) => char !== undefined && char >= "0" && char <= "9";
|
|
25
|
+
|
|
26
|
+
const lex = (text: string): Lexeme[] =>
|
|
27
|
+
text.match(/[0-9]+|[^0-9]+/g)?.map((run) => ({ isNumber: isDigit(run[0]), text: run })) ?? [];
|
|
28
|
+
|
|
29
|
+
// The repeated text and the separator of a pattern without numbers: its two equal halves.
|
|
30
|
+
const splitText = (text: string): Pattern => {
|
|
31
|
+
const half = Math.floor(text.length / 2);
|
|
32
|
+
const odd = text.length % 2;
|
|
33
|
+
for (let offset = 0; offset < half; offset++) {
|
|
34
|
+
const first = text.slice(0, half - offset);
|
|
35
|
+
if (first === text.slice(half + offset + odd, half + offset + odd + half - offset))
|
|
36
|
+
return { pieces: [first], separator: text.slice(half - offset, half + offset + odd) };
|
|
37
|
+
}
|
|
38
|
+
return { pieces: [], separator: text };
|
|
39
|
+
};
|
|
40
|
+
|
|
41
|
+
const correlate = (first: Lexeme[], second: Lexeme[]): Piece[] | undefined => {
|
|
42
|
+
if (first.length !== second.length) throw new TlaZenonError("Zenon: an uneven template");
|
|
43
|
+
const pieces = first.map((lexeme, position): Piece | undefined => {
|
|
44
|
+
const other = second[position];
|
|
45
|
+
if (!lexeme.isNumber && !other.isNumber && lexeme.text === other.text) return lexeme.text;
|
|
46
|
+
if (lexeme.isNumber && other.isNumber)
|
|
47
|
+
return { base: Number(lexeme.text), step: Number(other.text) - Number(lexeme.text) };
|
|
48
|
+
return undefined;
|
|
49
|
+
});
|
|
50
|
+
return pieces.every((piece) => piece !== undefined) ? pieces : undefined;
|
|
51
|
+
};
|
|
52
|
+
|
|
53
|
+
// Zenon's split_sep: the separator inside the middle text, after the end of the first instance's
|
|
54
|
+
// last lexeme and before the start of the second instance's first.
|
|
55
|
+
const splitSeparator = (
|
|
56
|
+
before: Lexeme,
|
|
57
|
+
middle: string,
|
|
58
|
+
after: Lexeme,
|
|
59
|
+
): [Lexeme[], string, Lexeme[]] | undefined => {
|
|
60
|
+
if (!before.isNumber && !middle.startsWith(before.text)) return undefined;
|
|
61
|
+
if (!after.isNumber && !middle.endsWith(after.text)) return undefined;
|
|
62
|
+
const start = before.isNumber ? 0 : before.text.length;
|
|
63
|
+
const end = after.isNumber ? 0 : after.text.length;
|
|
64
|
+
if (start + end > middle.length) return undefined;
|
|
65
|
+
return [
|
|
66
|
+
before.isNumber ? [] : [before],
|
|
67
|
+
middle.slice(start, middle.length - end),
|
|
68
|
+
after.isNumber ? [] : [after],
|
|
69
|
+
];
|
|
70
|
+
};
|
|
71
|
+
|
|
72
|
+
// Zenon's split_sep2, for two instances that meet between two numbers.
|
|
73
|
+
const splitSeparatorBetween = (
|
|
74
|
+
before: Lexeme,
|
|
75
|
+
first: Lexeme,
|
|
76
|
+
second: Lexeme,
|
|
77
|
+
after: Lexeme,
|
|
78
|
+
): [Lexeme[], string, Lexeme[]] => {
|
|
79
|
+
if (
|
|
80
|
+
!before.isNumber &&
|
|
81
|
+
!first.isNumber &&
|
|
82
|
+
second.isNumber &&
|
|
83
|
+
after.isNumber &&
|
|
84
|
+
first.text.startsWith(before.text)
|
|
85
|
+
)
|
|
86
|
+
return [[before], first.text.slice(before.text.length), [second]];
|
|
87
|
+
if (
|
|
88
|
+
before.isNumber &&
|
|
89
|
+
first.isNumber &&
|
|
90
|
+
!second.isNumber &&
|
|
91
|
+
!after.isNumber &&
|
|
92
|
+
second.text.endsWith(after.text)
|
|
93
|
+
)
|
|
94
|
+
return [[first], second.text.slice(0, second.text.length - after.text.length), [after]];
|
|
95
|
+
throw new TlaZenonError("Zenon: a template whose instances don't meet");
|
|
96
|
+
};
|
|
97
|
+
|
|
98
|
+
// Zenon's Enum.parse: a template's text holds two instances of the pattern and the separator.
|
|
99
|
+
const parsePattern = (text: string): Pattern | undefined => {
|
|
100
|
+
const lexemes = lex(text);
|
|
101
|
+
const length = lexemes.length;
|
|
102
|
+
if (length === 0) return { pieces: [], separator: "" };
|
|
103
|
+
if (length === 1) {
|
|
104
|
+
const only = lexemes[0];
|
|
105
|
+
if (!only.isNumber) return splitText(only.text);
|
|
106
|
+
if (only.text.length % 2 === 1) return undefined;
|
|
107
|
+
const half = only.text.length / 2;
|
|
108
|
+
const base = Number(only.text.slice(0, half));
|
|
109
|
+
return { pieces: [{ base, step: Number(only.text.slice(half)) - base }], separator: "" };
|
|
110
|
+
}
|
|
111
|
+
const half = Math.floor(length / 2);
|
|
112
|
+
if (length % 4 === 0) {
|
|
113
|
+
const prefix = lexemes.slice(0, half - 1);
|
|
114
|
+
const suffix = lexemes.slice(half + 1);
|
|
115
|
+
const split = splitSeparatorBetween(
|
|
116
|
+
suffix[suffix.length - 1],
|
|
117
|
+
lexemes[half - 1],
|
|
118
|
+
lexemes[half],
|
|
119
|
+
prefix[0],
|
|
120
|
+
);
|
|
121
|
+
const pieces = correlate([...prefix, ...split[0]], [...split[2], ...suffix]);
|
|
122
|
+
return pieces === undefined ? undefined : { pieces, separator: split[1] };
|
|
123
|
+
}
|
|
124
|
+
if (length % 2 === 0) return undefined;
|
|
125
|
+
const middle = lexemes[half];
|
|
126
|
+
if (middle.isNumber) return undefined;
|
|
127
|
+
const prefix = lexemes.slice(0, half);
|
|
128
|
+
const suffix = lexemes.slice(half + 1);
|
|
129
|
+
const split = splitSeparator(suffix[suffix.length - 1], middle.text, prefix[0]);
|
|
130
|
+
if (split === undefined) return undefined;
|
|
131
|
+
const pieces = correlate([...prefix, ...split[0]], [...split[2], ...suffix]);
|
|
132
|
+
return pieces === undefined ? undefined : { pieces, separator: split[1] };
|
|
133
|
+
};
|
|
134
|
+
|
|
135
|
+
const getInstance = (pieces: Piece[], value: (piece: { base: number; step: number }) => number) =>
|
|
136
|
+
pieces.map((piece) => (typeof piece === "string" ? piece : String(value(piece)))).join("");
|
|
137
|
+
|
|
138
|
+
// Zenon's expand_string and expand_string_rev: the pattern repeated count times.
|
|
139
|
+
const expandPattern = (count: number, text: string, isReversed: boolean) => {
|
|
140
|
+
const pattern = parsePattern(text);
|
|
141
|
+
if (pattern === undefined) return undefined;
|
|
142
|
+
const positions = Array.from({ length: count }, (_, position) =>
|
|
143
|
+
isReversed ? count - 1 - position : position,
|
|
144
|
+
);
|
|
145
|
+
return positions
|
|
146
|
+
.map((position) =>
|
|
147
|
+
getInstance(pattern.pieces, (piece) =>
|
|
148
|
+
isReversed
|
|
149
|
+
? piece.base + piece.step - position * piece.step
|
|
150
|
+
: piece.base + position * piece.step,
|
|
151
|
+
),
|
|
152
|
+
)
|
|
153
|
+
.join(pattern.separator);
|
|
154
|
+
};
|
|
155
|
+
|
|
156
|
+
// Zenon's read_suffix: a count adjustment such as [n-1] after the end marker.
|
|
157
|
+
const readAdjustment = (text: string, position: number): [number, number] => {
|
|
158
|
+
const match = /^\[n(?:\]|([+-])([0-9]*)\])/.exec(text.slice(position));
|
|
159
|
+
if (match === null) return [0, position];
|
|
160
|
+
const sign = match[1] === "-" ? -1 : 1;
|
|
161
|
+
return [match[1] === undefined ? 0 : sign * Number(match[2]), position + match[0].length];
|
|
162
|
+
};
|
|
163
|
+
|
|
164
|
+
const trimNewlines = (text: string) => {
|
|
165
|
+
if (text.length >= 2 && text.startsWith("\n") && text.endsWith("\n")) return text.slice(1, -1);
|
|
166
|
+
if (text.length >= 4 && text.startsWith("\r\n") && text.endsWith("\r\n"))
|
|
167
|
+
return text.slice(2, -2);
|
|
168
|
+
throw new TlaZenonError("Zenon: a bad template");
|
|
169
|
+
};
|
|
170
|
+
|
|
171
|
+
// Zenon's Enum.expand_text.
|
|
172
|
+
const expandTemplate = (count: number, template: string) => {
|
|
173
|
+
const parts: string[] = [];
|
|
174
|
+
let position = 0;
|
|
175
|
+
for (;;) {
|
|
176
|
+
const up = template.indexOf("@@@", position);
|
|
177
|
+
const down = template.indexOf("...", position);
|
|
178
|
+
if (up === -1 && down === -1) break;
|
|
179
|
+
const isReversed = up === -1 || (down !== -1 && down < up);
|
|
180
|
+
const start = isReversed ? down : up;
|
|
181
|
+
const end = template.indexOf(isReversed ? "@@@" : "...", start + 3);
|
|
182
|
+
if (end === -1) throw new TlaZenonError("Zenon: a bad template");
|
|
183
|
+
parts.push(template.slice(position, start));
|
|
184
|
+
const text = template.slice(start + 3, end);
|
|
185
|
+
const adjustment = readAdjustment(template, end + 3);
|
|
186
|
+
const expanded =
|
|
187
|
+
expandPattern(count + adjustment[0], text, isReversed) ??
|
|
188
|
+
expandPattern(count + adjustment[0], trimNewlines(text), isReversed);
|
|
189
|
+
if (expanded === undefined) throw new TlaZenonError("Zenon: a bad template");
|
|
190
|
+
parts.push(expanded);
|
|
191
|
+
position = adjustment[1];
|
|
192
|
+
}
|
|
193
|
+
parts.push(template.slice(position));
|
|
194
|
+
return parts.join("");
|
|
195
|
+
};
|
|
196
|
+
|
|
197
|
+
export const printCaseLemma = (arity: number, isOther: boolean) =>
|
|
198
|
+
`have zenon_case${isOther ? "other" : ""}${arity} :${expandTemplate(
|
|
199
|
+
arity,
|
|
200
|
+
isOther ? CASE_OTHER_TEMPLATE : CASE_TEMPLATE,
|
|
201
|
+
)}`;
|
|
202
|
+
|
|
203
|
+
export const printRecordLemma = (arity: number) =>
|
|
204
|
+
`have zenon_inrecordsetI${arity} :${expandTemplate(arity, getRecordTemplate(arity))}`;
|
|
205
|
+
|
|
206
|
+
const CASE_TEMPLATE = String.raw`
|
|
207
|
+
"!! P @@@c1x e1x c2x e2x... .
|
|
208
|
+
P (CASE @@@c1x -> e1x [] c2x -> e2x...) ==>
|
|
209
|
+
@@@
|
|
210
|
+
(c1x ==> P (e1x) ==> FALSE) ==>
|
|
211
|
+
(c2x ==> P (e2x) ==> FALSE) ==>
|
|
212
|
+
...
|
|
213
|
+
(...~c2x & ~c1x@@@ & TRUE ==> FALSE) ==>
|
|
214
|
+
FALSE"
|
|
215
|
+
proof -
|
|
216
|
+
fix P @@@c1x e1x c2x e2x...
|
|
217
|
+
assume h: "P (CASE @@@c1x -> e1x [] c2x -> e2x...)"
|
|
218
|
+
(is "P (?cas)")
|
|
219
|
+
@@@
|
|
220
|
+
assume h1: "c1x ==> P (e1x) ==> FALSE"
|
|
221
|
+
assume h2: "c2x ==> P (e2x) ==> FALSE"
|
|
222
|
+
...
|
|
223
|
+
assume hoth: "...~c2x & ~c1x@@@ & TRUE ==> FALSE"
|
|
224
|
+
def cs == "<<@@@c1x, c2x...>>" (is "?cs")
|
|
225
|
+
def es == "<<@@@e1x, e2x...>>" (is "?es")
|
|
226
|
+
def arms == "UNION {CaseArm (?cs[i], ?es[i]) : i \\in DOMAIN ?cs}"
|
|
227
|
+
(is "?arms")
|
|
228
|
+
def cas == "?cas"
|
|
229
|
+
have h0: "P (cas)" using h by (fold cas_def)
|
|
230
|
+
def dcs == "...c2x | c1x@@@" (is "?dcs")
|
|
231
|
+
show FALSE
|
|
232
|
+
proof (rule zenon_em [of "?dcs"])
|
|
233
|
+
assume ha: "~(?dcs)"
|
|
234
|
+
@@@
|
|
235
|
+
have hh1: "~c1x" using ha by blast
|
|
236
|
+
have hh2: "~c2x" using ha by blast
|
|
237
|
+
...
|
|
238
|
+
show FALSE
|
|
239
|
+
using hoth @@@hh1 hh2... by blast
|
|
240
|
+
next
|
|
241
|
+
assume ha: "?dcs"
|
|
242
|
+
def scs == "zenon_seqify (@@@zenon_appseq (zenon_appseq (...
|
|
243
|
+
<<>>, @@@c1x), c2x)...)"
|
|
244
|
+
(is "?scs")
|
|
245
|
+
def ses == "zenon_seqify (@@@zenon_appseq (zenon_appseq (...
|
|
246
|
+
<<>>, @@@e1x), e2x)...)"
|
|
247
|
+
(is "?ses")
|
|
248
|
+
have ha1: "\<exists> i \<in> DOMAIN ?scs : ?scs[i]"
|
|
249
|
+
using ha zenon_case_seq_empty
|
|
250
|
+
by (simp only: zenon_case_seq_simpl zenon_seqify_empty, blast)
|
|
251
|
+
have ha2: "\<exists> i \<in> DOMAIN ?cs : ?cs[i]"
|
|
252
|
+
using ha1 by (simp only: zenon_seqify_appseq zenon_seqify_empty)
|
|
253
|
+
have hb: "\\E x : x \\in arms"
|
|
254
|
+
using zenon_case_domain [OF ha2, where es = "?es"]
|
|
255
|
+
by (unfold arms_def, blast)
|
|
256
|
+
have hc: "(CHOOSE x : x \\in arms) \\in arms"
|
|
257
|
+
using hb by (unfold Ex_def, auto)
|
|
258
|
+
have hf0: "?cas \\in arms"
|
|
259
|
+
using hc by (unfold arms_def, fold Case_def)
|
|
260
|
+
have hf3: "cas \\in UNION {CaseArm (?scs[i], ?ses[i])
|
|
261
|
+
: i \\in DOMAIN ?scs}"
|
|
262
|
+
(is "?hf3")
|
|
263
|
+
using hf0 by (fold cas_def, unfold arms_def,
|
|
264
|
+
simp only: zenon_seqify_appseq zenon_seqify_empty)
|
|
265
|
+
have hf4: "Len (?scs) = Len (?ses)" (is "?hf4")
|
|
266
|
+
by (simp only: zenon_case_len_simpl)
|
|
267
|
+
have hf5: "?hf4 & ?hf3"
|
|
268
|
+
by (rule conjI [OF hf4 hf3])
|
|
269
|
+
have hf: "
|
|
270
|
+
...cas \\in CaseArm (c2x, e2x)
|
|
271
|
+
| cas \\in CaseArm (c1x, e1x)@@@
|
|
272
|
+
| cas \\in UNION {CaseArm (zenon_seqify (<<>>)[i],
|
|
273
|
+
zenon_seqify (<<>>)[i])
|
|
274
|
+
: i \\in DOMAIN zenon_seqify (<<>>)}
|
|
275
|
+
" (is "_ | ?gxx")
|
|
276
|
+
using hf5 by (simp only: zenon_case_union_simpl, blast)
|
|
277
|
+
@@@
|
|
278
|
+
have hg1x: "cas \\in CaseArm (c1x, e1x) => FALSE"
|
|
279
|
+
using h0 h1 by auto
|
|
280
|
+
have hg2x: "cas \\in CaseArm (c2x, e2x) => FALSE"
|
|
281
|
+
using h0 h2 by auto
|
|
282
|
+
...
|
|
283
|
+
from hf
|
|
284
|
+
have hh0: "?gxx" ...(is "_ | ?g1")
|
|
285
|
+
by (rule zenon_disjE1 [OF _ hg3x])
|
|
286
|
+
then have hh1: "?g1" (is "_ | ?g0")
|
|
287
|
+
by (rule zenon_disjE1 [OF _ hg2x])
|
|
288
|
+
then have hh0: "?g0"@@@[n-1]
|
|
289
|
+
by (rule zenon_disjE1 [OF _ hg1x])
|
|
290
|
+
have hi: "cas \\in UNION {CaseArm (<<>>[i], <<>>[i])
|
|
291
|
+
: i \\in DOMAIN <<>>}"
|
|
292
|
+
using hh0 by (simp only: zenon_seqify_empty)
|
|
293
|
+
show FALSE
|
|
294
|
+
by (rule zenon_case_empty_union [OF hi])
|
|
295
|
+
qed
|
|
296
|
+
qed
|
|
297
|
+
`;
|
|
298
|
+
|
|
299
|
+
const CASE_OTHER_TEMPLATE = String.raw`
|
|
300
|
+
"!! P oth @@@c1x e1x c2x e2x... .
|
|
301
|
+
P (CASE @@@c1x -> e1x [] c2x -> e2x... [] OTHER -> oth) ==>
|
|
302
|
+
@@@
|
|
303
|
+
(c1x ==> P (e1x) ==> FALSE) ==>
|
|
304
|
+
(c2x ==> P (e2x) ==> FALSE) ==>
|
|
305
|
+
...
|
|
306
|
+
(...~c2x & ~c1x@@@ & TRUE ==> P (oth) ==> FALSE) ==>
|
|
307
|
+
FALSE"
|
|
308
|
+
proof -
|
|
309
|
+
fix P oth @@@c1x e1x c2x e2x...
|
|
310
|
+
assume h: "P (CASE @@@c1x -> e1x [] c2x -> e2x... [] OTHER -> oth)"
|
|
311
|
+
(is "P (?cas)")
|
|
312
|
+
@@@
|
|
313
|
+
assume h1: "c1x ==> P (e1x) ==> FALSE"
|
|
314
|
+
assume h2: "c2x ==> P (e2x) ==> FALSE"
|
|
315
|
+
...
|
|
316
|
+
assume hoth: "...~c2x & ~c1x@@@ & TRUE ==> P (oth) ==> FALSE"
|
|
317
|
+
def cs == "<<@@@c1x, c2x...>>" (is "?cs")
|
|
318
|
+
def es == "<<@@@e1x, e2x...>>" (is "?es")
|
|
319
|
+
def arms == "UNION {CaseArm (?cs[i], ?es[i]) : i \\in DOMAIN ?cs}"
|
|
320
|
+
(is "?arms")
|
|
321
|
+
def cas == "?cas"
|
|
322
|
+
have h0: "P (cas)" using h by (fold cas_def)
|
|
323
|
+
def dcs == "...c2x | c1x@@@ | FALSE" (is "?dcs")
|
|
324
|
+
def scs == "zenon_seqify (@@@zenon_appseq (zenon_appseq (...
|
|
325
|
+
<<>>, @@@c1x), c2x)...)"
|
|
326
|
+
(is "?scs")
|
|
327
|
+
have hscs : "?cs = ?scs"
|
|
328
|
+
by (simp only: zenon_seqify_appseq zenon_seqify_empty)
|
|
329
|
+
def ses == "zenon_seqify (@@@zenon_appseq (zenon_appseq (...
|
|
330
|
+
<<>>, @@@e1x), e2x)...)"
|
|
331
|
+
(is "?ses")
|
|
332
|
+
have hses : "?es = ?ses"
|
|
333
|
+
by (simp only: zenon_seqify_appseq zenon_seqify_empty)
|
|
334
|
+
have hlen: "Len (?scs) = Len (?ses)" (is "?hlen")
|
|
335
|
+
by (simp only: zenon_case_len_simpl)
|
|
336
|
+
def armoth == "CaseArm (\<forall> i \<in> DOMAIN ?cs : ~?cs[i], oth)"
|
|
337
|
+
(is "?armoth")
|
|
338
|
+
show FALSE
|
|
339
|
+
proof (rule zenon_em [of "?dcs"])
|
|
340
|
+
assume ha: "~(?dcs)"
|
|
341
|
+
have hb: "P (CHOOSE x : x \\in arms \<union> armoth)"
|
|
342
|
+
using h by (unfold CaseOther_def, fold arms_def armoth_def)
|
|
343
|
+
have hc: "arms \\cup armoth
|
|
344
|
+
= UNION {CaseArm (?scs[i], ?ses[i]) : i \\in DOMAIN ?scs}
|
|
345
|
+
\\cup CaseArm (\<forall> i \<in> DOMAIN ?scs : ~?scs[i],
|
|
346
|
+
oth)"
|
|
347
|
+
(is "_ = ?sarmsoth")
|
|
348
|
+
using hscs hses by (unfold arms_def armoth_def, auto)
|
|
349
|
+
have hd: "~(?dcs) & ?hlen & arms \<union> armoth = ?sarmsoth"
|
|
350
|
+
using ha hlen hc by blast
|
|
351
|
+
have he: "arms \<union> armoth = {oth}"
|
|
352
|
+
using hd by (simp only: zenon_case_oth_simpl zenon_case_oth_empty)
|
|
353
|
+
have hf: "(CHOOSE x : x \\in arms \\cup armoth) = oth"
|
|
354
|
+
using he by auto
|
|
355
|
+
have hg: "P (oth)"
|
|
356
|
+
using hb hf by auto
|
|
357
|
+
@@@
|
|
358
|
+
have hh1: "~c1x" using ha by blast
|
|
359
|
+
have hh2: "~c2x" using ha by blast
|
|
360
|
+
...
|
|
361
|
+
show FALSE
|
|
362
|
+
using hg hoth @@@hh1 hh2... by blast
|
|
363
|
+
next
|
|
364
|
+
assume ha: "?dcs"
|
|
365
|
+
have ha1: "\<exists> i \<in> DOMAIN ?scs : ?scs[i]"
|
|
366
|
+
using ha zenon_case_seq_empty
|
|
367
|
+
by (simp only: zenon_case_seq_simpl zenon_seqify_empty, blast)
|
|
368
|
+
have ha2: "\<exists> i \<in> DOMAIN ?cs : ?cs[i]"
|
|
369
|
+
using ha1 hscs by auto
|
|
370
|
+
have ha3: "~ (\<forall> i \<in> DOMAIN ?cs : ~?cs[i])"
|
|
371
|
+
using ha2 by blast
|
|
372
|
+
have ha4: "armoth = {}"
|
|
373
|
+
using ha3 condElse [OF ha3, where t = "{oth}" and e = "{}"]
|
|
374
|
+
by (unfold armoth_def CaseArm_def, blast)
|
|
375
|
+
have hb: "\\E x : x \\in arms \\cup armoth"
|
|
376
|
+
using zenon_case_domain [OF ha2, where es = "?es"]
|
|
377
|
+
by (unfold arms_def, blast)
|
|
378
|
+
have hc: "(CHOOSE x : x \\in arms \\cup armoth)
|
|
379
|
+
\\in arms \\cup armoth"
|
|
380
|
+
using hb by (unfold Ex_def, auto)
|
|
381
|
+
have hf0: "?cas \\in arms \\cup armoth"
|
|
382
|
+
using hc by (unfold arms_def armoth_def, fold CaseOther_def)
|
|
383
|
+
have hf1: "cas \\in arms \\cup armoth"
|
|
384
|
+
using hf0 by (fold cas_def)
|
|
385
|
+
have hf2: "cas \\in arms"
|
|
386
|
+
using hf1 ha4 by auto
|
|
387
|
+
have hf3: "cas \\in UNION {CaseArm (?scs[i], ?ses[i])
|
|
388
|
+
: i \\in DOMAIN ?scs}"
|
|
389
|
+
(is "?hf3")
|
|
390
|
+
using hf2 by (unfold arms_def,
|
|
391
|
+
simp only: zenon_seqify_appseq zenon_seqify_empty)
|
|
392
|
+
have hf5: "?hlen & ?hf3"
|
|
393
|
+
by (rule conjI [OF hlen hf3])
|
|
394
|
+
have hf: "
|
|
395
|
+
...cas \\in CaseArm (c2x, e2x)
|
|
396
|
+
| cas \\in CaseArm (c1x, e1x)@@@
|
|
397
|
+
| cas \\in UNION {CaseArm (zenon_seqify (<<>>)[i],
|
|
398
|
+
zenon_seqify (<<>>)[i])
|
|
399
|
+
: i \\in DOMAIN zenon_seqify (<<>>)}
|
|
400
|
+
" (is "_ | ?gxx")
|
|
401
|
+
using hf5 by (simp only: zenon_case_union_simpl, blast)
|
|
402
|
+
@@@
|
|
403
|
+
have hg1x: "cas \\in CaseArm (c1x, e1x) => FALSE"
|
|
404
|
+
using h0 h1 by auto
|
|
405
|
+
have hg2x: "cas \\in CaseArm (c2x, e2x) => FALSE"
|
|
406
|
+
using h0 h2 by auto
|
|
407
|
+
...
|
|
408
|
+
from hf
|
|
409
|
+
have hh0: "?gxx" ...(is "_ | ?g1")
|
|
410
|
+
by (rule zenon_disjE1 [OF _ hg3x])
|
|
411
|
+
then have hh1: "?g1" (is "_ | ?g0")
|
|
412
|
+
by (rule zenon_disjE1 [OF _ hg2x])
|
|
413
|
+
then have hh0: "?g0"@@@[n-1]
|
|
414
|
+
by (rule zenon_disjE1 [OF _ hg1x])
|
|
415
|
+
have hi: "cas \\in UNION {CaseArm (<<>>[i], <<>>[i])
|
|
416
|
+
: i \\in DOMAIN <<>>}"
|
|
417
|
+
using hh0 by (simp only: zenon_seqify_empty)
|
|
418
|
+
show FALSE
|
|
419
|
+
by (rule zenon_case_empty_union [OF hi])
|
|
420
|
+
qed
|
|
421
|
+
qed
|
|
422
|
+
`;
|
|
423
|
+
|
|
424
|
+
const getRecordTemplate = (arity: number) => String.raw`
|
|
425
|
+
"!! r @@@l1x s1x l2x s2x... .
|
|
426
|
+
isAFcn (r) ==>
|
|
427
|
+
DOMAIN r = {@@@l1x, l2x...} ==>
|
|
428
|
+
@@@
|
|
429
|
+
r[l1x] \\in s1x ==>
|
|
430
|
+
r[l2x] \\in s2x ==>
|
|
431
|
+
...
|
|
432
|
+
r \\in [@@@l1x : s1x, l2x : s2x...]"
|
|
433
|
+
proof -
|
|
434
|
+
fix r @@@l1x s1x l2x s2x...
|
|
435
|
+
assume hfcn: "isAFcn (r)"
|
|
436
|
+
assume hdom: "DOMAIN r = {@@@l1x, l2x...}"
|
|
437
|
+
@@@
|
|
438
|
+
assume h1: "r[l1x] \\in s1x"
|
|
439
|
+
assume h2: "r[l2x] \\in s2x"
|
|
440
|
+
...
|
|
441
|
+
let ?doms = "<<@@@l1x, l2x...>>"
|
|
442
|
+
let ?domset = "{@@@l1x, l2x...}"
|
|
443
|
+
let ?domsetrev = "{...l2x, l1x@@@}"
|
|
444
|
+
let ?rngs = "<<@@@s1x, s2x...>>"
|
|
445
|
+
let ?n0n = "0"
|
|
446
|
+
@@@
|
|
447
|
+
let ?n1n = "Succ[?n0n]"
|
|
448
|
+
let ?n2n = "Succ[?n1n]"
|
|
449
|
+
...
|
|
450
|
+
let ?indices = "{...?n2n, ?n1n@@@}"
|
|
451
|
+
have hdomx : "?domsetrev = DOMAIN r"
|
|
452
|
+
by (rule zenon_set_rev_1, (rule zenon_set_rev_2)+, rule zenon_set_rev_3,
|
|
453
|
+
rule hdom)
|
|
454
|
+
show "r \\in EnumFuncSet (?doms, ?rngs)"
|
|
455
|
+
proof (rule EnumFuncSetI [of r, OF hfcn])
|
|
456
|
+
have hx1: "isASeq (?doms) & ?domsetrev = Range (?doms)"
|
|
457
|
+
by ((rule zenon_range_2)+, rule zenon_range_1)
|
|
458
|
+
have hx2: "?domsetrev = Range (?doms)"
|
|
459
|
+
by (rule conjD2 [OF hx1])
|
|
460
|
+
show "DOMAIN r = Range (?doms)"
|
|
461
|
+
by (rule subst [where P = "%x. x = Range (?doms)", OF hdomx hx2])
|
|
462
|
+
next
|
|
463
|
+
show "DOMAIN ?rngs = DOMAIN ?doms"
|
|
464
|
+
by (rule zenon_tuple_dom_3, (rule zenon_tuple_dom_2)+,
|
|
465
|
+
rule zenon_tuple_dom_1)
|
|
466
|
+
next
|
|
467
|
+
have hdomseq: "isASeq (?doms)" by auto
|
|
468
|
+
have hindx: "isASeq (?doms) & ?n${arity}n = Len (?doms)
|
|
469
|
+
& ?indices = DOMAIN ?doms"
|
|
470
|
+
by (simp only: DomainSeqLen [OF hdomseq], (rule zenon_dom_app_2)+,
|
|
471
|
+
rule zenon_dom_app_1)
|
|
472
|
+
have hind: "?indices = DOMAIN ?doms" by (rule conjE [OF hindx], elim conjE)
|
|
473
|
+
show "ALL i in DOMAIN ?doms : r[?doms[i]] \\in ?rngs[i]"
|
|
474
|
+
proof (rule subst [OF hind], (rule zenon_all_rec_2)+, rule zenon_all_rec_1)
|
|
475
|
+
@@@
|
|
476
|
+
have hn: "l1x = ?doms[?n1n]"
|
|
477
|
+
by (((rule zenon_tuple_acc_2, safe, simp only: zenon_ss_1 zenon_ss_2,
|
|
478
|
+
rule zenon_zero_lt,
|
|
479
|
+
simp only: zenon_ss_1 zenon_ss_2 zenon_sa_1 zenon_sa_2,
|
|
480
|
+
((rule zenon_ss_le_sa_2)+)?, rule zenon_ss_le_sa_1
|
|
481
|
+
)+)?,
|
|
482
|
+
rule zenon_tuple_acc_1, auto)
|
|
483
|
+
have hs: "s1x = ?rngs[?n1n]"
|
|
484
|
+
by (((rule zenon_tuple_acc_2, safe, simp only: zenon_ss_1 zenon_ss_2,
|
|
485
|
+
rule zenon_zero_lt,
|
|
486
|
+
simp only: zenon_ss_1 zenon_ss_2 zenon_sa_1 zenon_sa_2,
|
|
487
|
+
((rule zenon_ss_le_sa_2)+)?, rule zenon_ss_le_sa_1
|
|
488
|
+
)+)?,
|
|
489
|
+
rule zenon_tuple_acc_1, auto)
|
|
490
|
+
show "r[?doms[?n1n]] \\in ?rngs[?n1n]"
|
|
491
|
+
by (rule subst[OF hs], rule subst[OF hn], rule h1)
|
|
492
|
+
next
|
|
493
|
+
have hn: "l2x = ?doms[?n2n]"
|
|
494
|
+
by (((rule zenon_tuple_acc_2, safe, simp only: zenon_ss_1 zenon_ss_2,
|
|
495
|
+
rule zenon_zero_lt,
|
|
496
|
+
simp only: zenon_ss_1 zenon_ss_2 zenon_sa_1 zenon_sa_2,
|
|
497
|
+
((rule zenon_ss_le_sa_2)+)?, rule zenon_ss_le_sa_1
|
|
498
|
+
)+)?,
|
|
499
|
+
rule zenon_tuple_acc_1, auto)
|
|
500
|
+
have hs: "s2x = ?rngs[?n2n]"
|
|
501
|
+
by (((rule zenon_tuple_acc_2, safe, simp only: zenon_ss_1 zenon_ss_2,
|
|
502
|
+
rule zenon_zero_lt,
|
|
503
|
+
simp only: zenon_ss_1 zenon_ss_2 zenon_sa_1 zenon_sa_2,
|
|
504
|
+
((rule zenon_ss_le_sa_2)+)?, rule zenon_ss_le_sa_1
|
|
505
|
+
)+)?,
|
|
506
|
+
rule zenon_tuple_acc_1, auto)
|
|
507
|
+
show "r[?doms[?n2n]] \\in ?rngs[?n2n]"
|
|
508
|
+
by (rule subst[OF hs], rule subst[OF hn], rule h2)
|
|
509
|
+
...
|
|
510
|
+
qed
|
|
511
|
+
qed
|
|
512
|
+
qed
|
|
513
|
+
`;
|