![]() |
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 7941 | . . 3 ⊢ (𝑅 ∈ V → dom 𝑅 ∈ V) | |
2 | erdm 8773 | . . . 4 ⊢ (𝑅 Er 𝐴 → dom 𝑅 = 𝐴) | |
3 | 2 | eleq1d 2829 | . . 3 ⊢ (𝑅 Er 𝐴 → (dom 𝑅 ∈ V ↔ 𝐴 ∈ V)) |
4 | 1, 3 | imbitrid 244 | . 2 ⊢ (𝑅 Er 𝐴 → (𝑅 ∈ V → 𝐴 ∈ V)) |
5 | erex 8787 | . 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 2108 Vcvv 3488 dom cdm 5700 Er wer 8760 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-xp 5706 df-rel 5707 df-cnv 5708 df-dm 5710 df-rn 5711 df-er 8763 |
This theorem is referenced by: prtex 38836 |
Copyright terms: Public domain | W3C validator |