| 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 18503 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → 𝑋 ≤ 𝑋) |
| 4 | 3 | 3adant3 1149 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ≤ 𝑋) |
| 5 | 4 | biantrurd 541 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑋 ≤ 𝑋 ∧ 𝑋 ≤ 𝑌))) |
| 6 | simp1 1153 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Lat) | |
| 7 | simp2 1154 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 8 | simp3 1155 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 9 | latmle.m | . . . . . 6 ⊢ ∧ = (meet‘𝐾) | |
| 10 | 1, 2, 9 | latlem12 18528 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑋 ≤ 𝑋 ∧ 𝑋 ≤ 𝑌) ↔ 𝑋 ≤ (𝑋 ∧ 𝑌))) |
| 11 | 6, 7, 7, 8, 10 | syl13anc 1398 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑋 ∧ 𝑋 ≤ 𝑌) ↔ 𝑋 ≤ (𝑋 ∧ 𝑌))) |
| 12 | 5, 11 | bitrd 282 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ 𝑋 ≤ (𝑋 ∧ 𝑌))) |
| 13 | 1, 2, 9 | latmle1 18526 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∧ 𝑌) ≤ 𝑋) |
| 14 | 13 | biantrurd 541 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ (𝑋 ∧ 𝑌) ↔ ((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ 𝑋 ≤ (𝑋 ∧ 𝑌)))) |
| 15 | 12, 14 | bitrd 282 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ ((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ 𝑋 ≤ (𝑋 ∧ 𝑌)))) |
| 16 | latpos 18500 | . . . 4 ⊢ (𝐾 ∈ Lat → 𝐾 ∈ Poset) | |
| 17 | 16 | 3ad2ant1 1150 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Poset) |
| 18 | 1, 9 | latmcl 18502 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∧ 𝑌) ∈ 𝐵) |
| 19 | 1, 2 | posasymb 18381 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∧ 𝑌) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ 𝑋 ≤ (𝑋 ∧ 𝑌)) ↔ (𝑋 ∧ 𝑌) = 𝑋)) |
| 20 | 17, 18, 7, 19 | syl3anc 1397 | . 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 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 class class class wbr 5108 ‘cfv 6536 (class class class)co 7412 Basecbs 17275 lecple 17323 Posetcpo 18369 meetcmee 18374 Latclat 18493 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-proset 18356 df-poset 18375 df-lub 18406 df-glb 18407 df-join 18408 df-meet 18409 df-lat 18494 |
| This theorem is used by: latleeqm2 18530 latnlemlt 18534 latabs2 18538 atnle 40119 2llnmat 40326 llnmlplnN 40341 dalem25 40500 2lnat 40586 lhpm0atN 40831 lhpmatb 40833 cdleme1 41029 cdleme5 41042 cdleme20d 41114 cdleme22e 41146 cdleme22eALTN 41147 cdleme23b 41152 cdleme32e 41247 doca2N 41928 djajN 41939 dihglblem5aN 42094 dihmeetbclemN 42106 |
| Copyright terms: Public domain | W3C validator |