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

Theorem thlval 21677
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 3453 . 2 (𝑊𝑉𝑊 ∈ V)
2 thlval.k . . 3 𝐾 = (toHL‘𝑊)
3 fveq2 6834 . . . . . . . 8 ( = 𝑊 → (ClSubSp‘) = (ClSubSp‘𝑊))
4 thlval.c . . . . . . . 8 𝐶 = (ClSubSp‘𝑊)
53, 4eqtr4di 2793 . . . . . . 7 ( = 𝑊 → (ClSubSp‘) = 𝐶)
65fveq2d 6838 . . . . . 6 ( = 𝑊 → (toInc‘(ClSubSp‘)) = (toInc‘𝐶))
7 thlval.i . . . . . 6 𝐼 = (toInc‘𝐶)
86, 7eqtr4di 2793 . . . . 5 ( = 𝑊 → (toInc‘(ClSubSp‘)) = 𝐼)
9 fveq2 6834 . . . . . . 7 ( = 𝑊 → (ocv‘) = (ocv‘𝑊))
10 thlval.o . . . . . . 7 = (ocv‘𝑊)
119, 10eqtr4di 2793 . . . . . 6 ( = 𝑊 → (ocv‘) = )
1211opeq2d 4818 . . . . 5 ( = 𝑊 → ⟨(oc‘ndx), (ocv‘)⟩ = ⟨(oc‘ndx), ⟩)
138, 12oveq12d 7381 . . . 4 ( = 𝑊 → ((toInc‘(ClSubSp‘)) sSet ⟨(oc‘ndx), (ocv‘)⟩) = (𝐼 sSet ⟨(oc‘ndx), ⟩))
14 df-thl 21647 . . . 4 toHL = ( ∈ V ↦ ((toInc‘(ClSubSp‘)) sSet ⟨(oc‘ndx), (ocv‘)⟩))
15 ovex 7396 . . . 4 (𝐼 sSet ⟨(oc‘ndx), ⟩) ∈ V
1613, 14, 15fvmpt 6942 . . 3 (𝑊 ∈ V → (toHL‘𝑊) = (𝐼 sSet ⟨(oc‘ndx), ⟩))
172, 16eqtrid 2787 . 2 (𝑊 ∈ V → 𝐾 = (𝐼 sSet ⟨(oc‘ndx), ⟩))
181, 17syl 17 1 (𝑊𝑉𝐾 = (𝐼 sSet ⟨(oc‘ndx), ⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1547  wcel 2119  Vcvv 3432  cop 4568  cfv 6492  (class class class)co 7363   sSet csts 17131  ndxcnx 17161  occoc 17226  toInccipo 18491  ocvcocv 21642  ClSubSpccss 21643  toHLcthl 21644
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pr 5369
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-iota 6448  df-fun 6494  df-fv 6500  df-ov 7366  df-thl 21647
This theorem is referenced by:  thlbas  21678  thlle  21679  thloc  21681
  Copyright terms: Public domain W3C validator