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

Theorem thlval 21650
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 3461 . 2 (𝑊𝑉𝑊 ∈ V)
2 thlval.k . . 3 𝐾 = (toHL‘𝑊)
3 fveq2 6834 . . . . . . . 8 ( = 𝑊 → (ClSubSp‘) = (ClSubSp‘𝑊))
4 thlval.c . . . . . . . 8 𝐶 = (ClSubSp‘𝑊)
53, 4eqtr4di 2789 . . . . . . 7 ( = 𝑊 → (ClSubSp‘) = 𝐶)
65fveq2d 6838 . . . . . 6 ( = 𝑊 → (toInc‘(ClSubSp‘)) = (toInc‘𝐶))
7 thlval.i . . . . . 6 𝐼 = (toInc‘𝐶)
86, 7eqtr4di 2789 . . . . 5 ( = 𝑊 → (toInc‘(ClSubSp‘)) = 𝐼)
9 fveq2 6834 . . . . . . 7 ( = 𝑊 → (ocv‘) = (ocv‘𝑊))
10 thlval.o . . . . . . 7 = (ocv‘𝑊)
119, 10eqtr4di 2789 . . . . . 6 ( = 𝑊 → (ocv‘) = )
1211opeq2d 4836 . . . . 5 ( = 𝑊 → ⟨(oc‘ndx), (ocv‘)⟩ = ⟨(oc‘ndx), ⟩)
138, 12oveq12d 7376 . . . 4 ( = 𝑊 → ((toInc‘(ClSubSp‘)) sSet ⟨(oc‘ndx), (ocv‘)⟩) = (𝐼 sSet ⟨(oc‘ndx), ⟩))
14 df-thl 21620 . . . 4 toHL = ( ∈ V ↦ ((toInc‘(ClSubSp‘)) sSet ⟨(oc‘ndx), (ocv‘)⟩))
15 ovex 7391 . . . 4 (𝐼 sSet ⟨(oc‘ndx), ⟩) ∈ V
1613, 14, 15fvmpt 6941 . . 3 (𝑊 ∈ V → (toHL‘𝑊) = (𝐼 sSet ⟨(oc‘ndx), ⟩))
172, 16eqtrid 2783 . 2 (𝑊 ∈ V → 𝐾 = (𝐼 sSet ⟨(oc‘ndx), ⟩))
181, 17syl 17 1 (𝑊𝑉𝐾 = (𝐼 sSet ⟨(oc‘ndx), ⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2113  Vcvv 3440  cop 4586  cfv 6492  (class class class)co 7358   sSet csts 17090  ndxcnx 17120  occoc 17185  toInccipo 18450  ocvcocv 21615  ClSubSpccss 21616  toHLcthl 21617
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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-iota 6448  df-fun 6494  df-fv 6500  df-ov 7361  df-thl 21620
This theorem is referenced by:  thlbas  21651  thlle  21652  thloc  21654
  Copyright terms: Public domain W3C validator