Theorem lubid 18394

Description: The LUB of elements less than or equal to a fixed value equals that value. (Contributed by NM, 19-Oct-2011.) (Revised by NM, 7-Sep-2018.)

Hypotheses

Ref	Expression
lubid.b	⊢ 𝐵 = (Base‘𝐾)
lubid.l	⊢ ≤ = (le‘𝐾)
lubid.u	⊢ 𝑈 = (lub‘𝐾)
lubid.k	⊢ (𝜑 → 𝐾 ∈ Poset)
lubid.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)

Assertion

Ref	Expression
lubid	⊢ (𝜑 → (𝑈‘{𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}) = 𝑋)

Distinct variable groups:   𝑦, ≤   𝑦,𝐵   𝑦,𝑋

Allowed substitution hints:   𝜑(𝑦)   𝑈(𝑦)   𝐾(𝑦)

Proof of Theorem lubid

Dummy variables 𝑥 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lubid.b	. . 3 ⊢ 𝐵 = (Base‘𝐾)
2		lubid.l	. . 3 ⊢ ≤ = (le‘𝐾)
3		lubid.u	. . 3 ⊢ 𝑈 = (lub‘𝐾)
4		biid 263	. . 3 ⊢ ((∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤)) ↔ (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤)))
5		lubid.k	. . 3 ⊢ (𝜑 → 𝐾 ∈ Poset)
6		ssrab2 4035	. . . 4 ⊢ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋} ⊆ 𝐵
7	6	a1i 11	. . 3 ⊢ (𝜑 → {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋} ⊆ 𝐵)
8	1, 2, 3, 4, 5, 7	lubval 18388	. 2 ⊢ (𝜑 → (𝑈‘{𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}) = (℩𝑥 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤))))
9		lubid.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
10	1, 2, 3, 5, 9	lublecllem 18392	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤)) ↔ 𝑥 = 𝑋))
11	9, 10	riota5 7384	. 2 ⊢ (𝜑 → (℩𝑥 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤))) = 𝑋)
12	8, 11	eqtrd 2799	1 ⊢ (𝜑 → (𝑈‘{𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}) = 𝑋)

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1562   ∈ wcel 2144  ∀wral 3078  {crab 3416   ⊆ wss 3906   class class class wbr 5102  ‘cfv 6523  ℩crio 7354  Basecbs 17247  lecple 17295  Posetcpo 18341  lubclub 18343

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-rep 5229  ax-sep 5248  ax-nul 5258  ax-pow 5324  ax-pr 5392

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3079  df-rex 3089  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-riota 7355  df-proset 18328  df-poset 18347  df-lub 18378

This theorem is referenced by:  atlatmstc  39948  lubprlem  49588