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 16814 | . . 3 ⊢ (𝜑 → 𝐺 = ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓})) |
7 | 6 | dmeqd 5248 | . 2 ⊢ (𝜑 → dom 𝐺 = dom ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓})) |
8 | riotaex 6515 | . . . . 5 ⊢ (℩𝑥 ∈ 𝐵 𝜓) ∈ V | |
9 | eqid 2610 | . . . . 5 ⊢ (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) = (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) | |
10 | 8, 9 | dmmpti 5936 | . . . 4 ⊢ dom (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) = 𝒫 𝐵 |
11 | 10 | ineq2i 3773 | . . 3 ⊢ ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ dom (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓))) = ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ 𝒫 𝐵) |
12 | dmres 5339 | . . 3 ⊢ dom ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) = ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ dom (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓))) | |
13 | dfrab2 3862 | . . 3 ⊢ {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓} = ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ 𝒫 𝐵) | |
14 | 11, 12, 13 | 3eqtr4i 2642 | . 2 ⊢ dom ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) = {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓} |
15 | 7, 14 | syl6eq 2660 | 1 ⊢ (𝜑 → dom 𝐺 = {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 {cab 2596 ∀wral 2896 ∃!wreu 2898 {crab 2900 ∩ cin 3539 𝒫 cpw 4108 class class class wbr 4583 ↦ cmpt 4643 dom cdm 5038 ↾ cres 5040 ‘cfv 5804 ℩crio 6510 Basecbs 15695 lecple 15775 glbcglb 16766 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-glb 16798 |
This theorem is referenced by: glbeldm 16817 xrsclat 29011 |
Copyright terms: Public domain | W3C validator |