![]() |
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 7789 | . 2 ⊢ [𝐴]𝑅 = (𝑅 “ {𝐴}) | |
2 | imaexg 7145 | . 2 ⊢ (𝑅 ∈ 𝐵 → (𝑅 “ {𝐴}) ∈ V) | |
3 | 1, 2 | syl5eqel 2734 | 1 ⊢ (𝑅 ∈ 𝐵 → [𝐴]𝑅 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2030 Vcvv 3231 {csn 4210 “ cima 5146 [cec 7785 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 ax-nul 4822 ax-pr 4936 ax-un 6991 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ral 2946 df-rex 2947 df-rab 2950 df-v 3233 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-nul 3949 df-if 4120 df-sn 4211 df-pr 4213 df-op 4217 df-uni 4469 df-br 4686 df-opab 4746 df-xp 5149 df-cnv 5151 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-ec 7789 |
This theorem is referenced by: ecelqsg 7845 uniqs 7850 eroveu 7885 erov 7887 addsrpr 9934 mulsrpr 9935 quslem 16250 eqgen 17694 qusghm 17744 sylow2blem1 18081 vrgpval 18226 znzrhval 19943 qustgpopn 21970 qustgplem 21971 elpi1 22891 pi1xfrval 22900 pi1xfrcnvlem 22902 pi1xfrcnv 22903 pi1cof 22905 pi1coval 22906 pstmfval 30067 fvline 32376 ecex2 34241 |
Copyright terms: Public domain | W3C validator |