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

Theorem qusin 13647
Description: Restrict the equivalence relation in a quotient structure to the base set. (Contributed by Mario Carneiro, 23-Feb-2015.)
Hypotheses
Ref Expression
qusin.u  |-  ( ph  ->  U  =  ( R 
/.s  .~  ) )
qusin.v  |-  ( ph  ->  V  =  ( Base `  R ) )
qusin.e  |-  ( ph  ->  .~  e.  W )
qusin.r  |-  ( ph  ->  R  e.  Z )
qusin.s  |-  ( ph  ->  (  .~  " V
)  C_  V )
Assertion
Ref Expression
qusin  |-  ( ph  ->  U  =  ( R 
/.s  (  .~  i^i  ( V  X.  V ) ) ) )

Proof of Theorem qusin
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 qusin.s . . . . 5  |-  ( ph  ->  (  .~  " V
)  C_  V )
2 ecinxp 6884 . . . . 5  |-  ( ( (  .~  " V
)  C_  V  /\  x  e.  V )  ->  [ x ]  .~  =  [ x ] (  .~  i^i  ( V  X.  V ) ) )
31, 2sylan 283 . . . 4  |-  ( (
ph  /\  x  e.  V )  ->  [ x ]  .~  =  [ x ] (  .~  i^i  ( V  X.  V
) ) )
43mpteq2dva 4221 . . 3  |-  ( ph  ->  ( x  e.  V  |->  [ x ]  .~  )  =  ( x  e.  V  |->  [ x ] (  .~  i^i  ( V  X.  V
) ) ) )
54oveq1d 6100 . 2  |-  ( ph  ->  ( ( x  e.  V  |->  [ x ]  .~  )  "s  R )  =  ( ( x  e.  V  |->  [ x ] (  .~  i^i  ( V  X.  V ) ) )  "s  R ) )
6 qusin.u . . 3  |-  ( ph  ->  U  =  ( R 
/.s  .~  ) )
7 qusin.v . . 3  |-  ( ph  ->  V  =  ( Base `  R ) )
8 eqid 2238 . . 3  |-  ( x  e.  V  |->  [ x ]  .~  )  =  ( x  e.  V  |->  [ x ]  .~  )
9 qusin.e . . 3  |-  ( ph  ->  .~  e.  W )
10 qusin.r . . 3  |-  ( ph  ->  R  e.  Z )
116, 7, 8, 9, 10qusval 13644 . 2  |-  ( ph  ->  U  =  ( ( x  e.  V  |->  [ x ]  .~  )  "s  R ) )
12 eqidd 2239 . . 3  |-  ( ph  ->  ( R  /.s  (  .~  i^i  ( V  X.  V
) ) )  =  ( R  /.s  (  .~  i^i  ( V  X.  V
) ) ) )
13 eqid 2238 . . 3  |-  ( x  e.  V  |->  [ x ] (  .~  i^i  ( V  X.  V
) ) )  =  ( x  e.  V  |->  [ x ] (  .~  i^i  ( V  X.  V ) ) )
14 inex1g 4269 . . . 4  |-  (  .~  e.  W  ->  (  .~  i^i  ( V  X.  V
) )  e.  _V )
159, 14syl 14 . . 3  |-  ( ph  ->  (  .~  i^i  ( V  X.  V ) )  e.  _V )
1612, 7, 13, 15, 10qusval 13644 . 2  |-  ( ph  ->  ( R  /.s  (  .~  i^i  ( V  X.  V
) ) )  =  ( ( x  e.  V  |->  [ x ]
(  .~  i^i  ( V  X.  V ) ) )  "s  R ) )
175, 11, 163eqtr4d 2281 1  |-  ( ph  ->  U  =  ( R 
/.s  (  .~  i^i  ( V  X.  V ) ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209   _Vcvv 2821    i^i cin 3219    C_ wss 3220    |-> cmpt 4192    X. cxp 4772   "cima 4777   ` cfv 5377  (class class class)co 6085   [cec 6805   Basecbs 13352    "s cimas 13622    /.s cqus 13623
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-tp 3717  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-ec 6809  df-inn 9305  df-2 9363  df-3 9364  df-ndx 13355  df-slot 13356  df-base 13358  df-plusg 13444  df-mulr 13445  df-iimas 13624  df-qus 13625
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator