Theorem llnset 40337

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.

Step	Hyp	Ref	Expression
1		elex 3478	. 2 ⊢ (𝐾 ∈ 𝐷 → 𝐾 ∈ V)
2		llnset.n	. . 3 ⊢ 𝑁 = (LLines‘𝐾)
3		fveq2 6885	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
4		llnset.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
5	3, 4	eqtr4di 2818	. . . . 5 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
6		fveq2 6885	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
7		llnset.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
8	6, 7	eqtr4di 2818	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
9		fveq2 6885	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → ( ⋖ ‘𝑘) = ( ⋖ ‘𝐾))
10		llnset.c	. . . . . . . 8 ⊢ 𝐶 = ( ⋖ ‘𝐾)
11	9, 10	eqtr4di 2818	. . . . . . 7 ⊢ (𝑘 = 𝐾 → ( ⋖ ‘𝑘) = 𝐶)
12	11	breqd 5122	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑝( ⋖ ‘𝑘)𝑥 ↔ 𝑝𝐶𝑥))
13	8, 12	rexeqbidv 3341	. . . . 5 ⊢ (𝑘 = 𝐾 → (∃𝑝 ∈ (Atoms‘𝑘)𝑝( ⋖ ‘𝑘)𝑥 ↔ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑥))
14	5, 13	rabeqbidv 3436	. . . 4 ⊢ (𝑘 = 𝐾 → {𝑥 ∈ (Base‘𝑘) ∣ ∃𝑝 ∈ (Atoms‘𝑘)𝑝( ⋖ ‘𝑘)𝑥} = {𝑥 ∈ 𝐵 ∣ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑥})
15		df-llines 40330	. . . 4 ⊢ LLines = (𝑘 ∈ V ↦ {𝑥 ∈ (Base‘𝑘) ∣ ∃𝑝 ∈ (Atoms‘𝑘)𝑝( ⋖ ‘𝑘)𝑥})
16	4	fvexi 6899	. . . . 5 ⊢ 𝐵 ∈ V
17	16	rabex 5311	. . . 4 ⊢ {𝑥 ∈ 𝐵 ∣ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑥} ∈ V
18	14, 15, 17	fvmpt 6993	. . 3 ⊢ (𝐾 ∈ V → (LLines‘𝐾) = {𝑥 ∈ 𝐵 ∣ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑥})
19	2, 18	eqtrid 2812	. 2 ⊢ (𝐾 ∈ V → 𝑁 = {𝑥 ∈ 𝐵 ∣ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑥})
20	1, 19	syl 18	1 ⊢ (𝐾 ∈ 𝐷 → 𝑁 = {𝑥 ∈ 𝐵 ∣ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑥})

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146  ∃wrex 3091  {crab 3418  Vcvv 3457   class class class wbr 5111  ‘cfv 6540  Basecbs 17291   ⋖ ccvr 40094  Atomscatm 40095  LLinesclln 40323

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-llines 40330

This theorem is used by:  islln  40338