Theorem sotrieq2 5602

Description: Trichotomy law for strict order relation. (Contributed by NM, 5-May-1999.)

Assertion

Ref	Expression
sotrieq2	⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 = 𝐶 ↔ (¬ 𝐵𝑅𝐶 ∧ ¬ 𝐶𝑅𝐵)))

Proof of Theorem sotrieq2

Step	Hyp	Ref	Expression
1		sotrieq 5601	. 2 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 = 𝐶 ↔ ¬ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵)))
2		ioran 999	. 2 ⊢ (¬ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵) ↔ (¬ 𝐵𝑅𝐶 ∧ ¬ 𝐶𝑅𝐵))
3	1, 2	bitrdi 290	1 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 = 𝐶 ↔ (¬ 𝐵𝑅𝐶 ∧ ¬ 𝐶𝑅𝐵)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   = wceq 1567   ∈ wcel 2149   class class class wbr 5111   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 3423  df-v 3463  df-dif 3914  df-un 3916  df-ss 3928  df-nul 4293  df-if 4491  df-sn 4593  df-pr 4595  df-op 4599  df-br 5112  df-po 5570  df-so 5571

This theorem is referenced by:  fisupg  9248  supmo  9412  infmo  9457  fiinfg  9461  lttri3  11293  xrlttri3  13168  nosupbnd1lem2  27839  noinfbnd1lem2  27854  ltstrieq2  27880  weiunfrlem  36898  wessf1ornlem  45830