Theorem lubsscl 49873

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 2762	. . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾)
3		eqid 2762	. . . . 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 18444	. . . 4 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝐾))
8	1, 7	sstrd 3944	. . 3 ⊢ (𝜑 → 𝑇 ⊆ (Base‘𝐾))
9		lubsscl.x	. . . . 5 ⊢ (𝜑 → (𝑈‘𝑆) ∈ 𝑇)
10	8, 9	sseldd 3935	. . . 4 ⊢ (𝜑 → (𝑈‘𝑆) ∈ (Base‘𝐾))
11	5	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑇) → 𝐾 ∈ Poset)
12	6	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑇) → 𝑆 ∈ dom 𝑈)
13	1	sselda 3934	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑇) → 𝑦 ∈ 𝑆)
14	2, 3, 4, 11, 12, 13	luble 18449	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑇) → 𝑦(le‘𝐾)(𝑈‘𝑆))
15	14	ralrimiva 3156	. . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)(𝑈‘𝑆))
16		breq1 5110	. . . . . . 7 ⊢ (𝑦 = (𝑈‘𝑆) → (𝑦(le‘𝐾)𝑧 ↔ (𝑈‘𝑆)(le‘𝐾)𝑧))
17		simp3 1156	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧) → ∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧)
18	9	3ad2ant1 1151	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧) → (𝑈‘𝑆) ∈ 𝑇)
19	16, 17, 18	rspcdva 3580	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧) → (𝑈‘𝑆)(le‘𝐾)𝑧)
20	19	3expia 1139	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ (Base‘𝐾)) → (∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → (𝑈‘𝑆)(le‘𝐾)𝑧))
21	20	ralrimiva 3156	. . . 4 ⊢ (𝜑 → ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → (𝑈‘𝑆)(le‘𝐾)𝑧))
22		breq2 5111	. . . . . . 7 ⊢ (𝑥 = (𝑈‘𝑆) → (𝑦(le‘𝐾)𝑥 ↔ 𝑦(le‘𝐾)(𝑈‘𝑆)))
23	22	ralbidv 3187	. . . . . 6 ⊢ (𝑥 = (𝑈‘𝑆) → (∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑥 ↔ ∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)(𝑈‘𝑆)))
24		breq1 5110	. . . . . . . 8 ⊢ (𝑥 = (𝑈‘𝑆) → (𝑥(le‘𝐾)𝑧 ↔ (𝑈‘𝑆)(le‘𝐾)𝑧))
25	24	imbi2d 343	. . . . . . 7 ⊢ (𝑥 = (𝑈‘𝑆) → ((∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧) ↔ (∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → (𝑈‘𝑆)(le‘𝐾)𝑧)))
26	25	ralbidv 3187	. . . . . 6 ⊢ (𝑥 = (𝑈‘𝑆) → (∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧) ↔ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → (𝑈‘𝑆)(le‘𝐾)𝑧)))
27	23, 26	anbi12d 644	. . . . 5 ⊢ (𝑥 = (𝑈‘𝑆) → ((∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)) ↔ (∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)(𝑈‘𝑆) ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑇 𝑦(le‘𝐾)𝑧 → (𝑈‘𝑆)(le‘𝐾)𝑧))))
28	27	rspcev 3579	. . . 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 49869	. . 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 18503	. 2 ⊢ (𝜑 → (𝑈‘𝑇) = (𝑈‘𝑆))
34	32, 33	jca 521	1 ⊢ (𝜑 → (𝑇 ∈ dom 𝑈 ∧ (𝑈‘𝑇) = (𝑈‘𝑆)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3078  ∃wrex 3088   ⊆ wss 3902   class class class wbr 5107  dom cdm 5659  ‘cfv 6537  Basecbs 17305  lecple 17353  Posetcpo 18399  lubclub 18401

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7373  df-proset 18386  df-poset 18405  df-lub 18436

This theorem is used by:  lubprlem  49875