Theorem sotrieq2 5564

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 5563	. 2 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 = 𝐶 ↔ ¬ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵)))
2		ioran 985	. 2 ⊢ (¬ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵) ↔ (¬ 𝐵𝑅𝐶 ∧ ¬ 𝐶𝑅𝐵))
3	1, 2	bitrdi 287	1 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 = 𝐶 ↔ (¬ 𝐵𝑅𝐶 ∧ ¬ 𝐶𝑅𝐵)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1541   ∈ wcel 2113   class class class wbr 5098   Or wor 5531

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-br 5099  df-po 5532  df-so 5533

This theorem is referenced by:  fisupg  9190  supmo  9357  infmo  9402  fiinfg  9406  lttri3  11218  xrlttri3  13059  nosupbnd1lem2  27679  noinfbnd1lem2  27694  ltstrieq2  27720  weiunfrlem  36660  wessf1ornlem  45450