| 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 8723 | . 2 ⊢ [𝐴]𝑅 = (𝑅 “ {𝐴}) | |
| 2 | imaexg 7926 | . 2 ⊢ (𝑅 ∈ 𝐵 → (𝑅 “ {𝐴}) ∈ V) | |
| 3 | 1, 2 | eqeltrid 2864 | 1 ⊢ (𝑅 ∈ 𝐵 → [𝐴]𝑅 ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2144 Vcvv 3450 {csn 4584 “ cima 5653 [cec 8719 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5390 ax-un 7752 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-xp 5656 df-rel 5657 df-cnv 5658 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-ec 8723 |
| This theorem is used by: elecex 8772 eroveu 8837 erov 8839 addsrpr 11164 mulsrpr 11165 quslem 17721 eqgen 19399 qusghm 19475 ghmquskerco 19504 sylow2blem1 19840 vrgpval 19987 rngqiprngimf1 21602 znzrhval 21858 qustgpopn 24445 qustgplem 24446 elpi1 25372 pi1xfrval 25381 pi1xfrcnvlem 25383 pi1xfrcnv 25384 pi1cof 25386 pi1coval 25387 tgjustr 28942 rlocf1 33882 qusker 33957 qusvscpbl 33959 qusvsval 33960 qusrn 34007 zringfrac 34133 pstmfval 34575 fvline 37002 dmqmap 39479 qmapeldisjsim 39886 |
| Copyright terms: Public domain | W3C validator |