| 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 7899 | . . 3 ⊢ (𝑅 ∈ V → dom 𝑅 ∈ V) | |
| 2 | erdm 8706 | . . . 4 ⊢ (𝑅 Er 𝐴 → dom 𝑅 = 𝐴) | |
| 3 | 2 | eleq1d 2848 | . . 3 ⊢ (𝑅 Er 𝐴 → (dom 𝑅 ∈ V ↔ 𝐴 ∈ V)) |
| 4 | 1, 3 | imbitrid 247 | . 2 ⊢ (𝑅 Er 𝐴 → (𝑅 ∈ V → 𝐴 ∈ V)) |
| 5 | erex 8720 | . 2 ⊢ (𝑅 Er 𝐴 → (𝐴 ∈ V → 𝑅 ∈ V)) | |
| 6 | 4, 5 | impbid 215 | 1 ⊢ (𝑅 Er 𝐴 → (𝑅 ∈ V ↔ 𝐴 ∈ V)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∈ wcel 2143 Vcvv 3455 dom cdm 5663 Er wer 8692 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5258 ax-pow 5338 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-xp 5669 df-rel 5670 df-cnv 5671 df-dm 5673 df-rn 5674 df-er 8695 |
| This theorem is referenced by: prtex 39635 |
| Copyright terms: Public domain | W3C validator |