| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > latnle | Structured version Visualization version GIF version | ||
| Description: Equivalent expressions for "not less than" in a lattice. (chnle 31450 analog.) (Contributed by NM, 16-Nov-2011.) |
| Ref | Expression |
|---|---|
| latnle.b | ⊢ 𝐵 = (Base‘𝐾) |
| latnle.l | ⊢ ≤ = (le‘𝐾) |
| latnle.s | ⊢ < = (lt‘𝐾) |
| latnle.j | ⊢ ∨ = (join‘𝐾) |
| Ref | Expression |
|---|---|
| latnle | ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (¬ 𝑌 ≤ 𝑋 ↔ 𝑋 < (𝑋 ∨ 𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | latnle.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | latnle.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 3 | latnle.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
| 4 | 1, 2, 3 | latlej1 18414 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ≤ (𝑋 ∨ 𝑌)) |
| 5 | 4 | biantrurd 532 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≠ (𝑋 ∨ 𝑌) ↔ (𝑋 ≤ (𝑋 ∨ 𝑌) ∧ 𝑋 ≠ (𝑋 ∨ 𝑌)))) |
| 6 | 1, 2, 3 | latleeqj1 18417 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑌 ≤ 𝑋 ↔ (𝑌 ∨ 𝑋) = 𝑋)) |
| 7 | 6 | 3com23 1126 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 ≤ 𝑋 ↔ (𝑌 ∨ 𝑋) = 𝑋)) |
| 8 | eqcom 2737 | . . . . 5 ⊢ ((𝑌 ∨ 𝑋) = 𝑋 ↔ 𝑋 = (𝑌 ∨ 𝑋)) | |
| 9 | 7, 8 | bitrdi 287 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 ≤ 𝑋 ↔ 𝑋 = (𝑌 ∨ 𝑋))) |
| 10 | 1, 3 | latjcom 18413 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∨ 𝑌) = (𝑌 ∨ 𝑋)) |
| 11 | 10 | eqeq2d 2741 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 = (𝑋 ∨ 𝑌) ↔ 𝑋 = (𝑌 ∨ 𝑋))) |
| 12 | 9, 11 | bitr4d 282 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 ≤ 𝑋 ↔ 𝑋 = (𝑋 ∨ 𝑌))) |
| 13 | 12 | necon3bbid 2963 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (¬ 𝑌 ≤ 𝑋 ↔ 𝑋 ≠ (𝑋 ∨ 𝑌))) |
| 14 | 1, 3 | latjcl 18405 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∨ 𝑌) ∈ 𝐵) |
| 15 | latnle.s | . . . 4 ⊢ < = (lt‘𝐾) | |
| 16 | 2, 15 | pltval 18298 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ (𝑋 ∨ 𝑌) ∈ 𝐵) → (𝑋 < (𝑋 ∨ 𝑌) ↔ (𝑋 ≤ (𝑋 ∨ 𝑌) ∧ 𝑋 ≠ (𝑋 ∨ 𝑌)))) |
| 17 | 14, 16 | syld3an3 1411 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 < (𝑋 ∨ 𝑌) ↔ (𝑋 ≤ (𝑋 ∨ 𝑌) ∧ 𝑋 ≠ (𝑋 ∨ 𝑌)))) |
| 18 | 5, 13, 17 | 3bitr4d 311 | 1 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (¬ 𝑌 ≤ 𝑋 ↔ 𝑋 < (𝑋 ∨ 𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2926 class class class wbr 5110 ‘cfv 6514 (class class class)co 7390 Basecbs 17186 lecple 17234 ltcplt 18276 joincjn 18279 Latclat 18397 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-proset 18262 df-poset 18281 df-plt 18296 df-lub 18312 df-glb 18313 df-join 18314 df-meet 18315 df-lat 18398 |
| This theorem is referenced by: cvlcvr1 39339 hlrelat 39403 hlrelat2 39404 cvr2N 39412 cvrexchlem 39420 |
| Copyright terms: Public domain | W3C validator |