Theorem lubsscl 50068

Description: If a subset of 𝑆 contains the LUB of 𝑆, then the two sets have the same LUB. (Contributed by Zhi Wang, 26-Sep-2024.)

Hypotheses

Ref	Expression
lubsscl.k	⊢ (𝜑 → 𝐾 ∈ Poset)
lubsscl.t	⊢ (𝜑 → 𝑇 ⊆ 𝑆)
lubsscl.u	⊢ 𝑈 = (lub‘𝐾)
lubsscl.s	⊢ (𝜑 → 𝑆 ∈ dom 𝑈)
lubsscl.x	⊢ (𝜑 → (𝑈‘𝑆) ∈ 𝑇)

Assertion

Ref	Expression
lubsscl	⊢ (𝜑 → (𝑇 ∈ dom 𝑈 ∧ (𝑈‘𝑇) = (𝑈‘𝑆)))

Proof of Theorem lubsscl

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

Step	Hyp	Ref	Expression
1		lubsscl.t	. . . 4 ⊢ (𝜑 → 𝑇 ⊆ 𝑆)
2		eqid 2760	. . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾)
3		eqid 2760	. . . . 5 ⊢ (le‘𝐾) = (le‘𝐾)
4		lubsscl.u	. . . . 5 ⊢ 𝑈 = (lub‘𝐾)
5		lubsscl.k	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ Poset)
6		lubsscl.s	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ dom 𝑈)
7	2, 3, 4, 5, 6	lubelss 18526	. . . 4 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝐾))
8	1, 7	sstrd 3918	. . 3 ⊢ (𝜑 → 𝑇 ⊆ (Base‘𝐾))
9		lubsscl.x	. . . . 5 ⊢ (𝜑 → (𝑈‘𝑆) ∈ 𝑇)
10	8, 9	sseldd 3909	. . . 4 ⊢ (𝜑 → (𝑈‘𝑆) ∈ (Base‘𝐾))
11	5	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑇) → 𝐾 ∈ Poset)
12	6	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑇) → 𝑆 ∈ dom 𝑈)
13	1	sselda 3908	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑇) → 𝑦 ∈ 𝑆)
14	2, 3, 4, 11, 12, 13	luble 18531	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑇) → 𝑦(le‘𝐾)(𝑈‘𝑆))
15	14	ralrimiva 3154	. . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)(𝑈‘𝑆))
16		breq1 5105	. . . . . . 7 ⊢ (𝑦 = (𝑈‘𝑆) → (𝑦(le‘𝐾)𝑧 ↔ (𝑈‘𝑆)(le‘𝐾)𝑧))
17		simp3 1156	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧) → ∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧)
18	9	3ad2ant1 1151	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧) → (𝑈‘𝑆) ∈ 𝑇)
19	16, 17, 18	rspcdva 3577	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧) → (𝑈‘𝑆)(le‘𝐾)𝑧)
20	19	3expia 1139	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ (Base‘𝐾)) → (∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → (𝑈‘𝑆)(le‘𝐾)𝑧))
21	20	ralrimiva 3154	. . . 4 ⊢ (𝜑 → ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → (𝑈‘𝑆)(le‘𝐾)𝑧))
22		breq2 5106	. . . . . . 7 ⊢ (𝑥 = (𝑈‘𝑆) → (𝑦(le‘𝐾)𝑥 ↔ 𝑦(le‘𝐾)(𝑈‘𝑆)))
23	22	ralbidv 3185	. . . . . 6 ⊢ (𝑥 = (𝑈‘𝑆) → (∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑥 ↔ ∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)(𝑈‘𝑆)))
24		breq1 5105	. . . . . . . 8 ⊢ (𝑥 = (𝑈‘𝑆) → (𝑥(le‘𝐾)𝑧 ↔ (𝑈‘𝑆)(le‘𝐾)𝑧))
25	24	imbi2d 343	. . . . . . 7 ⊢ (𝑥 = (𝑈‘𝑆) → ((∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧) ↔ (∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → (𝑈‘𝑆)(le‘𝐾)𝑧)))
26	25	ralbidv 3185	. . . . . 6 ⊢ (𝑥 = (𝑈‘𝑆) → (∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧) ↔ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → (𝑈‘𝑆)(le‘𝐾)𝑧)))
27	23, 26	anbi12d 644	. . . . 5 ⊢ (𝑥 = (𝑈‘𝑆) → ((∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)) ↔ (∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)(𝑈‘𝑆) ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → (𝑈‘𝑆)(le‘𝐾)𝑧))))
28	27	rspcev 3576	. . . 4 ⊢ (((𝑈‘𝑆) ∈ (Base‘𝐾) ∧ (∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)(𝑈‘𝑆) ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → (𝑈‘𝑆)(le‘𝐾)𝑧))) → ∃𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)))
29	10, 15, 21, 28	syl12anc 850	. . 3 ⊢ (𝜑 → ∃𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)))
30		biid 264	. . . 4 ⊢ ((∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)) ↔ (∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)))
31	2, 3, 4, 30, 5	lubeldm2 50064	. . 3 ⊢ (𝜑 → (𝑇 ∈ dom 𝑈 ↔ (𝑇 ⊆ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)))))
32	8, 29, 31	mpbir2and 726	. 2 ⊢ (𝜑 → 𝑇 ∈ dom 𝑈)
33	3, 2, 4, 5, 8, 10, 14, 19	poslubd 18585	. 2 ⊢ (𝜑 → (𝑈‘𝑇) = (𝑈‘𝑆))
34	32, 33	jca 521	1 ⊢ (𝜑 → (𝑇 ∈ dom 𝑈 ∧ (𝑈‘𝑇) = (𝑈‘𝑆)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086   ⊆ wss 3895   class class class wbr 5102  dom cdm 5650  ‘cfv 6538  Basecbs 17387  lecple 17435  Posetcpo 18481  lubclub 18483

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-proset 18468  df-poset 18487  df-lub 18518

This theorem is used by:  lubprlem  50070