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

Theorem qsinxp 6505
Description: Restrict the equivalence relation in a quotient set to the base set. (Contributed by Mario Carneiro, 23-Feb-2015.)
Assertion
Ref Expression
qsinxp  |-  ( ( R " A ) 
C_  A  ->  ( A /. R )  =  ( A /. ( R  i^i  ( A  X.  A ) ) ) )

Proof of Theorem qsinxp
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ecinxp 6504 . . . . 5  |-  ( ( ( R " A
)  C_  A  /\  x  e.  A )  ->  [ x ] R  =  [ x ] ( R  i^i  ( A  X.  A ) ) )
21eqeq2d 2151 . . . 4  |-  ( ( ( R " A
)  C_  A  /\  x  e.  A )  ->  ( y  =  [
x ] R  <->  y  =  [ x ] ( R  i^i  ( A  X.  A ) ) ) )
32rexbidva 2434 . . 3  |-  ( ( R " A ) 
C_  A  ->  ( E. x  e.  A  y  =  [ x ] R  <->  E. x  e.  A  y  =  [ x ] ( R  i^i  ( A  X.  A
) ) ) )
43abbidv 2257 . 2  |-  ( ( R " A ) 
C_  A  ->  { y  |  E. x  e.  A  y  =  [
x ] R }  =  { y  |  E. x  e.  A  y  =  [ x ] ( R  i^i  ( A  X.  A ) ) } )
5 df-qs 6435 . 2  |-  ( A /. R )  =  { y  |  E. x  e.  A  y  =  [ x ] R }
6 df-qs 6435 . 2  |-  ( A /. ( R  i^i  ( A  X.  A
) ) )  =  { y  |  E. x  e.  A  y  =  [ x ] ( R  i^i  ( A  X.  A ) ) }
74, 5, 63eqtr4g 2197 1  |-  ( ( R " A ) 
C_  A  ->  ( A /. R )  =  ( A /. ( R  i^i  ( A  X.  A ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1331    e. wcel 1480   {cab 2125   E.wrex 2417    i^i cin 3070    C_ wss 3071    X. cxp 4537   "cima 4542   [cec 6427   /.cqs 6428
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-br 3930  df-opab 3990  df-xp 4545  df-rel 4546  df-cnv 4547  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-ec 6431  df-qs 6435
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator