| 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 32173 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 18672 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ≤ (𝑋 ∨ 𝑌)) |
| 5 | 4 | biantrurd 542 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≠ (𝑋 ∨ 𝑌) ↔ (𝑋 ≤ (𝑋 ∨ 𝑌) ∧ 𝑋 ≠ (𝑋 ∨ 𝑌)))) |
| 6 | 1, 2, 3 | latleeqj1 18675 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑌 ≤ 𝑋 ↔ (𝑌 ∨ 𝑋) = 𝑋)) |
| 7 | 6 | 3com23 1144 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 ≤ 𝑋 ↔ (𝑌 ∨ 𝑋) = 𝑋)) |
| 8 | eqcom 2770 | . . . . 5 ⊢ ((𝑌 ∨ 𝑋) = 𝑋 ↔ 𝑋 = (𝑌 ∨ 𝑋)) | |
| 9 | 7, 8 | bitrdi 290 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 ≤ 𝑋 ↔ 𝑋 = (𝑌 ∨ 𝑋))) |
| 10 | 1, 3 | latjcom 18671 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∨ 𝑌) = (𝑌 ∨ 𝑋)) |
| 11 | 10 | eqeq2d 2774 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 = (𝑋 ∨ 𝑌) ↔ 𝑋 = (𝑌 ∨ 𝑋))) |
| 12 | 9, 11 | bitr4d 285 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 ≤ 𝑋 ↔ 𝑋 = (𝑋 ∨ 𝑌))) |
| 13 | 12 | necon3bbid 2996 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (¬ 𝑌 ≤ 𝑋 ↔ 𝑋 ≠ (𝑋 ∨ 𝑌))) |
| 14 | 1, 3 | latjcl 18663 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∨ 𝑌) ∈ 𝐵) |
| 15 | latnle.s | . . . 4 ⊢ < = (lt‘𝐾) | |
| 16 | 2, 15 | pltval 18554 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ (𝑋 ∨ 𝑌) ∈ 𝐵) → (𝑋 < (𝑋 ∨ 𝑌) ↔ (𝑋 ≤ (𝑋 ∨ 𝑌) ∧ 𝑋 ≠ (𝑋 ∨ 𝑌)))) |
| 17 | 14, 16 | syld3an3 1437 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 < (𝑋 ∨ 𝑌) ↔ (𝑋 ≤ (𝑋 ∨ 𝑌) ∧ 𝑋 ≠ (𝑋 ∨ 𝑌)))) |
| 18 | 5, 13, 17 | 3bitr4d 314 | 1 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (¬ 𝑌 ≤ 𝑋 ↔ 𝑋 < (𝑋 ∨ 𝑌))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 Basecbs 17431 lecple 17479 ltcplt 18532 joincjn 18535 Latclat 18655 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-proset 18518 df-poset 18537 df-plt 18552 df-lub 18568 df-glb 18569 df-join 18570 df-meet 18571 df-lat 18656 |
| This theorem is used by: cvlcvr1 40662 hlrelat 40725 hlrelat2 40726 cvr2N 40734 cvrexchlem 40742 |
| Copyright terms: Public domain | W3C validator |