| 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 8697 | . 2 ⊢ [𝐴]𝑅 = (𝑅 “ {𝐴}) | |
| 2 | imaexg 7911 | . 2 ⊢ (𝑅 ∈ 𝐵 → (𝑅 “ {𝐴}) ∈ V) | |
| 3 | 1, 2 | eqeltrid 2867 | 1 ⊢ (𝑅 ∈ 𝐵 → [𝐴]𝑅 ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2143 Vcvv 3455 {csn 4590 “ cima 5666 [cec 8693 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5258 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-xp 5669 df-cnv 5671 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-ec 8697 |
| This theorem is referenced by: elecex 8746 eroveu 8811 erov 8813 addsrpr 11061 mulsrpr 11062 quslem 17598 eqgen 19250 qusghm 19326 ghmquskerco 19355 sylow2blem1 19691 vrgpval 19838 rngqiprngimf1 21421 znzrhval 21677 qustgpopn 24258 qustgplem 24259 elpi1 25185 pi1xfrval 25194 pi1xfrcnvlem 25196 pi1xfrcnv 25197 pi1cof 25199 pi1coval 25200 tgjustr 28724 rlocf1 33575 qusker 33650 qusvscpbl 33652 qusvsval 33653 qusrn 33699 zringfrac 33825 pstmfval 34267 fvline 36617 dmqmap 39083 qmapeldisjsim 39490 |
| Copyright terms: Public domain | W3C validator |