| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > posasymb | Structured version Visualization version GIF version | ||
| Description: A poset ordering is asymmetric. (Contributed by NM, 21-Oct-2011.) |
| Ref | Expression |
|---|---|
| posi.b | ⊢ 𝐵 = (Base‘𝐾) |
| posi.l | ⊢ ≤ = (le‘𝐾) |
| Ref | Expression |
|---|---|
| posasymb | ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) ↔ 𝑋 = 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1136 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Poset) | |
| 2 | simp2 1137 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 3 | simp3 1138 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 4 | posi.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 5 | posi.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
| 6 | 4, 5 | posi 18238 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 ≤ 𝑋 ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) → 𝑋 = 𝑌) ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑌) → 𝑋 ≤ 𝑌))) |
| 7 | 1, 2, 3, 3, 6 | syl13anc 1374 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑋 ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) → 𝑋 = 𝑌) ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑌) → 𝑋 ≤ 𝑌))) |
| 8 | 7 | simp2d 1143 | . 2 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) → 𝑋 = 𝑌)) |
| 9 | 4, 5 | posref 18239 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → 𝑋 ≤ 𝑋) |
| 10 | breq2 5100 | . . . . 5 ⊢ (𝑋 = 𝑌 → (𝑋 ≤ 𝑋 ↔ 𝑋 ≤ 𝑌)) | |
| 11 | 9, 10 | syl5ibcom 245 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → (𝑋 = 𝑌 → 𝑋 ≤ 𝑌)) |
| 12 | breq1 5099 | . . . . 5 ⊢ (𝑋 = 𝑌 → (𝑋 ≤ 𝑋 ↔ 𝑌 ≤ 𝑋)) | |
| 13 | 9, 12 | syl5ibcom 245 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → (𝑋 = 𝑌 → 𝑌 ≤ 𝑋)) |
| 14 | 11, 13 | jcad 512 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → (𝑋 = 𝑌 → (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋))) |
| 15 | 14 | 3adant3 1132 | . 2 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 = 𝑌 → (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋))) |
| 16 | 8, 15 | impbid 212 | 1 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) ↔ 𝑋 = 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 class class class wbr 5096 ‘cfv 6490 Basecbs 17134 lecple 17182 Posetcpo 18228 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2706 ax-nul 5249 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-ne 2931 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-sbc 3739 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4284 df-if 4478 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-iota 6446 df-fv 6498 df-proset 18215 df-poset 18234 |
| This theorem is referenced by: odupos 18247 pltnle 18257 pltval3 18258 lublecllem 18279 poslubmo 18330 posglbmo 18331 latasymb 18363 latleeqj1 18372 latleeqm1 18388 posrasymb 32998 mgcf1olem1 33032 mgcf1olem2 33033 archirngz 33220 archiabllem1a 33222 ople0 39386 op1le 39391 atlle0 39504 |
| Copyright terms: Public domain | W3C validator |