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 7724 | . . 3 ⊢ (𝑅 ∈ V → dom 𝑅 ∈ V) | |
2 | erdm 8466 | . . . 4 ⊢ (𝑅 Er 𝐴 → dom 𝑅 = 𝐴) | |
3 | 2 | eleq1d 2823 | . . 3 ⊢ (𝑅 Er 𝐴 → (dom 𝑅 ∈ V ↔ 𝐴 ∈ V)) |
4 | 1, 3 | syl5ib 243 | . 2 ⊢ (𝑅 Er 𝐴 → (𝑅 ∈ V → 𝐴 ∈ V)) |
5 | erex 8480 | . 2 ⊢ (𝑅 Er 𝐴 → (𝐴 ∈ V → 𝑅 ∈ V)) | |
6 | 4, 5 | impbid 211 | 1 ⊢ (𝑅 Er 𝐴 → (𝑅 ∈ V ↔ 𝐴 ∈ V)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∈ wcel 2108 Vcvv 3422 dom cdm 5580 Er wer 8453 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-xp 5586 df-rel 5587 df-cnv 5588 df-dm 5590 df-rn 5591 df-er 8456 |
This theorem is referenced by: prtex 36821 |
Copyright terms: Public domain | W3C validator |