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

Theorem erexb 8313
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 (𝑅 Er 𝐴 → (𝑅 ∈ V ↔ 𝐴 ∈ V))

Proof of Theorem erexb
StepHypRef Expression
1 dmexg 7612 . . 3 (𝑅 ∈ V → dom 𝑅 ∈ V)
2 erdm 8298 . . . 4 (𝑅 Er 𝐴 → dom 𝑅 = 𝐴)
32eleq1d 2897 . . 3 (𝑅 Er 𝐴 → (dom 𝑅 ∈ V ↔ 𝐴 ∈ V))
41, 3syl5ib 246 . 2 (𝑅 Er 𝐴 → (𝑅 ∈ V → 𝐴 ∈ V))
5 erex 8312 . 2 (𝑅 Er 𝐴 → (𝐴 ∈ V → 𝑅 ∈ V))
64, 5impbid 214 1 (𝑅 Er 𝐴 → (𝑅 ∈ V ↔ 𝐴 ∈ V))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wcel 2110  Vcvv 3494  dom cdm 5554   Er wer 8285
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pow 5265  ax-pr 5329  ax-un 7460
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4838  df-br 5066  df-opab 5128  df-xp 5560  df-rel 5561  df-cnv 5562  df-dm 5564  df-rn 5565  df-er 8288
This theorem is referenced by:  prtex  36015
  Copyright terms: Public domain W3C validator