| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > tlt3 | Structured version Visualization version GIF version | ||
| Description: In a Toset, two elements must compare strictly, or be equal. (Contributed by Thierry Arnoux, 13-Apr-2018.) |
| Ref | Expression |
|---|---|
| tlt3.b | ⊢ 𝐵 = (Base‘𝐾) |
| tlt3.l | ⊢ < = (lt‘𝐾) |
| Ref | Expression |
|---|---|
| tlt3 | ⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 = 𝑌 ∨ 𝑋 < 𝑌 ∨ 𝑌 < 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tlt3.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | eqid 2737 | . . . 4 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 3 | tlt3.l | . . . 4 ⊢ < = (lt‘𝐾) | |
| 4 | 1, 2, 3 | tlt2 33047 | . . 3 ⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋(le‘𝐾)𝑌 ∨ 𝑌 < 𝑋)) |
| 5 | tospos 18378 | . . . . 5 ⊢ (𝐾 ∈ Toset → 𝐾 ∈ Poset) | |
| 6 | 1, 2, 3 | pleval2 18295 | . . . . . 6 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋(le‘𝐾)𝑌 ↔ (𝑋 < 𝑌 ∨ 𝑋 = 𝑌))) |
| 7 | orcom 871 | . . . . . 6 ⊢ ((𝑋 < 𝑌 ∨ 𝑋 = 𝑌) ↔ (𝑋 = 𝑌 ∨ 𝑋 < 𝑌)) | |
| 8 | 6, 7 | bitrdi 287 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋(le‘𝐾)𝑌 ↔ (𝑋 = 𝑌 ∨ 𝑋 < 𝑌))) |
| 9 | 5, 8 | syl3an1 1164 | . . . 4 ⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋(le‘𝐾)𝑌 ↔ (𝑋 = 𝑌 ∨ 𝑋 < 𝑌))) |
| 10 | 9 | orbi1d 917 | . . 3 ⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋(le‘𝐾)𝑌 ∨ 𝑌 < 𝑋) ↔ ((𝑋 = 𝑌 ∨ 𝑋 < 𝑌) ∨ 𝑌 < 𝑋))) |
| 11 | 4, 10 | mpbid 232 | . 2 ⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 = 𝑌 ∨ 𝑋 < 𝑌) ∨ 𝑌 < 𝑋)) |
| 12 | df-3or 1088 | . 2 ⊢ ((𝑋 = 𝑌 ∨ 𝑋 < 𝑌 ∨ 𝑌 < 𝑋) ↔ ((𝑋 = 𝑌 ∨ 𝑋 < 𝑌) ∨ 𝑌 < 𝑋)) | |
| 13 | 11, 12 | sylibr 234 | 1 ⊢ ((𝐾 ∈ Toset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 = 𝑌 ∨ 𝑋 < 𝑌 ∨ 𝑌 < 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∨ wo 848 ∨ w3o 1086 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5086 ‘cfv 6493 Basecbs 17173 lecple 17221 Posetcpo 18267 ltcplt 18268 Tosetctos 18374 |
| 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-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pr 5371 |
| 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-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-sbc 3730 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-iota 6449 df-fun 6495 df-fv 6501 df-proset 18254 df-poset 18273 df-plt 18288 df-toset 18375 |
| This theorem is referenced by: archirngz 33268 archiabllem1b 33271 archiabllem2b 33275 |
| Copyright terms: Public domain | W3C validator |