![]() |
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 17025 | . . 3 ⊢ (𝜑 → 𝑈 = ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓})) |
7 | 6 | dmeqd 5358 | . 2 ⊢ (𝜑 → dom 𝑈 = dom ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓})) |
8 | riotaex 6655 | . . . . 5 ⊢ (℩𝑥 ∈ 𝐵 𝜓) ∈ V | |
9 | eqid 2651 | . . . . 5 ⊢ (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) = (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) | |
10 | 8, 9 | dmmpti 6061 | . . . 4 ⊢ dom (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) = 𝒫 𝐵 |
11 | 10 | ineq2i 3844 | . . 3 ⊢ ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ dom (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓))) = ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ 𝒫 𝐵) |
12 | dmres 5454 | . . 3 ⊢ dom ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) = ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ dom (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓))) | |
13 | dfrab2 3936 | . . 3 ⊢ {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓} = ({𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓} ∩ 𝒫 𝐵) | |
14 | 11, 12, 13 | 3eqtr4i 2683 | . 2 ⊢ dom ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 𝜓)) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) = {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓} |
15 | 7, 14 | syl6eq 2701 | 1 ⊢ (𝜑 → dom 𝑈 = {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 𝜓}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 383 = wceq 1523 ∈ wcel 2030 {cab 2637 ∀wral 2941 ∃!wreu 2943 {crab 2945 ∩ cin 3606 𝒫 cpw 4191 class class class wbr 4685 ↦ cmpt 4762 dom cdm 5143 ↾ cres 5145 ‘cfv 5926 ℩crio 6650 Basecbs 15904 lecple 15995 lubclub 16989 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-rep 4804 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-ral 2946 df-rex 2947 df-reu 2948 df-rab 2950 df-v 3233 df-sbc 3469 df-csb 3567 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-op 4217 df-uni 4469 df-iun 4554 df-br 4686 df-opab 4746 df-mpt 4763 df-id 5053 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-iota 5889 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-fv 5934 df-riota 6651 df-lub 17021 |
This theorem is referenced by: lubeldm 17028 xrsclat 29808 |
Copyright terms: Public domain | W3C validator |