# Question 5225: Typed Principal-Filter Obstruction Candidates [Return to catalogue page 27](https://ocme.evemisslab.com/en/questions/page/27/) [← Question derivation index](https://ocme.evemisslab.com/en/questions/) · [Original question batch](https://ocme.evemisslab.com/en/practice/batch-20261008-advance-20261011-r07-tends-to-relation-foundations/#q-20261008-advance-20261011-r07-tends-to-relation-0075) This teaching derivation has second-context AI mathematical and bilingual semantic review, limited to the model and assumptions stated in this question. It has no human review or new Lean proof and does not promote the original question or MKO to Canonical truth. R0009-05225 · q-20261008-advance-20261011-r07-tends-to-relation-0075 ## Original question and givens The complete total map f:Fin(6)→Fin(2) has images=[0, 1, 1, 0, 0, 1] indexed from 0; Fin(6)={0,…,5}. Every table entry must lie in the target type. S=[0, 1, 2]. principal(S) contains all source subsets containing S; the empty generator is allowed, and no NeBot premise is added. T=[0], ordered candidates=[0, 2, 0]. For each c, answer whether c∈S and f(c)∉T; do not evaluate f at a candidate outside its type. - G001 — The complete total map f:Fin(6)→Fin(2) has images=[0, 1, 1, 0, 0, 1] indexed from 0; Fin(6)={0,…,5}. Every table entry must lie in the target type. S=[0, 1, 2]. principal(S) contains all source subsets containing S; the empty generator is allowed, and no NeBot premise is added. T=[0], ordered candidates=[0, 2, 0]. For each c, answer whether c∈S and f(c)∉T; do not evaluate f at a candidate outside its type. ## Definition and scope Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate. - [mko-tends-to-relation](https://ocme.evemisslab.com/en/mko/mko-tends-to-relation/) ## Step-by-step derivation S001 · impliesBefore source index=0∈Fin(6) After image=0∈Fin(2) Conditions: none Every entry of the complete table must be legal;an entry being unused later does not waive total-map typing. Step identifiers and dependenciesRule: complete_principal_map_row · Uses: G001 S002 · impliesBefore source index=1∈Fin(6) After image=1∈Fin(2) Conditions: none Every entry of the complete table must be legal;an entry being unused later does not waive total-map typing. Step identifiers and dependenciesRule: complete_principal_map_row · Uses: G001, S001 S003 · impliesBefore source index=2∈Fin(6) After image=1∈Fin(2) Conditions: none Every entry of the complete table must be legal;an entry being unused later does not waive total-map typing. Step identifiers and dependenciesRule: complete_principal_map_row · Uses: G001, S002 S004 · impliesBefore source index=3∈Fin(6) After image=0∈Fin(2) Conditions: none Every entry of the complete table must be legal;an entry being unused later does not waive total-map typing. Step identifiers and dependenciesRule: complete_principal_map_row · Uses: G001, S003 S005 · impliesBefore source index=4∈Fin(6) After image=0∈Fin(2) Conditions: none Every entry of the complete table must be legal;an entry being unused later does not waive total-map typing. Step identifiers and dependenciesRule: complete_principal_map_row · Uses: G001, S004 S006 · impliesBefore source index=5∈Fin(6) After image=1∈Fin(2) Conditions: none Every entry of the complete table must be legal;an entry being unused later does not waive total-map typing. Step identifiers and dependenciesRule: complete_principal_map_row · Uses: G001, S005 S007 · impliesBefore Fin(6)→Fin(2);S=[0, 1, 2];full map=[0, 1, 1, 0, 0, 1] After principal(S)={A:S⊆A};empty generators allowed,no NeBot Conditions: none The declared convention allows empty S;its family of supersets then contains the empty set,and no proper-filter or NeBot condition is added.This is a finite principal-generator model,not a general sequence or point limit. Step identifiers and dependenciesRule: finite_principal_generator_convention · Uses: G001, S006 S008 · impliesBefore candidate=0;inside Fin(n)=Yes;inside S=Yes After image if in S=0;obstruction=No Conditions: none Check type and S-membership before table access;outside S do not read the table,so negative or outside indices cannot masquerade as legal map evaluations. Step identifiers and dependenciesRule: typed_principal_candidate_obstruction · Uses: G001, S007 S009 · impliesBefore candidate=2;inside Fin(n)=Yes;inside S=Yes After image if in S=1;obstruction=Yes Conditions: none Check type and S-membership before table access;outside S do not read the table,so negative or outside indices cannot masquerade as legal map evaluations. Step identifiers and dependenciesRule: typed_principal_candidate_obstruction · Uses: G001, S008 S010 · impliesBefore candidate=0;inside Fin(n)=Yes;inside S=Yes After image if in S=0;obstruction=No Conditions: none Check type and S-membership before table access;outside S do not read the table,so negative or outside indices cannot masquerade as legal map evaluations. Step identifiers and dependenciesRule: typed_principal_candidate_obstruction · Uses: G001, S009 ## Reverse checks - S010 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S009 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S008 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S007 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S006 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S005 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S004 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S003 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. ## Result [No, Yes, No] The full substitutions and premise checks give the original answer; source identity,format and status are unchanged. ## This question review and source binding Review date: 2026-10-26 Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof. Source hashes and review receipts - input commit: 0f7be61e2c22317a4075561dc822c87d881a50db - original question SHA-256: acf1a74fb7a2e42bacba1e53f8dab7bf8ea580014f93accfbbbe309e944897fa - candidate record SHA-256: e1f14e8571adb7b5d43285a627b9c4c97f38862b60aebe3ea4eadb29f495be79 - semantic review receipt SHA-256: 71e7db519df31f3a164533e472e293cb64f001b475a8d002b4a5c2740a237b56 - question-first witness SHA-256: 5a43f4f81b6256281f8d139a4010bbde127be803c528e5878857269c8f854462 - Lean: NOT_RUN · human review: NOT_PERFORMED [Same-source full JSON](https://ocme.evemisslab.com/data/question-derivations/questions/q-20261008-advance-20261011-r07-tends-to-relation-0075.json)