| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > joindmss | Structured version Visualization version GIF version | ||
| Description: Subset property of domain of join. (Contributed by NM, 12-Sep-2018.) |
| Ref | Expression |
|---|---|
| joindmss.b | ⊢ 𝐵 = (Base‘𝐾) |
| joindmss.j | ⊢ ∨ = (join‘𝐾) |
| joindmss.k | ⊢ (𝜑 → 𝐾 ∈ 𝑉) |
| Ref | Expression |
|---|---|
| joindmss | ⊢ (𝜑 → dom ∨ ⊆ (𝐵 × 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relopabv 5795 | . . 3 ⊢ Rel {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (lub‘𝐾)} | |
| 2 | joindmss.k | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ 𝑉) | |
| 3 | eqid 2760 | . . . . . 6 ⊢ (lub‘𝐾) = (lub‘𝐾) | |
| 4 | joindmss.j | . . . . . 6 ⊢ ∨ = (join‘𝐾) | |
| 5 | 3, 4 | joindm 18509 | . . . . 5 ⊢ (𝐾 ∈ 𝑉 → dom ∨ = {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (lub‘𝐾)}) |
| 6 | 2, 5 | syl 18 | . . . 4 ⊢ (𝜑 → dom ∨ = {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (lub‘𝐾)}) |
| 7 | 6 | releqd 5751 | . . 3 ⊢ (𝜑 → (Rel dom ∨ ↔ Rel {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (lub‘𝐾)})) |
| 8 | 1, 7 | mpbiri 261 | . 2 ⊢ (𝜑 → Rel dom ∨ ) |
| 9 | vex 3454 | . . . . 5 ⊢ 𝑥 ∈ V | |
| 10 | 9 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝑥 ∈ V) |
| 11 | vex 3454 | . . . . 5 ⊢ 𝑦 ∈ V | |
| 12 | 11 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝑦 ∈ V) |
| 13 | 3, 4, 2, 10, 12 | joindef 18510 | . . 3 ⊢ (𝜑 → (〈𝑥, 𝑦〉 ∈ dom ∨ ↔ {𝑥, 𝑦} ∈ dom (lub‘𝐾))) |
| 14 | joindmss.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 15 | eqid 2760 | . . . . . 6 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 16 | 2 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ {𝑥, 𝑦} ∈ dom (lub‘𝐾)) → 𝐾 ∈ 𝑉) |
| 17 | simpr 490 | . . . . . 6 ⊢ ((𝜑 ∧ {𝑥, 𝑦} ∈ dom (lub‘𝐾)) → {𝑥, 𝑦} ∈ dom (lub‘𝐾)) | |
| 18 | 14, 15, 3, 16, 17 | lubelss 18488 | . . . . 5 ⊢ ((𝜑 ∧ {𝑥, 𝑦} ∈ dom (lub‘𝐾)) → {𝑥, 𝑦} ⊆ 𝐵) |
| 19 | 18 | ex 418 | . . . 4 ⊢ (𝜑 → ({𝑥, 𝑦} ∈ dom (lub‘𝐾) → {𝑥, 𝑦} ⊆ 𝐵)) |
| 20 | 9, 11 | prss 4780 | . . . . 5 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ {𝑥, 𝑦} ⊆ 𝐵) |
| 21 | opelxpi 5684 | . . . . 5 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐵)) | |
| 22 | 20, 21 | sylbir 238 | . . . 4 ⊢ ({𝑥, 𝑦} ⊆ 𝐵 → 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐵)) |
| 23 | 19, 22 | syl6 36 | . . 3 ⊢ (𝜑 → ({𝑥, 𝑦} ∈ dom (lub‘𝐾) → 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐵))) |
| 24 | 13, 23 | sylbid 243 | . 2 ⊢ (𝜑 → (〈𝑥, 𝑦〉 ∈ dom ∨ → 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐵))) |
| 25 | 8, 24 | relssdv 5760 | 1 ⊢ (𝜑 → dom ∨ ⊆ (𝐵 × 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 Vcvv 3450 ⊆ wss 3898 {cpr 4585 〈cop 4589 {copab 5166 × cxp 5645 dom cdm 5647 Rel wrel 5652 ‘cfv 6527 Basecbs 17349 lecple 17397 lubclub 18445 joincjn 18447 |
| 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 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-oprab 7412 df-lub 18480 df-join 18482 |
| This theorem is used by: clatl 18644 joindm2 49998 |
| Copyright terms: Public domain | W3C validator |