| 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 8660 | . . 3 ⊢ (𝑅 Er 𝐴 → 𝑅 ⊆ (𝐴 × 𝐴)) | |
| 2 | sqxpexg 7702 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 × 𝐴) ∈ V) | |
| 3 | ssexg 5260 | . . 3 ⊢ ((𝑅 ⊆ (𝐴 × 𝐴) ∧ (𝐴 × 𝐴) ∈ V) → 𝑅 ∈ V) | |
| 4 | 1, 2, 3 | syl2an 597 | . 2 ⊢ ((𝑅 Er 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝑅 ∈ V) |
| 5 | 4 | ex 412 | 1 ⊢ (𝑅 Er 𝐴 → (𝐴 ∈ 𝑉 → 𝑅 ∈ V)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2114 Vcvv 3430 ⊆ wss 3890 × cxp 5622 Er wer 8633 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5231 ax-pow 5302 ax-pr 5370 ax-un 7682 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-xp 5630 df-rel 5631 df-cnv 5632 df-dm 5634 df-rn 5635 df-er 8636 |
| This theorem is referenced by: erexb 8662 qliftlem 8738 qshash 15781 qusaddvallem 17506 qusaddflem 17507 qusaddval 17508 qusaddf 17509 qusmulval 17510 qusmulf 17511 qusgrp2 19025 efgrelexlemb 19716 efgcpbllemb 19721 frgpuplem 19738 qusrng 20152 qusring2 20305 vitalilem2 25586 vitalilem3 25587 tgjustr 28556 |
| Copyright terms: Public domain | W3C validator |