{"slug":"formal-conditional-determinism","identifier":"formal-conditional-determinism","title":"Conditional Determinism","author":"Maclain Hunter","sourceSha256":"6cb8cd31364ff39227ce4abbd13e669a242c6a1bb7ba6a1cdec2c23a2553ae53","sourceKind":"formal-theorem","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:37:54.225Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.conditional_returns_declared_branch"],"units":[{"id":"conditional_returns_declared_branch","sourceStatement":"Formal statement: ∀c,t,e: mcbConditional(c,t,e) ∈ {t, e}","sourceOffset":0,"scope":"Universal branch membership for the declared deterministic conditional, over arbitrary result types.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"theorem conditional_returns_declared_branch {α : Type} (condition : Bool) (t e : α) :\n    (if condition then t else e) = t ∨ (if condition then t else e) = e := by\n  cases condition\n  · exact Or.inr rfl\n  · exact Or.inl rfl\n#print axioms conditional_returns_declared_branch\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.conditional_returns_declared_branch"}],"files":{"source.json":{"sha256":"2d323dea796010e9c5c190ba5f841bb1887569f31f87389d1be56500db43d935","bytes":746},"Proof.lean":{"sha256":"da37f151532848baffce74171f439f6460f99437a5ad0afb4718170395590af0","bytes":555},"lean-check.txt":{"sha256":"a54bde994b92162852a8caaf91ab837249a7827346df70328312c165b96a640c","bytes":139}},"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":"6cb8cd31364ff39227ce4abbd13e669a242c6a1bb7ba6a1cdec2c23a2553ae53","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/formal-conditional-determinism","jsonUrl":"/proof-verification/formal-conditional-determinism.json","leanUrl":"/proof-verification/formal-conditional-determinism.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://mcbcore.net/proof-verification/formal-conditional-determinism#lean","name":"Lean 4 witness: Conditional Determinism","url":"https://mcbcore.net/proof-verification/formal-conditional-determinism","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:37:54.225Z","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":"Conditional Determinism","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://mcbcore.net/proof-knowledge/formal-conditional-determinism","identifier":"formal-conditional-determinism"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://mcbcore.net/proof-verification/formal-conditional-determinism.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.conditional_returns_declared_branch\"]"},{"@type":"PropertyValue","name":"sourceSha256","value":"6cb8cd31364ff39227ce4abbd13e669a242c6a1bb7ba6a1cdec2c23a2553ae53"},{"@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"}]}}