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 18140 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 ≤ 𝑋 ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) → 𝑋 = 𝑌) ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑌) → 𝑋 ≤ 𝑌))) |
7 | 1, 2, 3, 3, 6 | syl13anc 1372 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑋 ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) → 𝑋 = 𝑌) ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑌) → 𝑋 ≤ 𝑌))) |
8 | 7 | simp2d 1143 | . 2 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) → 𝑋 = 𝑌)) |
9 | 4, 5 | posref 18141 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → 𝑋 ≤ 𝑋) |
10 | breq2 5107 | . . . . 5 ⊢ (𝑋 = 𝑌 → (𝑋 ≤ 𝑋 ↔ 𝑋 ≤ 𝑌)) | |
11 | 9, 10 | syl5ibcom 245 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → (𝑋 = 𝑌 → 𝑋 ≤ 𝑌)) |
12 | breq1 5106 | . . . . 5 ⊢ (𝑋 = 𝑌 → (𝑋 ≤ 𝑋 ↔ 𝑌 ≤ 𝑋)) | |
13 | 9, 12 | syl5ibcom 245 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → (𝑋 = 𝑌 → 𝑌 ≤ 𝑋)) |
14 | 11, 13 | jcad 514 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → (𝑋 = 𝑌 → (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋))) |
15 | 14 | 3adant3 1132 | . 2 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 = 𝑌 → (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋))) |
16 | 8, 15 | impbid 211 | 1 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) ↔ 𝑋 = 𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 class class class wbr 5103 ‘cfv 6491 Basecbs 17017 lecple 17074 Posetcpo 18130 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2708 ax-nul 5261 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2715 df-cleq 2729 df-clel 2815 df-ne 2942 df-ral 3063 df-rab 3406 df-v 3445 df-sbc 3738 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4281 df-if 4485 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4864 df-br 5104 df-iota 6443 df-fv 6499 df-proset 18118 df-poset 18136 |
This theorem is referenced by: odupos 18151 pltnle 18161 pltval3 18162 lublecllem 18183 poslubmo 18234 posglbmo 18235 latasymb 18265 latleeqj1 18274 latleeqm1 18290 posrasymb 31597 mgcf1olem1 31633 mgcf1olem2 31634 archirngz 31797 archiabllem1a 31799 ople0 37509 op1le 37514 atlle0 37627 |
Copyright terms: Public domain | W3C validator |