Theorem imainrect 6178

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 5672	. . 3 ⊢ ((𝐺 ∩ (𝐴 × 𝐵)) ↾ 𝑌) = ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
2	1	rneqi 5926	. 2 ⊢ ran ((𝐺 ∩ (𝐴 × 𝐵)) ↾ 𝑌) = ran ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
3		df-ima 5673	. 2 ⊢ ((𝐺 ∩ (𝐴 × 𝐵)) “ 𝑌) = ran ((𝐺 ∩ (𝐴 × 𝐵)) ↾ 𝑌)
4		df-ima 5673	. . . . 5 ⊢ (𝐺 “ (𝑌 ∩ 𝐴)) = ran (𝐺 ↾ (𝑌 ∩ 𝐴))
5		df-res 5672	. . . . . 6 ⊢ (𝐺 ↾ (𝑌 ∩ 𝐴)) = (𝐺 ∩ ((𝑌 ∩ 𝐴) × V))
6	5	rneqi 5926	. . . . 5 ⊢ ran (𝐺 ↾ (𝑌 ∩ 𝐴)) = ran (𝐺 ∩ ((𝑌 ∩ 𝐴) × V))
7	4, 6	eqtri 2785	. . . 4 ⊢ (𝐺 “ (𝑌 ∩ 𝐴)) = ran (𝐺 ∩ ((𝑌 ∩ 𝐴) × V))
8	7	ineq1i 4168	. . 3 ⊢ ((𝐺 “ (𝑌 ∩ 𝐴)) ∩ 𝐵) = (ran (𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ 𝐵)
9		cnvin 6140	. . . . . 6 ⊢ ◡((𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ (V × 𝐵)) = (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ ◡(V × 𝐵))
10		inxp 5817	. . . . . . . . . 10 ⊢ ((𝐴 × V) ∩ (V × 𝐵)) = ((𝐴 ∩ V) × (V ∩ 𝐵))
11		inv1 4354	. . . . . . . . . . 11 ⊢ (𝐴 ∩ V) = 𝐴
12		incom 4161	. . . . . . . . . . . 12 ⊢ (V ∩ 𝐵) = (𝐵 ∩ V)
13		inv1 4354	. . . . . . . . . . . 12 ⊢ (𝐵 ∩ V) = 𝐵
14	12, 13	eqtri 2785	. . . . . . . . . . 11 ⊢ (V ∩ 𝐵) = 𝐵
15	11, 14	xpeq12i 5688	. . . . . . . . . 10 ⊢ ((𝐴 ∩ V) × (V ∩ 𝐵)) = (𝐴 × 𝐵)
16	10, 15	eqtr2i 2786	. . . . . . . . 9 ⊢ (𝐴 × 𝐵) = ((𝐴 × V) ∩ (V × 𝐵))
17	16	ineq2i 4169	. . . . . . . 8 ⊢ ((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × 𝐵)) = ((𝐺 ∩ (𝑌 × V)) ∩ ((𝐴 × V) ∩ (V × 𝐵)))
18		in32 4181	. . . . . . . 8 ⊢ ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V)) = ((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × 𝐵))
19		xpindir 5819	. . . . . . . . . . . 12 ⊢ ((𝑌 ∩ 𝐴) × V) = ((𝑌 × V) ∩ (𝐴 × V))
20	19	ineq2i 4169	. . . . . . . . . . 11 ⊢ (𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) = (𝐺 ∩ ((𝑌 × V) ∩ (𝐴 × V)))
21		inass 4179	. . . . . . . . . . 11 ⊢ ((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × V)) = (𝐺 ∩ ((𝑌 × V) ∩ (𝐴 × V)))
22	20, 21	eqtr4i 2788	. . . . . . . . . 10 ⊢ (𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) = ((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × V))
23	22	ineq1i 4168	. . . . . . . . 9 ⊢ ((𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ (V × 𝐵)) = (((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × V)) ∩ (V × 𝐵))
24		inass 4179	. . . . . . . . 9 ⊢ (((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × V)) ∩ (V × 𝐵)) = ((𝐺 ∩ (𝑌 × V)) ∩ ((𝐴 × V) ∩ (V × 𝐵)))
25	23, 24	eqtri 2785	. . . . . . . 8 ⊢ ((𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ (V × 𝐵)) = ((𝐺 ∩ (𝑌 × V)) ∩ ((𝐴 × V) ∩ (V × 𝐵)))
26	17, 18, 25	3eqtr4i 2795	. . . . . . 7 ⊢ ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V)) = ((𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ (V × 𝐵))
27	26	cnveqi 5859	. . . . . 6 ⊢ ◡((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V)) = ◡((𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ (V × 𝐵))
28		df-res 5672	. . . . . . 7 ⊢ (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ↾ 𝐵) = (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ (𝐵 × V))
29		cnvxp 6153	. . . . . . . 8 ⊢ ◡(V × 𝐵) = (𝐵 × V)
30	29	ineq2i 4169	. . . . . . 7 ⊢ (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ ◡(V × 𝐵)) = (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ (𝐵 × V))
31	28, 30	eqtr4i 2788	. . . . . 6 ⊢ (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ↾ 𝐵) = (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ ◡(V × 𝐵))
32	9, 27, 31	3eqtr4ri 2796	. . . . 5 ⊢ (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ↾ 𝐵) = ◡((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
33	32	dmeqi 5893	. . . 4 ⊢ dom (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ↾ 𝐵) = dom ◡((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
34		incom 4161	. . . . 5 ⊢ (𝐵 ∩ dom ◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V))) = (dom ◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ 𝐵)
35		dmres 6010	. . . . 5 ⊢ dom (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ↾ 𝐵) = (𝐵 ∩ dom ◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)))
36		df-rn 5671	. . . . . 6 ⊢ ran (𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) = dom ◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V))
37	36	ineq1i 4168	. . . . 5 ⊢ (ran (𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ 𝐵) = (dom ◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ 𝐵)
38	34, 35, 37	3eqtr4ri 2796	. . . 4 ⊢ (ran (𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ 𝐵) = dom (◡(𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ↾ 𝐵)
39		df-rn 5671	. . . 4 ⊢ ran ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V)) = dom ◡((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
40	33, 38, 39	3eqtr4ri 2796	. . 3 ⊢ ran ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V)) = (ran (𝐺 ∩ ((𝑌 ∩ 𝐴) × V)) ∩ 𝐵)
41	8, 40	eqtr4i 2788	. 2 ⊢ ((𝐺 “ (𝑌 ∩ 𝐴)) ∩ 𝐵) = ran ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
42	2, 3, 41	3eqtr4i 2795	1 ⊢ ((𝐺 ∩ (𝐴 × 𝐵)) “ 𝑌) = ((𝐺 “ (𝑌 ∩ 𝐴)) ∩ 𝐵)

This proof depends on syntax axioms:   = wceq 1569  Vcvv 3454   ∩ cin 3903   × cxp 5658  ^◡ccnv 5659  dom cdm 5660  ran crn 5661   ↾ cres 5662   “ cima 5663

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-11 2191  ax-ext 2734  ax-sep 5256  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-xp 5666  df-rel 5667  df-cnv 5668  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673

This theorem is used by:  ecinxp  8788  marypha1lem  9391