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 3512 | . 2 ⊢ (𝐾 ∈ 𝑉 → 𝐾 ∈ V) | |
2 | pclfval.c | . . 3 ⊢ 𝑈 = (PCl‘𝐾) | |
3 | fveq2 6670 | . . . . . . 7 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾)) | |
4 | pclfval.a | . . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾) | |
5 | 3, 4 | syl6eqr 2874 | . . . . . 6 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴) |
6 | 5 | pweqd 4558 | . . . . 5 ⊢ (𝑘 = 𝐾 → 𝒫 (Atoms‘𝑘) = 𝒫 𝐴) |
7 | fveq2 6670 | . . . . . . . 8 ⊢ (𝑘 = 𝐾 → (PSubSp‘𝑘) = (PSubSp‘𝐾)) | |
8 | pclfval.s | . . . . . . . 8 ⊢ 𝑆 = (PSubSp‘𝐾) | |
9 | 7, 8 | syl6eqr 2874 | . . . . . . 7 ⊢ (𝑘 = 𝐾 → (PSubSp‘𝑘) = 𝑆) |
10 | 9 | rabeqdv 3484 | . . . . . 6 ⊢ (𝑘 = 𝐾 → {𝑦 ∈ (PSubSp‘𝑘) ∣ 𝑥 ⊆ 𝑦} = {𝑦 ∈ 𝑆 ∣ 𝑥 ⊆ 𝑦}) |
11 | 10 | inteqd 4881 | . . . . 5 ⊢ (𝑘 = 𝐾 → ∩ {𝑦 ∈ (PSubSp‘𝑘) ∣ 𝑥 ⊆ 𝑦} = ∩ {𝑦 ∈ 𝑆 ∣ 𝑥 ⊆ 𝑦}) |
12 | 6, 11 | mpteq12dv 5151 | . . . 4 ⊢ (𝑘 = 𝐾 → (𝑥 ∈ 𝒫 (Atoms‘𝑘) ↦ ∩ {𝑦 ∈ (PSubSp‘𝑘) ∣ 𝑥 ⊆ 𝑦}) = (𝑥 ∈ 𝒫 𝐴 ↦ ∩ {𝑦 ∈ 𝑆 ∣ 𝑥 ⊆ 𝑦})) |
13 | df-pclN 37039 | . . . 4 ⊢ PCl = (𝑘 ∈ V ↦ (𝑥 ∈ 𝒫 (Atoms‘𝑘) ↦ ∩ {𝑦 ∈ (PSubSp‘𝑘) ∣ 𝑥 ⊆ 𝑦})) | |
14 | 4 | fvexi 6684 | . . . . . 6 ⊢ 𝐴 ∈ V |
15 | 14 | pwex 5281 | . . . . 5 ⊢ 𝒫 𝐴 ∈ V |
16 | 15 | mptex 6986 | . . . 4 ⊢ (𝑥 ∈ 𝒫 𝐴 ↦ ∩ {𝑦 ∈ 𝑆 ∣ 𝑥 ⊆ 𝑦}) ∈ V |
17 | 12, 13, 16 | fvmpt 6768 | . . 3 ⊢ (𝐾 ∈ V → (PCl‘𝐾) = (𝑥 ∈ 𝒫 𝐴 ↦ ∩ {𝑦 ∈ 𝑆 ∣ 𝑥 ⊆ 𝑦})) |
18 | 2, 17 | syl5eq 2868 | . 2 ⊢ (𝐾 ∈ V → 𝑈 = (𝑥 ∈ 𝒫 𝐴 ↦ ∩ {𝑦 ∈ 𝑆 ∣ 𝑥 ⊆ 𝑦})) |
19 | 1, 18 | syl 17 | 1 ⊢ (𝐾 ∈ 𝑉 → 𝑈 = (𝑥 ∈ 𝒫 𝐴 ↦ ∩ {𝑦 ∈ 𝑆 ∣ 𝑥 ⊆ 𝑦})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 {crab 3142 Vcvv 3494 ⊆ wss 3936 𝒫 cpw 4539 ∩ cint 4876 ↦ cmpt 5146 ‘cfv 6355 Atomscatm 36414 PSubSpcpsubsp 36647 PClcpclN 37038 |
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 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 |
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 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-int 4877 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-pclN 37039 |
This theorem is referenced by: pclvalN 37041 |
Copyright terms: Public domain | W3C validator |