@stevenvo780/st-lang 4.9.0 → 4.11.0

package/dist/tooling/lemma-library/library.js

@@ -0,0 +1,126 @@
+"use strict";
+// ============================================================
+// LemmaLibrary — repositorio in-memory de lemas curados con
+// filtros por dominio/tag/dificultad, búsqueda keyword y
+// recuperación de lemas similares por overlap léxico/estructural.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LemmaLibrary = void 0;
+const tokenize_1 = require("./tokenize");
+class LemmaLibrary {
+    byId = new Map();
+    byDomainIndex = new Map();
+    byTagIndex = new Map();
+    byDifficultyIndex = new Map();
+    add(lemma) {
+        if (this.byId.has(lemma.id)) {
+            throw new Error(`LemmaLibrary: duplicate id ${lemma.id}`);
+        }
+        this.byId.set(lemma.id, lemma);
+        this.indexSet(this.byDomainIndex, lemma.domain, lemma.id);
+        for (const tag of lemma.tags) {
+            this.indexSet(this.byTagIndex, tag, lemma.id);
+        }
+        this.indexSet(this.byDifficultyIndex, lemma.difficulty, lemma.id);
+    }
+    get(id) {
+        return this.byId.get(id);
+    }
+    byDomain(domain) {
+        return this.resolve(this.byDomainIndex.get(domain));
+    }
+    byTag(tag) {
+        return this.resolve(this.byTagIndex.get(tag));
+    }
+    byDifficulty(d) {
+        return this.resolve(this.byDifficultyIndex.get(d));
+    }
+    all() {
+        return Array.from(this.byId.values());
+    }
+    size() {
+        return this.byId.size;
+    }
+    /**
+     * Búsqueda por palabra clave: tokeniza la query, asigna score a
+     * cada lema según matches en name (peso 3), tags (peso 2) y
+     * statement (peso 1). Si `opts.domain` está, filtra antes.
+     * Devuelve los top `opts.limit` (default 20).
+     */
+    search(query, opts = {}) {
+        const tokens = (0, tokenize_1.tokenize)(query);
+        if (tokens.length === 0)
+            return [];
+        const candidates = opts.domain ? this.byDomain(opts.domain) : this.all();
+        const scored = [];
+        for (const lemma of candidates) {
+            const nameTokens = (0, tokenize_1.tokenize)(lemma.name);
+            const tagTokens = lemma.tags.flatMap((t) => (0, tokenize_1.tokenize)(t));
+            const statementTokens = (0, tokenize_1.tokenize)(lemma.statement);
+            let score = 0;
+            for (const tok of tokens) {
+                if (nameTokens.includes(tok))
+                    score += 3;
+                if (tagTokens.includes(tok))
+                    score += 2;
+                if (statementTokens.includes(tok))
+                    score += 1;
+            }
+            if (score > 0)
+                scored.push({ lemma, score });
+        }
+        scored.sort((a, b) => b.score - a.score || a.lemma.id.localeCompare(b.lemma.id));
+        const limit = opts.limit ?? 20;
+        return scored.slice(0, limit).map((s) => s.lemma);
+    }
+    /**
+     * Recupera lemas similares al dado, ranqueados por overlap de
+     * tokens en statement (peso 2) + tags (peso 1). Excluye al propio
+     * lema. Default k = 5.
+     */
+    similar(lemma, k = 5) {
+        const targetStatementTokens = new Set((0, tokenize_1.tokenize)(lemma.statement));
+        const targetTags = new Set(lemma.tags);
+        const scored = [];
+        for (const other of this.all()) {
+            if (other.id === lemma.id)
+                continue;
+            let score = 0;
+            for (const tok of (0, tokenize_1.tokenize)(other.statement)) {
+                if (targetStatementTokens.has(tok))
+                    score += 2;
+            }
+            for (const tag of other.tags) {
+                if (targetTags.has(tag))
+                    score += 1;
+            }
+            if (other.domain === lemma.domain)
+                score += 1;
+            if (score > 0)
+                scored.push({ lemma: other, score });
+        }
+        scored.sort((a, b) => b.score - a.score || a.lemma.id.localeCompare(b.lemma.id));
+        return scored.slice(0, k).map((s) => s.lemma);
+    }
+    indexSet(index, key, id) {
+        let bucket = index.get(key);
+        if (!bucket) {
+            bucket = new Set();
+            index.set(key, bucket);
+        }
+        bucket.add(id);
+    }
+    resolve(ids) {
+        if (!ids)
+            return [];
+        const out = [];
+        for (const id of ids) {
+            const lemma = this.byId.get(id);
+            if (lemma)
+                out.push(lemma);
+        }
+        return out;
+    }
+}
+exports.LemmaLibrary = LemmaLibrary;
+//# sourceMappingURL=library.js.map

