Theorem imainrect 6168

Description: Image by a restricted and corestricted binary relation (intersection of a binary relation with a Cartesian product). (Contributed by Stefan O'Rear, 19-Feb-2015.)

Assertion

Ref	Expression
imainrect	⊢ ((𝐺 ∩ (𝐴 × 𝐵)) “ 𝑌) = ((𝐺 “ (𝑌 ∩ 𝐴)) ∩ 𝐵)

Proof of Theorem imainrect

Step	Hyp	Ref	Expression
1		df-res 5659	. . 3 ⊢ ((𝐺 ∩ (𝐴 × 𝐵)) ↾ 𝑌) = ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
2	1	rneqi 5915	. 2 ⊢ ran ((𝐺 ∩ (𝐴 × 𝐵)) ↾ 𝑌) = ran ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
3		df-ima 5660	. 2 ⊢ ((𝐺 ∩ (𝐴 × 𝐵)) “ 𝑌) = ran ((𝐺 ∩ (𝐴 × 𝐵)) ↾ 𝑌)
4		df-ima 5660	. . . . 5 ⊢ (𝐺 “ (𝑌 ∩ 𝐴)) = ran (𝐺 ↾ (𝑌 ∩ 𝐴))
5		df-res 5659	. . . . . 6 ⊢ (𝐺 ↾ (𝑌 ∩ 𝐴)) = (𝐺 ∩ ((𝑌 ∩ 𝐴) × V))
6	5	rneqi 5915	. . . . 5 ⊢ ran (𝐺 ↾ (𝑌 ∩ 𝐴)) = ran (𝐺 ∩ ((𝑌 ∩ 𝐴) × V))
7	4, 6	eqtri 2783	. . . 4 ⊢ (𝐺 “ (𝑌 ∩ 𝐴)) = ran (𝐺 ∩ ((𝑌 ∩ 𝐴) × V))
8	7	ineq1i 4161	. . 3 ⊢ ((𝐺 “ (𝑌 ∩ 𝐴)) ∩ 𝐵) = (ran (𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ 𝐵)
9		cnvin 6129	. . . . . 6 ⊢ ◡((𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ (V × 𝐵)) = (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ ◡(V × 𝐵))
10		inxp 5805	. . . . . . . . . 10 ⊢ ((𝐴 × V) ∩ (V × 𝐵)) = ((𝐴 ∩ V) × (V ∩ 𝐵))
11		inv1 4347	. . . . . . . . . . 11 ⊢ (𝐴 ∩ V) = 𝐴
12		incom 4154	. . . . . . . . . . . 12 ⊢ (V ∩ 𝐵) = (𝐵 ∩ V)
13		inv1 4347	. . . . . . . . . . . 12 ⊢ (𝐵 ∩ V) = 𝐵
14	12, 13	eqtri 2783	. . . . . . . . . . 11 ⊢ (V ∩ 𝐵) = 𝐵
15	11, 14	xpeq12i 5675	. . . . . . . . . 10 ⊢ ((𝐴 ∩ V) × (V ∩ 𝐵)) = (𝐴 × 𝐵)
16	10, 15	eqtr2i 2784	. . . . . . . . 9 ⊢ (𝐴 × 𝐵) = ((𝐴 × V) ∩ (V × 𝐵))
17	16	ineq2i 4162	. . . . . . . 8 ⊢ ((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × 𝐵)) = ((𝐺 ∩ (𝑌 × V)) ∩ ((𝐴 × V) ∩ (V × 𝐵)))
18		in32 4174	. . . . . . . 8 ⊢ ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V)) = ((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × 𝐵))
19		xpindir 5807	. . . . . . . . . . . 12 ⊢ ((𝑌 ∩ 𝐴) × V) = ((𝑌 × V) ∩ (𝐴 × V))
20	19	ineq2i 4162	. . . . . . . . . . 11 ⊢ (𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) = (𝐺 ∩ ((𝑌 × V) ∩ (𝐴 × V)))
21		inass 4172	. . . . . . . . . . 11 ⊢ ((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × V)) = (𝐺 ∩ ((𝑌 × V) ∩ (𝐴 × V)))
22	20, 21	eqtr4i 2786	. . . . . . . . . 10 ⊢ (𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) = ((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × V))
23	22	ineq1i 4161	. . . . . . . . 9 ⊢ ((𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ (V × 𝐵)) = (((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × V)) ∩ (V × 𝐵))
24		inass 4172	. . . . . . . . 9 ⊢ (((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × V)) ∩ (V × 𝐵)) = ((𝐺 ∩ (𝑌 × V)) ∩ ((𝐴 × V) ∩ (V × 𝐵)))
25	23, 24	eqtri 2783	. . . . . . . 8 ⊢ ((𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ (V × 𝐵)) = ((𝐺 ∩ (𝑌 × V)) ∩ ((𝐴 × V) ∩ (V × 𝐵)))
26	17, 18, 25	3eqtr4i 2793	. . . . . . 7 ⊢ ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V)) = ((𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ (V × 𝐵))
27	26	cnveqi 5848	. . . . . 6 ⊢ ◡((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V)) = ◡((𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ (V × 𝐵))
28		df-res 5659	. . . . . . 7 ⊢ (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ↾ 𝐵) = (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ (𝐵 × V))
29		cnvxp 6142	. . . . . . . 8 ⊢ ◡(V × 𝐵) = (𝐵 × V)
30	29	ineq2i 4162	. . . . . . 7 ⊢ (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ ◡(V × 𝐵)) = (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ (𝐵 × V))
31	28, 30	eqtr4i 2786	. . . . . 6 ⊢ (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ↾ 𝐵) = (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ ◡(V × 𝐵))
32	9, 27, 31	3eqtr4ri 2794	. . . . 5 ⊢ (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ↾ 𝐵) = ◡((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
33	32	dmeqi 5882	. . . 4 ⊢ dom (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ↾ 𝐵) = dom ◡((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
34		incom 4154	. . . . 5 ⊢ (𝐵 ∩ dom ◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V))) = (dom ◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ 𝐵)
35		dmres 5999	. . . . 5 ⊢ dom (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ↾ 𝐵) = (𝐵 ∩ dom ◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)))
36		df-rn 5658	. . . . . 6 ⊢ ran (𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) = dom ◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V))
37	36	ineq1i 4161	. . . . 5 ⊢ (ran (𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ 𝐵) = (dom ◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ 𝐵)
38	34, 35, 37	3eqtr4ri 2794	. . . 4 ⊢ (ran (𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ 𝐵) = dom (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ↾ 𝐵)
39		df-rn 5658	. . . 4 ⊢ ran ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V)) = dom ◡((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
40	33, 38, 39	3eqtr4ri 2794	. . 3 ⊢ ran ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V)) = (ran (𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ 𝐵)
41	8, 40	eqtr4i 2786	. 2 ⊢ ((𝐺 “ (𝑌 ∩ 𝐴)) ∩ 𝐵) = ran ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
42	2, 3, 41	3eqtr4i 2793	1 ⊢ ((𝐺 ∩ (𝐴 × 𝐵)) “ 𝑌) = ((𝐺 “ (𝑌 ∩ 𝐴)) ∩ 𝐵)

This proof depends on syntax axioms:   = wceq 1570  Vcvv 3450   ∩ cin 3897   × cxp 5645  ^◡ccnv 5646  dom cdm 5647  ran crn 5648   ↾ cres 5649   “ cima 5650

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-opab 5167  df-xp 5653  df-rel 5654  df-cnv 5655  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660

This theorem is used by:  ecinxp  8791  marypha1lem  9403