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 17726 | . . . 4 ⊢ (𝐾 ∈ CLat → 𝐾 ∈ Lat) | |
2 | ssel 3961 | . . . . 5 ⊢ (𝑆 ⊆ 𝐵 → (𝑋 ∈ 𝑆 → 𝑋 ∈ 𝐵)) | |
3 | 2 | impcom 410 | . . . 4 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → 𝑋 ∈ 𝐵) |
4 | lublem.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
5 | lublem.u | . . . . 5 ⊢ 𝑈 = (lub‘𝐾) | |
6 | 4, 5 | lubsn 17704 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → (𝑈‘{𝑋}) = 𝑋) |
7 | 1, 3, 6 | syl2an 597 | . . 3 ⊢ ((𝐾 ∈ CLat ∧ (𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵)) → (𝑈‘{𝑋}) = 𝑋) |
8 | 7 | 3impb 1111 | . 2 ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → (𝑈‘{𝑋}) = 𝑋) |
9 | snssi 4741 | . . . 4 ⊢ (𝑋 ∈ 𝑆 → {𝑋} ⊆ 𝑆) | |
10 | lublem.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
11 | 4, 10, 5 | lubss 17731 | . . . 4 ⊢ ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵 ∧ {𝑋} ⊆ 𝑆) → (𝑈‘{𝑋}) ≤ (𝑈‘𝑆)) |
12 | 9, 11 | syl3an3 1161 | . . 3 ⊢ ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵 ∧ 𝑋 ∈ 𝑆) → (𝑈‘{𝑋}) ≤ (𝑈‘𝑆)) |
13 | 12 | 3com23 1122 | . 2 ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → (𝑈‘{𝑋}) ≤ (𝑈‘𝑆)) |
14 | 8, 13 | eqbrtrrd 5090 | 1 ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ∈ 𝑆 ∧ 𝑆 ⊆ 𝐵) → 𝑋 ≤ (𝑈‘𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ⊆ wss 3936 {csn 4567 class class class wbr 5066 ‘cfv 6355 Basecbs 16483 lecple 16572 lubclub 17552 Latclat 17655 CLatccla 17717 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-proset 17538 df-poset 17556 df-lub 17584 df-glb 17585 df-join 17586 df-meet 17587 df-lat 17656 df-clat 17718 |
This theorem is referenced by: lubun 17733 atlatmstc 36470 2polssN 37066 |
Copyright terms: Public domain | W3C validator |