| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: An equivalence class modulo a set is a set. |
| Ref | Expression |
|---|---|
| ecexg |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | imaexg 3408 |
. 2
| |
| 2 | df-ec 4253 |
. 2
| |
| 3 | 1, 2 | syl5eqel 1549 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: ecelqsi 4282 ecqs 4287 brecop2 4297 th3q 4307 recmulpq 5050 ltexpq 5060 halfpq 5062 prlem934a 5117 prlem934 5119 recexsrlem 5192 suppsrlem 5201 suppsr 5202 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 960 ax-gen 961 ax-8 962 ax-10 964 ax-11 965 ax-12 966 ax-13 967 ax-14 968 ax-17 969 ax-4 971 ax-5o 973 ax-6o 976 ax-9o 1121 ax-10o 1138 ax-16 1208 ax-11o 1216 ax-ext 1457 ax-sep 2698 ax-pow 2737 ax-pr 2774 ax-un 2861 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 979 df-sb 1170 df-eu 1380 df-mo 1381 df-clab 1462 df-cleq 1467 df-clel 1470 df-ne 1584 df-rex 1647 df-v 1808 df-dif 2045 df-un 2046 df-in 2047 df-ss 2049 df-nul 2277 df-pw 2398 df-sn 2408 df-pr 2409 df-op 2412 df-uni 2499 df-br 2615 df-opab 2662 df-xp 3179 df-cnv 3181 df-dm 3183 df-rn 3184 df-res 3185 df-ima 3186 df-ec 4253 |