Question 3074: Permitted Domain of a Restricted Composition

Original question and givens

Let f:A→B and g:D→C be the explicit total functions A={11, 12, 13}, B={-25, 0, 26}, D={122}, C={-46, 1, 47}, f=[(11, 26), (12, -25), (13, 0)], and g=[(122, 47)]. List {x∈A:f(x)∈D}.

• G001 — Let f:A→B and g:D→C be the explicit total functions A={11, 12, 13}, B={-25, 0, 26}, D={122}, C={-46, 1, 47}, f=[(11, 26), (12, -25), (13, 0)], and g=[(122, 47)]. List {x∈A:f(x)∈D}.

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-composition

Step-by-step derivation

(g∘f)(x)

g(f(x)):apply f first,then g

f:A→B;g:D→C;D={122}

both tables are total on their declared domains

x=11;f(x)=26;D={122}

f(x)∈D=No

x=12;f(x)=-25;D={122}

f(x)∈D=No

x=13;f(x)=0;D={122}

f(x)∈D=No

{x∈A:f(x)∈D}

∅

Reverse checks

• 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

∅

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.