HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem ecexg 4271
Description: An equivalence class modulo a set is a set.
Assertion
Ref Expression
ecexg |- (R e. B -> [A]R e. V)

Proof of Theorem ecexg
StepHypRef Expression
1 imaexg 3422 . 2 |- (R e. B -> (R"{A}) e. V)
2 df-ec 4269 . 2 |- [A]R = (R"{A})
31, 2syl5eqel 1555 1 |- (R e. B -> [A]R e. V)
Colors of variables: wff set class
Syntax hints:   -> wi 3   e. wcel 960  Vcvv 1814  {csn 2413  "cima 3179  [cec 4265
This theorem is referenced by:  ecelqsi 4298  ecqs 4303  brecop2 4313  th3q 4323  recmulpq 5082  ltexpq 5092  halfpq 5094  prlem934a 5149  prlem934 5151  recexsrlem 5224  suppsrlem 5233  suppsr 5234
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785  ax-un 2872
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-rex 1653  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-uni 2508  df-br 2625  df-opab 2672  df-xp 3190  df-cnv 3192  df-dm 3194  df-rn 3195  df-res 3196  df-ima 3197  df-ec 4269
Copyright terms: Public domain