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

Theorem erexb 6517
Description: An equivalence relation is a set if and only if its domain is a set. (Contributed by Rodolfo Medina, 15-Oct-2010.) (Revised by Mario Carneiro, 12-Aug-2015.)
Assertion
Ref Expression
erexb  |-  ( R  Er  A  ->  ( R  e.  _V  <->  A  e.  _V ) )

Proof of Theorem erexb
StepHypRef Expression
1 dmexg 4862 . . 3  |-  ( R  e.  _V  ->  dom  R  e.  _V )
2 erdm 6502 . . . 4  |-  ( R  Er  A  ->  dom  R  =  A )
32eleq1d 2233 . . 3  |-  ( R  Er  A  ->  ( dom  R  e.  _V  <->  A  e.  _V ) )
41, 3syl5ib 153 . 2  |-  ( R  Er  A  ->  ( R  e.  _V  ->  A  e.  _V ) )
5 erex 6516 . 2  |-  ( R  Er  A  ->  ( A  e.  _V  ->  R  e.  _V ) )
64, 5impbid 128 1  |-  ( R  Er  A  ->  ( R  e.  _V  <->  A  e.  _V ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104    e. wcel 2135   _Vcvv 2721   dom cdm 4598    Er wer 6489
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 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-13 2137  ax-14 2138  ax-ext 2146  ax-sep 4094  ax-pow 4147  ax-pr 4181  ax-un 4405
This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ral 2447  df-rex 2448  df-v 2723  df-un 3115  df-in 3117  df-ss 3124  df-pw 3555  df-sn 3576  df-pr 3577  df-op 3579  df-uni 3784  df-br 3977  df-opab 4038  df-xp 4604  df-rel 4605  df-cnv 4606  df-dm 4608  df-rn 4609  df-er 6492
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator