| 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 18449 | . . . 4 ⊢ (𝐾 ∈ CLat → 𝐾 ∈ Lat) | |
| 2 | ssel 3937 | . . . . 5 ⊢ (𝑆 ⊆ 𝐵 → (𝑋 ∈ 𝑆 → 𝑋 ∈ 𝐵)) | |
| 3 | 2 | impcom 407 | . . . 4 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → 𝑋 ∈ 𝐵) |
| 4 | lublem.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 5 | lublem.u | . . . . 5 ⊢ 𝑈 = (lub‘𝐾) | |
| 6 | 4, 5 | lubsn 18423 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → (𝑈‘{𝑋}) = 𝑋) |
| 7 | 1, 3, 6 | syl2an 596 | . . 3 ⊢ ((𝐾 ∈ CLat ∧ (𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵)) → (𝑈‘{𝑋}) = 𝑋) |
| 8 | 7 | 3impb 1114 | . 2 ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → (𝑈‘{𝑋}) = 𝑋) |
| 9 | snssi 4768 | . . . 4 ⊢ (𝑋 ∈ 𝑆 → {𝑋} ⊆ 𝑆) | |
| 10 | lublem.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
| 11 | 4, 10, 5 | lubss 18454 | . . . 4 ⊢ ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵 ∧ {𝑋} ⊆ 𝑆) → (𝑈‘{𝑋}) ≤ (𝑈‘𝑆)) |
| 12 | 9, 11 | syl3an3 1165 | . . 3 ⊢ ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵 ∧ 𝑋 ∈ 𝑆) → (𝑈‘{𝑋}) ≤ (𝑈‘𝑆)) |
| 13 | 12 | 3com23 1126 | . 2 ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → (𝑈‘{𝑋}) ≤ (𝑈‘𝑆)) |
| 14 | 8, 13 | eqbrtrrd 5126 | 1 ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → 𝑋 ≤ (𝑈‘𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ⊆ wss 3911 {csn 4585 class class class wbr 5102 ‘cfv 6499 Basecbs 17155 lecple 17203 lubclub 18250 Latclat 18372 CLatccla 18439 |
| 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 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 |
| 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 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 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 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-proset 18235 df-poset 18254 df-lub 18285 df-glb 18286 df-join 18287 df-meet 18288 df-lat 18373 df-clat 18440 |
| This theorem is referenced by: lubun 18456 atlatmstc 39305 2polssN 39902 |
| Copyright terms: Public domain | W3C validator |