![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > sotrieq | Structured version Visualization version GIF version |
Description: Trichotomy law for strict order relation. (Contributed by NM, 9-Apr-1996.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) |
Ref | Expression |
---|---|
sotrieq | ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 = 𝐶 ↔ ¬ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sonr 5615 | . . . . . . 7 ⊢ ((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵𝑅𝐵) | |
2 | 1 | adantrr 715 | . . . . . 6 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → ¬ 𝐵𝑅𝐵) |
3 | pm1.2 901 | . . . . . 6 ⊢ ((𝐵𝑅𝐵 ∨ 𝐵𝑅𝐵) → 𝐵𝑅𝐵) | |
4 | 2, 3 | nsyl 140 | . . . . 5 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → ¬ (𝐵𝑅𝐵 ∨ 𝐵𝑅𝐵)) |
5 | breq2 5154 | . . . . . . 7 ⊢ (𝐵 = 𝐶 → (𝐵𝑅𝐵 ↔ 𝐵𝑅𝐶)) | |
6 | breq1 5153 | . . . . . . 7 ⊢ (𝐵 = 𝐶 → (𝐵𝑅𝐵 ↔ 𝐶𝑅𝐵)) | |
7 | 5, 6 | orbi12d 916 | . . . . . 6 ⊢ (𝐵 = 𝐶 → ((𝐵𝑅𝐵 ∨ 𝐵𝑅𝐵) ↔ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵))) |
8 | 7 | notbid 317 | . . . . 5 ⊢ (𝐵 = 𝐶 → (¬ (𝐵𝑅𝐵 ∨ 𝐵𝑅𝐵) ↔ ¬ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵))) |
9 | 4, 8 | syl5ibcom 244 | . . . 4 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 = 𝐶 → ¬ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵))) |
10 | 9 | con2d 134 | . . 3 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → ((𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵) → ¬ 𝐵 = 𝐶)) |
11 | solin 5617 | . . . . . 6 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶𝑅𝐵)) | |
12 | 3orass 1087 | . . . . . 6 ⊢ ((𝐵𝑅𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶𝑅𝐵) ↔ (𝐵𝑅𝐶 ∨ (𝐵 = 𝐶 ∨ 𝐶𝑅𝐵))) | |
13 | 11, 12 | sylib 217 | . . . . 5 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵𝑅𝐶 ∨ (𝐵 = 𝐶 ∨ 𝐶𝑅𝐵))) |
14 | or12 918 | . . . . 5 ⊢ ((𝐵𝑅𝐶 ∨ (𝐵 = 𝐶 ∨ 𝐶𝑅𝐵)) ↔ (𝐵 = 𝐶 ∨ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵))) | |
15 | 13, 14 | sylib 217 | . . . 4 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 = 𝐶 ∨ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵))) |
16 | 15 | ord 862 | . . 3 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (¬ 𝐵 = 𝐶 → (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵))) |
17 | 10, 16 | impbid 211 | . 2 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → ((𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵) ↔ ¬ 𝐵 = 𝐶)) |
18 | 17 | con2bid 353 | 1 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 = 𝐶 ↔ ¬ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 ∨ wo 845 ∨ w3o 1083 = wceq 1533 ∈ wcel 2098 class class class wbr 5150 Or wor 5591 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2698 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-sb 2060 df-clab 2705 df-cleq 2719 df-clel 2805 df-ral 3058 df-rab 3429 df-v 3473 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4325 df-if 4531 df-sn 4631 df-pr 4633 df-op 4637 df-br 5151 df-po 5592 df-so 5593 |
This theorem is referenced by: sotrieq2 5622 sotrine 5630 sossfld 6193 soisores 7339 soisoi 7340 weniso 7366 soseq 8168 wemapsolem 9579 distrlem4pr 11055 addcanpr 11075 sqgt0sr 11135 lttri2 11332 xrlttri2 13159 xrltne 13180 oneptri 42688 |
Copyright terms: Public domain | W3C validator |