![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > pclfvalN | Structured version Visualization version GIF version |
Description: The projective subspace closure function. (Contributed by NM, 7-Sep-2013.) (New usage is discouraged.) |
Ref | Expression |
---|---|
pclfval.a | ⊢ 𝐴 = (Atoms‘𝐾) |
pclfval.s | ⊢ 𝑆 = (PSubSp‘𝐾) |
pclfval.c | ⊢ 𝑈 = (PCl‘𝐾) |
Ref | Expression |
---|---|
pclfvalN | ⊢ (𝐾 ∈ 𝑉 → 𝑈 = (𝑥 ∈ 𝒫 𝐴 ↦ ∩ {𝑦 ∈ 𝑆 ∣ 𝑥 ⊆ 𝑦})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 3459 | . 2 ⊢ (𝐾 ∈ 𝑉 → 𝐾 ∈ V) | |
2 | pclfval.c | . . 3 ⊢ 𝑈 = (PCl‘𝐾) | |
3 | fveq2 6645 | . . . . . . 7 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾)) | |
4 | pclfval.a | . . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾) | |
5 | 3, 4 | eqtr4di 2851 | . . . . . 6 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴) |
6 | 5 | pweqd 4516 | . . . . 5 ⊢ (𝑘 = 𝐾 → 𝒫 (Atoms‘𝑘) = 𝒫 𝐴) |
7 | fveq2 6645 | . . . . . . . 8 ⊢ (𝑘 = 𝐾 → (PSubSp‘𝑘) = (PSubSp‘𝐾)) | |
8 | pclfval.s | . . . . . . . 8 ⊢ 𝑆 = (PSubSp‘𝐾) | |
9 | 7, 8 | eqtr4di 2851 | . . . . . . 7 ⊢ (𝑘 = 𝐾 → (PSubSp‘𝑘) = 𝑆) |
10 | 9 | rabeqdv 3432 | . . . . . 6 ⊢ (𝑘 = 𝐾 → {𝑦 ∈ (PSubSp‘𝑘) ∣ 𝑥 ⊆ 𝑦} = {𝑦 ∈ 𝑆 ∣ 𝑥 ⊆ 𝑦}) |
11 | 10 | inteqd 4843 | . . . . 5 ⊢ (𝑘 = 𝐾 → ∩ {𝑦 ∈ (PSubSp‘𝑘) ∣ 𝑥 ⊆ 𝑦} = ∩ {𝑦 ∈ 𝑆 ∣ 𝑥 ⊆ 𝑦}) |
12 | 6, 11 | mpteq12dv 5115 | . . . 4 ⊢ (𝑘 = 𝐾 → (𝑥 ∈ 𝒫 (Atoms‘𝑘) ↦ ∩ {𝑦 ∈ (PSubSp‘𝑘) ∣ 𝑥 ⊆ 𝑦}) = (𝑥 ∈ 𝒫 𝐴 ↦ ∩ {𝑦 ∈ 𝑆 ∣ 𝑥 ⊆ 𝑦})) |
13 | df-pclN 37184 | . . . 4 ⊢ PCl = (𝑘 ∈ V ↦ (𝑥 ∈ 𝒫 (Atoms‘𝑘) ↦ ∩ {𝑦 ∈ (PSubSp‘𝑘) ∣ 𝑥 ⊆ 𝑦})) | |
14 | 4 | fvexi 6659 | . . . . . 6 ⊢ 𝐴 ∈ V |
15 | 14 | pwex 5246 | . . . . 5 ⊢ 𝒫 𝐴 ∈ V |
16 | 15 | mptex 6963 | . . . 4 ⊢ (𝑥 ∈ 𝒫 𝐴 ↦ ∩ {𝑦 ∈ 𝑆 ∣ 𝑥 ⊆ 𝑦}) ∈ V |
17 | 12, 13, 16 | fvmpt 6745 | . . 3 ⊢ (𝐾 ∈ V → (PCl‘𝐾) = (𝑥 ∈ 𝒫 𝐴 ↦ ∩ {𝑦 ∈ 𝑆 ∣ 𝑥 ⊆ 𝑦})) |
18 | 2, 17 | syl5eq 2845 | . 2 ⊢ (𝐾 ∈ V → 𝑈 = (𝑥 ∈ 𝒫 𝐴 ↦ ∩ {𝑦 ∈ 𝑆 ∣ 𝑥 ⊆ 𝑦})) |
19 | 1, 18 | syl 17 | 1 ⊢ (𝐾 ∈ 𝑉 → 𝑈 = (𝑥 ∈ 𝒫 𝐴 ↦ ∩ {𝑦 ∈ 𝑆 ∣ 𝑥 ⊆ 𝑦})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 {crab 3110 Vcvv 3441 ⊆ wss 3881 𝒫 cpw 4497 ∩ cint 4838 ↦ cmpt 5110 ‘cfv 6324 Atomscatm 36559 PSubSpcpsubsp 36792 PClcpclN 37183 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-pclN 37184 |
This theorem is referenced by: pclvalN 37186 |
Copyright terms: Public domain | W3C validator |