| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relsdom | Structured version Visualization version GIF version | ||
| Description: Strict dominance is a relation. (Contributed by NM, 31-Mar-1998.) |
| Ref | Expression |
|---|---|
| relsdom | ⊢ Rel ≺ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reldom 9017 | . 2 ⊢ Rel ≼ | |
| 2 | reldif 5802 | . . 3 ⊢ (Rel ≼ → Rel ( ≼ ∖ ≈ )) | |
| 3 | df-sdom 9014 | . . . 4 ⊢ ≺ = ( ≼ ∖ ≈ ) | |
| 4 | 3 | releqi 5762 | . . 3 ⊢ (Rel ≺ ↔ Rel ( ≼ ∖ ≈ )) |
| 5 | 2, 4 | sylibr 237 | . 2 ⊢ (Rel ≼ → Rel ≺ ) |
| 6 | 1, 5 | ax-mp 5 | 1 ⊢ Rel ≺ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∖ cdif 4048 Rel wrel 5663 ≈ cen 9008 ≼ cdom 9009 ≺ csdm 9010 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| 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 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-opab 5174 df-xp 5664 df-rel 5665 df-dom 9013 df-sdom 9014 |
| This theorem is used by: domdifsn 9117 sdomirr 9171 sdomdif 9182 sucdom2 9256 0sdom1dom 9275 1sdom2dom 9283 unxpdom 9288 unxpdom2 9289 sucxpdom 9290 isfinite2 9328 fin2inf 9334 fodomfir 9357 card2on 9585 djuxpdom 10303 djufi 10304 infdif 10325 cfslb2n 10385 isfin5 10416 isfin6 10417 isfin4p1 10432 fin56 10510 fin67 10512 sdomsdomcard 10683 gchi 10748 canthp1lem1 10776 canthp1lem2 10777 canthp1 10778 frgpnabl 20140 kardsdom 35971 fphpd 44089 sdomne0 44736 sdomne0d 44737 |
| Copyright terms: Public domain | W3C validator |