Theorem poslubd 18352

Description: Properties which determine the least upper bound in a poset. (Contributed by Stefan O'Rear, 31-Jan-2015.)

Hypotheses

Ref	Expression
poslubd.l	⊢ ≤ = (le‘𝐾)
poslubd.b	⊢ 𝐵 = (Base‘𝐾)
poslubd.u	⊢ 𝑈 = (lub‘𝐾)
poslubd.k	⊢ (𝜑 → 𝐾 ∈ Poset)
poslubd.s	⊢ (𝜑 → 𝑆 ⊆ 𝐵)
poslubd.t	⊢ (𝜑 → 𝑇 ∈ 𝐵)
poslubd.ub	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝑥 ≤ 𝑇)
poslubd.le	⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦) → 𝑇 ≤ 𝑦)

Assertion

Ref	Expression
poslubd	⊢ (𝜑 → (𝑈‘𝑆) = 𝑇)

Distinct variable groups:   𝑥, ≤ ,𝑦   𝑥,𝐵,𝑦   𝑥,𝐾,𝑦   𝑥,𝑆,𝑦   𝑥,𝑈,𝑦   𝑥,𝑇,𝑦   𝜑,𝑥,𝑦

Proof of Theorem poslubd

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		poslubd.b	. . 3 ⊢ 𝐵 = (Base‘𝐾)
2		poslubd.l	. . 3 ⊢ ≤ = (le‘𝐾)
3		poslubd.u	. . 3 ⊢ 𝑈 = (lub‘𝐾)
4		biid 261	. . 3 ⊢ ((∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦)) ↔ (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦)))
5		poslubd.k	. . 3 ⊢ (𝜑 → 𝐾 ∈ Poset)
6		poslubd.s	. . 3 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)
7	1, 2, 3, 4, 5, 6	lubval 18295	. 2 ⊢ (𝜑 → (𝑈‘𝑆) = (℩𝑧 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦))))
8		poslubd.ub	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝑥 ≤ 𝑇)
9	8	ralrimiva 3125	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑇)
10		poslubd.le	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦) → 𝑇 ≤ 𝑦)
11	10	3expia 1121	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑇 ≤ 𝑦))
12	11	ralrimiva 3125	. . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑇 ≤ 𝑦))
13	9, 12	jca 511	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑇 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑇 ≤ 𝑦)))
14		poslubd.t	. . . 4 ⊢ (𝜑 → 𝑇 ∈ 𝐵)
15		breq2 5106	. . . . . . . . 9 ⊢ (𝑧 = 𝑇 → (𝑥 ≤ 𝑧 ↔ 𝑥 ≤ 𝑇))
16	15	ralbidv 3156	. . . . . . . 8 ⊢ (𝑧 = 𝑇 → (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ↔ ∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑇))
17		breq1 5105	. . . . . . . . . 10 ⊢ (𝑧 = 𝑇 → (𝑧 ≤ 𝑦 ↔ 𝑇 ≤ 𝑦))
18	17	imbi2d 340	. . . . . . . . 9 ⊢ (𝑧 = 𝑇 → ((∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦) ↔ (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑇 ≤ 𝑦)))
19	18	ralbidv 3156	. . . . . . . 8 ⊢ (𝑧 = 𝑇 → (∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦) ↔ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑇 ≤ 𝑦)))
20	16, 19	anbi12d 632	. . . . . . 7 ⊢ (𝑧 = 𝑇 → ((∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦)) ↔ (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑇 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑇 ≤ 𝑦))))
21	20	rspcev 3585	. . . . . 6 ⊢ ((𝑇 ∈ 𝐵 ∧ (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑇 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑇 ≤ 𝑦))) → ∃𝑧 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦)))
22	14, 13, 21	syl2anc 584	. . . . 5 ⊢ (𝜑 → ∃𝑧 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦)))
23	2, 1	poslubmo 18350	. . . . . 6 ⊢ ((𝐾 ∈ Poset ∧ 𝑆 ⊆ 𝐵) → ∃*𝑧 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦)))
24	5, 6, 23	syl2anc 584	. . . . 5 ⊢ (𝜑 → ∃*𝑧 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦)))
25		reu5 3353	. . . . 5 ⊢ (∃!𝑧 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦)) ↔ (∃𝑧 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦)) ∧ ∃*𝑧 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦))))
26	22, 24, 25	sylanbrc 583	. . . 4 ⊢ (𝜑 → ∃!𝑧 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦)))
27	20	riota2 7351	. . . 4 ⊢ ((𝑇 ∈ 𝐵 ∧ ∃!𝑧 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦))) → ((∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑇 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑇 ≤ 𝑦)) ↔ (℩𝑧 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦))) = 𝑇))
28	14, 26, 27	syl2anc 584	. . 3 ⊢ (𝜑 → ((∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑇 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑇 ≤ 𝑦)) ↔ (℩𝑧 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦))) = 𝑇))
29	13, 28	mpbid 232	. 2 ⊢ (𝜑 → (℩𝑧 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑧 ∧ ∀𝑦 ∈ 𝐵 (∀𝑥 ∈ 𝑆 𝑥 ≤ 𝑦 → 𝑧 ≤ 𝑦))) = 𝑇)
30	7, 29	eqtrd 2764	1 ⊢ (𝜑 → (𝑈‘𝑆) = 𝑇)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ∃wrex 3053  ∃!wreu 3349  ∃*wrmo 3350   ⊆ wss 3911   class class class wbr 5102  ‘cfv 6499  ℩crio 7325  Basecbs 17155  lecple 17203  Posetcpo 18248  lubclub 18250

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

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-proset 18235  df-poset 18254  df-lub 18285

This theorem is referenced by:  poslubdg  18353  lubsscl  48941