Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  lhpset Structured version   Visualization version   GIF version

Theorem lhpset 41032
Description: The set of co-atoms (lattice hyperplanes). (Contributed by NM, 11-May-2012.)
Hypotheses
Ref Expression
lhpset.b 𝐵 = (Base‘𝐾)
lhpset.u 1 = (1.‘𝐾)
lhpset.c 𝐶 = ( ⋖ ‘𝐾)
lhpset.h 𝐻 = (LHyp‘𝐾)
Assertion
Ref Expression
lhpset (𝐾 ∈ 𝐴 → 𝐻 = {𝑤 ∈ 𝐵 ∣ 𝑤𝐶 1 })
Distinct variable groups:   𝑤,𝐵   𝑤,𝐶   𝑤,𝐾   𝑤, 1
Allowed substitution hints:   𝐴(𝑤)   𝐻(𝑤)

Proof of Theorem lhpset
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 elex 3472 . 2 (𝐾 ∈ 𝐴 → 𝐾 ∈ V)
2 lhpset.h . . 3 𝐻 = (LHyp‘𝐾)
3 fveq2 6883 . . . . . 6 (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
4 lhpset.b . . . . . 6 𝐵 = (Base‘𝐾)
53, 4eqtr4di 2814 . . . . 5 (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
6 eqidd 2762 . . . . . 6 (𝑘 = 𝐾 → 𝑤 = 𝑤)
7 fveq2 6883 . . . . . . 7 (𝑘 = 𝐾 → ( ⋖ ‘𝑘) = ( ⋖ ‘𝐾))
8 lhpset.c . . . . . . 7 𝐶 = ( ⋖ ‘𝐾)
97, 8eqtr4di 2814 . . . . . 6 (𝑘 = 𝐾 → ( ⋖ ‘𝑘) = 𝐶)
10 fveq2 6883 . . . . . . 7 (𝑘 = 𝐾 → (1.‘𝑘) = (1.‘𝐾))
11 lhpset.u . . . . . . 7 1 = (1.‘𝐾)
1210, 11eqtr4di 2814 . . . . . 6 (𝑘 = 𝐾 → (1.‘𝑘) = 1 )
136, 9, 12breq123d 5117 . . . . 5 (𝑘 = 𝐾 → (𝑤( ⋖ ‘𝑘)(1.‘𝑘) ↔ 𝑤𝐶 1 ))
145, 13rabeqbidv 3430 . . . 4 (𝑘 = 𝐾 → {𝑤 ∈ (Base‘𝑘) ∣ 𝑤( ⋖ ‘𝑘)(1.‘𝑘)} = {𝑤 ∈ 𝐵 ∣ 𝑤𝐶 1 })
15 df-lhyp 41025 . . . 4 LHyp = (𝑘 ∈ V ↦ {𝑤 ∈ (Base‘𝑘) ∣ 𝑤( ⋖ ‘𝑘)(1.‘𝑘)})
164fvexi 6897 . . . . 5 𝐵 ∈ V
1716rabex 5300 . . . 4 {𝑤 ∈ 𝐵 ∣ 𝑤𝐶 1 } ∈ V
1814, 15, 17fvmpt 6991 . . 3 (𝐾 ∈ V → (LHyp‘𝐾) = {𝑤 ∈ 𝐵 ∣ 𝑤𝐶 1 })
192, 18eqtrid 2808 . 2 (𝐾 ∈ V → 𝐻 = {𝑤 ∈ 𝐵 ∣ 𝑤𝐶 1 })
201, 19syl 18 1 (𝐾 ∈ 𝐴 → 𝐻 = {𝑤 ∈ 𝐵 ∣ 𝑤𝐶 1 })
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  {crab 3413  Vcvv 3451   class class class wbr 5103  ‘cfv 6537  Basecbs 17380  1.cp1 18589   ⋖ ccvr 40299  LHypclh 41021
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-pw 4559  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-lhyp 41025
This theorem is used by:  islhp  41033
  Copyright terms: Public domain W3C validator