![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > so2nr | Structured version Visualization version GIF version |
Description: A strict order relation has no 2-cycle loops. (Contributed by NM, 21-Jan-1996.) |
Ref | Expression |
---|---|
so2nr | ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → ¬ (𝐵𝑅𝐶 ∧ 𝐶𝑅𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sopo 5456 | . 2 ⊢ (𝑅 Or 𝐴 → 𝑅 Po 𝐴) | |
2 | po2nr 5451 | . 2 ⊢ ((𝑅 Po 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → ¬ (𝐵𝑅𝐶 ∧ 𝐶𝑅𝐵)) | |
3 | 1, 2 | sylan 583 | 1 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → ¬ (𝐵𝑅𝐶 ∧ 𝐶𝑅𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∈ wcel 2111 class class class wbr 5030 Po wpo 5436 Or wor 5437 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-v 3443 df-un 3886 df-sn 4526 df-pr 4528 df-op 4532 df-br 5031 df-po 5438 df-so 5439 |
This theorem is referenced by: sotric 5465 somincom 5961 fisupg 8750 suppr 8919 infpr 8951 genpnnp 10416 ltnsym2 10728 |
Copyright terms: Public domain | W3C validator |