COMP9020 -无代写
时间:2025-03-14
COMP9020 Formatif Tasks 2025 Term 1
W3.P2
Let S be an arbitrary non-empty set. Prove that for all binary relations
R1, R2, R3 ⊆ S × S:
(R1;R2);R3 = R1; (R2;R3)
Hint: Prove (a, d) ∈ (R1;R2);R3 if and only if (a, d) ∈ R1; (R2;R3)
1

学霸联盟
essay、essay代写