MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  thlval Structured version   Visualization version   GIF version

Theorem thlval 21994
Description: Value of the Hilbert lattice. (Contributed by Mario Carneiro, 25-Oct-2015.)
Hypotheses
Ref Expression
thlval.k 𝐾 = (toHL‘𝑊)
thlval.c 𝐶 = (ClSubSp‘𝑊)
thlval.i 𝐼 = (toInc‘𝐶)
thlval.o ⊥ = (ocv‘𝑊)
Assertion
Ref Expression
thlval (𝑊 ∈ 𝑉 → 𝐾 = (𝐼 sSet ⟨(oc‘ndx), ⊥ ⟩))

Proof of Theorem thlval
Dummy variable ℎ is distinct from all other variables.
StepHypRef Expression
1 elex 3472 . 2 (𝑊 ∈ 𝑉 → 𝑊 ∈ V)
2 thlval.k . . 3 𝐾 = (toHL‘𝑊)
3 fveq2 6883 . . . . . . . 8 (ℎ = 𝑊 → (ClSubSp‘ℎ) = (ClSubSp‘𝑊))
4 thlval.c . . . . . . . 8 𝐶 = (ClSubSp‘𝑊)
53, 4eqtr4di 2814 . . . . . . 7 (ℎ = 𝑊 → (ClSubSp‘ℎ) = 𝐶)
65fveq2d 6887 . . . . . 6 (ℎ = 𝑊 → (toInc‘(ClSubSp‘ℎ)) = (toInc‘𝐶))
7 thlval.i . . . . . 6 𝐼 = (toInc‘𝐶)
86, 7eqtr4di 2814 . . . . 5 (ℎ = 𝑊 → (toInc‘(ClSubSp‘ℎ)) = 𝐼)
9 fveq2 6883 . . . . . . 7 (ℎ = 𝑊 → (ocv‘ℎ) = (ocv‘𝑊))
10 thlval.o . . . . . . 7 ⊥ = (ocv‘𝑊)
119, 10eqtr4di 2814 . . . . . 6 (ℎ = 𝑊 → (ocv‘ℎ) = ⊥ )
1211opeq2d 4840 . . . . 5 (ℎ = 𝑊 → ⟨(oc‘ndx), (ocv‘ℎ)⟩ = ⟨(oc‘ndx), ⊥ ⟩)
138, 12oveq12d 7436 . . . 4 (ℎ = 𝑊 → ((toInc‘(ClSubSp‘ℎ)) sSet ⟨(oc‘ndx), (ocv‘ℎ)⟩) = (𝐼 sSet ⟨(oc‘ndx), ⊥ ⟩))
14 df-thl 21964 . . . 4 toHL = (ℎ ∈ V ↦ ((toInc‘(ClSubSp‘ℎ)) sSet ⟨(oc‘ndx), (ocv‘ℎ)⟩))
15 ovex 7451 . . . 4 (𝐼 sSet ⟨(oc‘ndx), ⊥ ⟩) ∈ V
1613, 14, 15fvmpt 6991 . . 3 (𝑊 ∈ V → (toHL‘𝑊) = (𝐼 sSet ⟨(oc‘ndx), ⊥ ⟩))
172, 16eqtrid 2808 . 2 (𝑊 ∈ V → 𝐾 = (𝐼 sSet ⟨(oc‘ndx), ⊥ ⟩))
181, 17syl 18 1 (𝑊 ∈ 𝑉 → 𝐾 = (𝐼 sSet ⟨(oc‘ndx), ⊥ ⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ⟨cop 4590  ‘cfv 6537  (class class class)co 7418   sSet csts 17334  ndxcnx 17364  occoc 17429  toInccipo 18694  ocvcocv 21959  ClSubSpccss 21960  toHLcthl 21961
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7421  df-thl 21964
This theorem is used by:  thlbas  21995  thlle  21996  thloc  21998
  Copyright terms: Public domain W3C validator