| 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 8684 | . 2 ⊢ [𝐴]𝑅 = (𝑅 “ {𝐴}) | |
| 2 | imaexg 7898 | . 2 ⊢ (𝑅 ∈ 𝐵 → (𝑅 “ {𝐴}) ∈ V) | |
| 3 | 1, 2 | eqeltrid 2869 | 1 ⊢ (𝑅 ∈ 𝐵 → [𝐴]𝑅 ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2145 Vcvv 3457 {csn 4585 “ cima 5654 [cec 8680 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 ax-sep 5250 ax-pr 5394 ax-un 7722 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5105 df-opab 5167 df-xp 5657 df-cnv 5659 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-ec 8684 |
| This theorem is referenced by: elecex 8733 eroveu 8798 erov 8800 addsrpr 11048 mulsrpr 11049 quslem 17585 eqgen 19237 qusghm 19313 ghmquskerco 19342 sylow2blem1 19678 vrgpval 19825 rngqiprngimf1 21399 znzrhval 21653 qustgpopn 24234 qustgplem 24235 elpi1 25161 pi1xfrval 25170 pi1xfrcnvlem 25172 pi1xfrcnv 25173 pi1cof 25175 pi1coval 25176 tgjustr 28697 rlocf1 33502 qusker 33579 qusvscpbl 33581 qusvsval 33582 qusrn 33629 zringfrac 33756 pstmfval 34198 fvline 36502 dmqmap 38959 qmapeldisjsim 39366 |
| Copyright terms: Public domain | W3C validator |