![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > thlval | Structured version Visualization version GIF version |
Description: Value of the Hilbert lattice. (Contributed by Mario Carneiro, 25-Oct-2015.) |
Ref | Expression |
---|---|
thlval.k | ⊢ 𝐾 = (toHL‘𝑊) |
thlval.c | ⊢ 𝐶 = (ClSubSp‘𝑊) |
thlval.i | ⊢ 𝐼 = (toInc‘𝐶) |
thlval.o | ⊢ ⊥ = (ocv‘𝑊) |
Ref | Expression |
---|---|
thlval | ⊢ (𝑊 ∈ 𝑉 → 𝐾 = (𝐼 sSet 〈(oc‘ndx), ⊥ 〉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 3509 | . 2 ⊢ (𝑊 ∈ 𝑉 → 𝑊 ∈ V) | |
2 | thlval.k | . . 3 ⊢ 𝐾 = (toHL‘𝑊) | |
3 | fveq2 6920 | . . . . . . . 8 ⊢ (ℎ = 𝑊 → (ClSubSp‘ℎ) = (ClSubSp‘𝑊)) | |
4 | thlval.c | . . . . . . . 8 ⊢ 𝐶 = (ClSubSp‘𝑊) | |
5 | 3, 4 | eqtr4di 2798 | . . . . . . 7 ⊢ (ℎ = 𝑊 → (ClSubSp‘ℎ) = 𝐶) |
6 | 5 | fveq2d 6924 | . . . . . 6 ⊢ (ℎ = 𝑊 → (toInc‘(ClSubSp‘ℎ)) = (toInc‘𝐶)) |
7 | thlval.i | . . . . . 6 ⊢ 𝐼 = (toInc‘𝐶) | |
8 | 6, 7 | eqtr4di 2798 | . . . . 5 ⊢ (ℎ = 𝑊 → (toInc‘(ClSubSp‘ℎ)) = 𝐼) |
9 | fveq2 6920 | . . . . . . 7 ⊢ (ℎ = 𝑊 → (ocv‘ℎ) = (ocv‘𝑊)) | |
10 | thlval.o | . . . . . . 7 ⊢ ⊥ = (ocv‘𝑊) | |
11 | 9, 10 | eqtr4di 2798 | . . . . . 6 ⊢ (ℎ = 𝑊 → (ocv‘ℎ) = ⊥ ) |
12 | 11 | opeq2d 4904 | . . . . 5 ⊢ (ℎ = 𝑊 → 〈(oc‘ndx), (ocv‘ℎ)〉 = 〈(oc‘ndx), ⊥ 〉) |
13 | 8, 12 | oveq12d 7466 | . . . 4 ⊢ (ℎ = 𝑊 → ((toInc‘(ClSubSp‘ℎ)) sSet 〈(oc‘ndx), (ocv‘ℎ)〉) = (𝐼 sSet 〈(oc‘ndx), ⊥ 〉)) |
14 | df-thl 21706 | . . . 4 ⊢ toHL = (ℎ ∈ V ↦ ((toInc‘(ClSubSp‘ℎ)) sSet 〈(oc‘ndx), (ocv‘ℎ)〉)) | |
15 | ovex 7481 | . . . 4 ⊢ (𝐼 sSet 〈(oc‘ndx), ⊥ 〉) ∈ V | |
16 | 13, 14, 15 | fvmpt 7029 | . . 3 ⊢ (𝑊 ∈ V → (toHL‘𝑊) = (𝐼 sSet 〈(oc‘ndx), ⊥ 〉)) |
17 | 2, 16 | eqtrid 2792 | . 2 ⊢ (𝑊 ∈ V → 𝐾 = (𝐼 sSet 〈(oc‘ndx), ⊥ 〉)) |
18 | 1, 17 | syl 17 | 1 ⊢ (𝑊 ∈ 𝑉 → 𝐾 = (𝐼 sSet 〈(oc‘ndx), ⊥ 〉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2108 Vcvv 3488 〈cop 4654 ‘cfv 6573 (class class class)co 7448 sSet csts 17210 ndxcnx 17240 occoc 17319 toInccipo 18597 ocvcocv 21701 ClSubSpccss 21702 toHLcthl 21703 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-iota 6525 df-fun 6575 df-fv 6581 df-ov 7451 df-thl 21706 |
This theorem is referenced by: thlbas 21737 thlbasOLD 21738 thlle 21739 thlleOLD 21740 thloc 21742 |
Copyright terms: Public domain | W3C validator |