| 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 | relopab 5812 | . . 3 ⊢ Rel {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (glb‘𝐾)} | |
| 2 | meetdmss.k | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ 𝑉) | |
| 3 | eqid 2763 | . . . . . 6 ⊢ (glb‘𝐾) = (glb‘𝐾) | |
| 4 | meetdmss.j | . . . . . 6 ⊢ ∧ = (meet‘𝐾) | |
| 5 | 3, 4 | meetdm 18611 | . . . . 5 ⊢ (𝐾 ∈ 𝑉 → dom ∧ = {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (glb‘𝐾)}) |
| 6 | 2, 5 | syl 18 | . . . 4 ⊢ (𝜑 → dom ∧ = {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (glb‘𝐾)}) |
| 7 | 6 | releqd 5763 | . . 3 ⊢ (𝜑 → (Rel dom ∧ ↔ Rel {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (glb‘𝐾)})) |
| 8 | 1, 7 | mpbiri 261 | . 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 18612 | . . 3 ⊢ (𝜑 → (〈𝑥, 𝑦〉 ∈ dom ∧ ↔ {𝑥, 𝑦} ∈ dom (glb‘𝐾))) |
| 14 | meetdmss.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 15 | eqid 2763 | . . . . . 6 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 16 | 2 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ {𝑥, 𝑦} ∈ dom (glb‘𝐾)) → 𝐾 ∈ 𝑉) |
| 17 | simpr 490 | . . . . . 6 ⊢ ((𝜑 ∧ {𝑥, 𝑦} ∈ dom (glb‘𝐾)) → {𝑥, 𝑦} ∈ dom (glb‘𝐾)) | |
| 18 | 14, 15, 3, 16, 17 | glbelss 18589 | . . . . 5 ⊢ ((𝜑 ∧ {𝑥, 𝑦} ∈ dom (glb‘𝐾)) → {𝑥, 𝑦} ⊆ 𝐵) |
| 19 | 18 | ex 418 | . . . 4 ⊢ (𝜑 → ({𝑥, 𝑦} ∈ dom (glb‘𝐾) → {𝑥, 𝑦} ⊆ 𝐵)) |
| 20 | 9, 11 | prss 4781 | . . . . 5 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ {𝑥, 𝑦} ⊆ 𝐵) |
| 21 | opelxpi 5695 | . . . . 5 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐵)) | |
| 22 | 20, 21 | sylbir 238 | . . . 4 ⊢ ({𝑥, 𝑦} ⊆ 𝐵 → 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐵)) |
| 23 | 19, 22 | syl6 36 | . . 3 ⊢ (𝜑 → ({𝑥, 𝑦} ∈ dom (glb‘𝐾) → 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐵))) |
| 24 | 13, 23 | sylbid 243 | . 2 ⊢ (𝜑 → (〈𝑥, 𝑦〉 ∈ dom ∧ → 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐵))) |
| 25 | 8, 24 | relssdv 5773 | 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 4840 {copab 5173 × cxp 5656 dom cdm 5658 Rel wrel 5663 ‘cfv 6566 Basecbs 17431 lecple 17479 glbcglb 18534 meetcmee 18536 |
| 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 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| 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 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-oprab 7455 df-glb 18569 df-meet 18571 |
| This theorem is used by: clatl 18732 meetdm2 50415 |
| Copyright terms: Public domain | W3C validator |