Theorem soasym 5603

Description: Asymmetry law for strict orderings. (Contributed by Scott Fenton, 24-Nov-2021.)

Assertion

Ref	Expression
soasym	⊢ ((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (𝑋𝑅𝑌 → ¬ 𝑌𝑅𝑋))

Proof of Theorem soasym

Step	Hyp	Ref	Expression
1		sotric 5600	. 2 ⊢ ((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (𝑋𝑅𝑌 ↔ ¬ (𝑋 = 𝑌 ∨ 𝑌𝑅𝑋)))
2		pm2.46 895	. 2 ⊢ (¬ (𝑋 = 𝑌 ∨ 𝑌𝑅𝑋) → ¬ 𝑌𝑅𝑋)
3	1, 2	biimtrdi 256	1 ⊢ ((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (𝑋𝑅𝑌 → ¬ 𝑌𝑅𝑋))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   ∨ wo 860   = wceq 1567   ∈ wcel 2149   class class class wbr 5113   Or wor 5569

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5114  df-po 5570  df-so 5571

This theorem is referenced by:  fiinfg  9460  noresle  27826  nosupprefixmo  27829  noinfprefixmo  27830  nosupbnd1lem1  27837  nosupbnd1lem4  27840  nosupbnd2lem1  27844  nosupbnd2  27845  noinfbnd1lem1  27852  noinfbnd1lem4  27855  noinfbnd2lem1  27859  noinfbnd2  27860  ltsasym  27877  or2expropbi  47659  prproropf1olem3  48142