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

Theorem lplnset 40402
Description: The set of lattice planes in a Hilbert lattice. (Contributed by NM, 16-Jun-2012.)
Hypotheses
Ref Expression
lplnset.b 𝐵 = (Base‘𝐾)
lplnset.c 𝐶 = ( ⋖ ‘𝐾)
lplnset.n 𝑁 = (LLines‘𝐾)
lplnset.p 𝑃 = (LPlanes‘𝐾)
Assertion
Ref Expression
lplnset (𝐾𝐴𝑃 = {𝑥𝐵 ∣ ∃𝑦𝑁 𝑦𝐶𝑥})
Distinct variable groups:   𝑦,𝑁   𝑥,𝐵   𝑥,𝑦,𝐾
Allowed substitution hints:   𝐴(𝑥, 𝑦)   𝐵(𝑦)   𝐶(𝑥, 𝑦)   𝑃(𝑥, 𝑦)   𝑁(𝑥)

Proof of Theorem lplnset
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 elex 3471 . 2 (𝐾𝐴𝐾 ∈ V)
2 lplnset.p . . 3 𝑃 = (LPlanes‘𝐾)
3 fveq2 6878 . . . . . 6 (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
4 lplnset.b . . . . . 6 𝐵 = (Base‘𝐾)
53, 4eqtr4di 2813 . . . . 5 (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
6 fveq2 6878 . . . . . . 7 (𝑘 = 𝐾 → (LLines‘𝑘) = (LLines‘𝐾))
7 lplnset.n . . . . . . 7 𝑁 = (LLines‘𝐾)
86, 7eqtr4di 2813 . . . . . 6 (𝑘 = 𝐾 → (LLines‘𝑘) = 𝑁)
9 fveq2 6878 . . . . . . . 8 (𝑘 = 𝐾 → ( ⋖ ‘𝑘) = ( ⋖ ‘𝐾))
10 lplnset.c . . . . . . . 8 𝐶 = ( ⋖ ‘𝐾)
119, 10eqtr4di 2813 . . . . . . 7 (𝑘 = 𝐾 → ( ⋖ ‘𝑘) = 𝐶)
1211breqd 5114 . . . . . 6 (𝑘 = 𝐾 → (𝑦( ⋖ ‘𝑘)𝑥𝑦𝐶𝑥))
138, 12rexeqbidv 3335 . . . . 5 (𝑘 = 𝐾 → (∃𝑦 ∈ (LLines‘𝑘)𝑦( ⋖ ‘𝑘)𝑥 ↔ ∃𝑦𝑁 𝑦𝐶𝑥))
145, 13rabeqbidv 3429 . . . 4 (𝑘 = 𝐾 → {𝑥 ∈ (Base‘𝑘) ∣ ∃𝑦 ∈ (LLines‘𝑘)𝑦( ⋖ ‘𝑘)𝑥} = {𝑥𝐵 ∣ ∃𝑦𝑁 𝑦𝐶𝑥})
15 df-lplanes 40372 . . . 4 LPlanes = (𝑘 ∈ V ↦ {𝑥 ∈ (Base‘𝑘) ∣ ∃𝑦 ∈ (LLines‘𝑘)𝑦( ⋖ ‘𝑘)𝑥})
164fvexi 6892 . . . . 5 𝐵 ∈ V
1716rabex 5303 . . . 4 {𝑥𝐵 ∣ ∃𝑦𝑁 𝑦𝐶𝑥} ∈ V
1814, 15, 17fvmpt 6986 . . 3 (𝐾 ∈ V → (LPlanes‘𝐾) = {𝑥𝐵 ∣ ∃𝑦𝑁 𝑦𝐶𝑥})
192, 18eqtrid 2807 . 2 (𝐾 ∈ V → 𝑃 = {𝑥𝐵 ∣ ∃𝑦𝑁 𝑦𝐶𝑥})
201, 19syl 18 1 (𝐾𝐴𝑃 = {𝑥𝐵 ∣ ∃𝑦𝑁 𝑦𝐶𝑥})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2145  wrex 3086  {crab 3412  Vcvv 3450   class class class wbr 5103  cfv 6533  Basecbs 17301  ccvr 40135  LLinesclln 40364  LPlanesclpl 40365
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-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 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-lplanes 40372
This theorem is used by:  islpln  40403
  Copyright terms: Public domain W3C validator