package/dist/tooling/lemma-library/library.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"library.js","sourceRoot":"","sources":["../../../src/tooling/lemma-library/library.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4DAA4D;AAC5D,yDAAyD;AACzD,kEAAkE;AAClE,+DAA+D;;;AAG/D,yCAAsC;AAOtC,MAAa,YAAY;IACf,IAAI,GAA8B,IAAI,GAAG,EAAE,CAAC;IAC5C,aAAa,GAA6B,IAAI,GAAG,EAAE,CAAC;IACpD,UAAU,GAA6B,IAAI,GAAG,EAAE,CAAC;IACjD,iBAAiB,GAAsC,IAAI,GAAG,EAAE,CAAC;IAEzE,GAAG,CAAC,KAAmB;QACrB,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,8BAA8B,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5D,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC/B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;QAC1D,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;YAC7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;QAChD,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,iBAAiB,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;IACpE,CAAC;IAED,GAAG,CAAC,EAAU;QACZ,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC;IAED,QAAQ,CAAC,MAAc;QACrB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,KAAK,CAAC,GAAW;QACf,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,YAAY,CAAC,CAAkB;QAC7B,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IAED,GAAG;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACxC,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IACxB,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,KAAa,EAAE,OAAsB,EAAE;QAC5C,MAAM,MAAM,GAAG,IAAA,mBAAQ,EAAC,KAAK,CAAC,CAAC;QAC/B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACnC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QACzE,MAAM,MAAM,GAAkD,EAAE,CAAC;QACjE,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,MAAM,UAAU,GAAG,IAAA,mBAAQ,EAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACxC,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,mBAAQ,EAAC,CAAC,CAAC,CAAC,CAAC;YACzD,MAAM,eAAe,GAAG,IAAA,mBAAQ,EAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YAClD,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;gBACzB,IAAI,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC;oBAAE,KAAK,IAAI,CAAC,CAAC;gBACzC,IAAI,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC;oBAAE,KAAK,IAAI,CAAC,CAAC;gBACxC,IAAI,eAAe,CAAC,QAAQ,CAAC,GAAG,CAAC;oBAAE,KAAK,IAAI,CAAC,CAAC;YAChD,CAAC;YACD,IAAI,KAAK,GAAG,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;QAC/C,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;QACjF,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QAC/B,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACpD,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,KAAmB,EAAE,CAAC,GAAG,CAAC;QAChC,MAAM,qBAAqB,GAAG,IAAI,GAAG,CAAC,IAAA,mBAAQ,EAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;QACjE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,MAAM,GAAkD,EAAE,CAAC;QACjE,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YAC/B,IAAI,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE;gBAAE,SAAS;YACpC,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,GAAG,IAAI,IAAA,mBAAQ,EAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC5C,IAAI,qBAAqB,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,KAAK,IAAI,CAAC,CAAC;YACjD,CAAC;YACD,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;gBAC7B,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,KAAK,IAAI,CAAC,CAAC;YACtC,CAAC;YACD,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;gBAAE,KAAK,IAAI,CAAC,CAAC;YAC9C,IAAI,KAAK,GAAG,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;QACtD,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;QACjF,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAChD,CAAC;IAEO,QAAQ,CAAI,KAA0B,EAAE,GAAM,EAAE,EAAU;QAChE,IAAI,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;YACnB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACzB,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAEO,OAAO,CAAC,GAA4B;QAC1C,IAAI,CAAC,GAAG;YAAE,OAAO,EAAE,CAAC;QACpB,MAAM,GAAG,GAAmB,EAAE,CAAC;QAC/B,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,KAAK;gBAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAjHD,oCAiHC"}

package/dist/tooling/lemma-library/modal.d.ts

@@ -0,0 +1,3 @@
+import type { CuratedLemma } from './types';
+export declare const MODAL_LEMMAS: CuratedLemma[];
+//# sourceMappingURL=modal.d.ts.map

package/dist/tooling/lemma-library/modal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"modal.d.ts","sourceRoot":"","sources":["../../../src/tooling/lemma-library/modal.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAE5C,eAAO,MAAM,YAAY,EAAE,YAAY,EAiItC,CAAC"}

package/dist/tooling/lemma-library/modal.js

