Metamath Proof Explorer


Theorem dminxp

Description: Two ways to express totality of a restricted and corestricted binary relation (intersection of a binary relation with a Cartesian product). (Contributed by NM, 17-Jan-2006)

Ref Expression
Assertion dminxp domCA×B=AxAyBxCy

Proof

Step Hyp Ref Expression
1 dfdm4 domCA×B=ranCA×B-1
2 cnvin CA×B-1=C-1A×B-1
3 cnvxp A×B-1=B×A
4 3 ineq2i C-1A×B-1=C-1B×A
5 2 4 eqtri CA×B-1=C-1B×A
6 5 rneqi ranCA×B-1=ranC-1B×A
7 1 6 eqtri domCA×B=ranC-1B×A
8 7 eqeq1i domCA×B=AranC-1B×A=A
9 rninxp ranC-1B×A=AxAyByC-1x
10 vex yV
11 vex xV
12 10 11 brcnv yC-1xxCy
13 12 rexbii yByC-1xyBxCy
14 13 ralbii xAyByC-1xxAyBxCy
15 8 9 14 3bitri domCA×B=AxAyBxCy