| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > latleeqm1 | Structured version Visualization version GIF version | ||
| Description: "Less than or equal to" in terms of meet. (Contributed by NM, 7-Nov-2011.) |
| Ref | Expression |
|---|---|
| latmle.b | ⊢ 𝐵 = (Base‘𝐾) |
| latmle.l | ⊢ ≤ = (le‘𝐾) |
| latmle.m | ⊢ ∧ = (meet‘𝐾) |
| Ref | Expression |
|---|---|
| latleeqm1 | ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑋 ∧ 𝑌) = 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | latmle.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | latmle.l | . . . . . . 7 ⊢ ≤ = (le‘𝐾) | |
| 3 | 1, 2 | latref 18396 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → 𝑋 ≤ 𝑋) |
| 4 | 3 | 3adant3 1133 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ≤ 𝑋) |
| 5 | 4 | biantrurd 532 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑋 ≤ 𝑋 ∧ 𝑋 ≤ 𝑌))) |
| 6 | simp1 1137 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Lat) | |
| 7 | simp2 1138 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 8 | simp3 1139 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 9 | latmle.m | . . . . . 6 ⊢ ∧ = (meet‘𝐾) | |
| 10 | 1, 2, 9 | latlem12 18421 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑋 ≤ 𝑋 ∧ 𝑋 ≤ 𝑌) ↔ 𝑋 ≤ (𝑋 ∧ 𝑌))) |
| 11 | 6, 7, 7, 8, 10 | syl13anc 1375 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑋 ∧ 𝑋 ≤ 𝑌) ↔ 𝑋 ≤ (𝑋 ∧ 𝑌))) |
| 12 | 5, 11 | bitrd 279 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ 𝑋 ≤ (𝑋 ∧ 𝑌))) |
| 13 | 1, 2, 9 | latmle1 18419 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∧ 𝑌) ≤ 𝑋) |
| 14 | 13 | biantrurd 532 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ (𝑋 ∧ 𝑌) ↔ ((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ 𝑋 ≤ (𝑋 ∧ 𝑌)))) |
| 15 | 12, 14 | bitrd 279 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ ((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ 𝑋 ≤ (𝑋 ∧ 𝑌)))) |
| 16 | latpos 18393 | . . . 4 ⊢ (𝐾 ∈ Lat → 𝐾 ∈ Poset) | |
| 17 | 16 | 3ad2ant1 1134 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Poset) |
| 18 | 1, 9 | latmcl 18395 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∧ 𝑌) ∈ 𝐵) |
| 19 | 1, 2 | posasymb 18274 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∧ 𝑌) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ 𝑋 ≤ (𝑋 ∧ 𝑌)) ↔ (𝑋 ∧ 𝑌) = 𝑋)) |
| 20 | 17, 18, 7, 19 | syl3anc 1374 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ 𝑋 ≤ (𝑋 ∧ 𝑌)) ↔ (𝑋 ∧ 𝑌) = 𝑋)) |
| 21 | 15, 20 | bitrd 279 | 1 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑋 ∧ 𝑌) = 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5074 ‘cfv 6487 (class class class)co 7356 Basecbs 17168 lecple 17216 Posetcpo 18262 meetcmee 18267 Latclat 18386 |
| 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 2184 ax-ext 2707 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7678 |
| 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-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2931 df-ral 3050 df-rex 3060 df-rmo 3340 df-reu 3341 df-rab 3388 df-v 3429 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-id 5515 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-riota 7313 df-ov 7359 df-oprab 7360 df-proset 18249 df-poset 18268 df-lub 18299 df-glb 18300 df-join 18301 df-meet 18302 df-lat 18387 |
| This theorem is referenced by: latleeqm2 18423 latnlemlt 18427 latabs2 18431 atnle 39751 2llnmat 39958 llnmlplnN 39973 dalem25 40132 2lnat 40218 lhpm0atN 40463 lhpmatb 40465 cdleme1 40661 cdleme5 40674 cdleme20d 40746 cdleme22e 40778 cdleme22eALTN 40779 cdleme23b 40784 cdleme32e 40879 doca2N 41560 djajN 41571 dihglblem5aN 41726 dihmeetbclemN 41738 |
| Copyright terms: Public domain | W3C validator |