| 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 8989 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≈ 𝐴) | |
| 2 | endom 8984 | . 2 ⊢ (𝐴 ≈ 𝐴 → 𝐴 ≼ 𝐴) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≼ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2145 class class class wbr 5102 ≈ cen 8948 ≼ cdom 8949 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5248 ax-pow 5326 ax-pr 5390 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 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 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-en 8952 df-dom 8953 |
| This theorem is used by: cardprclem 10031 indcardi 10091 djudom1 10232 infdif 10257 alephexp2 10637 pwcfsdom 10639 alephom 10641 iunctb2 38246 safesnsupfidom1o 44361 sn1dom 44470 fvconstdomi 49922 indthincALT 50493 |
| Copyright terms: Public domain | W3C validator |