| 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 1137 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Poset) | |
| 2 | simp2 1138 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 3 | simp3 1139 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 4 | posi.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 5 | posi.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
| 6 | 4, 5 | posi 18252 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 ≤ 𝑋 ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) → 𝑋 = 𝑌) ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑌) → 𝑋 ≤ 𝑌))) |
| 7 | 1, 2, 3, 3, 6 | syl13anc 1375 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑋 ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) → 𝑋 = 𝑌) ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑌) → 𝑋 ≤ 𝑌))) |
| 8 | 7 | simp2d 1144 | . 2 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) → 𝑋 = 𝑌)) |
| 9 | 4, 5 | posref 18253 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → 𝑋 ≤ 𝑋) |
| 10 | breq2 5104 | . . . . 5 ⊢ (𝑋 = 𝑌 → (𝑋 ≤ 𝑋 ↔ 𝑋 ≤ 𝑌)) | |
| 11 | 9, 10 | syl5ibcom 245 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → (𝑋 = 𝑌 → 𝑋 ≤ 𝑌)) |
| 12 | breq1 5103 | . . . . 5 ⊢ (𝑋 = 𝑌 → (𝑋 ≤ 𝑋 ↔ 𝑌 ≤ 𝑋)) | |
| 13 | 9, 12 | syl5ibcom 245 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → (𝑋 = 𝑌 → 𝑌 ≤ 𝑋)) |
| 14 | 11, 13 | jcad 512 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → (𝑋 = 𝑌 → (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋))) |
| 15 | 14 | 3adant3 1133 | . 2 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 = 𝑌 → (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋))) |
| 16 | 8, 15 | impbid 212 | 1 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) ↔ 𝑋 = 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5100 ‘cfv 6500 Basecbs 17148 lecple 17196 Posetcpo 18242 |
| 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-ext 2709 ax-nul 5253 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-dif 3906 df-un 3908 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-iota 6456 df-fv 6508 df-proset 18229 df-poset 18248 |
| This theorem is referenced by: odupos 18261 pltnle 18271 pltval3 18272 lublecllem 18293 poslubmo 18344 posglbmo 18345 latasymb 18377 latleeqj1 18386 latleeqm1 18402 posrasymb 33060 mgcf1olem1 33094 mgcf1olem2 33095 archirngz 33283 archiabllem1a 33285 ople0 39563 op1le 39568 atlle0 39681 |
| Copyright terms: Public domain | W3C validator |