| 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 18562 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → 𝑋 ≤ 𝑋) |
| 4 | 3 | 3adant3 1150 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ≤ 𝑋) |
| 5 | 4 | biantrurd 542 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑋 ≤ 𝑋 ∧ 𝑋 ≤ 𝑌))) |
| 6 | simp1 1154 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Lat) | |
| 7 | simp2 1155 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 8 | simp3 1156 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 9 | latmle.m | . . . . . 6 ⊢ ∧ = (meet‘𝐾) | |
| 10 | 1, 2, 9 | latlem12 18587 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑋 ≤ 𝑋 ∧ 𝑋 ≤ 𝑌) ↔ 𝑋 ≤ (𝑋 ∧ 𝑌))) |
| 11 | 6, 7, 7, 8, 10 | syl13anc 1399 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑋 ∧ 𝑋 ≤ 𝑌) ↔ 𝑋 ≤ (𝑋 ∧ 𝑌))) |
| 12 | 5, 11 | bitrd 282 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ 𝑋 ≤ (𝑋 ∧ 𝑌))) |
| 13 | 1, 2, 9 | latmle1 18585 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∧ 𝑌) ≤ 𝑋) |
| 14 | 13 | biantrurd 542 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ (𝑋 ∧ 𝑌) ↔ ((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ 𝑋 ≤ (𝑋 ∧ 𝑌)))) |
| 15 | 12, 14 | bitrd 282 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ ((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ 𝑋 ≤ (𝑋 ∧ 𝑌)))) |
| 16 | latpos 18559 | . . . 4 ⊢ (𝐾 ∈ Lat → 𝐾 ∈ Poset) | |
| 17 | 16 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Poset) |
| 18 | 1, 9 | latmcl 18561 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∧ 𝑌) ∈ 𝐵) |
| 19 | 1, 2 | posasymb 18440 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∧ 𝑌) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ 𝑋 ≤ (𝑋 ∧ 𝑌)) ↔ (𝑋 ∧ 𝑌) = 𝑋)) |
| 20 | 17, 18, 7, 19 | syl3anc 1398 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ 𝑋 ≤ (𝑋 ∧ 𝑌)) ↔ (𝑋 ∧ 𝑌) = 𝑋)) |
| 21 | 15, 20 | bitrd 282 | 1 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑋 ∧ 𝑌) = 𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 class class class wbr 5103 ‘cfv 6528 (class class class)co 7409 Basecbs 17334 lecple 17382 Posetcpo 18428 meetcmee 18433 Latclat 18552 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5543 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-iota 6484 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-riota 7366 df-ov 7412 df-oprab 7413 df-proset 18415 df-poset 18434 df-lub 18465 df-glb 18466 df-join 18467 df-meet 18468 df-lat 18553 |
| This theorem is used by: latleeqm2 18589 latnlemlt 18593 latabs2 18597 atnle 40288 2llnmat 40495 llnmlplnN 40510 dalem25 40669 2lnat 40755 lhpm0atN 41000 lhpmatb 41002 cdleme1 41198 cdleme5 41211 cdleme20d 41283 cdleme22e 41315 cdleme22eALTN 41316 cdleme23b 41321 cdleme32e 41416 doca2N 42097 djajN 42108 dihglblem5aN 42263 dihmeetbclemN 42275 |
| Copyright terms: Public domain | W3C validator |