Theorem llnset 40669

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 3471	. 2 ⊢ (𝐾 ∈ 𝐷 → 𝐾 ∈ V)
2		llnset.n	. . 3 ⊢ 𝑁 = (LLines‘𝐾)
3		fveq2 6888	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
4		llnset.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
5	3, 4	eqtr4di 2813	. . . . 5 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
6		fveq2 6888	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
7		llnset.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
8	6, 7	eqtr4di 2813	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
9		fveq2 6888	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → ( ⋖ ‘𝑘) = ( ⋖ ‘𝐾))
10		llnset.c	. . . . . . . 8 ⊢ 𝐶 = ( ⋖ ‘𝐾)
11	9, 10	eqtr4di 2813	. . . . . . 7 ⊢ (𝑘 = 𝐾 → ( ⋖ ‘𝑘) = 𝐶)
12	11	breqd 5113	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑝( ⋖ ‘𝑘)𝑥 ↔ 𝑝𝐶𝑥))
13	8, 12	rexeqbidv 3335	. . . . 5 ⊢ (𝑘 = 𝐾 → (∃𝑝 ∈ (Atoms‘𝑘)𝑝( ⋖ ‘𝑘)𝑥 ↔ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑥))
14	5, 13	rabeqbidv 3429	. . . 4 ⊢ (𝑘 = 𝐾 → {𝑥 ∈ (Base‘𝑘) ∣ ∃𝑝 ∈ (Atoms‘𝑘)𝑝( ⋖ ‘𝑘)𝑥} = {𝑥 ∈ 𝐵 ∣ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑥})
15		df-llines 40662	. . . 4 ⊢ LLines = (𝑘 ∈ V ↦ {𝑥 ∈ (Base‘𝑘) ∣ ∃𝑝 ∈ (Atoms‘𝑘)𝑝( ⋖ ‘𝑘)𝑥})
16	4	fvexi 6902	. . . . 5 ⊢ 𝐵 ∈ V
17	16	rabex 5299	. . . 4 ⊢ {𝑥 ∈ 𝐵 ∣ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑥} ∈ V
18	14, 15, 17	fvmpt 6996	. . 3 ⊢ (𝐾 ∈ V → (LLines‘𝐾) = {𝑥 ∈ 𝐵 ∣ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑥})
19	2, 18	eqtrid 2807	. 2 ⊢ (𝐾 ∈ V → 𝑁 = {𝑥 ∈ 𝐵 ∣ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑥})
20	1, 19	syl 18	1 ⊢ (𝐾 ∈ 𝐷 → 𝑁 = {𝑥 ∈ 𝐵 ∣ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑥})

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  ∃wrex 3086  {crab 3412  Vcvv 3450   class class class wbr 5102  ‘cfv 6541  Basecbs 17394   ⋖ ccvr 40426  Atomscatm 40427  LLinesclln 40655

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6496  df-fun 6543  df-fv 6549  df-llines 40662

This theorem is used by:  islln  40670