Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > soasym | Structured version Visualization version GIF version |
Description: Asymmetry law for strict orderings. (Contributed by Scott Fenton, 24-Nov-2021.) |
Ref | Expression |
---|---|
soasym | ⊢ ((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (𝑋𝑅𝑌 → ¬ 𝑌𝑅𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sotric 5504 | . 2 ⊢ ((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (𝑋𝑅𝑌 ↔ ¬ (𝑋 = 𝑌 ∨ 𝑌𝑅𝑋))) | |
2 | pm2.46 879 | . 2 ⊢ (¬ (𝑋 = 𝑌 ∨ 𝑌𝑅𝑋) → ¬ 𝑌𝑅𝑋) | |
3 | 1, 2 | syl6bi 255 | 1 ⊢ ((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (𝑋𝑅𝑌 → ¬ 𝑌𝑅𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∨ wo 843 = wceq 1536 ∈ wcel 2113 class class class wbr 5069 Or wor 5476 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ral 3146 df-rab 3150 df-v 3499 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-br 5070 df-po 5477 df-so 5478 |
This theorem is referenced by: fiinfg 8966 noresle 33204 noprefixmo 33206 nosupbnd1lem1 33212 nosupbnd1lem4 33215 nosupbnd2lem1 33219 nosupbnd2 33220 sltasym 33231 or2expropbi 43276 prproropf1olem3 43674 |
Copyright terms: Public domain | W3C validator |