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 17603 | . . 3 ⊢ (𝜑 → 𝐺 = ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓})) |
7 | 6 | dmeqd 5776 | . 2 ⊢ (𝜑 → dom 𝐺 = dom ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓})) |
8 | riotaex 7120 | . . . . 5 ⊢ (℩𝑥 ∈ 𝐵 𝜓) ∈ V | |
9 | eqid 2823 | . . . . 5 ⊢ (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) = (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) | |
10 | 8, 9 | dmmpti 6494 | . . . 4 ⊢ dom (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) = 𝒫 𝐵 |
11 | 10 | ineq2i 4188 | . . 3 ⊢ ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ dom (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓))) = ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ 𝒫 𝐵) |
12 | dmres 5877 | . . 3 ⊢ dom ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) = ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ dom (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓))) | |
13 | dfrab2 4281 | . . 3 ⊢ {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓} = ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ 𝒫 𝐵) | |
14 | 11, 12, 13 | 3eqtr4i 2856 | . 2 ⊢ dom ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) = {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓} |
15 | 7, 14 | syl6eq 2874 | 1 ⊢ (𝜑 → dom 𝐺 = {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 {cab 2801 ∀wral 3140 ∃!wreu 3142 {crab 3144 ∩ cin 3937 𝒫 cpw 4541 class class class wbr 5068 ↦ cmpt 5148 dom cdm 5557 ↾ cres 5559 ‘cfv 6357 ℩crio 7115 Basecbs 16485 lecple 16574 glbcglb 17555 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-glb 17587 |
This theorem is referenced by: glbeldm 17606 xrsclat 30669 |
Copyright terms: Public domain | W3C validator |