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 49282
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 2737 . . . . 5 (Base‘𝐾) = (Base‘𝐾)
3 eqid 2737 . . . . 5 (le‘𝐾) = (le‘𝐾)
4 lubsscl.u . . . . 5 𝑈 = (lub‘𝐾)
5 lubsscl.k . . . . 5 (𝜑𝐾 ∈ Poset)
6 lubsscl.s . . . . 5 (𝜑𝑆 ∈ dom 𝑈)
72, 3, 4, 5, 6lubelss 18280 . . . 4 (𝜑𝑆 ⊆ (Base‘𝐾))
81, 7sstrd 3945 . . 3 (𝜑𝑇 ⊆ (Base‘𝐾))
9 lubsscl.x . . . . 5 (𝜑 → (𝑈𝑆) ∈ 𝑇)
108, 9sseldd 3935 . . . 4 (𝜑 → (𝑈𝑆) ∈ (Base‘𝐾))
115adantr 480 . . . . . 6 ((𝜑𝑦𝑇) → 𝐾 ∈ Poset)
126adantr 480 . . . . . 6 ((𝜑𝑦𝑇) → 𝑆 ∈ dom 𝑈)
131sselda 3934 . . . . . 6 ((𝜑𝑦𝑇) → 𝑦𝑆)
142, 3, 4, 11, 12, 13luble 18285 . . . . 5 ((𝜑𝑦𝑇) → 𝑦(le‘𝐾)(𝑈𝑆))
1514ralrimiva 3129 . . . 4 (𝜑 → ∀𝑦𝑇 𝑦(le‘𝐾)(𝑈𝑆))
16 breq1 5102 . . . . . . 7 (𝑦 = (𝑈𝑆) → (𝑦(le‘𝐾)𝑧 ↔ (𝑈𝑆)(le‘𝐾)𝑧))
17 simp3 1139 . . . . . . 7 ((𝜑𝑧 ∈ (Base‘𝐾) ∧ ∀𝑦𝑇 𝑦(le‘𝐾)𝑧) → ∀𝑦𝑇 𝑦(le‘𝐾)𝑧)
1893ad2ant1 1134 . . . . . . 7 ((𝜑𝑧 ∈ (Base‘𝐾) ∧ ∀𝑦𝑇 𝑦(le‘𝐾)𝑧) → (𝑈𝑆) ∈ 𝑇)
1916, 17, 18rspcdva 3578 . . . . . 6 ((𝜑𝑧 ∈ (Base‘𝐾) ∧ ∀𝑦𝑇 𝑦(le‘𝐾)𝑧) → (𝑈𝑆)(le‘𝐾)𝑧)
20193expia 1122 . . . . 5 ((𝜑𝑧 ∈ (Base‘𝐾)) → (∀𝑦𝑇 𝑦(le‘𝐾)𝑧 → (𝑈𝑆)(le‘𝐾)𝑧))
2120ralrimiva 3129 . . . 4 (𝜑 → ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧 → (𝑈𝑆)(le‘𝐾)𝑧))
22 breq2 5103 . . . . . . 7 (𝑥 = (𝑈𝑆) → (𝑦(le‘𝐾)𝑥𝑦(le‘𝐾)(𝑈𝑆)))
2322ralbidv 3160 . . . . . 6 (𝑥 = (𝑈𝑆) → (∀𝑦𝑇 𝑦(le‘𝐾)𝑥 ↔ ∀𝑦𝑇 𝑦(le‘𝐾)(𝑈𝑆)))
24 breq1 5102 . . . . . . . 8 (𝑥 = (𝑈𝑆) → (𝑥(le‘𝐾)𝑧 ↔ (𝑈𝑆)(le‘𝐾)𝑧))
2524imbi2d 340 . . . . . . 7 (𝑥 = (𝑈𝑆) → ((∀𝑦𝑇 𝑦(le‘𝐾)𝑧𝑥(le‘𝐾)𝑧) ↔ (∀𝑦𝑇 𝑦(le‘𝐾)𝑧 → (𝑈𝑆)(le‘𝐾)𝑧)))
2625ralbidv 3160 . . . . . 6 (𝑥 = (𝑈𝑆) → (∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧𝑥(le‘𝐾)𝑧) ↔ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧 → (𝑈𝑆)(le‘𝐾)𝑧)))
2723, 26anbi12d 633 . . . . 5 (𝑥 = (𝑈𝑆) → ((∀𝑦𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧𝑥(le‘𝐾)𝑧)) ↔ (∀𝑦𝑇 𝑦(le‘𝐾)(𝑈𝑆) ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧 → (𝑈𝑆)(le‘𝐾)𝑧))))
2827rspcev 3577 . . . 4 (((𝑈𝑆) ∈ (Base‘𝐾) ∧ (∀𝑦𝑇 𝑦(le‘𝐾)(𝑈𝑆) ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧 → (𝑈𝑆)(le‘𝐾)𝑧))) → ∃𝑥 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧𝑥(le‘𝐾)𝑧)))
2910, 15, 21, 28syl12anc 837 . . 3 (𝜑 → ∃𝑥 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧𝑥(le‘𝐾)𝑧)))
30 biid 261 . . . 4 ((∀𝑦𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧𝑥(le‘𝐾)𝑧)) ↔ (∀𝑦𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧𝑥(le‘𝐾)𝑧)))
312, 3, 4, 30, 5lubeldm2 49278 . . 3 (𝜑 → (𝑇 ∈ dom 𝑈 ↔ (𝑇 ⊆ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦𝑇 𝑦(le‘𝐾)𝑧𝑥(le‘𝐾)𝑧)))))
328, 29, 31mpbir2and 714 . 2 (𝜑𝑇 ∈ dom 𝑈)
333, 2, 4, 5, 8, 10, 14, 19poslubd 18339 . 2 (𝜑 → (𝑈𝑇) = (𝑈𝑆))
3432, 33jca 511 1 (𝜑 → (𝑇 ∈ dom 𝑈 ∧ (𝑈𝑇) = (𝑈𝑆)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3052  wrex 3061  wss 3902   class class class wbr 5099  dom cdm 5625  cfv 6493  Basecbs 17141  lecple 17189  Posetcpo 18235  lubclub 18237
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rmo 3351  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-riota 7318  df-proset 18222  df-poset 18241  df-lub 18272
This theorem is referenced by:  lubprlem  49284
  Copyright terms: Public domain W3C validator