{"slug":"archived-q1054-9bc0dfbadc58","identifier":"archived-q1054-9bc0dfbadc58","title":"NOT Involution","author":"Maclain Hunter","sourceSha256":"9bc0dfbadc58a4fae979cab7188a0fafa6eb7a9eb409db67c2826627cd9b2737","sourceKind":"archived-authored-source","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:40.592Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.negation_value_involution"],"units":[{"id":"negation_value_involution","sourceStatement":"{\n  \"name\": \"NOT Involution\",\n  \"formal\": \"∀e ∈ MCBExponent: NOT(NOT(e)) = e\",\n  \"proof\": \"NOT(NOT(v)) = NOT(-v) = -(-v) = v\",\n  \"implementation\": \"mcbExponentNOT(a: MCBExponent): MCBExponent\"\n}","sourceOffset":0,"scope":"Exact authored value-level NOT involution for arbitrary integers. Host record metadata preservation is a separate implementation obligation.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"theorem negation_value_involution (value : Int) : -(-value) = value :=\n  Int.neg_neg value\n#print axioms negation_value_involution\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.negation_value_involution"}],"files":{"source.json":{"sha256":"ba485819a794255275abcb5188db668dbf2149ca3f74599bc387878d92b3d38a","bytes":744},"Proof.lean":{"sha256":"b4a8a7d774173b80daa3e39a922729ef9c7a52beb2a251e23aec97751c03709e","bytes":397},"lean-check.txt":{"sha256":"1afa795344f173ee8cf18fffb82fbaa4907347fe87a313d3cda5ae8976ac682b","bytes":129}},"boundary":"Lean establishes the listed formal statements and dependencies. The exact authored source, Ground, known premise meanings, application validation and empirical evidence remain separately typed. No unencoded section is certified by a neighboring theorem.","currentSourceSha256":"9bc0dfbadc58a4fae979cab7188a0fafa6eb7a9eb409db67c2826627cd9b2737","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/archived-q1054-9bc0dfbadc58","jsonUrl":"/proof-verification/archived-q1054-9bc0dfbadc58.json","leanUrl":"/proof-verification/archived-q1054-9bc0dfbadc58.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://4p-mcb.com/proof-verification/archived-q1054-9bc0dfbadc58#lean","name":"Lean 4 witness: NOT Involution","url":"https://4p-mcb.com/proof-verification/archived-q1054-9bc0dfbadc58","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:40:40.592Z","creator":{"@type":"Organization","name":"Replit Agent"},"programmingLanguage":{"@type":"ComputerLanguage","name":"Lean","version":"Lean (version 4.7.0, commit v4.7.0, Release)"},"author":{"@type":"Organization","name":"Replit Agent"},"description":"Lean establishes the listed formal statements and dependencies. The exact authored source, Ground, known premise meanings, application validation and empirical evidence remain separately typed. No unencoded section is certified by a neighboring theorem.","isBasedOn":{"@type":"CreativeWork","name":"NOT Involution","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://4p-mcb.com/proof-knowledge/archived-q1054-9bc0dfbadc58","identifier":"archived-q1054-9bc0dfbadc58"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://4p-mcb.com/proof-verification/archived-q1054-9bc0dfbadc58.lean"},"subjectOf":{"@type":"DigitalDocument","name":"Independently verified RFC 3161 existence timestamp","dateCreated":"2026-10-03T10:42:55.000Z","url":"https://4p-mcb.com/proof-verification/timestamp.json"},"additionalProperty":[{"@type":"PropertyValue","name":"verificationStatus","value":"partial"},{"@type":"PropertyValue","name":"axiomFree","value":"true"},{"@type":"PropertyValue","name":"axiomDependencies","value":"[]"},{"@type":"PropertyValue","name":"theorems","value":"[\"HunterAuthored.negation_value_involution\"]"},{"@type":"PropertyValue","name":"sourceSha256","value":"9bc0dfbadc58a4fae979cab7188a0fafa6eb7a9eb409db67c2826627cd9b2737"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"null"},{"@type":"PropertyValue","name":"sourceDateMeaning","value":"Database registration time, not a claim of original handwritten authorship."},{"@type":"PropertyValue","name":"originalAuthoredAt","value":"null"},{"@type":"PropertyValue","name":"timestampAuthority","value":"https://www.freetsa.org"},{"@type":"PropertyValue","name":"timestampScope","value":"Independent cryptographic existence timestamp for the manifest and its content-addressed artifacts. Not legal notarization, an authorship adjudication, or a retroactive timestamp for handwritten work."},{"@type":"PropertyValue","name":"governingGround","value":"Logic / Logos / God"},{"@type":"PropertyValue","name":"formalizationAttribution","value":"Machine formalization by Replit Agent of Maclain Hunter's unchanged authored source"}]}}