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 5470 | . . . . . . 7 ⊢ ((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵𝑅𝐵) | |
2 | 1 | adantrr 716 | . . . . . 6 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → ¬ 𝐵𝑅𝐵) |
3 | pm1.2 901 | . . . . . 6 ⊢ ((𝐵𝑅𝐵 ∨ 𝐵𝑅𝐵) → 𝐵𝑅𝐵) | |
4 | 2, 3 | nsyl 142 | . . . . 5 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → ¬ (𝐵𝑅𝐵 ∨ 𝐵𝑅𝐵)) |
5 | breq2 5041 | . . . . . . 7 ⊢ (𝐵 = 𝐶 → (𝐵𝑅𝐵 ↔ 𝐵𝑅𝐶)) | |
6 | breq1 5040 | . . . . . . 7 ⊢ (𝐵 = 𝐶 → (𝐵𝑅𝐵 ↔ 𝐶𝑅𝐵)) | |
7 | 5, 6 | orbi12d 916 | . . . . . 6 ⊢ (𝐵 = 𝐶 → ((𝐵𝑅𝐵 ∨ 𝐵𝑅𝐵) ↔ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵))) |
8 | 7 | notbid 321 | . . . . 5 ⊢ (𝐵 = 𝐶 → (¬ (𝐵𝑅𝐵 ∨ 𝐵𝑅𝐵) ↔ ¬ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵))) |
9 | 4, 8 | syl5ibcom 248 | . . . 4 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 = 𝐶 → ¬ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵))) |
10 | 9 | con2d 136 | . . 3 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → ((𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵) → ¬ 𝐵 = 𝐶)) |
11 | solin 5472 | . . . . . 6 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶𝑅𝐵)) | |
12 | 3orass 1088 | . . . . . 6 ⊢ ((𝐵𝑅𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶𝑅𝐵) ↔ (𝐵𝑅𝐶 ∨ (𝐵 = 𝐶 ∨ 𝐶𝑅𝐵))) | |
13 | 11, 12 | sylib 221 | . . . . 5 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵𝑅𝐶 ∨ (𝐵 = 𝐶 ∨ 𝐶𝑅𝐵))) |
14 | or12 918 | . . . . 5 ⊢ ((𝐵𝑅𝐶 ∨ (𝐵 = 𝐶 ∨ 𝐶𝑅𝐵)) ↔ (𝐵 = 𝐶 ∨ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵))) | |
15 | 13, 14 | sylib 221 | . . . 4 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 = 𝐶 ∨ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵))) |
16 | 15 | ord 861 | . . 3 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (¬ 𝐵 = 𝐶 → (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵))) |
17 | 10, 16 | impbid 215 | . 2 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → ((𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵) ↔ ¬ 𝐵 = 𝐶)) |
18 | 17 | con2bid 358 | 1 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 = 𝐶 ↔ ¬ (𝐵𝑅𝐶 ∨ 𝐶𝑅𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 ∨ wo 844 ∨ w3o 1084 = wceq 1539 ∈ wcel 2112 class class class wbr 5037 Or wor 5447 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1912 ax-6 1971 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2159 ax-12 2176 ax-ext 2730 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1086 df-3an 1087 df-tru 1542 df-ex 1783 df-nf 1787 df-sb 2071 df-clab 2737 df-cleq 2751 df-clel 2831 df-nfc 2902 df-ral 3076 df-v 3412 df-un 3866 df-sn 4527 df-pr 4529 df-op 4533 df-br 5038 df-po 5448 df-so 5449 |
This theorem is referenced by: sotrieq2 5477 sossfld 6021 soisores 7081 soisoi 7082 weniso 7108 wemapsolem 9061 distrlem4pr 10500 addcanpr 10520 sqgt0sr 10580 lttri2 10775 xrlttri2 12590 xrltne 12611 sotrine 33264 soseq 33372 |
Copyright terms: Public domain | W3C validator |