@@ -0,0 +1,138 @@
+"use strict";
+// ============================================================
+// Lemas curados — Lógicas modales (~15)
+// Axiomas K/T/4/5/B/D + dualidades □/◇.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MODAL_LEMMAS = void 0;
+exports.MODAL_LEMMAS = [
+    {
+        id: 'modal.k',
+        name: 'Axiom K (distribution)',
+        statement: '□(P → Q) → (□P → □Q)',
+        domain: 'modal',
+        tags: ['axiom', 'K', 'distribution', 'box', 'normal-modal'],
+        difficulty: 'easy',
+        isAxiom: true,
+        references: ['Kripke, 1963'],
+    },
+    {
+        id: 'modal.t',
+        name: 'Axiom T (reflexivity)',
+        statement: '□P → P',
+        domain: 'modal',
+        tags: ['axiom', 'T', 'reflexivity', 'box'],
+        difficulty: 'easy',
+        isAxiom: true,
+    },
+    {
+        id: 'modal.4',
+        name: 'Axiom 4 (transitivity)',
+        statement: '□P → □□P',
+        domain: 'modal',
+        tags: ['axiom', '4', 'transitivity', 'box', 'S4'],
+        difficulty: 'easy',
+        isAxiom: true,
+    },
+    {
+        id: 'modal.5',
+        name: 'Axiom 5 (euclidean)',
+        statement: '◇P → □◇P',
+        domain: 'modal',
+        tags: ['axiom', '5', 'euclidean', 'diamond', 'box', 'S5'],
+        difficulty: 'medium',
+        isAxiom: true,
+    },
+    {
+        id: 'modal.b',
+        name: 'Axiom B (symmetry)',
+        statement: 'P → □◇P',
+        domain: 'modal',
+        tags: ['axiom', 'B', 'symmetry', 'box', 'diamond'],
+        difficulty: 'medium',
+        isAxiom: true,
+    },
+    {
+        id: 'modal.d',
+        name: 'Axiom D (serial)',
+        statement: '□P → ◇P',
+        domain: 'modal',
+        tags: ['axiom', 'D', 'serial', 'box', 'diamond'],
+        difficulty: 'easy',
+        isAxiom: true,
+    },
+    {
+        id: 'modal.duality-box',
+        name: 'Modal duality (box)',
+        statement: '□P ↔ ¬◇¬P',
+        domain: 'modal',
+        tags: ['duality', 'box', 'diamond', 'negation', 'definition'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'modal.duality-diamond',
+        name: 'Modal duality (diamond)',
+        statement: '◇P ↔ ¬□¬P',
+        domain: 'modal',
+        tags: ['duality', 'box', 'diamond', 'negation', 'definition'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'modal.necessitation',
+        name: 'Necessitation rule',
+        statement: '⊢ P ⇒ ⊢ □P',
+        domain: 'modal',
+        tags: ['rule', 'necessitation', 'box', 'normal-modal'],
+        difficulty: 'easy',
+        isAxiom: true,
+    },
+    {
+        id: 'modal.box-and',
+        name: 'Box distributes over conjunction',
+        statement: '□(P ∧ Q) ↔ (□P ∧ □Q)',
+        domain: 'modal',
+        tags: ['distribution', 'box', 'conjunction', 'normal-modal'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'modal.diamond-or',
+        name: 'Diamond distributes over disjunction',
+        statement: '◇(P ∨ Q) ↔ (◇P ∨ ◇Q)',
+        domain: 'modal',
+        tags: ['distribution', 'diamond', 'disjunction', 'normal-modal'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'modal.box-conjunction-intro',
+        name: 'Box conjunction introduction',
+        statement: '(□P ∧ □Q) → □(P ∧ Q)',
+        domain: 'modal',
+        tags: ['introduction', 'box', 'conjunction', 'normal-modal'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'modal.s5-collapse',
+        name: 'S5 modality collapse',
+        statement: '◇□P → □P',
+        domain: 'modal',
+        tags: ['S5', 'collapse', 'diamond', 'box'],
+        difficulty: 'hard',
+    },
+    {
+        id: 'modal.contingency',
+        name: 'Contingency definition',
+        statement: 'Contingent(P) ↔ (◇P ∧ ◇¬P)',
+        domain: 'modal',
+        tags: ['definition', 'contingency', 'diamond', 'negation'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'modal.box-mp',
+        name: 'Box modus ponens',
+        statement: '(□P ∧ □(P → Q)) → □Q',
+        domain: 'modal',
+        tags: ['modus-ponens', 'box', 'implication', 'normal-modal'],
+        difficulty: 'easy',
+    },
+];
+//# sourceMappingURL=modal.js.map

package/dist/tooling/lemma-library/modal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"modal.js","sourceRoot":"","sources":["../../../src/tooling/lemma-library/modal.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wCAAwC;AACxC,wCAAwC;AACxC,+DAA+D;;;AAIlD,QAAA,YAAY,GAAmB;IAC1C;QACE,EAAE,EAAE,SAAS;QACb,IAAI,EAAE,wBAAwB;QAC9B,SAAS,EAAE,sBAAsB;QACjC,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE,cAAc,EAAE,KAAK,EAAE,cAAc,CAAC;QAC3D,UAAU,EAAE,MAAM;QAClB,OAAO,EAAE,IAAI;QACb,UAAU,EAAE,CAAC,cAAc,CAAC;KAC7B;IACD;QACE,EAAE,EAAE,SAAS;QACb,IAAI,EAAE,uBAAuB;QAC7B,SAAS,EAAE,QAAQ;QACnB,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE,aAAa,EAAE,KAAK,CAAC;QAC1C,UAAU,EAAE,MAAM;QAClB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,SAAS;QACb,IAAI,EAAE,wBAAwB;QAC9B,SAAS,EAAE,UAAU;QACrB,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE,cAAc,EAAE,KAAK,EAAE,IAAI,CAAC;QACjD,UAAU,EAAE,MAAM;QAClB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,SAAS;QACb,IAAI,EAAE,qBAAqB;QAC3B,SAAS,EAAE,UAAU;QACrB,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC;QACzD,UAAU,EAAE,QAAQ;QACpB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,SAAS;QACb,IAAI,EAAE,oBAAoB;QAC1B,SAAS,EAAE,SAAS;QACpB,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS,CAAC;QAClD,UAAU,EAAE,QAAQ;QACpB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,SAAS;QACb,IAAI,EAAE,kBAAkB;QACxB,SAAS,EAAE,SAAS;QACpB,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,CAAC;QAChD,UAAU,EAAE,MAAM;QAClB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,mBAAmB;QACvB,IAAI,EAAE,qBAAqB;QAC3B,SAAS,EAAE,WAAW;QACtB,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,CAAC,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,YAAY,CAAC;QAC7D,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,uBAAuB;QAC3B,IAAI,EAAE,yBAAyB;QAC/B,SAAS,EAAE,WAAW;QACtB,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,CAAC,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,YAAY,CAAC;QAC7D,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,qBAAqB;QACzB,IAAI,EAAE,oBAAoB;QAC1B,SAAS,EAAE,YAAY;QACvB,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,CAAC,MAAM,EAAE,eAAe,EAAE,KAAK,EAAE,cAAc,CAAC;QACtD,UAAU,EAAE,MAAM;QAClB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,eAAe;QACnB,IAAI,EAAE,kCAAkC;QACxC,SAAS,EAAE,sBAAsB;QACjC,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,CAAC,cAAc,EAAE,KAAK,EAAE,aAAa,EAAE,cAAc,CAAC;QAC5D,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,kBAAkB;QACtB,IAAI,EAAE,sCAAsC;QAC5C,SAAS,EAAE,sBAAsB;QACjC,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,CAAC,cAAc,EAAE,SAAS,EAAE,aAAa,EAAE,cAAc,CAAC;QAChE,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,6BAA6B;QACjC,IAAI,EAAE,8BAA8B;QACpC,SAAS,EAAE,sBAAsB;QACjC,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,CAAC,cAAc,EAAE,KAAK,EAAE,aAAa,EAAE,cAAc,CAAC;QAC5D,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,mBAAmB;QACvB,IAAI,EAAE,sBAAsB;QAC5B,SAAS,EAAE,UAAU;QACrB,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,CAAC,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE,KAAK,CAAC;QAC1C,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,mBAAmB;QACvB,IAAI,EAAE,wBAAwB;QAC9B,SAAS,EAAE,4BAA4B;QACvC,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,CAAC,YAAY,EAAE,aAAa,EAAE,SAAS,EAAE,UAAU,CAAC;QAC1D,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,cAAc;QAClB,IAAI,EAAE,kBAAkB;QACxB,SAAS,EAAE,sBAAsB;QACjC,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,CAAC,cAAc,EAAE,KAAK,EAAE,aAAa,EAAE,cAAc,CAAC;QAC5D,UAAU,EAAE,MAAM;KACnB;CACF,CAAC"}

package/dist/tooling/lemma-library/propositional.d.ts

@@ -0,0 +1,3 @@
+import type { CuratedLemma } from './types';
+export declare const PROPOSITIONAL_LEMMAS: CuratedLemma[];
+//# sourceMappingURL=propositional.d.ts.map

package/dist/tooling/lemma-library/propositional.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"propositional.d.ts","sourceRoot":"","sources":["../../../src/tooling/lemma-library/propositional.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAE5C,eAAO,MAAM,oBAAoB,EAAE,YAAY,EAgQ9C,CAAC"}

package/dist/tooling/lemma-library/propositional.js

@@ -0,0 +1,265 @@
+"use strict";
+// ============================================================
+// Lemas curados — Lógica proposicional clásica (~30)
+// Identidades, De Morgan, contraposición, distributividad, etc.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PROPOSITIONAL_LEMMAS = void 0;
+exports.PROPOSITIONAL_LEMMAS = [
+    {
+        id: 'prop.identity',
+        name: 'Identity',
+        statement: 'P → P',
+        domain: 'propositional',
+        tags: ['identity', 'implication', 'classical', 'intuitionistic'],
+        difficulty: 'trivial',
+    },
+    {
+        id: 'prop.double-negation-elim',
+        name: 'Double negation elimination',
+        statement: '¬¬P → P',
+        domain: 'propositional',
+        tags: ['negation', 'classical', 'double-negation'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'prop.double-negation-intro',
+        name: 'Double negation introduction',
+        statement: 'P → ¬¬P',
+        domain: 'propositional',
+        tags: ['negation', 'classical', 'intuitionistic', 'double-negation'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'prop.excluded-middle',
+        name: 'Law of excluded middle',
+        statement: 'P ∨ ¬P',
+        domain: 'propositional',
+        tags: ['classical', 'tertium-non-datur', 'disjunction', 'negation'],
+        difficulty: 'easy',
+        isAxiom: true,
+    },
+    {
+        id: 'prop.non-contradiction',
+        name: 'Law of non-contradiction',
+        statement: '¬(P ∧ ¬P)',
+        domain: 'propositional',
+        tags: ['classical', 'intuitionistic', 'negation', 'conjunction'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'prop.de-morgan-and',
+        name: 'De Morgan (conjunction)',
+        statement: '¬(P ∧ Q) ↔ (¬P ∨ ¬Q)',
+        domain: 'propositional',
+        tags: ['de-morgan', 'duality', 'classical', 'conjunction', 'disjunction', 'negation'],
+        difficulty: 'easy',
+        references: ['De Morgan, 1860'],
+    },
+    {
+        id: 'prop.de-morgan-or',
+        name: 'De Morgan (disjunction)',
+        statement: '¬(P ∨ Q) ↔ (¬P ∧ ¬Q)',
+        domain: 'propositional',
+        tags: ['de-morgan', 'duality', 'classical', 'intuitionistic', 'disjunction', 'negation'],
+        difficulty: 'easy',
+        references: ['De Morgan, 1860'],
+    },
+    {
+        id: 'prop.contraposition',
+        name: 'Contraposition',
+        statement: '(P → Q) ↔ (¬Q → ¬P)',
+        domain: 'propositional',
+        tags: ['contraposition', 'classical', 'implication', 'negation'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'prop.modus-ponens',
+        name: 'Modus ponens',
+        statement: '((P → Q) ∧ P) → Q',
+        domain: 'propositional',
+        tags: ['modus-ponens', 'inference', 'classical', 'intuitionistic', 'implication'],
+        difficulty: 'trivial',
+        isAxiom: true,
+    },
+    {
+        id: 'prop.modus-tollens',
+        name: 'Modus tollens',
+        statement: '((P → Q) ∧ ¬Q) → ¬P',
+        domain: 'propositional',
+        tags: ['modus-tollens', 'inference', 'classical', 'implication', 'negation'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'prop.hypothetical-syllogism',
+        name: 'Hypothetical syllogism',
+        statement: '((P → Q) ∧ (Q → R)) → (P → R)',
+        domain: 'propositional',
+        tags: ['syllogism', 'transitivity', 'classical', 'intuitionistic', 'implication'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'prop.disjunctive-syllogism',
+        name: 'Disjunctive syllogism',
+        statement: '((P ∨ Q) ∧ ¬P) → Q',
+        domain: 'propositional',
+        tags: ['syllogism', 'classical', 'disjunction', 'negation'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'prop.and-commutative',
+        name: 'Commutativity of conjunction',
+        statement: '(P ∧ Q) ↔ (Q ∧ P)',
+        domain: 'propositional',
+        tags: ['commutativity', 'classical', 'intuitionistic', 'conjunction'],
+        difficulty: 'trivial',
+    },
+    {
+        id: 'prop.or-commutative',
+        name: 'Commutativity of disjunction',
+        statement: '(P ∨ Q) ↔ (Q ∨ P)',
+        domain: 'propositional',
+        tags: ['commutativity', 'classical', 'intuitionistic', 'disjunction'],
+        difficulty: 'trivial',
+    },
+    {
+        id: 'prop.and-associative',
+        name: 'Associativity of conjunction',
+        statement: '((P ∧ Q) ∧ R) ↔ (P ∧ (Q ∧ R))',
+        domain: 'propositional',
+        tags: ['associativity', 'classical', 'intuitionistic', 'conjunction'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'prop.or-associative',
+        name: 'Associativity of disjunction',
+        statement: '((P ∨ Q) ∨ R) ↔ (P ∨ (Q ∨ R))',
+        domain: 'propositional',
+        tags: ['associativity', 'classical', 'intuitionistic', 'disjunction'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'prop.and-idempotent',
+        name: 'Idempotence of conjunction',
+        statement: '(P ∧ P) ↔ P',
+        domain: 'propositional',
+        tags: ['idempotence', 'classical', 'intuitionistic', 'conjunction'],
+        difficulty: 'trivial',
+    },
+    {
+        id: 'prop.or-idempotent',
+        name: 'Idempotence of disjunction',
+        statement: '(P ∨ P) ↔ P',
+        domain: 'propositional',
+        tags: ['idempotence', 'classical', 'intuitionistic', 'disjunction'],
+        difficulty: 'trivial',
+    },
+    {
+        id: 'prop.and-distributes-over-or',
+        name: 'Conjunction distributes over disjunction',
+        statement: '(P ∧ (Q ∨ R)) ↔ ((P ∧ Q) ∨ (P ∧ R))',
+        domain: 'propositional',
+        tags: ['distributivity', 'classical', 'intuitionistic', 'conjunction', 'disjunction'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'prop.or-distributes-over-and',
+        name: 'Disjunction distributes over conjunction',
+        statement: '(P ∨ (Q ∧ R)) ↔ ((P ∨ Q) ∧ (P ∨ R))',
+        domain: 'propositional',
+        tags: ['distributivity', 'classical', 'intuitionistic', 'conjunction', 'disjunction'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'prop.absorption-and',
+        name: 'Absorption (∧ over ∨)',
+        statement: '(P ∧ (P ∨ Q)) ↔ P',
+        domain: 'propositional',
+        tags: ['absorption', 'classical', 'intuitionistic', 'conjunction', 'disjunction'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'prop.absorption-or',
+        name: 'Absorption (∨ over ∧)',
+        statement: '(P ∨ (P ∧ Q)) ↔ P',
+        domain: 'propositional',
+        tags: ['absorption', 'classical', 'intuitionistic', 'conjunction', 'disjunction'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'prop.implication-as-or',
+        name: 'Implication as disjunction',
+        statement: '(P → Q) ↔ (¬P ∨ Q)',
+        domain: 'propositional',
+        tags: ['implication', 'classical', 'disjunction', 'negation', 'definition'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'prop.biconditional-def',
+        name: 'Biconditional definition',
+        statement: '(P ↔ Q) ↔ ((P → Q) ∧ (Q → P))',
+        domain: 'propositional',
+        tags: ['biconditional', 'classical', 'intuitionistic', 'implication', 'conjunction'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'prop.ex-falso',
+        name: 'Ex falso quodlibet',
+        statement: '⊥ → P',
+        domain: 'propositional',
+        tags: ['ex-falso', 'explosion', 'classical', 'intuitionistic', 'bottom'],
+        difficulty: 'easy',
+        isAxiom: true,
+    },
+    {
+        id: 'prop.peirce',
+        name: "Peirce's law",
+        statement: '((P → Q) → P) → P',
+        domain: 'propositional',
+        tags: ['peirce', 'classical', 'implication'],
+        difficulty: 'hard',
+        references: ['Peirce, 1885'],
+    },
+    {
+        id: 'prop.weakening',
+        name: 'Weakening',
+        statement: 'P → (Q → P)',
+        domain: 'propositional',
+        tags: ['weakening', 'classical', 'intuitionistic', 'implication'],
+        difficulty: 'trivial',
+        isAxiom: true,
+    },
+    {
+        id: 'prop.and-elim-left',
+        name: 'Conjunction elimination (left)',
+        statement: '(P ∧ Q) → P',
+        domain: 'propositional',
+        tags: ['elimination', 'classical', 'intuitionistic', 'conjunction'],
+        difficulty: 'trivial',
+    },
+    {
+        id: 'prop.and-elim-right',
+        name: 'Conjunction elimination (right)',
+        statement: '(P ∧ Q) → Q',
+        domain: 'propositional',
+        tags: ['elimination', 'classical', 'intuitionistic', 'conjunction'],
+        difficulty: 'trivial',
+    },
+    {
+        id: 'prop.or-intro-left',
+        name: 'Disjunction introduction (left)',
+        statement: 'P → (P ∨ Q)',
+        domain: 'propositional',
+        tags: ['introduction', 'classical', 'intuitionistic', 'disjunction'],
+        difficulty: 'trivial',
+    },
+    {
+        id: 'prop.or-intro-right',
+        name: 'Disjunction introduction (right)',
+        statement: 'Q → (P ∨ Q)',
+        domain: 'propositional',
+        tags: ['introduction', 'classical', 'intuitionistic', 'disjunction'],
+        difficulty: 'trivial',
+    },
+];
+//# sourceMappingURL=propositional.js.map

package/dist/tooling/lemma-library/propositional.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"propositional.js","sourceRoot":"","sources":["../../../src/tooling/lemma-library/propositional.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,qDAAqD;AACrD,gEAAgE;AAChE,+DAA+D;;;AAIlD,QAAA,oBAAoB,GAAmB;IAClD;QACE,EAAE,EAAE,eAAe;QACnB,IAAI,EAAE,UAAU;QAChB,SAAS,EAAE,OAAO;QAClB,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,gBAAgB,CAAC;QAChE,UAAU,EAAE,SAAS;KACtB;IACD;QACE,EAAE,EAAE,2BAA2B;QAC/B,IAAI,EAAE,6BAA6B;QACnC,SAAS,EAAE,SAAS;QACpB,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,UAAU,EAAE,WAAW,EAAE,iBAAiB,CAAC;QAClD,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,4BAA4B;QAChC,IAAI,EAAE,8BAA8B;QACpC,SAAS,EAAE,SAAS;QACpB,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,UAAU,EAAE,WAAW,EAAE,gBAAgB,EAAE,iBAAiB,CAAC;QACpE,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,sBAAsB;QAC1B,IAAI,EAAE,wBAAwB;QAC9B,SAAS,EAAE,QAAQ;QACnB,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,WAAW,EAAE,mBAAmB,EAAE,aAAa,EAAE,UAAU,CAAC;QACnE,UAAU,EAAE,MAAM;QAClB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,wBAAwB;QAC5B,IAAI,EAAE,0BAA0B;QAChC,SAAS,EAAE,WAAW;QACtB,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,WAAW,EAAE,gBAAgB,EAAE,UAAU,EAAE,aAAa,CAAC;QAChE,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,oBAAoB;QACxB,IAAI,EAAE,yBAAyB;QAC/B,SAAS,EAAE,sBAAsB;QACjC,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,WAAW,EAAE,SAAS,EAAE,WAAW,EAAE,aAAa,EAAE,aAAa,EAAE,UAAU,CAAC;QACrF,UAAU,EAAE,MAAM;QAClB,UAAU,EAAE,CAAC,iBAAiB,CAAC;KAChC;IACD;QACE,EAAE,EAAE,mBAAmB;QACvB,IAAI,EAAE,yBAAyB;QAC/B,SAAS,EAAE,sBAAsB;QACjC,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,WAAW,EAAE,SAAS,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,EAAE,UAAU,CAAC;QACxF,UAAU,EAAE,MAAM;QAClB,UAAU,EAAE,CAAC,iBAAiB,CAAC;KAChC;IACD;QACE,EAAE,EAAE,qBAAqB;QACzB,IAAI,EAAE,gBAAgB;QACtB,SAAS,EAAE,qBAAqB;QAChC,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,gBAAgB,EAAE,WAAW,EAAE,aAAa,EAAE,UAAU,CAAC;QAChE,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,mBAAmB;QACvB,IAAI,EAAE,cAAc;QACpB,SAAS,EAAE,mBAAmB;QAC9B,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,cAAc,EAAE,WAAW,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,CAAC;QACjF,UAAU,EAAE,SAAS;QACrB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,oBAAoB;QACxB,IAAI,EAAE,eAAe;QACrB,SAAS,EAAE,qBAAqB;QAChC,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,eAAe,EAAE,WAAW,EAAE,WAAW,EAAE,aAAa,EAAE,UAAU,CAAC;QAC5E,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,6BAA6B;QACjC,IAAI,EAAE,wBAAwB;QAC9B,SAAS,EAAE,+BAA+B;QAC1C,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,WAAW,EAAE,cAAc,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,CAAC;QACjF,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,4BAA4B;QAChC,IAAI,EAAE,uBAAuB;QAC7B,SAAS,EAAE,oBAAoB;QAC/B,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,WAAW,EAAE,WAAW,EAAE,aAAa,EAAE,UAAU,CAAC;QAC3D,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,sBAAsB;QAC1B,IAAI,EAAE,8BAA8B;QACpC,SAAS,EAAE,mBAAmB;QAC9B,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,eAAe,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,CAAC;QACrE,UAAU,EAAE,SAAS;KACtB;IACD;QACE,EAAE,EAAE,qBAAqB;QACzB,IAAI,EAAE,8BAA8B;QACpC,SAAS,EAAE,mBAAmB;QAC9B,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,eAAe,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,CAAC;QACrE,UAAU,EAAE,SAAS;KACtB;IACD;QACE,EAAE,EAAE,sBAAsB;QAC1B,IAAI,EAAE,8BAA8B;QACpC,SAAS,EAAE,+BAA+B;QAC1C,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,eAAe,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,CAAC;QACrE,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,qBAAqB;QACzB,IAAI,EAAE,8BAA8B;QACpC,SAAS,EAAE,+BAA+B;QAC1C,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,eAAe,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,CAAC;QACrE,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,qBAAqB;QACzB,IAAI,EAAE,4BAA4B;QAClC,SAAS,EAAE,aAAa;QACxB,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,aAAa,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,CAAC;QACnE,UAAU,EAAE,SAAS;KACtB;IACD;QACE,EAAE,EAAE,oBAAoB;QACxB,IAAI,EAAE,4BAA4B;QAClC,SAAS,EAAE,aAAa;QACxB,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,aAAa,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,CAAC;QACnE,UAAU,EAAE,SAAS;KACtB;IACD;QACE,EAAE,EAAE,8BAA8B;QAClC,IAAI,EAAE,0CAA0C;QAChD,SAAS,EAAE,qCAAqC;QAChD,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,gBAAgB,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,EAAE,aAAa,CAAC;QACrF,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,8BAA8B;QAClC,IAAI,EAAE,0CAA0C;QAChD,SAAS,EAAE,qCAAqC;QAChD,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,gBAAgB,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,EAAE,aAAa,CAAC;QACrF,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,qBAAqB;QACzB,IAAI,EAAE,uBAAuB;QAC7B,SAAS,EAAE,mBAAmB;QAC9B,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,YAAY,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,EAAE,aAAa,CAAC;QACjF,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,oBAAoB;QACxB,IAAI,EAAE,uBAAuB;QAC7B,SAAS,EAAE,mBAAmB;QAC9B,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,YAAY,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,EAAE,aAAa,CAAC;QACjF,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,wBAAwB;QAC5B,IAAI,EAAE,4BAA4B;QAClC,SAAS,EAAE,oBAAoB;QAC/B,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,aAAa,EAAE,WAAW,EAAE,aAAa,EAAE,UAAU,EAAE,YAAY,CAAC;QAC3E,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,wBAAwB;QAC5B,IAAI,EAAE,0BAA0B;QAChC,SAAS,EAAE,+BAA+B;QAC1C,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,eAAe,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,EAAE,aAAa,CAAC;QACpF,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,eAAe;QACnB,IAAI,EAAE,oBAAoB;QAC1B,SAAS,EAAE,OAAO;QAClB,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,gBAAgB,EAAE,QAAQ,CAAC;QACxE,UAAU,EAAE,MAAM;QAClB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,aAAa;QACjB,IAAI,EAAE,cAAc;QACpB,SAAS,EAAE,mBAAmB;QAC9B,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,QAAQ,EAAE,WAAW,EAAE,aAAa,CAAC;QAC5C,UAAU,EAAE,MAAM;QAClB,UAAU,EAAE,CAAC,cAAc,CAAC;KAC7B;IACD;QACE,EAAE,EAAE,gBAAgB;QACpB,IAAI,EAAE,WAAW;QACjB,SAAS,EAAE,aAAa;QACxB,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,WAAW,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,CAAC;QACjE,UAAU,EAAE,SAAS;QACrB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,oBAAoB;QACxB,IAAI,EAAE,gCAAgC;QACtC,SAAS,EAAE,aAAa;QACxB,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,aAAa,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,CAAC;QACnE,UAAU,EAAE,SAAS;KACtB;IACD;QACE,EAAE,EAAE,qBAAqB;QACzB,IAAI,EAAE,iCAAiC;QACvC,SAAS,EAAE,aAAa;QACxB,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,aAAa,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,CAAC;QACnE,UAAU,EAAE,SAAS;KACtB;IACD;QACE,EAAE,EAAE,oBAAoB;QACxB,IAAI,EAAE,iCAAiC;QACvC,SAAS,EAAE,aAAa;QACxB,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,cAAc,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,CAAC;QACpE,UAAU,EAAE,SAAS;KACtB;IACD;QACE,EAAE,EAAE,qBAAqB;QACzB,IAAI,EAAE,kCAAkC;QACxC,SAAS,EAAE,aAAa;QACxB,MAAM,EAAE,eAAe;QACvB,IAAI,EAAE,CAAC,cAAc,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,CAAC;QACpE,UAAU,EAAE,SAAS;KACtB;CACF,CAAC"}

package/dist/tooling/lemma-library/set-theory.d.ts

@@ -0,0 +1,3 @@
+import type { CuratedLemma } from './types';
+export declare const SET_THEORY_LEMMAS: CuratedLemma[];
+//# sourceMappingURL=set-theory.d.ts.map

package/dist/tooling/lemma-library/set-theory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"set-theory.d.ts","sourceRoot":"","sources":["../../../src/tooling/lemma-library/set-theory.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAE5C,eAAO,MAAM,iBAAiB,EAAE,YAAY,EA6H3C,CAAC"}