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

Theorem thlval 21908
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 3471 . 2 (𝑊𝑉𝑊 ∈ V)
2 thlval.k . . 3 𝐾 = (toHL‘𝑊)
3 fveq2 6878 . . . . . . . 8 ( = 𝑊 → (ClSubSp‘) = (ClSubSp‘𝑊))
4 thlval.c . . . . . . . 8 𝐶 = (ClSubSp‘𝑊)
53, 4eqtr4di 2813 . . . . . . 7 ( = 𝑊 → (ClSubSp‘) = 𝐶)
65fveq2d 6882 . . . . . 6 ( = 𝑊 → (toInc‘(ClSubSp‘)) = (toInc‘𝐶))
7 thlval.i . . . . . 6 𝐼 = (toInc‘𝐶)
86, 7eqtr4di 2813 . . . . 5 ( = 𝑊 → (toInc‘(ClSubSp‘)) = 𝐼)
9 fveq2 6878 . . . . . . 7 ( = 𝑊 → (ocv‘) = (ocv‘𝑊))
10 thlval.o . . . . . . 7 = (ocv‘𝑊)
119, 10eqtr4di 2813 . . . . . 6 ( = 𝑊 → (ocv‘) = )
1211opeq2d 4840 . . . . 5 ( = 𝑊 → ⟨(oc‘ndx), (ocv‘)⟩ = ⟨(oc‘ndx), ⟩)
138, 12oveq12d 7431 . . . 4 ( = 𝑊 → ((toInc‘(ClSubSp‘)) sSet ⟨(oc‘ndx), (ocv‘)⟩) = (𝐼 sSet ⟨(oc‘ndx), ⟩))
14 df-thl 21878 . . . 4 toHL = ( ∈ V ↦ ((toInc‘(ClSubSp‘)) sSet ⟨(oc‘ndx), (ocv‘)⟩))
15 ovex 7446 . . . 4 (𝐼 sSet ⟨(oc‘ndx), ⟩) ∈ V
1613, 14, 15fvmpt 6986 . . 3 (𝑊 ∈ V → (toHL‘𝑊) = (𝐼 sSet ⟨(oc‘ndx), ⟩))
172, 16eqtrid 2807 . 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 3450  cop 4590  cfv 6533  (class class class)co 7413   sSet csts 17255  ndxcnx 17285  occoc 17350  toInccipo 18615  ocvcocv 21873  ClSubSpccss 21874  toHLcthl 21875
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 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  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 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7416  df-thl 21878
This theorem is used by:  thlbas  21909  thlle  21910  thloc  21912
  Copyright terms: Public domain W3C validator