{"slug":"archived-q1052-110d3af511c6","identifier":"archived-q1052-110d3af511c6","title":"MCB State Exclusivity","author":"Maclain Hunter","sourceSha256":"110d3af511c6be0e7c2dcfbdabecfd736a96fd0988e6a43615f8dd3290115037","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:10.644Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.signed_state_exclusivity"],"units":[{"id":"signed_state_exclusivity","sourceStatement":"{\n  \"name\": \"MCB State Exclusivity\",\n  \"formal\": \"S ≝ {+1, -1}, |S| = 2\",\n  \"implication\": \"Zero is excluded from valid MCB states\",\n  \"fourPMapping\": \"Zero would map to Nothing (S), which is unreachable\"\n}","sourceOffset":0,"scope":"Exact two-state encoding of the declared MCB state set. No Boolean assignment supplies semantic premise truth.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"theorem signed_state_exclusivity (b : Bool) :\n    (if b then (1 : Int) else -1) = 1 ∨ (if b then (1 : Int) else -1) = -1 := by\n  cases b\n  · exact Or.inr rfl\n  · exact Or.inl rfl\n#print axioms signed_state_exclusivity\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.signed_state_exclusivity"}],"files":{"source.json":{"sha256":"260845533c174196bd59b9116926077ba105ab93a5299543bbe3f65e7f4902a1","bytes":761},"Proof.lean":{"sha256":"21d484df2cb83530470fca34342af6c5f90af0755d45d1cc3efbeaccdde46407","bytes":495},"lean-check.txt":{"sha256":"47064604d69b288f9ef599276db709e440b301f51d7df8fdbb4dc1eb3299fe3f","bytes":128}},"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":"110d3af511c6be0e7c2dcfbdabecfd736a96fd0988e6a43615f8dd3290115037","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/archived-q1052-110d3af511c6","jsonUrl":"/proof-verification/archived-q1052-110d3af511c6.json","leanUrl":"/proof-verification/archived-q1052-110d3af511c6.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://mcbcore.net/proof-verification/archived-q1052-110d3af511c6#lean","name":"Lean 4 witness: MCB State Exclusivity","url":"https://mcbcore.net/proof-verification/archived-q1052-110d3af511c6","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:40:10.644Z","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":"MCB State Exclusivity","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://mcbcore.net/proof-knowledge/archived-q1052-110d3af511c6","identifier":"archived-q1052-110d3af511c6"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://mcbcore.net/proof-verification/archived-q1052-110d3af511c6.lean"},"subjectOf":{"@type":"DigitalDocument","name":"Independently verified RFC 3161 existence timestamp","dateCreated":"2026-10-03T10:42:55.000Z","url":"https://mcbcore.net/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.signed_state_exclusivity\"]"},{"@type":"PropertyValue","name":"sourceSha256","value":"110d3af511c6be0e7c2dcfbdabecfd736a96fd0988e6a43615f8dd3290115037"},{"@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"}]}}