MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  domrefg Unicode version

Theorem domrefg 7080
Description: Dominance is reflexive. (Contributed by NM, 18-Jun-1998.)
Assertion
Ref Expression
domrefg  |-  ( A  e.  V  ->  A  ~<_  A )

Proof of Theorem domrefg
StepHypRef Expression
1 enrefg 7077 . 2  |-  ( A  e.  V  ->  A  ~~  A )
2 endom 7072 . 2  |-  ( A 
~~  A  ->  A  ~<_  A )
31, 2syl 16 1  |-  ( A  e.  V  ->  A  ~<_  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 1717   class class class wbr 4155    ~~ cen 7044    ~<_ cdom 7045
This theorem is referenced by:  cardprclem  7801  indcardi  7857  cdadom1  8001  infdif  8024  alephexp2  8391  pwcfsdom  8393  alephom  8395
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-13 1719  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2370  ax-sep 4273  ax-nul 4281  ax-pow 4320  ax-pr 4346  ax-un 4643
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2244  df-mo 2245  df-clab 2376  df-cleq 2382  df-clel 2385  df-nfc 2514  df-ne 2554  df-ral 2656  df-rex 2657  df-rab 2660  df-v 2903  df-dif 3268  df-un 3270  df-in 3272  df-ss 3279  df-nul 3574  df-if 3685  df-pw 3746  df-sn 3765  df-pr 3766  df-op 3768  df-uni 3960  df-br 4156  df-opab 4210  df-id 4441  df-xp 4826  df-rel 4827  df-cnv 4828  df-co 4829  df-dm 4830  df-rn 4831  df-res 4832  df-ima 4833  df-fun 5398  df-fn 5399  df-f 5400  df-f1 5401  df-fo 5402  df-f1o 5403  df-en 7048  df-dom 7049
  Copyright terms: Public domain W3C validator