Theorem sotrieq2 5571

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 5570	. 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 1540   ∈ wcel 2109   class class class wbr 5102   Or wor 5538

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 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rab 3403  df-v 3446  df-dif 3914  df-un 3916  df-ss 3928  df-nul 4293  df-if 4485  df-sn 4586  df-pr 4588  df-op 4592  df-br 5103  df-po 5539  df-so 5540

This theorem is referenced by:  fisupg  9211  supmo  9379  infmo  9424  fiinfg  9428  lttri3  11233  xrlttri3  13079  nosupbnd1lem2  27654  noinfbnd1lem2  27669  slttrieq2  27695  weiunfrlem  36445  wessf1ornlem  45172