Theorem tridc 7089

Description: A trichotomous order is decidable. (Contributed by Jim Kingdon, 5-Sep-2022.)

Hypotheses

Ref	Expression
tridc.po	⊢ (𝜑 → 𝑅 Po 𝐴)
tridc.tri	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥))
tridc.b	⊢ (𝜑 → 𝐵 ∈ 𝐴)
tridc.c	⊢ (𝜑 → 𝐶 ∈ 𝐴)

Assertion

Ref	Expression
tridc	⊢ (𝜑 → DECID 𝐵𝑅𝐶)

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑦,𝐶   𝑥,𝑅,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐶(𝑥)

Proof of Theorem tridc

Step	Hyp	Ref	Expression
1		simpr 110	. . . 4 ⊢ ((𝜑 ∧ 𝐵𝑅𝐶) → 𝐵𝑅𝐶)
2	1	orcd 740	. . 3 ⊢ ((𝜑 ∧ 𝐵𝑅𝐶) → (𝐵𝑅𝐶 ∨ ¬ 𝐵𝑅𝐶))
3		df-dc 842	. . 3 ⊢ (DECID 𝐵𝑅𝐶 ↔ (𝐵𝑅𝐶 ∨ ¬ 𝐵𝑅𝐶))
4	2, 3	sylibr 134	. 2 ⊢ ((𝜑 ∧ 𝐵𝑅𝐶) → DECID 𝐵𝑅𝐶)
5		tridc.po	. . . . . . 7 ⊢ (𝜑 → 𝑅 Po 𝐴)
6		tridc.c	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ 𝐴)
7		poirr 4404	. . . . . . 7 ⊢ ((𝑅 Po 𝐴 ∧ 𝐶 ∈ 𝐴) → ¬ 𝐶𝑅𝐶)
8	5, 6, 7	syl2anc 411	. . . . . 6 ⊢ (𝜑 → ¬ 𝐶𝑅𝐶)
9	8	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 = 𝐶) → ¬ 𝐶𝑅𝐶)
10		simpr 110	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 = 𝐶) → 𝐵 = 𝐶)
11	10	breq1d 4098	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 = 𝐶) → (𝐵𝑅𝐶 ↔ 𝐶𝑅𝐶))
12	9, 11	mtbird 679	. . . 4 ⊢ ((𝜑 ∧ 𝐵 = 𝐶) → ¬ 𝐵𝑅𝐶)
13	12	olcd 741	. . 3 ⊢ ((𝜑 ∧ 𝐵 = 𝐶) → (𝐵𝑅𝐶 ∨ ¬ 𝐵𝑅𝐶))
14	13, 3	sylibr 134	. 2 ⊢ ((𝜑 ∧ 𝐵 = 𝐶) → DECID 𝐵𝑅𝐶)
15		tridc.b	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ 𝐴)
16		po2nr 4406	. . . . . . 7 ⊢ ((𝑅 Po 𝐴 ∧ (𝐶 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴)) → ¬ (𝐶𝑅𝐵 ∧ 𝐵𝑅𝐶))
17	5, 6, 15, 16	syl12anc 1271	. . . . . 6 ⊢ (𝜑 → ¬ (𝐶𝑅𝐵 ∧ 𝐵𝑅𝐶))
18	17	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝐶𝑅𝐵) → ¬ (𝐶𝑅𝐵 ∧ 𝐵𝑅𝐶))
19		simplr 529	. . . . . 6 ⊢ (((𝜑 ∧ 𝐶𝑅𝐵) ∧ 𝐵𝑅𝐶) → 𝐶𝑅𝐵)
20		simpr 110	. . . . . 6 ⊢ (((𝜑 ∧ 𝐶𝑅𝐵) ∧ 𝐵𝑅𝐶) → 𝐵𝑅𝐶)
21	19, 20	jca 306	. . . . 5 ⊢ (((𝜑 ∧ 𝐶𝑅𝐵) ∧ 𝐵𝑅𝐶) → (𝐶𝑅𝐵 ∧ 𝐵𝑅𝐶))
22	18, 21	mtand 671	. . . 4 ⊢ ((𝜑 ∧ 𝐶𝑅𝐵) → ¬ 𝐵𝑅𝐶)
23	22	olcd 741	. . 3 ⊢ ((𝜑 ∧ 𝐶𝑅𝐵) → (𝐵𝑅𝐶 ∨ ¬ 𝐵𝑅𝐶))
24	23, 3	sylibr 134	. 2 ⊢ ((𝜑 ∧ 𝐶𝑅𝐵) → DECID 𝐵𝑅𝐶)
25		tridc.tri	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥))
26		breq1 4091	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝑥𝑅𝑦 ↔ 𝐵𝑅𝑦))
27		eqeq1 2238	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝑥 = 𝑦 ↔ 𝐵 = 𝑦))
28		breq2 4092	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝑦𝑅𝑥 ↔ 𝑦𝑅𝐵))
29	26, 27, 28	3orbi123d 1347	. . . 4 ⊢ (𝑥 = 𝐵 → ((𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ (𝐵𝑅𝑦 ∨ 𝐵 = 𝑦 ∨ 𝑦𝑅𝐵)))
30		breq2 4092	. . . . 5 ⊢ (𝑦 = 𝐶 → (𝐵𝑅𝑦 ↔ 𝐵𝑅𝐶))
31		eqeq2 2241	. . . . 5 ⊢ (𝑦 = 𝐶 → (𝐵 = 𝑦 ↔ 𝐵 = 𝐶))
32		breq1 4091	. . . . 5 ⊢ (𝑦 = 𝐶 → (𝑦𝑅𝐵 ↔ 𝐶𝑅𝐵))
33	30, 31, 32	3orbi123d 1347	. . . 4 ⊢ (𝑦 = 𝐶 → ((𝐵𝑅𝑦 ∨ 𝐵 = 𝑦 ∨ 𝑦𝑅𝐵) ↔ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶𝑅𝐵)))
34	29, 33	rspc2va 2924	. . 3 ⊢ (((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)) → (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶𝑅𝐵))
35	15, 6, 25, 34	syl21anc 1272	. 2 ⊢ (𝜑 → (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶𝑅𝐵))
36	4, 14, 24, 35	mpjao3dan 1343	1 ⊢ (𝜑 → DECID 𝐵𝑅𝐶)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 715  DECID wdc 841   ∨ w3o 1003   = wceq 1397   ∈ wcel 2202  ∀wral 2510   class class class wbr 4088   Po wpo 4391

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-v 2804  df-un 3204  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-po 4393

This theorem is referenced by:  fimax2gtrilemstep  7090