| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > domrefg | Structured version Visualization version GIF version | ||
| Description: Dominance is reflexive. (Contributed by NM, 18-Jun-1998.) |
| Ref | Expression |
|---|---|
| domrefg | ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≼ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | enrefg 9011 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≈ 𝐴) | |
| 2 | endom 9006 | . 2 ⊢ (𝐴 ≈ 𝐴 → 𝐴 ≼ 𝐴) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≼ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2144 class class class wbr 5102 ≈ cen 8970 ≼ cdom 8971 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-en 8974 df-dom 8975 |
| This theorem is used by: cardprclem 10060 indcardi 10120 djudom1 10261 infdif 10286 alephexp2 10666 pwcfsdom 10668 alephom 10670 iunctb2 38327 safesnsupfidom1o 44418 sn1dom 44527 fvconstdomi 50000 indthincALT 50571 |
| Copyright terms: Public domain | W3C validator |