Theorem sotr3 5581

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

Assertion

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

Proof of Theorem sotr3

Step	Hyp	Ref	Expression
1		simp3 1139	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑍 ∈ 𝐴) → 𝑍 ∈ 𝐴)
2		simp2 1138	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑍 ∈ 𝐴) → 𝑌 ∈ 𝐴)
3	1, 2	jca 511	. . . . . 6 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑍 ∈ 𝐴) → (𝑍 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴))
4		sotric 5570	. . . . . 6 ⊢ ((𝑅 Or 𝐴 ∧ (𝑍 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (𝑍𝑅𝑌 ↔ ¬ (𝑍 = 𝑌 ∨ 𝑌𝑅𝑍)))
5	3, 4	sylan2 594	. . . . 5 ⊢ ((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑍 ∈ 𝐴)) → (𝑍𝑅𝑌 ↔ ¬ (𝑍 = 𝑌 ∨ 𝑌𝑅𝑍)))
6	5	con2bid 354	. . . 4 ⊢ ((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑍 ∈ 𝐴)) → ((𝑍 = 𝑌 ∨ 𝑌𝑅𝑍) ↔ ¬ 𝑍𝑅𝑌))
7	6	adantr 480	. . 3 ⊢ (((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑍 ∈ 𝐴)) ∧ 𝑋𝑅𝑌) → ((𝑍 = 𝑌 ∨ 𝑌𝑅𝑍) ↔ ¬ 𝑍𝑅𝑌))
8		breq2 5104	. . . . . 6 ⊢ (𝑍 = 𝑌 → (𝑋𝑅𝑍 ↔ 𝑋𝑅𝑌))
9	8	biimprcd 250	. . . . 5 ⊢ (𝑋𝑅𝑌 → (𝑍 = 𝑌 → 𝑋𝑅𝑍))
10	9	adantl 481	. . . 4 ⊢ (((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑍 ∈ 𝐴)) ∧ 𝑋𝑅𝑌) → (𝑍 = 𝑌 → 𝑋𝑅𝑍))
11		sotr 5565	. . . . 5 ⊢ ((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑍 ∈ 𝐴)) → ((𝑋𝑅𝑌 ∧ 𝑌𝑅𝑍) → 𝑋𝑅𝑍))
12	11	expdimp 452	. . . 4 ⊢ (((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑍 ∈ 𝐴)) ∧ 𝑋𝑅𝑌) → (𝑌𝑅𝑍 → 𝑋𝑅𝑍))
13	10, 12	jaod 860	. . 3 ⊢ (((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑍 ∈ 𝐴)) ∧ 𝑋𝑅𝑌) → ((𝑍 = 𝑌 ∨ 𝑌𝑅𝑍) → 𝑋𝑅𝑍))
14	7, 13	sylbird 260	. 2 ⊢ (((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑍 ∈ 𝐴)) ∧ 𝑋𝑅𝑌) → (¬ 𝑍𝑅𝑌 → 𝑋𝑅𝑍))
15	14	expimpd 453	1 ⊢ ((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑍 ∈ 𝐴)) → ((𝑋𝑅𝑌 ∧ ¬ 𝑍𝑅𝑌) → 𝑋𝑅𝑍))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   class class class wbr 5100   Or wor 5539

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-po 5540  df-so 5541

This theorem is referenced by:  nosupbnd2  27696  noinfbnd1  27709  ltlestr  27740