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

Theorem domrefg 7134
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 7131 . 2  |-  ( A  e.  V  ->  A  ~~  A )
2 endom 7126 . 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 1725   class class class wbr 4204    ~~ cen 7098    ~<_ cdom 7099
This theorem is referenced by:  cardprclem  7858  indcardi  7914  cdadom1  8058  infdif  8081  alephexp2  8448  pwcfsdom  8450  alephom  8452
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-13 1727  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-sep 4322  ax-nul 4330  ax-pow 4369  ax-pr 4395  ax-un 4693
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rex 2703  df-rab 2706  df-v 2950  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-nul 3621  df-if 3732  df-pw 3793  df-sn 3812  df-pr 3813  df-op 3815  df-uni 4008  df-br 4205  df-opab 4259  df-id 4490  df-xp 4876  df-rel 4877  df-cnv 4878  df-co 4879  df-dm 4880  df-rn 4881  df-res 4882  df-ima 4883  df-fun 5448  df-fn 5449  df-f 5450  df-f1 5451  df-fo 5452  df-f1o 5453  df-en 7102  df-dom 7103
  Copyright terms: Public domain W3C validator