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 5494 | . 2 ⊢ (𝑅 Or 𝐴 → 𝑅 Po 𝐴) | |
2 | poirr 5487 | . 2 ⊢ ((𝑅 Po 𝐴 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵𝑅𝐵) | |
3 | 1, 2 | sylan 582 | 1 ⊢ ((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵𝑅𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∈ wcel 2114 class class class wbr 5068 Po wpo 5474 Or wor 5475 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rab 3149 df-v 3498 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-br 5069 df-po 5476 df-so 5477 |
This theorem is referenced by: sotric 5503 sotrieq 5504 soirri 5988 suppr 8937 infpr 8969 hartogslem1 9008 canth4 10071 canthwelem 10074 pwfseqlem4 10086 1ne0sr 10520 ltnr 10737 opsrtoslem2 20267 nodenselem4 33193 nodenselem5 33194 nodenselem7 33196 nolt02o 33201 noresle 33202 noprefixmo 33204 nosupbnd1lem1 33210 nosupbnd2lem1 33217 sltirr 33227 fin2solem 34880 fin2so 34881 |
Copyright terms: Public domain | W3C validator |