![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > pmapfval | Structured version Visualization version GIF version |
Description: The projective map of a Hilbert lattice. (Contributed by NM, 2-Oct-2011.) |
Ref | Expression |
---|---|
pmapfval.b | ⊢ 𝐵 = (Base‘𝐾) |
pmapfval.l | ⊢ ≤ = (le‘𝐾) |
pmapfval.a | ⊢ 𝐴 = (Atoms‘𝐾) |
pmapfval.m | ⊢ 𝑀 = (pmap‘𝐾) |
Ref | Expression |
---|---|
pmapfval | ⊢ (𝐾 ∈ 𝐶 → 𝑀 = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 3459 | . 2 ⊢ (𝐾 ∈ 𝐶 → 𝐾 ∈ V) | |
2 | pmapfval.m | . . 3 ⊢ 𝑀 = (pmap‘𝐾) | |
3 | fveq2 6645 | . . . . . 6 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾)) | |
4 | pmapfval.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
5 | 3, 4 | eqtr4di 2851 | . . . . 5 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵) |
6 | fveq2 6645 | . . . . . . 7 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾)) | |
7 | pmapfval.a | . . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾) | |
8 | 6, 7 | eqtr4di 2851 | . . . . . 6 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴) |
9 | fveq2 6645 | . . . . . . . 8 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾)) | |
10 | pmapfval.l | . . . . . . . 8 ⊢ ≤ = (le‘𝐾) | |
11 | 9, 10 | eqtr4di 2851 | . . . . . . 7 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = ≤ ) |
12 | 11 | breqd 5041 | . . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑎(le‘𝑘)𝑥 ↔ 𝑎 ≤ 𝑥)) |
13 | 8, 12 | rabeqbidv 3433 | . . . . 5 ⊢ (𝑘 = 𝐾 → {𝑎 ∈ (Atoms‘𝑘) ∣ 𝑎(le‘𝑘)𝑥} = {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥}) |
14 | 5, 13 | mpteq12dv 5115 | . . . 4 ⊢ (𝑘 = 𝐾 → (𝑥 ∈ (Base‘𝑘) ↦ {𝑎 ∈ (Atoms‘𝑘) ∣ 𝑎(le‘𝑘)𝑥}) = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥})) |
15 | df-pmap 36800 | . . . 4 ⊢ pmap = (𝑘 ∈ V ↦ (𝑥 ∈ (Base‘𝑘) ↦ {𝑎 ∈ (Atoms‘𝑘) ∣ 𝑎(le‘𝑘)𝑥})) | |
16 | 14, 15, 4 | mptfvmpt 6968 | . . 3 ⊢ (𝐾 ∈ V → (pmap‘𝐾) = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥})) |
17 | 2, 16 | syl5eq 2845 | . 2 ⊢ (𝐾 ∈ V → 𝑀 = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥})) |
18 | 1, 17 | syl 17 | 1 ⊢ (𝐾 ∈ 𝐶 → 𝑀 = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 {crab 3110 Vcvv 3441 class class class wbr 5030 ↦ cmpt 5110 ‘cfv 6324 Basecbs 16475 lecple 16564 Atomscatm 36559 pmapcpmap 36793 |
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-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-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 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-pmap 36800 |
This theorem is referenced by: pmapval 37053 |
Copyright terms: Public domain | W3C validator |