| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > latleeqj1 | Structured version Visualization version GIF version | ||
| Description: "Less than or equal to" in terms of join. (chlejb1 32114 analog.) (Contributed by NM, 21-Oct-2011.) |
| Ref | Expression |
|---|---|
| latlej.b | ⊢ 𝐵 = (Base‘𝐾) |
| latlej.l | ⊢ ≤ = (le‘𝐾) |
| latlej.j | ⊢ ∨ = (join‘𝐾) |
| Ref | Expression |
|---|---|
| latleeqj1 | ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑋 ∨ 𝑌) = 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | latlej.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | latlej.l | . . . . . . 7 ⊢ ≤ = (le‘𝐾) | |
| 3 | 1, 2 | latref 18615 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ 𝑌 ∈ 𝐵) → 𝑌 ≤ 𝑌) |
| 4 | 3 | 3adant2 1149 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ≤ 𝑌) |
| 5 | 4 | biantrud 541 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑌))) |
| 6 | simp1 1154 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Lat) | |
| 7 | simp2 1155 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 8 | simp3 1156 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 9 | latlej.j | . . . . . 6 ⊢ ∨ = (join‘𝐾) | |
| 10 | 1, 2, 9 | latjle12 18624 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑌) ↔ (𝑋 ∨ 𝑌) ≤ 𝑌)) |
| 11 | 6, 7, 8, 8, 10 | syl13anc 1399 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑌) ↔ (𝑋 ∨ 𝑌) ≤ 𝑌)) |
| 12 | 5, 11 | bitrd 282 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑋 ∨ 𝑌) ≤ 𝑌)) |
| 13 | 1, 2, 9 | latlej2 18623 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ≤ (𝑋 ∨ 𝑌)) |
| 14 | 13 | biantrud 541 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ∨ 𝑌) ≤ 𝑌 ↔ ((𝑋 ∨ 𝑌) ≤ 𝑌 ∧ 𝑌 ≤ (𝑋 ∨ 𝑌)))) |
| 15 | 12, 14 | bitrd 282 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ ((𝑋 ∨ 𝑌) ≤ 𝑌 ∧ 𝑌 ≤ (𝑋 ∨ 𝑌)))) |
| 16 | latpos 18612 | . . . 4 ⊢ (𝐾 ∈ Lat → 𝐾 ∈ Poset) | |
| 17 | 16 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Poset) |
| 18 | 1, 9 | latjcl 18613 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∨ 𝑌) ∈ 𝐵) |
| 19 | 1, 2 | posasymb 18493 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∨ 𝑌) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((𝑋 ∨ 𝑌) ≤ 𝑌 ∧ 𝑌 ≤ (𝑋 ∨ 𝑌)) ↔ (𝑋 ∨ 𝑌) = 𝑌)) |
| 20 | 17, 18, 8, 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 1569 ∈ wcel 2144 class class class wbr 5102 ‘cfv 6538 (class class class)co 7420 Basecbs 17387 lecple 17435 Posetcpo 18481 joincjn 18485 Latclat 18605 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-proset 18468 df-poset 18487 df-lub 18518 df-glb 18519 df-join 18520 df-meet 18521 df-lat 18606 |
| This theorem is used by: latleeqj2 18626 latnle 18647 cvlsupr2 40401 hlrelat5N 40459 3dim3 40527 dalem-cly 40729 dalem44 40774 cdleme30a 41436 |
| Copyright terms: Public domain | W3C validator |