Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sonr | Structured version Visualization version GIF version |
Description: A strict order relation is irreflexive. (Contributed by NM, 24-Nov-1995.) |
Ref | Expression |
---|---|
sonr | ⊢ ((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵𝑅𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sopo 5491 | . 2 ⊢ (𝑅 Or 𝐴 → 𝑅 Po 𝐴) | |
2 | poirr 5484 | . 2 ⊢ ((𝑅 Po 𝐴 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵𝑅𝐵) | |
3 | 1, 2 | sylan 582 | 1 ⊢ ((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵𝑅𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∈ wcel 2110 class class class wbr 5065 Po wpo 5471 Or wor 5472 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rab 3147 df-v 3496 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4567 df-pr 4569 df-op 4573 df-br 5066 df-po 5473 df-so 5474 |
This theorem is referenced by: sotric 5500 sotrieq 5501 soirri 5985 suppr 8934 infpr 8966 hartogslem1 9005 canth4 10068 canthwelem 10071 pwfseqlem4 10083 1ne0sr 10517 ltnr 10734 opsrtoslem2 20264 nodenselem4 33191 nodenselem5 33192 nodenselem7 33194 nolt02o 33199 noresle 33200 noprefixmo 33202 nosupbnd1lem1 33208 nosupbnd2lem1 33215 sltirr 33225 fin2solem 34877 fin2so 34878 |
Copyright terms: Public domain | W3C validator |