| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lubel | Structured version Visualization version GIF version | ||
| Description: An element of a set is less than or equal to the least upper bound of the set. (Contributed by NM, 21-Oct-2011.) |
| Ref | Expression |
|---|---|
| lublem.b | ⊢ 𝐵 = (Base‘𝐾) |
| lublem.l | ⊢ ≤ = (le‘𝐾) |
| lublem.u | ⊢ 𝑈 = (lub‘𝐾) |
| Ref | Expression |
|---|---|
| lubel | ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → 𝑋 ≤ (𝑈‘𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | clatl 18474 | . . . 4 ⊢ (𝐾 ∈ CLat → 𝐾 ∈ Lat) | |
| 2 | ssel 3915 | . . . . 5 ⊢ (𝑆 ⊆ 𝐵 → (𝑋 ∈ 𝑆 → 𝑋 ∈ 𝐵)) | |
| 3 | 2 | impcom 407 | . . . 4 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → 𝑋 ∈ 𝐵) |
| 4 | lublem.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 5 | lublem.u | . . . . 5 ⊢ 𝑈 = (lub‘𝐾) | |
| 6 | 4, 5 | lubsn 18448 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → (𝑈‘{𝑋}) = 𝑋) |
| 7 | 1, 3, 6 | syl2an 597 | . . 3 ⊢ ((𝐾 ∈ CLat ∧ (𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵)) → (𝑈‘{𝑋}) = 𝑋) |
| 8 | 7 | 3impb 1115 | . 2 ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → (𝑈‘{𝑋}) = 𝑋) |
| 9 | snssi 4729 | . . . 4 ⊢ (𝑋 ∈ 𝑆 → {𝑋} ⊆ 𝑆) | |
| 10 | lublem.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
| 11 | 4, 10, 5 | lubss 18479 | . . . 4 ⊢ ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵 ∧ {𝑋} ⊆ 𝑆) → (𝑈‘{𝑋}) ≤ (𝑈‘𝑆)) |
| 12 | 9, 11 | syl3an3 1166 | . . 3 ⊢ ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵 ∧ 𝑋 ∈ 𝑆) → (𝑈‘{𝑋}) ≤ (𝑈‘𝑆)) |
| 13 | 12 | 3com23 1127 | . 2 ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → (𝑈‘{𝑋}) ≤ (𝑈‘𝑆)) |
| 14 | 8, 13 | eqbrtrrd 5109 | 1 ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → 𝑋 ≤ (𝑈‘𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ⊆ wss 3889 {csn 4567 class class class wbr 5085 ‘cfv 6498 Basecbs 17179 lecple 17227 lubclub 18275 Latclat 18397 CLatccla 18464 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 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 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-proset 18260 df-poset 18279 df-lub 18310 df-glb 18311 df-join 18312 df-meet 18313 df-lat 18398 df-clat 18465 |
| This theorem is referenced by: lubun 18481 atlatmstc 39765 2polssN 40361 |
| Copyright terms: Public domain | W3C validator |