Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > lubdm | Structured version Visualization version GIF version |
Description: Domain of the least upper bound function of a poset. (Contributed by NM, 6-Sep-2018.) |
Ref | Expression |
---|---|
lubfval.b | ⊢ 𝐵 = (Base‘𝐾) |
lubfval.l | ⊢ ≤ = (le‘𝐾) |
lubfval.u | ⊢ 𝑈 = (lub‘𝐾) |
lubfval.p | ⊢ (𝜓 ↔ (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))) |
lubfval.k | ⊢ (𝜑 → 𝐾 ∈ 𝑉) |
Ref | Expression |
---|---|
lubdm | ⊢ (𝜑 → dom 𝑈 = {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lubfval.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
2 | lubfval.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
3 | lubfval.u | . . . 4 ⊢ 𝑈 = (lub‘𝐾) | |
4 | lubfval.p | . . . 4 ⊢ (𝜓 ↔ (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))) | |
5 | lubfval.k | . . . 4 ⊢ (𝜑 → 𝐾 ∈ 𝑉) | |
6 | 1, 2, 3, 4, 5 | lubfval 16978 | . . 3 ⊢ (𝜑 → 𝑈 = ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓})) |
7 | 6 | dmeqd 5326 | . 2 ⊢ (𝜑 → dom 𝑈 = dom ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓})) |
8 | riotaex 6615 | . . . . 5 ⊢ (℩𝑥 ∈ 𝐵 𝜓) ∈ V | |
9 | eqid 2622 | . . . . 5 ⊢ (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) = (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) | |
10 | 8, 9 | dmmpti 6023 | . . . 4 ⊢ dom (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) = 𝒫 𝐵 |
11 | 10 | ineq2i 3811 | . . 3 ⊢ ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ dom (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓))) = ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ 𝒫 𝐵) |
12 | dmres 5419 | . . 3 ⊢ dom ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) = ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ dom (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓))) | |
13 | dfrab2 3903 | . . 3 ⊢ {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓} = ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ 𝒫 𝐵) | |
14 | 11, 12, 13 | 3eqtr4i 2654 | . 2 ⊢ dom ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) = {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓} |
15 | 7, 14 | syl6eq 2672 | 1 ⊢ (𝜑 → dom 𝑈 = {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 = wceq 1483 ∈ wcel 1990 {cab 2608 ∀wral 2912 ∃!wreu 2914 {crab 2916 ∩ cin 3573 𝒫 cpw 4158 class class class wbr 4653 ↦ cmpt 4729 dom cdm 5114 ↾ cres 5116 ‘cfv 5888 ℩crio 6610 Basecbs 15857 lecple 15948 lubclub 16942 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-lub 16974 |
This theorem is referenced by: lubeldm 16981 xrsclat 29680 |
Copyright terms: Public domain | W3C validator |