| 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 18570 | . . . 4 ⊢ (𝐾 ∈ CLat → 𝐾 ∈ Lat) | |
| 2 | ssel 3930 | . . . . 5 ⊢ (𝑆 ⊆ 𝐵 → (𝑋 ∈ 𝑆 → 𝑋 ∈ 𝐵)) | |
| 3 | 2 | impcom 412 | . . . 4 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → 𝑋 ∈ 𝐵) |
| 4 | lublem.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 5 | lublem.u | . . . . 5 ⊢ 𝑈 = (lub‘𝐾) | |
| 6 | 4, 5 | lubsn 18544 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → (𝑈‘{𝑋}) = 𝑋) |
| 7 | 1, 3, 6 | syl2an 607 | . . 3 ⊢ ((𝐾 ∈ CLat ∧ (𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵)) → (𝑈‘{𝑋}) = 𝑋) |
| 8 | 7 | 3impb 1131 | . 2 ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → (𝑈‘{𝑋}) = 𝑋) |
| 9 | snssi 4750 | . . . 4 ⊢ (𝑋 ∈ 𝑆 → {𝑋} ⊆ 𝑆) | |
| 10 | lublem.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
| 11 | 4, 10, 5 | lubss 18575 | . . . 4 ⊢ ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵 ∧ {𝑋} ⊆ 𝑆) → (𝑈‘{𝑋}) ≤ (𝑈‘𝑆)) |
| 12 | 9, 11 | syl3an3 1182 | . . 3 ⊢ ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵 ∧ 𝑋 ∈ 𝑆) → (𝑈‘{𝑋}) ≤ (𝑈‘𝑆)) |
| 13 | 12 | 3com23 1143 | . 2 ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → (𝑈‘{𝑋}) ≤ (𝑈‘𝑆)) |
| 14 | 8, 13 | eqbrtrrd 5134 | 1 ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → 𝑋 ≤ (𝑈‘𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 ⊆ wss 3904 {csn 4588 class class class wbr 5108 ‘cfv 6536 Basecbs 17275 lecple 17323 lubclub 18371 Latclat 18493 CLatccla 18560 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-proset 18356 df-poset 18375 df-lub 18406 df-glb 18407 df-join 18408 df-meet 18409 df-lat 18494 df-clat 18561 |
| This theorem is used by: lubun 18577 atlatmstc 40121 2polssN 40717 |
| Copyright terms: Public domain | W3C validator |