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 49724
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 49723 . 2 (𝜑 → (dom = (𝐵 × 𝐵) ↔ ∀𝑥𝐵𝑦𝐵 {𝑥, 𝑦} ∈ dom 𝑈))
6 simprl 782 . . . . . 6 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → 𝑥𝐵)
7 simprr 784 . . . . . 6 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → 𝑦𝐵)
86, 7prssd 4789 . . . . 5 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → {𝑥, 𝑦} ⊆ 𝐵)
9 joindm3.l . . . . . . 7 = (le‘𝐾)
10 biid 264 . . . . . . 7 ((∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑧 ∧ ∀𝑤𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑤𝑧 𝑤)) ↔ (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑧 ∧ ∀𝑤𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑤𝑧 𝑤)))
111, 9, 3, 10, 2lubeldm 18408 . . . . . 6 (𝜑 → ({𝑥, 𝑦} ∈ dom 𝑈 ↔ ({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃!𝑧𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑧 ∧ ∀𝑤𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑤𝑧 𝑤)))))
1211baibd 548 . . . . 5 ((𝜑 ∧ {𝑥, 𝑦} ⊆ 𝐵) → ({𝑥, 𝑦} ∈ dom 𝑈 ↔ ∃!𝑧𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑧 ∧ ∀𝑤𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑤𝑧 𝑤))))
138, 12syldan 602 . . . 4 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ({𝑥, 𝑦} ∈ dom 𝑈 ↔ ∃!𝑧𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑧 ∧ ∀𝑤𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑤𝑧 𝑤))))
142adantr 485 . . . . . . 7 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → 𝐾𝑉)
151, 9, 4, 14, 6, 7joinval2lem 18435 . . . . . 6 ((𝑥𝐵𝑦𝐵) → ((∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑧 ∧ ∀𝑤𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑤𝑧 𝑤)) ↔ ((𝑥 𝑧𝑦 𝑧) ∧ ∀𝑤𝐵 ((𝑥 𝑤𝑦 𝑤) → 𝑧 𝑤))))
1615reubidv 3385 . . . . 5 ((𝑥𝐵𝑦𝐵) → (∃!𝑧𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑧 ∧ ∀𝑤𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑤𝑧 𝑤)) ↔ ∃!𝑧𝐵 ((𝑥 𝑧𝑦 𝑧) ∧ ∀𝑤𝐵 ((𝑥 𝑤𝑦 𝑤) → 𝑧 𝑤))))
1716adantl 486 . . . 4 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (∃!𝑧𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑧 ∧ ∀𝑤𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑣 𝑤𝑧 𝑤)) ↔ ∃!𝑧𝐵 ((𝑥 𝑧𝑦 𝑧) ∧ ∀𝑤𝐵 ((𝑥 𝑤𝑦 𝑤) → 𝑧 𝑤))))
1813, 17bitrd 282 . . 3 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ({𝑥, 𝑦} ∈ dom 𝑈 ↔ ∃!𝑧𝐵 ((𝑥 𝑧𝑦 𝑧) ∧ ∀𝑤𝐵 ((𝑥 𝑤𝑦 𝑤) → 𝑧 𝑤))))
19182ralbidva 3227 . 2 (𝜑 → (∀𝑥𝐵𝑦𝐵 {𝑥, 𝑦} ∈ dom 𝑈 ↔ ∀𝑥𝐵𝑦𝐵 ∃!𝑧𝐵 ((𝑥 𝑧𝑦 𝑧) ∧ ∀𝑤𝐵 ((𝑥 𝑤𝑦 𝑤) → 𝑧 𝑤))))
205, 19bitrd 282 1 (𝜑 → (dom = (𝐵 × 𝐵) ↔ ∀𝑥𝐵𝑦𝐵 ∃!𝑧𝐵 ((𝑥 𝑧𝑦 𝑧) ∧ ∀𝑤𝐵 ((𝑥 𝑤𝑦 𝑤) → 𝑧 𝑤))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1570  wcel 2143  wral 3079  ∃!wreu 3367  wss 3906  {cpr 4592   class class class wbr 5110   × cxp 5661  dom cdm 5663  cfv 6538  Basecbs 17270  lecple 17318  lubclub 18366  joincjn 18368
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  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 7369  df-oprab 7416  df-lub 18401  df-join 18403
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator