![]() |
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 28373 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 17060 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ≤ (𝑋 ∨ 𝑌)) |
5 | 4 | biantrurd 529 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≠ (𝑋 ∨ 𝑌) ↔ (𝑋 ≤ (𝑋 ∨ 𝑌) ∧ 𝑋 ≠ (𝑋 ∨ 𝑌)))) |
6 | 1, 2, 3 | latleeqj1 17063 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑌 ≤ 𝑋 ↔ (𝑌 ∨ 𝑋) = 𝑋)) |
7 | 6 | 3com23 1271 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 ≤ 𝑋 ↔ (𝑌 ∨ 𝑋) = 𝑋)) |
8 | eqcom 2629 | . . . . 5 ⊢ ((𝑌 ∨ 𝑋) = 𝑋 ↔ 𝑋 = (𝑌 ∨ 𝑋)) | |
9 | 7, 8 | syl6bb 276 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 ≤ 𝑋 ↔ 𝑋 = (𝑌 ∨ 𝑋))) |
10 | 1, 3 | latjcom 17059 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∨ 𝑌) = (𝑌 ∨ 𝑋)) |
11 | 10 | eqeq2d 2632 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 = (𝑋 ∨ 𝑌) ↔ 𝑋 = (𝑌 ∨ 𝑋))) |
12 | 9, 11 | bitr4d 271 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 ≤ 𝑋 ↔ 𝑋 = (𝑋 ∨ 𝑌))) |
13 | 12 | necon3bbid 2831 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (¬ 𝑌 ≤ 𝑋 ↔ 𝑋 ≠ (𝑋 ∨ 𝑌))) |
14 | 1, 3 | latjcl 17051 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∨ 𝑌) ∈ 𝐵) |
15 | latnle.s | . . . 4 ⊢ < = (lt‘𝐾) | |
16 | 2, 15 | pltval 16960 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ (𝑋 ∨ 𝑌) ∈ 𝐵) → (𝑋 < (𝑋 ∨ 𝑌) ↔ (𝑋 ≤ (𝑋 ∨ 𝑌) ∧ 𝑋 ≠ (𝑋 ∨ 𝑌)))) |
17 | 14, 16 | syld3an3 1371 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 < (𝑋 ∨ 𝑌) ↔ (𝑋 ≤ (𝑋 ∨ 𝑌) ∧ 𝑋 ≠ (𝑋 ∨ 𝑌)))) |
18 | 5, 13, 17 | 3bitr4d 300 | 1 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (¬ 𝑌 ≤ 𝑋 ↔ 𝑋 < (𝑋 ∨ 𝑌))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 class class class wbr 4653 ‘cfv 5888 (class class class)co 6650 Basecbs 15857 lecple 15948 ltcplt 16941 joincjn 16944 Latclat 17045 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-preset 16928 df-poset 16946 df-plt 16958 df-lub 16974 df-glb 16975 df-join 16976 df-meet 16977 df-lat 17046 |
This theorem is referenced by: cvlcvr1 34626 hlrelat 34688 hlrelat2 34689 cvr2N 34697 cvrexchlem 34705 |
Copyright terms: Public domain | W3C validator |