Metamath Proof Explorer


Theorem reldmun

Description: Split a relation into two parts based on its domain. (Contributed by Thierry Arnoux, 9-Oct-2023) Remove requirement that A and B are disjoint. (Revised by Eric Schmidt, 20-Jun-2026)

Ref Expression
Assertion reldmun Rel R dom R = A B R = R A R B

Proof

Step Hyp Ref Expression
1 reseq2 dom R = A B R dom R = R A B
2 1 adantl Rel R dom R = A B R dom R = R A B
3 resdm Rel R R dom R = R
4 3 adantr Rel R dom R = A B R dom R = R
5 resundi R A B = R A R B
6 5 a1i Rel R dom R = A B R A B = R A R B
7 2 4 6 3eqtr3d Rel R dom R = A B R = R A R B