| 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 31587 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 18364 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ 𝑌 ∈ 𝐵) → 𝑌 ≤ 𝑌) |
| 4 | 3 | 3adant2 1131 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ≤ 𝑌) |
| 5 | 4 | biantrud 531 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑌))) |
| 6 | simp1 1136 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Lat) | |
| 7 | simp2 1137 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 8 | simp3 1138 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 9 | latlej.j | . . . . . 6 ⊢ ∨ = (join‘𝐾) | |
| 10 | 1, 2, 9 | latjle12 18373 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑌) ↔ (𝑋 ∨ 𝑌) ≤ 𝑌)) |
| 11 | 6, 7, 8, 8, 10 | syl13anc 1374 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑌) ↔ (𝑋 ∨ 𝑌) ≤ 𝑌)) |
| 12 | 5, 11 | bitrd 279 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑋 ∨ 𝑌) ≤ 𝑌)) |
| 13 | 1, 2, 9 | latlej2 18372 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ≤ (𝑋 ∨ 𝑌)) |
| 14 | 13 | biantrud 531 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ∨ 𝑌) ≤ 𝑌 ↔ ((𝑋 ∨ 𝑌) ≤ 𝑌 ∧ 𝑌 ≤ (𝑋 ∨ 𝑌)))) |
| 15 | 12, 14 | bitrd 279 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ ((𝑋 ∨ 𝑌) ≤ 𝑌 ∧ 𝑌 ≤ (𝑋 ∨ 𝑌)))) |
| 16 | latpos 18361 | . . . 4 ⊢ (𝐾 ∈ Lat → 𝐾 ∈ Poset) | |
| 17 | 16 | 3ad2ant1 1133 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Poset) |
| 18 | 1, 9 | latjcl 18362 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∨ 𝑌) ∈ 𝐵) |
| 19 | 1, 2 | posasymb 18242 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∨ 𝑌) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((𝑋 ∨ 𝑌) ≤ 𝑌 ∧ 𝑌 ≤ (𝑋 ∨ 𝑌)) ↔ (𝑋 ∨ 𝑌) = 𝑌)) |
| 20 | 17, 18, 8, 19 | syl3anc 1373 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((𝑋 ∨ 𝑌) ≤ 𝑌 ∧ 𝑌 ≤ (𝑋 ∨ 𝑌)) ↔ (𝑋 ∨ 𝑌) = 𝑌)) |
| 21 | 15, 20 | bitrd 279 | 1 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑋 ∨ 𝑌) = 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 class class class wbr 5098 ‘cfv 6492 (class class class)co 7358 Basecbs 17136 lecple 17184 Posetcpo 18230 joincjn 18234 Latclat 18354 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-proset 18217 df-poset 18236 df-lub 18267 df-glb 18268 df-join 18269 df-meet 18270 df-lat 18355 |
| This theorem is referenced by: latleeqj2 18375 latnle 18396 cvlsupr2 39599 hlrelat5N 39657 3dim3 39725 dalem-cly 39927 dalem44 39972 cdleme30a 40634 |
| Copyright terms: Public domain | W3C validator |