Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  lubsscl Structured version   Visualization version   GIF version

Theorem lubsscl 46142
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.
StepHypRef Expression
1 lubsscl.t . . . 4 (𝜑𝑇𝑆)
2 eqid 2738 . . . . 5 (Base‘𝐾) = (Base‘𝐾)
3 eqid 2738 . . . . 5 (le‘𝐾) = (le‘𝐾)
4 lubsscl.u . . . . 5 𝑈 = (lub‘𝐾)
5 lubsscl.k . . . . 5 (𝜑𝐾 ∈ Poset)
6 lubsscl.s . . . . 5 (𝜑𝑆 ∈ dom 𝑈)
72, 3, 4, 5, 6lubelss 17987 . . . 4 (𝜑𝑆 ⊆ (Base‘𝐾))
81, 7sstrd 3927 . . 3 (𝜑𝑇 ⊆ (Base‘𝐾))
9 lubsscl.x . . . . 5 (𝜑 → (𝑈𝑆) ∈ 𝑇)
108, 9sseldd 3918 . . . 4 (𝜑 → (𝑈𝑆) ∈ (Base‘𝐾))
115adantr 480 . . . . . 6 ((𝜑𝑦𝑇) → 𝐾 ∈ Poset)
126adantr 480 . . . . . 6 ((𝜑𝑦𝑇) → 𝑆 ∈ dom 𝑈)
131sselda 3917 . . . . . 6 ((𝜑𝑦𝑇) → 𝑦𝑆)
142, 3, 4, 11, 12, 13luble 17992 . . . . 5 ((𝜑𝑦𝑇) → 𝑦(le‘𝐾)(𝑈𝑆))
1514ralrimiva 3107 . . . 4 (𝜑 → ∀𝑦𝑇 𝑦(le‘𝐾)(𝑈𝑆))
16 breq1 5073 . . . . . . 7 (𝑦 = (𝑈𝑆) → (𝑦(le‘𝐾)𝑧 ↔ (𝑈𝑆)(le‘𝐾)𝑧))
17 simp3 1136 . . . . . . 7 ((𝜑𝑧 ∈ (Base‘𝐾) ∧ ∀𝑦𝑇 𝑦(le‘𝐾)𝑧) → ∀𝑦𝑇 𝑦(le‘𝐾)𝑧)
1893ad2ant1 1131 . . . . . . 7 ((𝜑𝑧 ∈ (Base‘𝐾) ∧ ∀𝑦𝑇 𝑦(le‘𝐾)𝑧) → (𝑈𝑆) ∈ 𝑇)
1916, 17, 18rspcdva 3554 . . . . . 6 ((𝜑𝑧 ∈ (Base‘𝐾) ∧ ∀𝑦𝑇 𝑦(le‘𝐾)𝑧) → (𝑈𝑆)(le‘𝐾)𝑧)
20193expia 1119 . . . . 5 ((𝜑𝑧 ∈ (Base‘𝐾)) → (∀𝑦𝑇 𝑦(le‘𝐾)𝑧 → (𝑈𝑆)(le‘𝐾)𝑧))
2120ralrimiva 3107 . . . 4 (𝜑 → ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧 → (𝑈𝑆)(le‘𝐾)𝑧))
22 breq2 5074 . . . . . . 7 (𝑥 = (𝑈𝑆) → (𝑦(le‘𝐾)𝑥𝑦(le‘𝐾)(𝑈𝑆)))
2322ralbidv 3120 . . . . . 6 (𝑥 = (𝑈𝑆) → (∀𝑦𝑇 𝑦(le‘𝐾)𝑥 ↔ ∀𝑦𝑇 𝑦(le‘𝐾)(𝑈𝑆)))
24 breq1 5073 . . . . . . . 8 (𝑥 = (𝑈𝑆) → (𝑥(le‘𝐾)𝑧 ↔ (𝑈𝑆)(le‘𝐾)𝑧))
2524imbi2d 340 . . . . . . 7 (𝑥 = (𝑈𝑆) → ((∀𝑦𝑇 𝑦(le‘𝐾)𝑧𝑥(le‘𝐾)𝑧) ↔ (∀𝑦𝑇 𝑦(le‘𝐾)𝑧 → (𝑈𝑆)(le‘𝐾)𝑧)))
2625ralbidv 3120 . . . . . 6 (𝑥 = (𝑈𝑆) → (∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧𝑥(le‘𝐾)𝑧) ↔ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧 → (𝑈𝑆)(le‘𝐾)𝑧)))
2723, 26anbi12d 630 . . . . 5 (𝑥 = (𝑈𝑆) → ((∀𝑦𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧𝑥(le‘𝐾)𝑧)) ↔ (∀𝑦𝑇 𝑦(le‘𝐾)(𝑈𝑆) ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧 → (𝑈𝑆)(le‘𝐾)𝑧))))
2827rspcev 3552 . . . 4 (((𝑈𝑆) ∈ (Base‘𝐾) ∧ (∀𝑦𝑇 𝑦(le‘𝐾)(𝑈𝑆) ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧 → (𝑈𝑆)(le‘𝐾)𝑧))) → ∃𝑥 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧𝑥(le‘𝐾)𝑧)))
2910, 15, 21, 28syl12anc 833 . . 3 (𝜑 → ∃𝑥 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧𝑥(le‘𝐾)𝑧)))
30 biid 260 . . . 4 ((∀𝑦𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧𝑥(le‘𝐾)𝑧)) ↔ (∀𝑦𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧𝑥(le‘𝐾)𝑧)))
312, 3, 4, 30, 5lubeldm2 46138 . . 3 (𝜑 → (𝑇 ∈ dom 𝑈 ↔ (𝑇 ⊆ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧𝑥(le‘𝐾)𝑧)))))
328, 29, 31mpbir2and 709 . 2 (𝜑𝑇 ∈ dom 𝑈)
333, 2, 4, 5, 8, 10, 14, 19poslubd 18046 . 2 (𝜑 → (𝑈𝑇) = (𝑈𝑆))
3432, 33jca 511 1 (𝜑 → (𝑇 ∈ dom 𝑈 ∧ (𝑈𝑇) = (𝑈𝑆)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1085   = wceq 1539  wcel 2108  wral 3063  wrex 3064  wss 3883   class class class wbr 5070  dom cdm 5580  cfv 6418  Basecbs 16840  lecple 16895  Posetcpo 17940  lubclub 17942
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-proset 17928  df-poset 17946  df-lub 17979
This theorem is referenced by:  lubprlem  46144
  Copyright terms: Public domain W3C validator