| 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 8750 | . 2 ⊢ [𝐴]𝑅 = (𝑅 “ {𝐴}) | |
| 2 | imaexg 7952 | . 2 ⊢ (𝑅 ∈ 𝐵 → (𝑅 “ {𝐴}) ∈ V) | |
| 3 | 1, 2 | eqeltrid 2868 | 1 ⊢ (𝑅 ∈ 𝐵 → [𝐴]𝑅 ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2147 Vcvv 3454 {csn 4588 “ cima 5659 [cec 8746 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5253 ax-pr 5396 ax-un 7778 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5172 df-xp 5662 df-rel 5663 df-cnv 5664 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-ec 8750 |
| This theorem is used by: elecex 8799 eroveu 8864 erov 8866 addsrpr 11190 mulsrpr 11191 quslem 17747 eqgen 19425 qusghm 19501 ghmquskerco 19531 sylow2blem1 19867 vrgpval 20014 rngqiprngimf1 21629 znzrhval 21885 qustgpopn 24472 qustgplem 24473 elpi1 25399 pi1xfrval 25408 pi1xfrcnvlem 25410 pi1xfrcnv 25411 pi1cof 25413 pi1coval 25414 tgjustr 28969 rlocf1 33911 qusker 33994 qusvscpbl 33996 qusvsval 33997 qusrn 34044 zringfrac 34169 pstmfval 34611 fvline 37100 dmqmap 39588 qmapeldisjsim 39995 |
| Copyright terms: Public domain | W3C validator |