| 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 7898 | . . 3 ⊢ (𝑅 ∈ V → dom 𝑅 ∈ V) | |
| 2 | erdm 8707 | . . . 4 ⊢ (𝑅 Er 𝐴 → dom 𝑅 = 𝐴) | |
| 3 | 2 | eleq1d 2845 | . . 3 ⊢ (𝑅 Er 𝐴 → (dom 𝑅 ∈ V ↔ 𝐴 ∈ V)) |
| 4 | 1, 3 | imbitrid 247 | . 2 ⊢ (𝑅 Er 𝐴 → (𝑅 ∈ V → 𝐴 ∈ V)) |
| 5 | erex 8721 | . 2 ⊢ (𝑅 Er 𝐴 → (𝐴 ∈ V → 𝑅 ∈ V)) | |
| 6 | 4, 5 | impbid 215 | 1 ⊢ (𝑅 Er 𝐴 → (𝑅 ∈ V ↔ 𝐴 ∈ V)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∈ wcel 2145 Vcvv 3450 dom cdm 5655 Er wer 8693 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5251 ax-pow 5330 ax-pr 5398 ax-un 7736 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-xp 5661 df-rel 5662 df-cnv 5663 df-dm 5665 df-rn 5666 df-er 8696 |
| This theorem is used by: prtex 39753 |
| Copyright terms: Public domain | W3C validator |