{"slug":"hunter-our-proofs-stand","identifier":"hunter-our-proofs-stand","title":"Our Proofs Stand by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"c0b446fa430b1da250beb17d7ba4e6b123c13dcaa2d106eff50e735a72c8a144","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:42:29.527Z","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:51.161Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R <-> S, S -> T} |= T <-> ((S <-> R) & (Q <-> P))","sourceOffset":2090,"scope":"Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.","variables":["P","Q","R","S","T"],"premises":["P","P -> Q","Q -> R","R <-> S","S -> T"],"conclusion":"T <-> ((S <-> R) & (Q <-> P))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && (v2 == v3)) && ((!v3) || v4))) || (v4 == ((v3 == v2) && (v1 == v0)))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"00bf92de820ae89fd1d1c56454aa9cef91c38018389232d967b80076a3b41e99","bytes":6829},"Proof.lean":{"sha256":"af09fb0114f670086ed7585ee9f0b920f4c43da664342e20085481c319e23739","bytes":568},"lean-check.txt":{"sha256":"283a8aa40f54008e4bfc528069537344fae9f76a8d2f62b37f48d942b98ba62c","bytes":115}},"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":"c0b446fa430b1da250beb17d7ba4e6b123c13dcaa2d106eff50e735a72c8a144","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-our-proofs-stand","jsonUrl":"/proof-verification/hunter-our-proofs-stand.json","leanUrl":"/proof-verification/hunter-our-proofs-stand.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://4p-mcb.com/proof-verification/hunter-our-proofs-stand#lean","name":"Lean 4 witness: Our Proofs Stand by Maclain Hunter","url":"https://4p-mcb.com/proof-verification/hunter-our-proofs-stand","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:40:51.161Z","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":"Our Proofs Stand by Maclain Hunter","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://4p-mcb.com/proof-knowledge/hunter-our-proofs-stand","identifier":"hunter-our-proofs-stand"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://4p-mcb.com/proof-verification/hunter-our-proofs-stand.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":"verified"},{"@type":"PropertyValue","name":"axiomFree","value":"true"},{"@type":"PropertyValue","name":"axiomDependencies","value":"[]"},{"@type":"PropertyValue","name":"theorems","value":"[\"HunterAuthored.inference_1\"]"},{"@type":"PropertyValue","name":"sourceSha256","value":"c0b446fa430b1da250beb17d7ba4e6b123c13dcaa2d106eff50e735a72c8a144"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-02T20:42:29.527Z"},{"@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"}]}}