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

Theorem qsid 7429
 Description: A set is equal to its quotient set mod converse epsilon. (Note: converse epsilon is not an equivalence relation.) (Contributed by NM, 13-Aug-1995.) (Revised by Mario Carneiro, 9-Jul-2014.)
Assertion
Ref Expression
qsid

Proof of Theorem qsid
Dummy variables are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 3081 . . . . . . 7
21ecid 7428 . . . . . 6
32eqeq2i 2438 . . . . 5
4 equcom 1843 . . . . 5
53, 4bitri 252 . . . 4
65rexbii 2925 . . 3
7 vex 3081 . . . 4
87elqs 7416 . . 3
9 risset 2951 . . 3
106, 8, 93bitr4i 280 . 2
1110eqriv 2416 1
 Colors of variables: wff setvar class Syntax hints:   wceq 1437   wcel 1867  wrex 2774   cep 4755  ccnv 4845  cec 7361  cqs 7362 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1665  ax-4 1678  ax-5 1748  ax-6 1794  ax-7 1838  ax-9 1871  ax-10 1886  ax-11 1891  ax-12 1904  ax-13 2052  ax-ext 2398  ax-sep 4540  ax-nul 4548  ax-pr 4653 This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-3an 984  df-tru 1440  df-ex 1660  df-nf 1664  df-sb 1787  df-eu 2267  df-mo 2268  df-clab 2406  df-cleq 2412  df-clel 2415  df-nfc 2570  df-ne 2618  df-ral 2778  df-rex 2779  df-rab 2782  df-v 3080  df-sbc 3297  df-dif 3436  df-un 3438  df-in 3440  df-ss 3447  df-nul 3759  df-if 3907  df-sn 3994  df-pr 3996  df-op 4000  df-br 4418  df-opab 4477  df-eprel 4757  df-xp 4852  df-cnv 4854  df-dm 4856  df-rn 4857  df-res 4858  df-ima 4859  df-ec 7365  df-qs 7369 This theorem is referenced by:  dfcnqs  9562
 Copyright terms: Public domain W3C validator