MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  lubub Structured version   Visualization version   GIF version

Theorem lubub 18737
Description: The LUB of a complete lattice subset is an upper bound. (Contributed by NM, 19-Oct-2011.)
Hypotheses
Ref Expression
lublem.b 𝐵 = (Base‘𝐾)
lublem.l ≤ = (le‘𝐾)
lublem.u 𝑈 = (lub‘𝐾)
Assertion
Ref Expression
lubub ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵 ∧ 𝑋 ∈ 𝑆) → 𝑋 ≤ (𝑈‘𝑆))

Proof of Theorem lubub
Dummy variables 𝑧 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lublem.b . . . 4 𝐵 = (Base‘𝐾)
2 lublem.l . . . 4 ≤ = (le‘𝐾)
3 lublem.u . . . 4 𝑈 = (lub‘𝐾)
41, 2, 3lublem 18736 . . 3 ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵) → (∀𝑦 ∈ 𝑆 𝑦 ≤ (𝑈‘𝑆) ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧 → (𝑈‘𝑆) ≤ 𝑧)))
54simpld 500 . 2 ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵) → ∀𝑦 ∈ 𝑆 𝑦 ≤ (𝑈‘𝑆))
6 breq1 5110 . . 3 (𝑦 = 𝑋 → (𝑦 ≤ (𝑈‘𝑆) ↔ 𝑋 ≤ (𝑈‘𝑆)))
76rspccva 3578 . 2 ((∀𝑦 ∈ 𝑆 𝑦 ≤ (𝑈‘𝑆) ∧ 𝑋 ∈ 𝑆) → 𝑋 ≤ (𝑈‘𝑆))
85, 7stoic3 1811 1 ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵 ∧ 𝑋 ∈ 𝑆) → 𝑋 ≤ (𝑈‘𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150  ∀wral 3083   ⊆ wss 3899   class class class wbr 5107  ‘cfv 6565  Basecbs 17433  lecple 17481  lubclub 18535  CLatccla 18724
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-lub 18570  df-clat 18725
This theorem is used by:  lubss  18739
  Copyright terms: Public domain W3C validator