MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  seinxp Structured version   Visualization version   Unicode version

Theorem seinxp 5185
Description: Intersection of set-like relation with Cartesian product of its field. (Contributed by Mario Carneiro, 22-Jun-2015.)
Assertion
Ref Expression
seinxp  |-  ( R Se  A  <->  ( R  i^i  ( A  X.  A
) ) Se  A )

Proof of Theorem seinxp
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 brinxp 5181 . . . . . 6  |-  ( ( y  e.  A  /\  x  e.  A )  ->  ( y R x  <-> 
y ( R  i^i  ( A  X.  A
) ) x ) )
21ancoms 469 . . . . 5  |-  ( ( x  e.  A  /\  y  e.  A )  ->  ( y R x  <-> 
y ( R  i^i  ( A  X.  A
) ) x ) )
32rabbidva 3188 . . . 4  |-  ( x  e.  A  ->  { y  e.  A  |  y R x }  =  { y  e.  A  |  y ( R  i^i  ( A  X.  A ) ) x } )
43eleq1d 2686 . . 3  |-  ( x  e.  A  ->  ( { y  e.  A  |  y R x }  e.  _V  <->  { y  e.  A  |  y
( R  i^i  ( A  X.  A ) ) x }  e.  _V ) )
54ralbiia 2979 . 2  |-  ( A. x  e.  A  {
y  e.  A  | 
y R x }  e.  _V  <->  A. x  e.  A  { y  e.  A  |  y ( R  i^i  ( A  X.  A ) ) x }  e.  _V )
6 df-se 5074 . 2  |-  ( R Se  A  <->  A. x  e.  A  { y  e.  A  |  y R x }  e.  _V )
7 df-se 5074 . 2  |-  ( ( R  i^i  ( A  X.  A ) ) Se  A  <->  A. x  e.  A  { y  e.  A  |  y ( R  i^i  ( A  X.  A ) ) x }  e.  _V )
85, 6, 73bitr4i 292 1  |-  ( R Se  A  <->  ( R  i^i  ( A  X.  A
) ) Se  A )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 196    e. wcel 1990   A.wral 2912   {crab 2916   _Vcvv 3200    i^i cin 3573   class class class wbr 4653   Se wse 5071    X. cxp 5112
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-se 5074  df-xp 5120
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator