Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sonr | Structured version Visualization version Unicode version |
Description: A strict order relation is irreflexive. (Contributed by NM, 24-Nov-1995.) |
Ref | Expression |
---|---|
sonr |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sopo 5052 | . 2 | |
2 | poirr 5046 | . 2 | |
3 | 1, 2 | sylan 488 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wn 3 wi 4 wa 384 wcel 1990 class class class wbr 4653 wpo 5033 wor 5034 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-br 4654 df-po 5035 df-so 5036 |
This theorem is referenced by: sotric 5061 sotrieq 5062 soirri 5522 suppr 8377 infpr 8409 hartogslem1 8447 canth4 9469 canthwelem 9472 pwfseqlem4 9484 1ne0sr 9917 ltnr 10132 opsrtoslem2 19485 nodenselem4 31837 nodenselem5 31838 nodenselem7 31840 nolt02o 31845 noresle 31846 noprefixmo 31848 nosupbnd1lem1 31854 nosupbnd2lem1 31861 sltirr 31871 fin2solem 33395 fin2so 33396 |
Copyright terms: Public domain | W3C validator |