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

Theorem llnset 40164
Description: The set of lattice lines in a Hilbert lattice. (Contributed by NM, 16-Jun-2012.)
Hypotheses
Ref Expression
llnset.b 𝐵 = (Base‘𝐾)
llnset.c 𝐶 = ( ⋖ ‘𝐾)
llnset.a 𝐴 = (Atoms‘𝐾)
llnset.n 𝑁 = (LLines‘𝐾)
Assertion
Ref Expression
llnset (𝐾𝐷𝑁 = {𝑥𝐵 ∣ ∃𝑝𝐴 𝑝𝐶𝑥})
Distinct variable groups:   𝐴,𝑝   𝑥,𝐵   𝑥,𝑝,𝐾
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑝)   𝐶(𝑥,𝑝)   𝐷(𝑥,𝑝)   𝑁(𝑥,𝑝)

Proof of Theorem llnset
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 elex 3484 . 2 (𝐾𝐷𝐾 ∈ V)
2 llnset.n . . 3 𝑁 = (LLines‘𝐾)
3 fveq2 6879 . . . . . 6 (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
4 llnset.b . . . . . 6 𝐵 = (Base‘𝐾)
53, 4eqtr4di 2822 . . . . 5 (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
6 fveq2 6879 . . . . . . 7 (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
7 llnset.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
86, 7eqtr4di 2822 . . . . . 6 (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
9 fveq2 6879 . . . . . . . 8 (𝑘 = 𝐾 → ( ⋖ ‘𝑘) = ( ⋖ ‘𝐾))
10 llnset.c . . . . . . . 8 𝐶 = ( ⋖ ‘𝐾)
119, 10eqtr4di 2822 . . . . . . 7 (𝑘 = 𝐾 → ( ⋖ ‘𝑘) = 𝐶)
1211breqd 5121 . . . . . 6 (𝑘 = 𝐾 → (𝑝( ⋖ ‘𝑘)𝑥𝑝𝐶𝑥))
138, 12rexeqbidv 3346 . . . . 5 (𝑘 = 𝐾 → (∃𝑝 ∈ (Atoms‘𝑘)𝑝( ⋖ ‘𝑘)𝑥 ↔ ∃𝑝𝐴 𝑝𝐶𝑥))
145, 13rabeqbidv 3441 . . . 4 (𝑘 = 𝐾 → {𝑥 ∈ (Base‘𝑘) ∣ ∃𝑝 ∈ (Atoms‘𝑘)𝑝( ⋖ ‘𝑘)𝑥} = {𝑥𝐵 ∣ ∃𝑝𝐴 𝑝𝐶𝑥})
15 df-llines 40157 . . . 4 LLines = (𝑘 ∈ V ↦ {𝑥 ∈ (Base‘𝑘) ∣ ∃𝑝 ∈ (Atoms‘𝑘)𝑝( ⋖ ‘𝑘)𝑥})
164fvexi 6893 . . . . 5 𝐵 ∈ V
1716rabex 5307 . . . 4 {𝑥𝐵 ∣ ∃𝑝𝐴 𝑝𝐶𝑥} ∈ V
1814, 15, 17fvmpt 6987 . . 3 (𝐾 ∈ V → (LLines‘𝐾) = {𝑥𝐵 ∣ ∃𝑝𝐴 𝑝𝐶𝑥})
192, 18eqtrid 2816 . 2 (𝐾 ∈ V → 𝑁 = {𝑥𝐵 ∣ ∃𝑝𝐴 𝑝𝐶𝑥})
201, 19syl 18 1 (𝐾𝐷𝑁 = {𝑥𝐵 ∣ ∃𝑝𝐴 𝑝𝐶𝑥})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1567  wcel 2149  wrex 3095  {crab 3423  Vcvv 3463   class class class wbr 5110  cfv 6534  Basecbs 17265  ccvr 39921  Atomscatm 39922  LLinesclln 40150
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pr 5402
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6490  df-fun 6536  df-fv 6542  df-llines 40157
This theorem is referenced by:  islln  40165
  Copyright terms: Public domain W3C validator