| 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 5771 | . . 3 ⊢ Rel {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (glb‘𝐾)} | |
| 2 | meetdmss.k | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ 𝑉) | |
| 3 | eqid 2737 | . . . . . 6 ⊢ (glb‘𝐾) = (glb‘𝐾) | |
| 4 | meetdmss.j | . . . . . 6 ⊢ ∧ = (meet‘𝐾) | |
| 5 | 3, 4 | meetdm 18347 | . . . . 5 ⊢ (𝐾 ∈ 𝑉 → dom ∧ = {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (glb‘𝐾)}) |
| 6 | 2, 5 | syl 17 | . . . 4 ⊢ (𝜑 → dom ∧ = {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (glb‘𝐾)}) |
| 7 | 6 | releqd 5729 | . . 3 ⊢ (𝜑 → (Rel dom ∧ ↔ Rel {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (glb‘𝐾)})) |
| 8 | 1, 7 | mpbiri 258 | . 2 ⊢ (𝜑 → Rel dom ∧ ) |
| 9 | vex 3434 | . . . . 5 ⊢ 𝑥 ∈ V | |
| 10 | 9 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝑥 ∈ V) |
| 11 | vex 3434 | . . . . 5 ⊢ 𝑦 ∈ V | |
| 12 | 11 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝑦 ∈ V) |
| 13 | 3, 4, 2, 10, 12 | meetdef 18348 | . . 3 ⊢ (𝜑 → (〈𝑥, 𝑦〉 ∈ dom ∧ ↔ {𝑥, 𝑦} ∈ dom (glb‘𝐾))) |
| 14 | meetdmss.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 15 | eqid 2737 | . . . . . 6 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 16 | 2 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ {𝑥, 𝑦} ∈ dom (glb‘𝐾)) → 𝐾 ∈ 𝑉) |
| 17 | simpr 484 | . . . . . 6 ⊢ ((𝜑 ∧ {𝑥, 𝑦} ∈ dom (glb‘𝐾)) → {𝑥, 𝑦} ∈ dom (glb‘𝐾)) | |
| 18 | 14, 15, 3, 16, 17 | glbelss 18325 | . . . . 5 ⊢ ((𝜑 ∧ {𝑥, 𝑦} ∈ dom (glb‘𝐾)) → {𝑥, 𝑦} ⊆ 𝐵) |
| 19 | 18 | ex 412 | . . . 4 ⊢ (𝜑 → ({𝑥, 𝑦} ∈ dom (glb‘𝐾) → {𝑥, 𝑦} ⊆ 𝐵)) |
| 20 | 9, 11 | prss 4764 | . . . . 5 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ {𝑥, 𝑦} ⊆ 𝐵) |
| 21 | opelxpi 5662 | . . . . 5 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐵)) | |
| 22 | 20, 21 | sylbir 235 | . . . 4 ⊢ ({𝑥, 𝑦} ⊆ 𝐵 → 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐵)) |
| 23 | 19, 22 | syl6 35 | . . 3 ⊢ (𝜑 → ({𝑥, 𝑦} ∈ dom (glb‘𝐾) → 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐵))) |
| 24 | 13, 23 | sylbid 240 | . 2 ⊢ (𝜑 → (〈𝑥, 𝑦〉 ∈ dom ∧ → 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐵))) |
| 25 | 8, 24 | relssdv 5738 | 1 ⊢ (𝜑 → dom ∧ ⊆ (𝐵 × 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3430 ⊆ wss 3890 {cpr 4570 〈cop 4574 {copab 5148 × cxp 5623 dom cdm 5625 Rel wrel 5630 ‘cfv 6493 Basecbs 17173 lecple 17221 glbcglb 18270 meetcmee 18272 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-oprab 7365 df-glb 18305 df-meet 18307 |
| This theorem is referenced by: clatl 18468 meetdm2 49460 |
| Copyright terms: Public domain | W3C validator |