Original question and givens
The binary relation has source A={4, 5, 6}, target B={8, 9, 10}, and R={(4, 8), (5, 9), (6, 10)}⊆A×B. Does the ordered pair (8, 4) belong to R?
G001 — The binary relation has source A={4, 5, 6}, target B={8, 9, 10}, and R={(4, 8), (5, 9), (6, 10)}⊆A×B. Does the ordered pair (8, 4) belong to R?
Step-by-step derivation
S001 · implies
Before
source roles = [qf-relation-pair-membership, [A, B, R, operation, x, y]]
After
derived = [pair_membership, no-invented-domain]
Conditions: none
Keep EACH bank’s keys/operation/domain distinct:LDL/PULSE/function legacy table underscores,TREE full tree_* with its declared domain,and permissive BASE signed without invented op/domain.All arithmetic respects the binary-primitive contract.
Step identifiers and dependencies
Rule: R69_SOURCE_specific_keys_operation_domain_AND_binary_contract · Uses: G001
S002 · implies
Before
source roles = [relation A ORIGINAL, 100, [4, 5, 6]]
After
derived = [[4, 5, 6]]
Conditions: none
Type EVERY RAW SAFE label,distinctness and THIS bank’s cardinality bound;empty is allowed.Sort ONLY the derived representation,not original JSON.Do not exchange TREE and LDL limits.
Step identifiers and dependencies
Rule: Finite_RAW_ALL_SAFE_distinct_labels_then_derived_sort · Uses: G001, S001
S003 · implies
Before
source roles = [relation B ORIGINAL, 100, [8, 9, 10]]
After
derived = [[8, 9, 10]]
Conditions: none
Type EVERY RAW SAFE label,distinctness and THIS bank’s cardinality bound;empty is allowed.Sort ONLY the derived representation,not original JSON.Do not exchange TREE and LDL limits.
Step identifiers and dependencies
Rule: Finite_RAW_ALL_SAFE_distinct_labels_then_derived_sort · Uses: G001, S002
S004 · implies
Before
source roles = [relation R ORIGINAL, 0, [4, 8]]
After
derived = [[4, 8]]
Conditions: none
BEFORE deduplication,type EACH RAW pair as EXACTLY TWO SAFE components.Identical rows may be representation duplicates,but no unvalidated cell may be silently discarded.
Step identifiers and dependencies
Rule: Pairs_EVERY_RAW_two_SAFE_cells_BEFORE_any_dedup · Uses: G001, S003
S005 · implies
Before
source roles = [relation R ORIGINAL, 1, [5, 9]]
After
derived = [[5, 9]]
Conditions: none
BEFORE deduplication,type EACH RAW pair as EXACTLY TWO SAFE components.Identical rows may be representation duplicates,but no unvalidated cell may be silently discarded.
Step identifiers and dependencies
Rule: Pairs_EVERY_RAW_two_SAFE_cells_BEFORE_any_dedup · Uses: G001, S004
S006 · implies
Before
source roles = [relation R ORIGINAL, 2, [6, 10]]
After
derived = [[6, 10]]
Conditions: none
BEFORE deduplication,type EACH RAW pair as EXACTLY TWO SAFE components.Identical rows may be representation duplicates,but no unvalidated cell may be silently discarded.
Step identifiers and dependencies
Rule: Pairs_EVERY_RAW_two_SAFE_cells_BEFORE_any_dedup · Uses: G001, S005
S007 · implies
Before
source roles = [[4, 5, 6], [8, 9, 10], [[4, 8], [5, 9], [6, 10]]]
After
derived = [Yes]
Conditions: none
FIRST qualify the WHOLE R as a subset of A×B.A relation may be one-to-many/many-to-one and need not be total or a function.Typed raw duplicate pairs may normalize.
Step identifiers and dependencies
Rule: Relation_WHOLE_R_subset_declared_AcrossB_NO_function_premise · Uses: G001, S006
S008 · implies
Before
source roles = [8, 4]
After
derived = [[[[4, 8], No], [[5, 9], No], [[6, 10], No]], No]
Conditions: none
Compare the COMPLETE ordered pair,not separately occurring coordinates.A query outside carriers or in empty R is a LEGAL No.Do not force queried labels into A/B or confuse(y,x).
Step identifiers and dependencies
Rule: Relation_PAIR_query_keep_component_order_OUTSIDE_is_legal_No · Uses: G001, S007