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 40090
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 3474 . 2 (𝐾𝐷𝐾 ∈ V)
2 llnset.n . . 3 𝑁 = (LLines‘𝐾)
3 fveq2 6862 . . . . . 6 (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
4 llnset.b . . . . . 6 𝐵 = (Base‘𝐾)
53, 4eqtr4di 2814 . . . . 5 (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
6 fveq2 6862 . . . . . . 7 (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
7 llnset.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
86, 7eqtr4di 2814 . . . . . 6 (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
9 fveq2 6862 . . . . . . . 8 (𝑘 = 𝐾 → ( ⋖ ‘𝑘) = ( ⋖ ‘𝐾))
10 llnset.c . . . . . . . 8 𝐶 = ( ⋖ ‘𝐾)
119, 10eqtr4di 2814 . . . . . . 7 (𝑘 = 𝐾 → ( ⋖ ‘𝑘) = 𝐶)
1211breqd 5108 . . . . . 6 (𝑘 = 𝐾 → (𝑝( ⋖ ‘𝑘)𝑥𝑝𝐶𝑥))
138, 12rexeqbidv 3336 . . . . 5 (𝑘 = 𝐾 → (∃𝑝 ∈ (Atoms‘𝑘)𝑝( ⋖ ‘𝑘)𝑥 ↔ ∃𝑝𝐴 𝑝𝐶𝑥))
145, 13rabeqbidv 3431 . . . 4 (𝑘 = 𝐾 → {𝑥 ∈ (Base‘𝑘) ∣ ∃𝑝 ∈ (Atoms‘𝑘)𝑝( ⋖ ‘𝑘)𝑥} = {𝑥𝐵 ∣ ∃𝑝𝐴 𝑝𝐶𝑥})
15 df-llines 40083 . . . 4 LLines = (𝑘 ∈ V ↦ {𝑥 ∈ (Base‘𝑘) ∣ ∃𝑝 ∈ (Atoms‘𝑘)𝑝( ⋖ ‘𝑘)𝑥})
164fvexi 6876 . . . . 5 𝐵 ∈ V
1716rabex 5292 . . . 4 {𝑥𝐵 ∣ ∃𝑝𝐴 𝑝𝐶𝑥} ∈ V
1814, 15, 17fvmpt 6970 . . 3 (𝐾 ∈ V → (LLines‘𝐾) = {𝑥𝐵 ∣ ∃𝑝𝐴 𝑝𝐶𝑥})
192, 18eqtrid 2808 . 2 (𝐾 ∈ V → 𝑁 = {𝑥𝐵 ∣ ∃𝑝𝐴 𝑝𝐶𝑥})
201, 19syl 17 1 (𝐾𝐷𝑁 = {𝑥𝐵 ∣ ∃𝑝𝐴 𝑝𝐶𝑥})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1559  wcel 2141  wrex 3085  {crab 3413  Vcvv 3453   class class class wbr 5097  cfv 6516  Basecbs 17236  ccvr 39847  Atomscatm 39848  LLinesclln 40076
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pr 5387
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-iota 6472  df-fun 6518  df-fv 6524  df-llines 40083
This theorem is referenced by:  islln  40091
  Copyright terms: Public domain W3C validator