ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  imainrect GIF version

Theorem imainrect 5049
Description: Image of a relation restricted to a rectangular region. (Contributed by Stefan O'Rear, 19-Feb-2015.)
Assertion
Ref Expression
imainrect ((𝐺 ∩ (𝐴 × 𝐵)) “ 𝑌) = ((𝐺 “ (𝑌𝐴)) ∩ 𝐵)

Proof of Theorem imainrect
StepHypRef Expression
1 df-res 4616 . . 3 ((𝐺 ∩ (𝐴 × 𝐵)) ↾ 𝑌) = ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
21rneqi 4832 . 2 ran ((𝐺 ∩ (𝐴 × 𝐵)) ↾ 𝑌) = ran ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
3 df-ima 4617 . 2 ((𝐺 ∩ (𝐴 × 𝐵)) “ 𝑌) = ran ((𝐺 ∩ (𝐴 × 𝐵)) ↾ 𝑌)
4 df-ima 4617 . . . . 5 (𝐺 “ (𝑌𝐴)) = ran (𝐺 ↾ (𝑌𝐴))
5 df-res 4616 . . . . . 6 (𝐺 ↾ (𝑌𝐴)) = (𝐺 ∩ ((𝑌𝐴) × V))
65rneqi 4832 . . . . 5 ran (𝐺 ↾ (𝑌𝐴)) = ran (𝐺 ∩ ((𝑌𝐴) × V))
74, 6eqtri 2186 . . . 4 (𝐺 “ (𝑌𝐴)) = ran (𝐺 ∩ ((𝑌𝐴) × V))
87ineq1i 3319 . . 3 ((𝐺 “ (𝑌𝐴)) ∩ 𝐵) = (ran (𝐺 ∩ ((𝑌𝐴) × V)) ∩ 𝐵)
9 cnvin 5011 . . . . . 6 ((𝐺 ∩ ((𝑌𝐴) × V)) ∩ (V × 𝐵)) = ((𝐺 ∩ ((𝑌𝐴) × V)) ∩ (V × 𝐵))
10 inxp 4738 . . . . . . . . . 10 ((𝐴 × V) ∩ (V × 𝐵)) = ((𝐴 ∩ V) × (V ∩ 𝐵))
11 inv1 3445 . . . . . . . . . . 11 (𝐴 ∩ V) = 𝐴
12 incom 3314 . . . . . . . . . . . 12 (V ∩ 𝐵) = (𝐵 ∩ V)
13 inv1 3445 . . . . . . . . . . . 12 (𝐵 ∩ V) = 𝐵
1412, 13eqtri 2186 . . . . . . . . . . 11 (V ∩ 𝐵) = 𝐵
1511, 14xpeq12i 4626 . . . . . . . . . 10 ((𝐴 ∩ V) × (V ∩ 𝐵)) = (𝐴 × 𝐵)
1610, 15eqtr2i 2187 . . . . . . . . 9 (𝐴 × 𝐵) = ((𝐴 × V) ∩ (V × 𝐵))
1716ineq2i 3320 . . . . . . . 8 ((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × 𝐵)) = ((𝐺 ∩ (𝑌 × V)) ∩ ((𝐴 × V) ∩ (V × 𝐵)))
18 in32 3334 . . . . . . . 8 ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V)) = ((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × 𝐵))
19 xpindir 4740 . . . . . . . . . . . 12 ((𝑌𝐴) × V) = ((𝑌 × V) ∩ (𝐴 × V))
2019ineq2i 3320 . . . . . . . . . . 11 (𝐺 ∩ ((𝑌𝐴) × V)) = (𝐺 ∩ ((𝑌 × V) ∩ (𝐴 × V)))
21 inass 3332 . . . . . . . . . . 11 ((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × V)) = (𝐺 ∩ ((𝑌 × V) ∩ (𝐴 × V)))
2220, 21eqtr4i 2189 . . . . . . . . . 10 (𝐺 ∩ ((𝑌𝐴) × V)) = ((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × V))
2322ineq1i 3319 . . . . . . . . 9 ((𝐺 ∩ ((𝑌𝐴) × V)) ∩ (V × 𝐵)) = (((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × V)) ∩ (V × 𝐵))
24 inass 3332 . . . . . . . . 9 (((𝐺 ∩ (𝑌 × V)) ∩ (𝐴 × V)) ∩ (V × 𝐵)) = ((𝐺 ∩ (𝑌 × V)) ∩ ((𝐴 × V) ∩ (V × 𝐵)))
2523, 24eqtri 2186 . . . . . . . 8 ((𝐺 ∩ ((𝑌𝐴) × V)) ∩ (V × 𝐵)) = ((𝐺 ∩ (𝑌 × V)) ∩ ((𝐴 × V) ∩ (V × 𝐵)))
2617, 18, 253eqtr4i 2196 . . . . . . 7 ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V)) = ((𝐺 ∩ ((𝑌𝐴) × V)) ∩ (V × 𝐵))
2726cnveqi 4779 . . . . . 6 ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V)) = ((𝐺 ∩ ((𝑌𝐴) × V)) ∩ (V × 𝐵))
28 df-res 4616 . . . . . . 7 ((𝐺 ∩ ((𝑌𝐴) × V)) ↾ 𝐵) = ((𝐺 ∩ ((𝑌𝐴) × V)) ∩ (𝐵 × V))
29 cnvxp 5022 . . . . . . . 8 (V × 𝐵) = (𝐵 × V)
3029ineq2i 3320 . . . . . . 7 ((𝐺 ∩ ((𝑌𝐴) × V)) ∩ (V × 𝐵)) = ((𝐺 ∩ ((𝑌𝐴) × V)) ∩ (𝐵 × V))
3128, 30eqtr4i 2189 . . . . . 6 ((𝐺 ∩ ((𝑌𝐴) × V)) ↾ 𝐵) = ((𝐺 ∩ ((𝑌𝐴) × V)) ∩ (V × 𝐵))
329, 27, 313eqtr4ri 2197 . . . . 5 ((𝐺 ∩ ((𝑌𝐴) × V)) ↾ 𝐵) = ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
3332dmeqi 4805 . . . 4 dom ((𝐺 ∩ ((𝑌𝐴) × V)) ↾ 𝐵) = dom ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
34 incom 3314 . . . . 5 (𝐵 ∩ dom (𝐺 ∩ ((𝑌𝐴) × V))) = (dom (𝐺 ∩ ((𝑌𝐴) × V)) ∩ 𝐵)
35 dmres 4905 . . . . 5 dom ((𝐺 ∩ ((𝑌𝐴) × V)) ↾ 𝐵) = (𝐵 ∩ dom (𝐺 ∩ ((𝑌𝐴) × V)))
36 df-rn 4615 . . . . . 6 ran (𝐺 ∩ ((𝑌𝐴) × V)) = dom (𝐺 ∩ ((𝑌𝐴) × V))
3736ineq1i 3319 . . . . 5 (ran (𝐺 ∩ ((𝑌𝐴) × V)) ∩ 𝐵) = (dom (𝐺 ∩ ((𝑌𝐴) × V)) ∩ 𝐵)
3834, 35, 373eqtr4ri 2197 . . . 4 (ran (𝐺 ∩ ((𝑌𝐴) × V)) ∩ 𝐵) = dom ((𝐺 ∩ ((𝑌𝐴) × V)) ↾ 𝐵)
39 df-rn 4615 . . . 4 ran ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V)) = dom ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
4033, 38, 393eqtr4ri 2197 . . 3 ran ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V)) = (ran (𝐺 ∩ ((𝑌𝐴) × V)) ∩ 𝐵)
418, 40eqtr4i 2189 . 2 ((𝐺 “ (𝑌𝐴)) ∩ 𝐵) = ran ((𝐺 ∩ (𝐴 × 𝐵)) ∩ (𝑌 × V))
422, 3, 413eqtr4i 2196 1 ((𝐺 ∩ (𝐴 × 𝐵)) “ 𝑌) = ((𝐺 “ (𝑌𝐴)) ∩ 𝐵)
Colors of variables: wff set class
Syntax hints:   = wceq 1343  Vcvv 2726  cin 3115   × cxp 4602  ccnv 4603  dom cdm 4604  ran crn 4605  cres 4606  cima 4607
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-br 3983  df-opab 4044  df-xp 4610  df-rel 4611  df-cnv 4612  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617
This theorem is referenced by:  ecinxp  6576
  Copyright terms: Public domain W3C validator