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 8504 | . . 3 ⊢ (𝑅 Er 𝐴 → 𝑅 ⊆ (𝐴 × 𝐴)) | |
2 | sqxpexg 7599 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 × 𝐴) ∈ V) | |
3 | ssexg 5251 | . . 3 ⊢ ((𝑅 ⊆ (𝐴 × 𝐴) ∧ (𝐴 × 𝐴) ∈ V) → 𝑅 ∈ V) | |
4 | 1, 2, 3 | syl2an 596 | . 2 ⊢ ((𝑅 Er 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝑅 ∈ V) |
5 | 4 | ex 413 | 1 ⊢ (𝑅 Er 𝐴 → (𝐴 ∈ 𝑉 → 𝑅 ∈ V)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2110 Vcvv 3431 ⊆ wss 3892 × cxp 5588 Er wer 8478 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-12 2175 ax-ext 2711 ax-sep 5227 ax-nul 5234 ax-pow 5292 ax-pr 5356 ax-un 7582 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-sb 2072 df-clab 2718 df-cleq 2732 df-clel 2818 df-ral 3071 df-rex 3072 df-rab 3075 df-v 3433 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4846 df-br 5080 df-opab 5142 df-xp 5596 df-rel 5597 df-cnv 5598 df-dm 5600 df-rn 5601 df-er 8481 |
This theorem is referenced by: erexb 8506 qliftlem 8570 qshash 15537 qusaddvallem 17260 qusaddflem 17261 qusaddval 17262 qusaddf 17263 qusmulval 17264 qusmulf 17265 qusgrp2 18691 efgrelexlemb 19354 efgcpbllemb 19359 frgpuplem 19376 qusring2 19857 vitalilem2 24771 vitalilem3 24772 tgjustr 26833 |
Copyright terms: Public domain | W3C validator |