| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sdomn2lp | Structured version Visualization version GIF version | ||
| Description: Strict dominance has no 2-cycle loops. (Contributed by NM, 6-May-2008.) |
| Ref | Expression |
|---|---|
| sdomn2lp | ⊢ ¬ (𝐴 ≺ 𝐵 ∧ 𝐵 ≺ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sdomirr 9086 | . 2 ⊢ ¬ 𝐴 ≺ 𝐴 | |
| 2 | sdomtr 9087 | . 2 ⊢ ((𝐴 ≺ 𝐵 ∧ 𝐵 ≺ 𝐴) → 𝐴 ≺ 𝐴) | |
| 3 | 1, 2 | mto 199 | 1 ⊢ ¬ (𝐴 ≺ 𝐵 ∧ 𝐵 ≺ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∧ wa 399 class class class wbr 5100 ≺ csdm 8926 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-pow 5322 ax-pr 5390 ax-un 7718 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |