| 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 1149 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Poset) | |
| 2 | simp2 1150 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 3 | simp3 1151 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 4 | posi.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 5 | posi.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
| 6 | 4, 5 | posi 18349 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 ≤ 𝑋 ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) → 𝑋 = 𝑌) ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑌) → 𝑋 ≤ 𝑌))) |
| 7 | 1, 2, 3, 3, 6 | syl13anc 1391 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑋 ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) → 𝑋 = 𝑌) ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑌) → 𝑋 ≤ 𝑌))) |
| 8 | 7 | simp2d 1156 | . 2 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) → 𝑋 = 𝑌)) |
| 9 | 4, 5 | posref 18350 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → 𝑋 ≤ 𝑋) |
| 10 | breq2 5104 | . . . . 5 ⊢ (𝑋 = 𝑌 → (𝑋 ≤ 𝑋 ↔ 𝑋 ≤ 𝑌)) | |
| 11 | 9, 10 | syl5ibcom 247 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → (𝑋 = 𝑌 → 𝑋 ≤ 𝑌)) |
| 12 | breq1 5103 | . . . . 5 ⊢ (𝑋 = 𝑌 → (𝑋 ≤ 𝑋 ↔ 𝑌 ≤ 𝑋)) | |
| 13 | 9, 12 | syl5ibcom 247 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → (𝑋 = 𝑌 → 𝑌 ≤ 𝑋)) |
| 14 | 11, 13 | jcad 520 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → (𝑋 = 𝑌 → (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋))) |
| 15 | 14 | 3adant3 1145 | . 2 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 = 𝑌 → (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋))) |
| 16 | 8, 15 | impbid 214 | 1 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) ↔ 𝑋 = 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1098 = wceq 1560 ∈ wcel 2142 class class class wbr 5100 ‘cfv 6521 Basecbs 17245 lecple 17293 Posetcpo 18339 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 ax-nul 5256 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-sbc 3745 df-dif 3907 df-un 3909 df-ss 3921 df-nul 4286 df-if 4481 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-iota 6477 df-fv 6529 df-proset 18326 df-poset 18345 |
| This theorem is referenced by: odupos 18358 pltnle 18368 pltval3 18369 lublecllem 18390 poslubmo 18441 posglbmo 18442 latasymb 18474 latleeqj1 18483 latleeqm1 18499 posrasymb 33145 mgcf1olem1 33179 mgcf1olem2 33180 archirngz 33369 archiabllem1a 33371 ople0 39811 op1le 39816 atlle0 39929 |
| Copyright terms: Public domain | W3C validator |