Theorem solin 5614

Description: A strict order relation is linear (satisfies trichotomy). (Contributed by NM, 21-Jan-1996.)

Assertion

Ref	Expression
solin	⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶𝑅𝐵))

Proof of Theorem solin

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq1 5152	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝑥𝑅𝑦 ↔ 𝐵𝑅𝑦))
2		eqeq1 2734	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝑥 = 𝑦 ↔ 𝐵 = 𝑦))
3		breq2 5153	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝑦𝑅𝑥 ↔ 𝑦𝑅𝐵))
4	1, 2, 3	3orbi123d 1433	. . . 4 ⊢ (𝑥 = 𝐵 → ((𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ (𝐵𝑅𝑦 ∨ 𝐵 = 𝑦 ∨ 𝑦𝑅𝐵)))
5	4	imbi2d 339	. . 3 ⊢ (𝑥 = 𝐵 → ((𝑅 Or 𝐴 → (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)) ↔ (𝑅 Or 𝐴 → (𝐵𝑅𝑦 ∨ 𝐵 = 𝑦 ∨ 𝑦𝑅𝐵))))
6		breq2 5153	. . . . 5 ⊢ (𝑦 = 𝐶 → (𝐵𝑅𝑦 ↔ 𝐵𝑅𝐶))
7		eqeq2 2742	. . . . 5 ⊢ (𝑦 = 𝐶 → (𝐵 = 𝑦 ↔ 𝐵 = 𝐶))
8		breq1 5152	. . . . 5 ⊢ (𝑦 = 𝐶 → (𝑦𝑅𝐵 ↔ 𝐶𝑅𝐵))
9	6, 7, 8	3orbi123d 1433	. . . 4 ⊢ (𝑦 = 𝐶 → ((𝐵𝑅𝑦 ∨ 𝐵 = 𝑦 ∨ 𝑦𝑅𝐵) ↔ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶𝑅𝐵)))
10	9	imbi2d 339	. . 3 ⊢ (𝑦 = 𝐶 → ((𝑅 Or 𝐴 → (𝐵𝑅𝑦 ∨ 𝐵 = 𝑦 ∨ 𝑦𝑅𝐵)) ↔ (𝑅 Or 𝐴 → (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶𝑅𝐵))))
11		df-so 5590	. . . . 5 ⊢ (𝑅 Or 𝐴 ↔ (𝑅 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
12		breq1 5152	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝑥𝑅𝑦 ↔ 𝑧𝑅𝑦))
13		equequ1 2026	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝑦 ↔ 𝑧 = 𝑦))
14		breq2 5153	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝑦𝑅𝑥 ↔ 𝑦𝑅𝑧))
15	12, 13, 14	3orbi123d 1433	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → ((𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ (𝑧𝑅𝑦 ∨ 𝑧 = 𝑦 ∨ 𝑦𝑅𝑧)))
16	15	ralbidv 3175	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ ∀𝑦 ∈ 𝐴 (𝑧𝑅𝑦 ∨ 𝑧 = 𝑦 ∨ 𝑦𝑅𝑧)))
17	16	rspw 3231	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) → (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
18		breq2 5153	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → (𝑥𝑅𝑦 ↔ 𝑥𝑅𝑧))
19		equequ2 2027	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → (𝑥 = 𝑦 ↔ 𝑥 = 𝑧))
20		breq1 5152	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → (𝑦𝑅𝑥 ↔ 𝑧𝑅𝑥))
21	18, 19, 20	3orbi123d 1433	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → ((𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ (𝑥𝑅𝑧 ∨ 𝑥 = 𝑧 ∨ 𝑧𝑅𝑥)))
22	21	rspw 3231	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) → (𝑦 ∈ 𝐴 → (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
23	17, 22	syl6 35	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) → (𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐴 → (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥))))
24	23	impd 409	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
25	11, 24	simplbiim 503	. . . 4 ⊢ (𝑅 Or 𝐴 → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
26	25	com12 32	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑅 Or 𝐴 → (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
27	5, 10, 26	vtocl2ga 3568	. 2 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → (𝑅 Or 𝐴 → (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶𝑅𝐵)))
28	27	impcom 406	1 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶𝑅𝐵))

Syntax hints:   → wi 4   ∧ wa 394   ∨ w3o 1084   = wceq 1539   ∈ wcel 2104  ∀wral 3059   class class class wbr 5149   Po wpo 5587   Or wor 5588

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 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-ext 2701

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2722  df-clel 2808  df-ral 3060  df-rab 3431  df-v 3474  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-br 5150  df-so 5590

This theorem is referenced by:  sotric  5617  sotrieq  5618  somo  5626  wecmpep  5669  sorpssi  7723  soxp  8119  wfrlem10OLD  8322  infsupprpr  9503  wemaplem2  9546  fpwwe2lem11  10640  fpwwe2lem12  10641  lttri4  11304  xmullem  13249  xmulasslem  13270  noresle  27434  nosupbnd1lem6  27450  noinfbnd1lem6  27465  sltlin  27486  orngsqr  32690  fin2so  36780  fnwe2lem3  42098  prproropf1olem4  46474