| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ecexg | Structured version Visualization version GIF version | ||
| Description: An equivalence class modulo a set is a set. (Contributed by NM, 24-Jul-1995.) |
| Ref | Expression |
|---|---|
| ecexg | ⊢ (𝑅 ∈ 𝐵 → [𝐴]𝑅 ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ec 8721 | . 2 ⊢ [𝐴]𝑅 = (𝑅 “ {𝐴}) | |
| 2 | imaexg 7909 | . 2 ⊢ (𝑅 ∈ 𝐵 → (𝑅 “ {𝐴}) ∈ V) | |
| 3 | 1, 2 | eqeltrid 2838 | 1 ⊢ (𝑅 ∈ 𝐵 → [𝐴]𝑅 ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2108 Vcvv 3459 {csn 4601 “ cima 5657 [cec 8717 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pr 5402 ax-un 7729 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2714 df-cleq 2727 df-clel 2809 df-ral 3052 df-rex 3061 df-rab 3416 df-v 3461 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-if 4501 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-br 5120 df-opab 5182 df-xp 5660 df-cnv 5662 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-ec 8721 |
| This theorem is referenced by: ecelqsg 8786 uniqs 8791 eroveu 8826 erov 8828 addsrpr 11089 mulsrpr 11090 quslem 17557 eqgen 19164 qusghm 19238 ghmquskerco 19267 sylow2blem1 19601 vrgpval 19748 rngqiprngimf1 21261 znzrhval 21507 qustgpopn 24058 qustgplem 24059 elpi1 24996 pi1xfrval 25005 pi1xfrcnvlem 25007 pi1xfrcnv 25008 pi1cof 25010 pi1coval 25011 tgjustr 28453 rlocf1 33268 qusker 33364 qusvscpbl 33366 qusvsval 33367 qusrn 33424 zringfrac 33569 pstmfval 33927 fvline 36162 ecex2 38346 |
| Copyright terms: Public domain | W3C validator |