| 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 8654 | . . 3 ⊢ (𝑅 Er 𝐴 → 𝑅 ⊆ (𝐴 × 𝐴)) | |
| 2 | sqxpexg 7697 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 × 𝐴) ∈ V) | |
| 3 | ssexg 5265 | . . 3 ⊢ ((𝑅 ⊆ (𝐴 × 𝐴) ∧ (𝐴 × 𝐴) ∈ V) → 𝑅 ∈ V) | |
| 4 | 1, 2, 3 | syl2an 596 | . 2 ⊢ ((𝑅 Er 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝑅 ∈ V) |
| 5 | 4 | ex 412 | 1 ⊢ (𝑅 Er 𝐴 → (𝐴 ∈ 𝑉 → 𝑅 ∈ V)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2113 Vcvv 3437 ⊆ wss 3898 × cxp 5619 Er wer 8628 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2712 df-cleq 2725 df-clel 2808 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-br 5096 df-opab 5158 df-xp 5627 df-rel 5628 df-cnv 5629 df-dm 5631 df-rn 5632 df-er 8631 |
| This theorem is referenced by: erexb 8656 qliftlem 8731 qshash 15741 qusaddvallem 17463 qusaddflem 17464 qusaddval 17465 qusaddf 17466 qusmulval 17467 qusmulf 17468 qusgrp2 18979 efgrelexlemb 19670 efgcpbllemb 19675 frgpuplem 19692 qusrng 20106 qusring2 20261 vitalilem2 25557 vitalilem3 25558 tgjustr 28472 |
| Copyright terms: Public domain | W3C validator |