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

Theorem joindmss 18580
Description: Subset property of domain of join. (Contributed by NM, 12-Sep-2018.)
Hypotheses
Ref Expression
joindmss.b 𝐵 = (Base‘𝐾)
joindmss.j ∨ = (join‘𝐾)
joindmss.k (𝜑 → 𝐾 ∈ 𝑉)
Assertion
Ref Expression
joindmss (𝜑 → dom ∨ ⊆ (𝐵 × 𝐵))

Proof of Theorem joindmss
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relopab 5808 . . 3 Rel {⟨𝑥, 𝑦⟩ ∣ {𝑥, 𝑦} ∈ dom (lub‘𝐾)}
2 joindmss.k . . . . 5 (𝜑 → 𝐾 ∈ 𝑉)
3 eqid 2763 . . . . . 6 (lub‘𝐾) = (lub‘𝐾)
4 joindmss.j . . . . . 6 ∨ = (join‘𝐾)
53, 4joindm 18576 . . . . 5 (𝐾 ∈ 𝑉 → dom ∨ = {⟨𝑥, 𝑦⟩ ∣ {𝑥, 𝑦} ∈ dom (lub‘𝐾)})
62, 5syl 18 . . . 4 (𝜑 → dom ∨ = {⟨𝑥, 𝑦⟩ ∣ {𝑥, 𝑦} ∈ dom (lub‘𝐾)})
76releqd 5760 . . 3 (𝜑 → (Rel dom ∨ ↔ Rel {⟨𝑥, 𝑦⟩ ∣ {𝑥, 𝑦} ∈ dom (lub‘𝐾)}))
81, 7mpbiri 261 . 2 (𝜑 → Rel dom ∨ )
9 vex 3458 . . . . 5 𝑥 ∈ V
109a1i 11 . . . 4 (𝜑 → 𝑥 ∈ V)
11 vex 3458 . . . . 5 𝑦 ∈ V
1211a1i 11 . . . 4 (𝜑 → 𝑦 ∈ V)
133, 4, 2, 10, 12joindef 18577 . . 3 (𝜑 → (⟨𝑥, 𝑦⟩ ∈ dom ∨ ↔ {𝑥, 𝑦} ∈ dom (lub‘𝐾)))
14 joindmss.b . . . . . 6 𝐵 = (Base‘𝐾)
15 eqid 2763 . . . . . 6 (le‘𝐾) = (le‘𝐾)
162adantr 486 . . . . . 6 ((𝜑 ∧ {𝑥, 𝑦} ∈ dom (lub‘𝐾)) → 𝐾 ∈ 𝑉)
17 simpr 490 . . . . . 6 ((𝜑 ∧ {𝑥, 𝑦} ∈ dom (lub‘𝐾)) → {𝑥, 𝑦} ∈ dom (lub‘𝐾))
1814, 15, 3, 16, 17lubelss 18555 . . . . 5 ((𝜑 ∧ {𝑥, 𝑦} ∈ dom (lub‘𝐾)) → {𝑥, 𝑦} ⊆ 𝐵)
1918ex 418 . . . 4 (𝜑 → ({𝑥, 𝑦} ∈ dom (lub‘𝐾) → {𝑥, 𝑦} ⊆ 𝐵))
209, 11prss 4779 . . . . 5 ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ {𝑥, 𝑦} ⊆ 𝐵)
21 opelxpi 5692 . . . . 5 ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵))
2220, 21sylbir 238 . . . 4 ({𝑥, 𝑦} ⊆ 𝐵 → ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵))
2319, 22syl6 36 . . 3 (𝜑 → ({𝑥, 𝑦} ∈ dom (lub‘𝐾) → ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵)))
2413, 23sylbid 243 . 2 (𝜑 → (⟨𝑥, 𝑦⟩ ∈ dom ∨ → ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵)))
258, 24relssdv 5769 1 (𝜑 → dom ∨ ⊆ (𝐵 × 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900  {cpr 4590  ⟨cop 4838  {copab 5170   × cxp 5653  dom cdm 5655  Rel wrel 5660  ‘cfv 6558  Basecbs 17416  lecple 17464  lubclub 18512  joincjn 18514
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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-oprab 7447  df-lub 18547  df-join 18549
This theorem is used by:  clatl  18711  joindm2  50287
  Copyright terms: Public domain W3C validator