| 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 5800 | . . 3 ⊢ Rel {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (glb‘𝐾)} | |
| 2 | meetdmss.k | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ 𝑉) | |
| 3 | eqid 2760 | . . . . . 6 ⊢ (glb‘𝐾) = (glb‘𝐾) | |
| 4 | meetdmss.j | . . . . . 6 ⊢ ∧ = (meet‘𝐾) | |
| 5 | 3, 4 | meetdm 18570 | . . . . 5 ⊢ (𝐾 ∈ 𝑉 → dom ∧ = {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (glb‘𝐾)}) |
| 6 | 2, 5 | syl 18 | . . . 4 ⊢ (𝜑 → dom ∧ = {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (glb‘𝐾)}) |
| 7 | 6 | releqd 5756 | . . 3 ⊢ (𝜑 → (Rel dom ∧ ↔ Rel {〈𝑥, 𝑦〉 ∣ {𝑥, 𝑦} ∈ dom (glb‘𝐾)})) |
| 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 | meetdef 18571 | . . 3 ⊢ (𝜑 → (〈𝑥, 𝑦〉 ∈ dom ∧ ↔ {𝑥, 𝑦} ∈ dom (glb‘𝐾))) |
| 14 | meetdmss.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 15 | eqid 2760 | . . . . . 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 18548 | . . . . 5 ⊢ ((𝜑 ∧ {𝑥, 𝑦} ∈ dom (glb‘𝐾)) → {𝑥, 𝑦} ⊆ 𝐵) |
| 19 | 18 | ex 418 | . . . 4 ⊢ (𝜑 → ({𝑥, 𝑦} ∈ dom (glb‘𝐾) → {𝑥, 𝑦} ⊆ 𝐵)) |
| 20 | 9, 11 | prss 4775 | . . . . 5 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ {𝑥, 𝑦} ⊆ 𝐵) |
| 21 | opelxpi 5688 | . . . . 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 5765 | 1 ⊢ (𝜑 → dom ∧ ⊆ (𝐵 × 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ⊆ wss 3896 {cpr 4586 〈cop 4834 {copab 5166 × cxp 5649 dom cdm 5651 Rel wrel 5656 ‘cfv 6543 Basecbs 17396 lecple 17444 glbcglb 18493 meetcmee 18495 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-oprab 7428 df-glb 18528 df-meet 18530 |
| This theorem is used by: clatl 18691 meetdm2 50220 |
| Copyright terms: Public domain | W3C validator |