| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > erex | Unicode 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 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | erssxp 6830 |
. . 3
| |
| 2 | xpexg 4889 |
. . . 4
| |
| 3 | 2 | anidms 401 |
. . 3
|
| 4 | ssexg 4272 |
. . 3
| |
| 5 | 1, 3, 4 | syl2an 289 |
. 2
|
| 6 | 5 | ex 115 |
1
|
| Colors of variables: wff set class |
| This proof depends on syntax axioms:
|
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4131 df-opab 4193 df-xp 4780 df-rel 4781 df-cnv 4782 df-dm 4784 df-rn 4785 df-er 6807 |
| This theorem is used by: erexb 6832 qliftlem 6887 qusaddvallemg 13654 qusaddflemg 13655 qusaddval 13656 qusaddf 13657 qusmulval 13658 qusmulf 13659 qusgrp2 13916 eqgen 14030 qusrng 14257 qusring2 14371 |
| Copyright terms: Public domain | W3C validator |