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

Theorem joindm3 49322
Description: The join of any two elements always exists iff all unordered pairs have LUB (expanded version). (Contributed by Zhi Wang, 25-Sep-2024.)
Hypotheses
Ref Expression
joindm2.b 𝐵 = (Base‘𝐾)
joindm2.k (𝜑𝐾𝑉)
joindm2.u 𝑈 = (lub‘𝐾)
joindm2.j = (join‘𝐾)
joindm3.l = (le‘𝐾)
Assertion
Ref Expression
joindm3 (𝜑 → (dom = (𝐵 × 𝐵) ↔ ∀𝑥𝐵𝑦𝐵 ∃!𝑧𝐵 ((𝑥 𝑧𝑦 𝑧) ∧ ∀𝑤𝐵 ((𝑥 𝑤𝑦 𝑤) → 𝑧 𝑤))))
Distinct variable groups:   𝑥,𝑤,𝑦,𝑧,   𝑤,𝐵,𝑥,𝑦,𝑧   𝑤,𝐾,𝑧   𝜑,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑧,𝑤)   𝑈(𝑥,𝑦,𝑧,𝑤)   𝐾(𝑥,𝑦)   (𝑥,𝑦,𝑧,𝑤)   𝑉(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem joindm3
Dummy variable 𝑣 is distinct from all other variables.
StepHypRef Expression
1 joindm2.b . . 3 𝐵 = (Base‘𝐾)
2 joindm2.k . . 3 (𝜑𝐾𝑉)
3 joindm2.u . . 3 𝑈 = (lub‘𝐾)
4 joindm2.j . . 3 = (join‘𝐾)
51, 2, 3, 4joindm2 49321 . 2 (𝜑 → (dom = (𝐵 × 𝐵) ↔ ∀𝑥𝐵𝑦𝐵 {𝑥, 𝑦} ∈ dom 𝑈))
6 simprl 771 . . . . . 6 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → 𝑥𝐵)
7 simprr 773 . . . . . 6 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → 𝑦𝐵)
86, 7prssd 4780 . . . . 5 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → {𝑥, 𝑦} ⊆ 𝐵)
9 joindm3.l . . . . . . 7 = (le‘𝐾)
10 biid 261 . . . . . . 7 ((∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑧 ∧ ∀𝑤𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑤𝑧 𝑤)) ↔ (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑧 ∧ ∀𝑤𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑤𝑧 𝑤)))
111, 9, 3, 10, 2lubeldm 18286 . . . . . 6 (𝜑 → ({𝑥, 𝑦} ∈ dom 𝑈 ↔ ({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃!𝑧𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑧 ∧ ∀𝑤𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑤𝑧 𝑤)))))
1211baibd 539 . . . . 5 ((𝜑 ∧ {𝑥, 𝑦} ⊆ 𝐵) → ({𝑥, 𝑦} ∈ dom 𝑈 ↔ ∃!𝑧𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑧 ∧ ∀𝑤𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑤𝑧 𝑤))))
138, 12syldan 592 . . . 4 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ({𝑥, 𝑦} ∈ dom 𝑈 ↔ ∃!𝑧𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑧 ∧ ∀𝑤𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑤𝑧 𝑤))))
142adantr 480 . . . . . . 7 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → 𝐾𝑉)
151, 9, 4, 14, 6, 7joinval2lem 18313 . . . . . 6 ((𝑥𝐵𝑦𝐵) → ((∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑧 ∧ ∀𝑤𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑤𝑧 𝑤)) ↔ ((𝑥 𝑧𝑦 𝑧) ∧ ∀𝑤𝐵 ((𝑥 𝑤𝑦 𝑤) → 𝑧 𝑤))))
1615reubidv 3368 . . . . 5 ((𝑥𝐵𝑦𝐵) → (∃!𝑧𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑧 ∧ ∀𝑤𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑤𝑧 𝑤)) ↔ ∃!𝑧𝐵 ((𝑥 𝑧𝑦 𝑧) ∧ ∀𝑤𝐵 ((𝑥 𝑤𝑦 𝑤) → 𝑧 𝑤))))
1716adantl 481 . . . 4 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (∃!𝑧𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑧 ∧ ∀𝑤𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑤𝑧 𝑤)) ↔ ∃!𝑧𝐵 ((𝑥 𝑧𝑦 𝑧) ∧ ∀𝑤𝐵 ((𝑥 𝑤𝑦 𝑤) → 𝑧 𝑤))))
1813, 17bitrd 279 . . 3 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ({𝑥, 𝑦} ∈ dom 𝑈 ↔ ∃!𝑧𝐵 ((𝑥 𝑧𝑦 𝑧) ∧ ∀𝑤𝐵 ((𝑥 𝑤𝑦 𝑤) → 𝑧 𝑤))))
19182ralbidva 3200 . 2 (𝜑 → (∀𝑥𝐵𝑦𝐵 {𝑥, 𝑦} ∈ dom 𝑈 ↔ ∀𝑥𝐵𝑦𝐵 ∃!𝑧𝐵 ((𝑥 𝑧𝑦 𝑧) ∧ ∀𝑤𝐵 ((𝑥 𝑤𝑦 𝑤) → 𝑧 𝑤))))
205, 19bitrd 279 1 (𝜑 → (dom = (𝐵 × 𝐵) ↔ ∀𝑥𝐵𝑦𝐵 ∃!𝑧𝐵 ((𝑥 𝑧𝑦 𝑧) ∧ ∀𝑤𝐵 ((𝑥 𝑤𝑦 𝑤) → 𝑧 𝑤))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wral 3052  ∃!wreu 3350  wss 3903  {cpr 4584   class class class wbr 5100   × cxp 5630  dom cdm 5632  cfv 6500  Basecbs 17148  lecple 17196  lubclub 18244  joincjn 18246
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 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
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 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-oprab 7372  df-lub 18279  df-join 18281
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator