| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > erex | Structured version Visualization version GIF version | ||
| Description: An equivalence relation is a set if its domain is a set. (Contributed by Rodolfo Medina, 15-Oct-2010.) (Proof shortened by Mario Carneiro, 12-Aug-2015.) |
| Ref | Expression |
|---|---|
| erex | ⊢ (𝑅 Er 𝐴 → (𝐴 ∈ 𝑉 → 𝑅 ∈ V)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | erssxp 8696 | . . 3 ⊢ (𝑅 Er 𝐴 → 𝑅 ⊆ (𝐴 × 𝐴)) | |
| 2 | sqxpexg 7733 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 × 𝐴) ∈ V) | |
| 3 | ssexg 5276 | . . 3 ⊢ ((𝑅 ⊆ (𝐴 × 𝐴) ∧ (𝐴 × 𝐴) ∈ V) → 𝑅 ∈ V) | |
| 4 | 1, 2, 3 | syl2an 605 | . 2 ⊢ ((𝑅 Er 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝑅 ∈ V) |
| 5 | 4 | ex 416 | 1 ⊢ (𝑅 Er 𝐴 → (𝐴 ∈ 𝑉 → 𝑅 ∈ V)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2141 Vcvv 3453 ⊆ wss 3902 × cxp 5641 Er wer 8669 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 ax-sep 5243 ax-pow 5319 ax-pr 5387 ax-un 7713 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-opab 5160 df-xp 5649 df-rel 5650 df-cnv 5651 df-dm 5653 df-rn 5654 df-er 8672 |
| This theorem is referenced by: erexb 8698 qliftlem 8774 qshash 15846 qusaddvallem 17572 qusaddflem 17573 qusaddval 17574 qusaddf 17575 qusmulval 17576 qusmulf 17577 qusgrp2 19091 efgrelexlemb 19781 efgcpbllemb 19786 frgpuplem 19803 qusrng 20217 qusring2 20370 vitalilem2 25659 vitalilem3 25660 tgjustr 28631 |
| Copyright terms: Public domain | W3C validator |