The Comprehensive LaTeX Symbol List

Table 70: mathabx Negated Binary Relations \napprox M \notperp * \nvDash \ncong ¢ \nprec * \nVDash¸ \ncurlyeqprec È \nprecapprox . \nVdash¹ \ncurlyeqsucc ¦ \npreccurlyeq & \nvdash+ \nDashv ª \npreceq . \nVvash/ \ndashV  \nprecsim Ê \precnapprox' \ndashv \nsim ¬ \precneq+ \nDashV \nsimeq Ä \precnsim/ \ndashVv £ \nsucc Ë \succnapprox \neq É \nsuccapprox ­ \succneq \notasymp § \nsucccurlyeq Å \succnsim \notdivides « \nsucceq \notequiv à \nsuccsimThe \changenotsign command toggles the behavior of \not to produce either avertical or a diagonal slash through a binary operator. Thus, “$a \not= b$” canbe made to produce either “a = b” or “a = b”.Table 71: MnSymbol Binary Relations≈ \approx ≖ \eqcirc \nwfree ∥ \shortparallel≊ \approxeq ⩦ \eqdot \nwmodels ∼ \sim \backapprox ≂ \eqsim \nwModels ≃ \simeq \backapproxeq = \equal \nwsecrossing ≻ \succ≌ \backcong \equalclosed \nwseline ⪸ \succapprox \backeqsim ≡ \equiv \Nwseline ≽ \succcurlyeq∽ \backsim \equivclosed \nwvdash ⪰ \succeq⋍ \backsimeq ≒ \fallingdotseq \nwVdash ≿ \succsim \backtriplesim ≙ \hateq ≺ \prec \swfootline≬ \between \hcrossing ⪷ \precapprox \swfree≏ \bumpeq \leftfootline ≼ \preccurlyeq \swmodels≎ \Bumpeq \leftfree ⪯ \preceq \swModels≗ \circeq \leftmodels ≾ \precsim \swvdash \closedequal \leftModels \rightfootline \swVdash \closedprec ∝ \leftpropto \rightfree ≋ \triplesim \closedsucc \leftrightline ⊧ \rightmodels ∣ \updownline≅ \cong \Leftrightline ⊫ \rightModels ∥ \Updownline⋞ \curlyeqprec ⪦ \leftslice \rightpropto \upfootline⋟ \curlyeqsucc ⊣ \leftvdash ⪧ \rightslice \upfree≐ \doteq \leftVdash ⊢ \rightvdash \upmodels≑ \Doteq \nefootline ⊩ \rightVdash \upModels \downfootline \nefree ≓ \risingdotseq \uppropto⫝ \downfree \nemodels \sefootline ⊥ \upvdash \downmodels \neModels \sefree ⍊ \upVdash \downModels \neswline \semodels \vcrossing \downpropto \Neswline \seModels ⊪ \Vvdash⊤ \downvdash \nevdash \separated⍑ \downVdash \neVdash \sevdash \eqbump \nwfootline \seVdash32