| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > erexb | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| erexb | ⊢ (𝑅 Er 𝐴 → (𝑅 ∈ V ↔ 𝐴 ∈ V)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dmexg 7845 | . . 3 ⊢ (𝑅 ∈ V → dom 𝑅 ∈ V) | |
| 2 | erdm 8647 | . . . 4 ⊢ (𝑅 Er 𝐴 → dom 𝑅 = 𝐴) | |
| 3 | 2 | eleq1d 2822 | . . 3 ⊢ (𝑅 Er 𝐴 → (dom 𝑅 ∈ V ↔ 𝐴 ∈ V)) |
| 4 | 1, 3 | imbitrid 244 | . 2 ⊢ (𝑅 Er 𝐴 → (𝑅 ∈ V → 𝐴 ∈ V)) |
| 5 | erex 8661 | . 2 ⊢ (𝑅 Er 𝐴 → (𝐴 ∈ V → 𝑅 ∈ V)) | |
| 6 | 4, 5 | impbid 212 | 1 ⊢ (𝑅 Er 𝐴 → (𝑅 ∈ V ↔ 𝐴 ∈ V)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∈ wcel 2114 Vcvv 3430 dom cdm 5624 Er wer 8633 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5231 ax-pow 5302 ax-pr 5370 ax-un 7682 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-xp 5630 df-rel 5631 df-cnv 5632 df-dm 5634 df-rn 5635 df-er 8636 |
| This theorem is referenced by: prtex 39340 |
| Copyright terms: Public domain | W3C validator |