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

Theorem joinval2 18553
Description: Value of join for a poset with LUB expanded. (Contributed by NM, 16-Sep-2011.) (Revised by NM, 11-Sep-2018.)
Hypotheses
Ref Expression
joinval2.b 𝐵 = (Base‘𝐾)
joinval2.l ≤ = (le‘𝐾)
joinval2.j ∨ = (join‘𝐾)
joinval2.k (𝜑 → 𝐾 ∈ 𝑉)
joinval2.x (𝜑 → 𝑋 ∈ 𝐵)
joinval2.y (𝜑 → 𝑌 ∈ 𝐵)
Assertion
Ref Expression
joinval2 (𝜑 → (𝑋 ∨ 𝑌) = (℩𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧))))
Distinct variable groups:   𝑥,𝑧,𝐵   𝑥, ∨ ,𝑧   𝑥,𝐾,𝑧   𝑥,𝑋,𝑧   𝑥,𝑌,𝑧
Allowed substitution hints:   𝜑(𝑥, 𝑧)   ≤ (𝑥, 𝑧)   𝑉(𝑥, 𝑧)

Proof of Theorem joinval2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eqid 2761 . . 3 (lub‘𝐾) = (lub‘𝐾)
2 joinval2.j . . 3 ∨ = (join‘𝐾)
3 joinval2.k . . 3 (𝜑 → 𝐾 ∈ 𝑉)
4 joinval2.x . . 3 (𝜑 → 𝑋 ∈ 𝐵)
5 joinval2.y . . 3 (𝜑 → 𝑌 ∈ 𝐵)
61, 2, 3, 4, 5joinval 18549 . 2 (𝜑 → (𝑋 ∨ 𝑌) = ((lub‘𝐾)‘{𝑋, 𝑌}))
7 joinval2.b . . 3 𝐵 = (Base‘𝐾)
8 joinval2.l . . 3 ≤ = (le‘𝐾)
9 biid 264 . . 3 ((∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
104, 5prssd 4783 . . 3 (𝜑 → {𝑋, 𝑌} ⊆ 𝐵)
117, 8, 1, 9, 3, 10lubval 18528 . 2 (𝜑 → ((lub‘𝐾)‘{𝑋, 𝑌}) = (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))))
127, 8, 2, 3, 4, 5joinval2lem 18552 . . . 4 ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧))))
1312riotabidv 7379 . . 3 ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))) = (℩𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧))))
144, 5, 13syl2anc 596 . 2 (𝜑 → (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))) = (℩𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧))))
156, 11, 143eqtrd 2800 1 (𝜑 → (𝑋 ∨ 𝑌) = (℩𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  {cpr 4586   class class class wbr 5103  ‘cfv 6538  ℩crio 7376  (class class class)co 7420  Basecbs 17387  lecple 17435  lubclub 18483  joincjn 18485
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  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 7377  df-ov 7423  df-oprab 7424  df-lub 18518  df-join 18520
This theorem is used by:  joinlem  18555
  Copyright terms: Public domain W3C validator