Metamath Proof Explorer


Theorem xpinpreima

Description: Rewrite the cartesian product of two sets as the intersection of their preimage by 1st and 2nd , the projections on the first and second elements. (Contributed by Thierry Arnoux, 22-Sep-2017)

Ref Expression
Assertion xpinpreima A × B = 1 st V × V -1 A 2 nd V × V -1 B

Proof

Step Hyp Ref Expression
1 inrab r V × V | 1 st r A r V × V | 2 nd r B = r V × V | 1 st r A 2 nd r B
2 f1stres 1 st V × V : V × V V
3 ffn 1 st V × V : V × V V 1 st V × V Fn V × V
4 fncnvima2 1 st V × V Fn V × V 1 st V × V -1 A = r V × V | 1 st V × V r A
5 2 3 4 mp2b 1 st V × V -1 A = r V × V | 1 st V × V r A
6 fvres r V × V 1 st V × V r = 1 st r
7 6 eleq1d r V × V 1 st V × V r A 1 st r A
8 7 rabbiia r V × V | 1 st V × V r A = r V × V | 1 st r A
9 5 8 eqtri 1 st V × V -1 A = r V × V | 1 st r A
10 f2ndres 2 nd V × V : V × V V
11 ffn 2 nd V × V : V × V V 2 nd V × V Fn V × V
12 fncnvima2 2 nd V × V Fn V × V 2 nd V × V -1 B = r V × V | 2 nd V × V r B
13 10 11 12 mp2b 2 nd V × V -1 B = r V × V | 2 nd V × V r B
14 fvres r V × V 2 nd V × V r = 2 nd r
15 14 eleq1d r V × V 2 nd V × V r B 2 nd r B
16 15 rabbiia r V × V | 2 nd V × V r B = r V × V | 2 nd r B
17 13 16 eqtri 2 nd V × V -1 B = r V × V | 2 nd r B
18 9 17 ineq12i 1 st V × V -1 A 2 nd V × V -1 B = r V × V | 1 st r A r V × V | 2 nd r B
19 xp2 A × B = r V × V | 1 st r A 2 nd r B
20 1 18 19 3eqtr4ri A × B = 1 st V × V -1 A 2 nd V × V -1 B