MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  soasym Structured version   Visualization version   GIF version

Theorem soasym 5577
Description: Asymmetry law for strict orderings. (Contributed by Scott Fenton, 24-Nov-2021.)
Assertion
Ref Expression
soasym ((𝑅 Or 𝐴 ∧ (𝑋𝐴𝑌𝐴)) → (𝑋𝑅𝑌 → ¬ 𝑌𝑅𝑋))

Proof of Theorem soasym
StepHypRef Expression
1 sotric 5574 . 2 ((𝑅 Or 𝐴 ∧ (𝑋𝐴𝑌𝐴)) → (𝑋𝑅𝑌 ↔ ¬ (𝑋 = 𝑌𝑌𝑅𝑋)))
2 pm2.46 882 . 2 (¬ (𝑋 = 𝑌𝑌𝑅𝑋) → ¬ 𝑌𝑅𝑋)
31, 2syl6bi 253 1 ((𝑅 Or 𝐴 ∧ (𝑋𝐴𝑌𝐴)) → (𝑋𝑅𝑌 → ¬ 𝑌𝑅𝑋))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 397  wo 846   = wceq 1542  wcel 2107   class class class wbr 5106   Or wor 5545
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2708
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2715  df-cleq 2729  df-clel 2815  df-ral 3066  df-rab 3409  df-v 3448  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4284  df-if 4488  df-sn 4588  df-pr 4590  df-op 4594  df-br 5107  df-po 5546  df-so 5547
This theorem is referenced by:  fiinfg  9436  noresle  27048  nosupprefixmo  27051  noinfprefixmo  27052  nosupbnd1lem1  27059  nosupbnd1lem4  27062  nosupbnd2lem1  27066  nosupbnd2  27067  noinfbnd1lem1  27074  noinfbnd1lem4  27077  noinfbnd2lem1  27081  noinfbnd2  27082  sltasym  27099  or2expropbi  45275  prproropf1olem3  45704
  Copyright terms: Public domain W3C validator