MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  joineu Structured version   Visualization version   GIF version

Theorem joineu 18604
Description: Uniqueness of join of elements in the domain. (Contributed by NM, 12-Sep-2018.)
Hypotheses
Ref Expression
joinval2.b 𝐵 = (Base‘𝐾)
joinval2.l ≤ = (le‘𝐾)
joinval2.j ∨ = (join‘𝐾)
joinval2.k (𝜑 → 𝐾 ∈ 𝑉)
joinval2.x (𝜑 → 𝑋 ∈ 𝐵)
joinval2.y (𝜑 → 𝑌 ∈ 𝐵)
joinlem.e (𝜑 → ⟨𝑋, 𝑌⟩ ∈ dom ∨ )
Assertion
Ref Expression
joineu (𝜑 → ∃!𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧)))
Distinct variable groups:   𝑥,𝑧,𝐵   𝑥, ∨ ,𝑧   𝑥,𝐾,𝑧   𝑥,𝑋,𝑧   𝑥,𝑌,𝑧   𝜑,𝑥
Allowed substitution hints:   𝜑(𝑧)   ≤ (𝑥, 𝑧)   𝑉(𝑥, 𝑧)

Proof of Theorem joineu
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 joinlem.e . 2 (𝜑 → ⟨𝑋, 𝑌⟩ ∈ dom ∨ )
2 eqid 2763 . . . 4 (lub‘𝐾) = (lub‘𝐾)
3 joinval2.j . . . 4 ∨ = (join‘𝐾)
4 joinval2.k . . . 4 (𝜑 → 𝐾 ∈ 𝑉)
5 joinval2.x . . . 4 (𝜑 → 𝑋 ∈ 𝐵)
6 joinval2.y . . . 4 (𝜑 → 𝑌 ∈ 𝐵)
72, 3, 4, 5, 6joindef 18598 . . 3 (𝜑 → (⟨𝑋, 𝑌⟩ ∈ dom ∨ ↔ {𝑋, 𝑌} ∈ dom (lub‘𝐾)))
8 joinval2.b . . . . . 6 𝐵 = (Base‘𝐾)
9 joinval2.l . . . . . 6 ≤ = (le‘𝐾)
10 biid 264 . . . . . 6 ((∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
114adantr 486 . . . . . 6 ((𝜑 ∧ {𝑋, 𝑌} ∈ dom (lub‘𝐾)) → 𝐾 ∈ 𝑉)
12 simpr 490 . . . . . 6 ((𝜑 ∧ {𝑋, 𝑌} ∈ dom (lub‘𝐾)) → {𝑋, 𝑌} ∈ dom (lub‘𝐾))
138, 9, 2, 10, 11, 12lubeu 18577 . . . . 5 ((𝜑 ∧ {𝑋, 𝑌} ∈ dom (lub‘𝐾)) → ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
1413ex 418 . . . 4 (𝜑 → ({𝑋, 𝑌} ∈ dom (lub‘𝐾) → ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))))
158, 9, 3, 4, 5, 6joinval2lem 18602 . . . . . 6 ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧))))
165, 6, 15syl2anc 596 . . . . 5 (𝜑 → ((∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧))))
1716reubidv 3385 . . . 4 (𝜑 → (∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ ∃!𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧))))
1814, 17sylibd 242 . . 3 (𝜑 → ({𝑋, 𝑌} ∈ dom (lub‘𝐾) → ∃!𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧))))
197, 18sylbid 243 . 2 (𝜑 → (⟨𝑋, 𝑌⟩ ∈ dom ∨ → ∃!𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧))))
201, 19mpd 16 1 (𝜑 → ∃!𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃!wreu 3367  {cpr 4590  ⟨cop 4840   class class class wbr 5108  dom cdm 5658  ‘cfv 6566  Basecbs 17431  lecple 17479  lubclub 18533  joincjn 18535
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-oprab 7455  df-lub 18568  df-join 18570
This theorem is used by:  joinlem  18605
  Copyright terms: Public domain W3C validator