Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > glbdm | Structured version Visualization version GIF version |
Description: Domain of the greatest lower bound function of a poset. (Contributed by NM, 6-Sep-2018.) |
Ref | Expression |
---|---|
glbfval.b | ⊢ 𝐵 = (Base‘𝐾) |
glbfval.l | ⊢ ≤ = (le‘𝐾) |
glbfval.g | ⊢ 𝐺 = (glb‘𝐾) |
glbfval.p | ⊢ (𝜓 ↔ (∀𝑦 ∈ 𝑠 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥))) |
glbfval.k | ⊢ (𝜑 → 𝐾 ∈ 𝑉) |
Ref | Expression |
---|---|
glbdm | ⊢ (𝜑 → dom 𝐺 = {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | glbfval.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
2 | glbfval.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
3 | glbfval.g | . . . 4 ⊢ 𝐺 = (glb‘𝐾) | |
4 | glbfval.p | . . . 4 ⊢ (𝜓 ↔ (∀𝑦 ∈ 𝑠 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥))) | |
5 | glbfval.k | . . . 4 ⊢ (𝜑 → 𝐾 ∈ 𝑉) | |
6 | 1, 2, 3, 4, 5 | glbfval 17595 | . . 3 ⊢ (𝜑 → 𝐺 = ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓})) |
7 | 6 | dmeqd 5769 | . 2 ⊢ (𝜑 → dom 𝐺 = dom ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓})) |
8 | riotaex 7112 | . . . . 5 ⊢ (℩𝑥 ∈ 𝐵 𝜓) ∈ V | |
9 | eqid 2821 | . . . . 5 ⊢ (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) = (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) | |
10 | 8, 9 | dmmpti 6487 | . . . 4 ⊢ dom (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) = 𝒫 𝐵 |
11 | 10 | ineq2i 4186 | . . 3 ⊢ ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ dom (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓))) = ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ 𝒫 𝐵) |
12 | dmres 5870 | . . 3 ⊢ dom ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) = ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ dom (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓))) | |
13 | dfrab2 4279 | . . 3 ⊢ {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓} = ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ 𝒫 𝐵) | |
14 | 11, 12, 13 | 3eqtr4i 2854 | . 2 ⊢ dom ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) = {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓} |
15 | 7, 14 | syl6eq 2872 | 1 ⊢ (𝜑 → dom 𝐺 = {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 {cab 2799 ∀wral 3138 ∃!wreu 3140 {crab 3142 ∩ cin 3935 𝒫 cpw 4539 class class class wbr 5059 ↦ cmpt 5139 dom cdm 5550 ↾ cres 5552 ‘cfv 6350 ℩crio 7107 Basecbs 16477 lecple 16566 glbcglb 17547 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-id 5455 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7108 df-glb 17579 |
This theorem is referenced by: glbeldm 17598 xrsclat 30662 |
Copyright terms: Public domain | W3C validator |