Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sotri | Structured version Visualization version Unicode version |
Description: A strict order relation is a transitive relation. (Contributed by NM, 10-Feb-1996.) (Revised by Mario Carneiro, 10-May-2013.) |
Ref | Expression |
---|---|
soi.1 | |
soi.2 |
Ref | Expression |
---|---|
sotri |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | soi.2 | . . . . 5 | |
2 | 1 | brel 5168 | . . . 4 |
3 | 2 | simpld 475 | . . 3 |
4 | 1 | brel 5168 | . . 3 |
5 | 3, 4 | anim12i 590 | . 2 |
6 | soi.1 | . . . 4 | |
7 | sotr 5057 | . . . 4 | |
8 | 6, 7 | mpan 706 | . . 3 |
9 | 8 | 3expb 1266 | . 2 |
10 | 5, 9 | mpcom 38 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wa 384 w3a 1037 wcel 1990 wss 3574 class class class wbr 4653 wor 5034 cxp 5112 |
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 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
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-rex 2918 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-opab 4713 df-po 5035 df-so 5036 df-xp 5120 |
This theorem is referenced by: son2lpi 5524 sotri2 5525 sotri3 5526 ltsonq 9791 ltbtwnnq 9800 nqpr 9836 prlem934 9855 ltexprlem4 9861 reclem2pr 9870 reclem4pr 9872 ltsosr 9915 addgt0sr 9925 supsrlem 9932 axpre-lttrn 9987 |
Copyright terms: Public domain | W3C validator |