Corollary 4.8 — Underivability of token creation and duplication
OpenABHS2004V2.corollary_4_8Falsity does not imply a token, and one token does not imply a tensor of two tokens. The displayed weak-conjunction elimination scheme is not derivable uniformly over well-formed formulas.
import Definitions.Def_ABHS2004V2_Realizability
namespace ABHS2004V2
/-- Corollary 4.8. The system proves neither token creation from falsity nor token
duplication. The displayed weak-conjunction elimination scheme is not uniformly
provable over well-formed formulas. -/
theorem corollary_4_8 :
¬ ClosedProvable (.imp Formula.bot Formula.lozenge) ∧
¬ ClosedProvable (.imp Formula.lozenge (.tensor Formula.lozenge Formula.lozenge)) ∧
¬ (∀ A B C : Formula,
A.WellFormed → B.WellFormed → C.WellFormed →
ClosedProvable (.imp (.imp A (.imp B C)) (.imp (.conj A B) C))) := by sorry
end ABHS2004V2Read-back
What the Lean code literally says, in plain math · OpenAI Codex (GPT-6)
The statement is a conjunction of three negations. Use to mean that there exists a proof term deriving the syntactic formula in the arithmetic derivation relation with both contexts empty. Write for its implication constructor, for its tensor constructor and for its additive conjunction constructor. Then the conjuncts are
The formula is the equality atom at between and , where is the unit constant. The formula is , with the variable of identifier and type and the corresponding typed existence predicate. The condition on a predicate atom requires weakly typed arguments matching its list of argument types, and on requires weakly typed at . For each binary constructor requires well-formedness on both sides, and for either quantifier it requires well-formedness of the body. Weak typing uses recorded types and the usual abstraction and application type rules, with iterator result from operand types and . The binders range over formulas including open well-formed formulas.
A context lists pairs of a natural-number assumption identifier and a formula. Derivations are generated by valid core axioms, active assumptions, implication and universal rules, passification for unit-cleaned conclusions, contraction, and list induction. A context union checks disjoint identifiers across the inputs, equality of list entries with equal identifiers in the output, and membership of exactly the entries found in the inputs. Provability is the existence of a derivation proof term.