| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > meetdmss | Structured version Visualization version GIF version | ||
| Description: Subset property of domain of meet. (Contributed by NM, 12-Sep-2018.) |
| Ref | Expression |
|---|---|
| meetdmss.b | ⊢ 𝐵 = (Base‘𝐾) |
| meetdmss.j | ⊢ ∧ = (meet‘𝐾) |
| meetdmss.k | ⊢ (𝜑 → 𝐾 ∈ 𝑉) |
| Ref | Expression |
|---|---|
| meetdmss | ⊢ (𝜑 → dom ∧ ⊆ (𝐵 × 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relopabv 5794 | . . 3 ⊢ Rel {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (glb‘𝐾)} | |
| 2 | meetdmss.k | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ 𝑉) | |
| 3 | eqid 2762 | . . . . . 6 ⊢ (glb‘𝐾) = (glb‘𝐾) | |
| 4 | meetdmss.j | . . . . . 6 ⊢ ∧ = (meet‘𝐾) | |
| 5 | 3, 4 | meetdm 18419 | . . . . 5 ⊢ (𝐾 ∈ 𝑉 → dom ∧ = {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (glb‘𝐾)}) |
| 6 | 2, 5 | syl 17 | . . . 4 ⊢ (𝜑 → dom ∧ = {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (glb‘𝐾)}) |
| 7 | 6 | releqd 5751 | . . 3 ⊢ (𝜑 → (Rel dom ∧ ↔ Rel {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (glb‘𝐾)})) |
| 8 | 1, 7 | mpbiri 260 | . 2 ⊢ (𝜑 → Rel dom ∧ ) |
| 9 | vex 3458 | . . . . 5 ⊢ 𝑥 ∈ V | |
| 10 | 9 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝑥 ∈ V) |
| 11 | vex 3458 | . . . . 5 ⊢ 𝑦 ∈ V | |
| 12 | 11 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝑦 ∈ V) |
| 13 | 3, 4, 2, 10, 12 | meetdef 18420 | . . 3 ⊢ (𝜑 → (〈𝑥, 𝑦〉 ∈ dom ∧ ↔ {𝑥, 𝑦} ∈ dom (glb‘𝐾))) |
| 14 | meetdmss.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 15 | eqid 2762 | . . . . . 6 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 16 | 2 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ {𝑥, 𝑦} ∈ dom (glb‘𝐾)) → 𝐾 ∈ 𝑉) |
| 17 | simpr 488 | . . . . . 6 ⊢ ((𝜑 ∧ {𝑥, 𝑦} ∈ dom (glb‘𝐾)) → {𝑥, 𝑦} ∈ dom (glb‘𝐾)) | |
| 18 | 14, 15, 3, 16, 17 | glbelss 18397 | . . . . 5 ⊢ ((𝜑 ∧ {𝑥, 𝑦} ∈ dom (glb‘𝐾)) → {𝑥, 𝑦} ⊆ 𝐵) |
| 19 | 18 | ex 416 | . . . 4 ⊢ (𝜑 → ({𝑥, 𝑦} ∈ dom (glb‘𝐾) → {𝑥, 𝑦} ⊆ 𝐵)) |
| 20 | 9, 11 | prss 4778 | . . . . 5 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ {𝑥, 𝑦} ⊆ 𝐵) |
| 21 | opelxpi 5684 | . . . . 5 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐵)) | |
| 22 | 20, 21 | sylbir 237 | . . . 4 ⊢ ({𝑥, 𝑦} ⊆ 𝐵 → 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐵)) |
| 23 | 19, 22 | syl6 35 | . . 3 ⊢ (𝜑 → ({𝑥, 𝑦} ∈ dom (glb‘𝐾) → 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐵))) |
| 24 | 13, 23 | sylbid 242 | . 2 ⊢ (𝜑 → (〈𝑥, 𝑦〉 ∈ dom ∧ → 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐵))) |
| 25 | 8, 24 | relssdv 5760 | 1 ⊢ (𝜑 → dom ∧ ⊆ (𝐵 × 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1560 ∈ wcel 2142 Vcvv 3454 ⊆ wss 3904 {cpr 4584 〈cop 4588 {copab 5162 × cxp 5645 dom cdm 5647 Rel wrel 5652 ‘cfv 6521 Basecbs 17245 lecple 17293 glbcglb 18342 meetcmee 18344 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 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 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-oprab 7400 df-glb 18377 df-meet 18379 |
| This theorem is referenced by: clatl 18540 meetdm2 49588 |
| Copyright terms: Public domain | W3C validator |