{"schema_version":"ocme-site-results-v1","locale":"en","page_type":"derivations","facts":{"questions":36000,"reviewed":36000,"display_candidates":0,"knowledge":302,"guides":299,"paths":59,"batches":360,"families":1441,"atlas":302,"core":80,"evidence":9,"formal_evidence":5,"formal_subjects":4,"lean_files":6,"lean_toolchain":"leanprover/lean4:v4.30.0","question_state":"candidate","english_state":"ai_candidate","question_Lean":"NOT_RUN","canonical_truth_promotion":false},"filters":{"q":"mko-lean-proof-term"},"kind":"guides","total":1,"pages":1,"page":1,"entries":[{"id":"derivation-mko-lean-proof-term-01","title":{"zh-Hant":"證明項：逐部分解讀 λh. ⟨snd h, fst h⟩ 為何是 P∧Q→Q∧P 的證明項","en":"Proof term: reading λh. ⟨snd h, fst h⟩ part by part as a proof term for P∧Q→Q∧P"},"summary":{"zh-Hant":"在一個明示的合成小型命題型別系統 ST 中（對應 MKO 假設 a2），取相異命題原子 P、Q：逐部分說明項 t=λh:P∧Q. ⟨snd h, fst h⟩ 的每一部分建立了什麼、具有什麼型別，推導判斷 ⊢ t : P∧Q→Q∧P，並說明 t 的型別為什麼與命題 S=P∧Q→Q∧P 相符；再證明外觀相近的 t′=λh:P∧Q. ⟨fst h, snd h⟩ 不是 S 的證明項。最後區分「ST 中的型別推導」「Lean kernel 接受」與「已保存的 proof-term receipt」三者。","en":"In an explicit synthetic small propositional type system ST (matching MKO assumption a2), with distinct propositional atoms P and Q: explain part by part what each piece of the term t=λh:P∧Q. ⟨snd h, fst h⟩ establishes and what type it has, derive the judgment ⊢ t : P∧Q→Q∧P, and explain why the type of t matches the proposition S=P∧Q→Q∧P; then prove that the similar-looking t′=λh:P∧Q. ⟨fst h, snd h⟩ is not a proof term for S. Finally separate three things: a typing derivation in ST, acceptance by the Lean kernel, and a saved proof-term receipt."},"mko_ids":["mko-lean-proof-term"]}],"title":"Concept derivation guides"}