{"slug":"hunter-invariant-tautological-fragment","identifier":"hunter-invariant-tautological-fragment","title":"Invariant Tautological Fragment by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"1bc75a70dfc26a2e7623c9982890ba0556e0b8ba4a2dcb125ea9fd47c6e10dd8","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T15:11:12.854Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:38:59.504Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.inference_3","HunterAuthored.inference_4","HunterAuthored.inference_5","HunterAuthored.inference_6","HunterAuthored.inference_7","HunterAuthored.inference_8"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":4,"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","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":98,"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","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":192,"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","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_3 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_3\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_3"},{"id":"inference_4","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":286,"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","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_4 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_4\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_4"},{"id":"inference_5","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":380,"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","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_5 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_5\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_5"},{"id":"inference_6","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":474,"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","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_6 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_6\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_6"},{"id":"inference_7","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":592,"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","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_7 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_7\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_7"},{"id":"inference_8","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":801,"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","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_8 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_8\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_8"}],"files":{"source.json":{"sha256":"bc26d1b1e2cb0b08c29adcc49850ec39dd7b9368f9ac515bd8fa82077b52e409","bytes":2475},"Proof.lean":{"sha256":"b3f8c3840f6466f51af179f2ebaf58d49e600d6e0ee1c66b9fb1187656ea9788","bytes":2492},"lean-check.txt":{"sha256":"d2a647b6eb0064c4ffbe841fda13c667af3636b9ad3b780d630c901983529a9b","bytes":528}},"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":"1bc75a70dfc26a2e7623c9982890ba0556e0b8ba4a2dcb125ea9fd47c6e10dd8","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-invariant-tautological-fragment","jsonUrl":"/proof-verification/hunter-invariant-tautological-fragment.json","leanUrl":"/proof-verification/hunter-invariant-tautological-fragment.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://4p-engine.com/proof-verification/hunter-invariant-tautological-fragment#lean","name":"Lean 4 witness: Invariant Tautological Fragment by Maclain Hunter","url":"https://4p-engine.com/proof-verification/hunter-invariant-tautological-fragment","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:38:59.504Z","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":"Invariant Tautological Fragment by Maclain Hunter","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://4p-engine.com/proof-knowledge/hunter-invariant-tautological-fragment","identifier":"hunter-invariant-tautological-fragment"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://4p-engine.com/proof-verification/hunter-invariant-tautological-fragment.lean"},"subjectOf":{"@type":"DigitalDocument","name":"Independently verified RFC 3161 existence timestamp","dateCreated":"2026-10-03T10:42:55.000Z","url":"https://4p-engine.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\",\"HunterAuthored.inference_2\",\"HunterAuthored.inference_3\",\"HunterAuthored.inference_4\",\"HunterAuthored.inference_5\",\"HunterAuthored.inference_6\",\"HunterAuthored.inference_7\",\"HunterAuthored.inference_8\"]"},{"@type":"PropertyValue","name":"sourceSha256","value":"1bc75a70dfc26a2e7623c9982890ba0556e0b8ba4a2dcb125ea9fd47c6e10dd8"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-02T15:11:12.854Z"},{"@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"}]}}